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.
Motion-compensation using variable-size block-matching with binary partition trees
2005-01-01
729749 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Motion-Compensation using Variable-Size Block-Matching with Binary Partition Trees
British Library Conference Proceedings | 2005
|British Library Conference Proceedings | 1995
|Variable sized block matching for in VIVO musculoskeletal motion analysis
British Library Conference Proceedings | 2003
|Comprehensive scheme for subpixel variable block-size motion estimation
British Library Online Contents | 2011
|