Abstract A fast block matching algorithm, namely Fast Walsh Search, is proposed for motion estimation in block-based video coding. In our approach, target blocks in current frame and their candidates in reference frame are projected onto Walsh Hadamard domain, allowing early rejection of mismatch candidates to reduce computation requirement. Moreover, we introduce a new method called block pyramid matching that re-uses many previous calculations to further lessen the computation load of our approach. Experimental results show that the proposed algorithm can achieve more accurate motion estimation than the popular three-step-search and diamond search with slight increase in computation requirement only.
Fast Block Matching Algorithm in Walsh Hadamard Domain
Computer Vision – ACCV 2006 ; 7 ; 712-721
Lecture Notes in Computer Science ; 3852 , 7
2006-01-01
10 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
Mean Square Error , Motion Vector , Motion Estimation , Block Match , Reference Block Computer Science , Image Processing and Computer Vision , Computer Imaging, Vision, Pattern Recognition and Graphics , Pattern Recognition , Artificial Intelligence (incl. Robotics) , Algorithm Analysis and Problem Complexity
Fast Block Matching Algorithm in Walsh Hadamard Domain
British Library Conference Proceedings | 2006
|Full-Optical TOAD based Walsh-Hadamard code generation
British Library Online Contents | 2017
|Muitiplicative Method of Hadamard Matrices Construction and Fast Hadamard Transform
British Library Online Contents | 1999
|Adaptive Multi-Pattern Fast Block-Matching Algorithm Based on Motion Classification Techniques
BASE | 2007
|