A new approach to variable size block matching is proposed, based on the binary partitioning of blocks. If a particular block does not allow for accurate motion compensation, then it is split into two using the horizontal or vertical line that achieves the maximum reduction in motion compensation error. This method causes partitioning to occur along motion boundaries, thus substantially reducing blocking artifacts. In addition, small blocks are placed in regions of complex motion, while large blocks cover regions of uniform motion. The proposed technique provides significant gains in picture quality of 1.5 to 3.0 dB, when compared to fixed size block matching at the same total rate.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Motion-compensation using variable-size block-matching with binary partition trees


    Contributors:
    Servais, M. (author) / Vlachos, T. (author) / Davies, T. (author)


    Publication date :

    2005-01-01


    Size :

    729749 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Motion-Compensation using Variable-Size Block-Matching with Binary Partition Trees

    Servais, M. / Vlachos, T. / Davies, T. | British Library Conference Proceedings | 2005


    Variable Block Size Bi-Directional Motion Compensation Inter-Frame Coding

    Shexiang, M. / Guizhong, L. / Zhaowei, S. | British Library Online Contents | 2002



    Adaptive-size hierarchical block matching for efficient motion compensation of video sequences [2451-11]

    Accame, M. / Giusto, D. D. / SPIE | British Library Conference Proceedings | 1995


    Variable sized block matching for in VIVO musculoskeletal motion analysis

    Revell, J. D. / Mirmehdi, M. / McNally, D. S. et al. | British Library Conference Proceedings | 2003