Paper
4 August 2010 Adaptive fast-matching algorithm based on sub-block ordering
Soonjong Jin, Changryoul Choi, Joohyun Lee, Jechang Jeong
Author Affiliations +
Proceedings Volume 7744, Visual Communications and Image Processing 2010; 77442F (2010) https://doi.org/10.1117/12.863822
Event: Visual Communications and Image Processing 2010, 2010, Huangshan, China
Abstract
In this paper, adaptive fast matching algorithms are proposed based on the sub-block ordering. Proposed two algorithms for the lossless fast matching only reduce the unnecessary matching complexity of motion estimation in the video coding. By observing the expectation of the sum of absolute differences between the current sub-block and a reference sub-block in the pixel domain, we derive an absolute difference model which indicates the relationship between the sub-block distortion and the intra sub-block complexity. In the same way, we consider the inter complexity among all sub-block with the absolute difference model. From the absolute difference model, we derive the transform coefficient model for measuring the sub-block complexity in the transform domain based on the Parseval's theorem. Experimental results show the proposed fast matching algorithms reduce the unnecessary complexity of the full search algorithm about 20% on average without any loss of image quality.
© (2010) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Soonjong Jin, Changryoul Choi, Joohyun Lee, and Jechang Jeong "Adaptive fast-matching algorithm based on sub-block ordering", Proc. SPIE 7744, Visual Communications and Image Processing 2010, 77442F (4 August 2010); https://doi.org/10.1117/12.863822
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Distortion

Algorithms

Antimony

Performance modeling

Motion models

Motion estimation

Diamond

Back to Top