Fast block matching algorithm based on the winner-update strategy
From MaRDI portal
Publication:4419973
DOI10.1109/83.935037zbMATH Open1062.68589OpenAlexW2167506279WikidataQ48888984 ScholiaQ48888984MaRDI QIDQ4419973FDOQ4419973
Authors: Yong-Sheng Chen, Yi-Ping Hung, Chiou-Shann Fuh
Publication date: 15 October 2003
Published in: IEEE Transactions on Image Processing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/d3dfb6b5fbbe4706bb6df3ec8c2e4f8960eb8666
Recommendations
- Fast block matching using prediction and rejection criteria
- A fast block-matching algorithm using smooth motion vector field adaptive search technique
- A fast block-matching algorithm based on variable shape search
- A fast matching criterion for VLSI implementation of block-based motion estimation
- A strategy of matching blocks at multi-levels
Cited In (8)
- An improved block-matching immune algorithm in fast motion estimation
- Multimodal genetic algorithms-based algorithm for automatic point correspondence
- Accelerating feature-vector matching using multiple-tree and sub-vector methods
- Fast block matching using prediction and rejection criteria
- Survey on block matching motion estimation algorithms and architectures with new results
- Fattening free block matching
- Fast and versatile algorithm for nearest neighbor search based on a lower bound tree
- Block matching displacement estimation: A sliding window approach
This page was built for publication: Fast block matching algorithm based on the winner-update strategy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4419973)