A framework for fast mode decision in the H264 video coding standard
Digital Signal Processing
An improved variable-size block-matching algorithm
Multimedia Tools and Applications
An improved block size selection method based on macroblock movement characteristic
Multimedia Tools and Applications
Short Communication: Efficient quadtree based block-shift filtering for deblocking and deringing
Journal of Visual Communication and Image Representation
SBCCI '10 Proceedings of the 23rd symposium on Integrated circuits and system design
Partial image retrieval system using sub tree matching
ICAI'05/MCBC'05/AMTA'05/MCBE'05 Proceedings of the 6th WSEAS international conference on Automation & information, and 6th WSEAS international conference on mathematics and computers in biology and chemistry, and 6th WSEAS international conference on acoustics and music: theory and applications, and 6th WSEAS international conference on Mathematics and computers in business and economics
A new non-symmetry and anti-packing model and its application to image contrast enhancement
Computers and Electrical Engineering
A new approximation algorithm for multidimensional rectangle tiling
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Nonrigid motion estimation from a sequence of degraded images
Mathematical and Computer Modelling: An International Journal
Bit-by-Bit Pipelined and Hybrid-Grained 2D Architecture for Motion Estimation of H.264/AVC
Journal of Signal Processing Systems
A generalization of quad-trees applied to image coding
Integrated Computer-Aided Engineering
Hi-index | 0.00 |
This paper reports two efficient quadtree-based algorithms for variable-size block matching (VSBM) motion estimation. The schemes allow the dimensions of blocks to adapt to local activity within the image, and the total number of blocks in any frame can be varied while still accurately representing true motion. This permits adaptive bit allocation between the representation of displacement and residual data, and also the variation of the overall bit-rate on a frame-by-frame basis. The first algorithm computes the optimal selection of variable-sized blocks to provide the best-achievable prediction error under the fixed number of blocks for a quadtree-based VSBM technique. The algorithm employs an efficient dynamic programming technique utilizing the special structure of a quadtree. Although this algorithm is computationally intensive, it does provide a yardstick by which the performance of other more practical VSBM techniques can be measured. The second algorithm adopts a heuristic way to select variable-sized square blocks. It relies more on local motion information than on global error optimization. Experiments suggest that the effective use of local information contributes to minimizing the overall error. The result is a more computationally efficient VSBM technique than the optimal algorithm, but with a comparable prediction error