The paper proposes three modifications to the 3-step hierarchical search block-matching algorithm for video coding: a multiple-winner search that improves the estimation accuracy, a method of subsampling that reduces computation and input data amount, and an overlapping strategy that improves the accuracy of large-area search. Experimental results show that combining these techniques provides high-speed and high-precision motion estimators with reduced on-chip buffers and lowered input bandwidth requirements.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Modifications and performance improvements of 3-step search block-matching algorithm for video coding


    Contributors:


    Publication date :

    1994-01-01


    Size :

    264039 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Modifications and Performance Improvements of 3-Step Search Block-Matching Algorithm for Video Coding

    Jong, H. M. / Chen, L. G. / Chiueh, T. D. et al. | British Library Conference Proceedings | 1994


    Rate constrained block matching algorithm for video coding

    Bayazit, U. / Pearlman, W. A. | British Library Online Contents | 1998



    Fast full search motion estimation algorithm using various matching scans in video coding

    Kim, J.-N. / Byun, S.-C. / Ahn, B.-H. | British Library Online Contents | 2002


    Performance of Different Still Picture Interpolative Coding Schemes on Block Matching Algorithm

    Tsang, W. M. / Lee, W. T. / Institution of Electrical Engineers et al. | British Library Conference Proceedings | 1999