A fast block matching algorithm in the feature domain was proposed by Fok and Au (1993) which achieves a computation reduction factor of N/2 with search block size of N/spl times/N. This paper presents an improved fast block matching algorithm in the integral projections feature domain. This algorithm is based on the fast block matching algorithm in the feature domain and a new motion field sub-sampling scheme. By utilizing the properties of the features and the motion field sub-sampling scheme, with a search block size of N/spl times/N, the improved algorithm can achieve a computation reduction factor of N while retaining close-to-optimal performance in the mean absolute difference (MAD) sense.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An improved fast feature-based block motion estimation


    Contributors:
    Yiu-Hung Fok (author) / Au, O.C. (author)


    Publication date :

    1994-01-01


    Size :

    534030 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    An Improved Fast Feature-Based Block Motion Estimation

    Fok, Y.-H. / Au, O. C. / IEEE; Signal Processing Society | British Library Conference Proceedings | 1994


    Truncated gray coding-based fast block motion estimation

    Urhan, O. | British Library Online Contents | 2013


    Adaptive Subsampling and Motion Feature Based Fast H.264 Motion Estimation

    Huang, Yiqing / Liu, Qin / Goto, Satoshi et al. | IEEE | 2008



    A Robust and Fast Block Motion Estimation Algorithm

    Li, R. / Zeng, B. / Liou, M. L. et al. | British Library Conference Proceedings | 1994