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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Fast Block Matching Algorithm in Walsh Hadamard Domain


    Contributors:
    Li, Ngai (author) / Mak, Chun-Man (author) / Cham, Wai-Kuen (author)


    Publication date :

    2006-01-01


    Size :

    10 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    Fast Block Matching Algorithm in Walsh Hadamard Domain

    Li, N. / Mak, C.-M. / Cham, W.-K. | British Library Conference Proceedings | 2006


    Full-Optical TOAD based Walsh-Hadamard code generation

    Mandal, A. K. | British Library Online Contents | 2017



    Muitiplicative Method of Hadamard Matrices Construction and Fast Hadamard Transform

    Sarukhanyan, A. G. | British Library Online Contents | 1999


    Adaptive Multi-Pattern Fast Block-Matching Algorithm Based on Motion Classification Techniques

    González Díaz, Iván / Frutos-López, Manuel de / Sanz Rodríguez-Escalona, Sergio et al. | BASE | 2007

    Free access