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.<>


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    An improved fast feature-based block motion estimation


    Beteiligte:
    Yiu-Hung Fok (Autor:in) / Au, O.C. (Autor:in)


    Erscheinungsdatum :

    01.01.1994


    Format / Umfang :

    534030 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    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

    Renxiang Li / Bing Zeng / Liou, M.L. | IEEE | 1994