Share Email Print

Proceedings Paper

Adaptive fast-matching algorithm based on sub-block ordering
Author(s): Soonjong Jin; Changryoul Choi; Joohyun Lee; Jechang Jeong
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 4 August 2010
PDF: 10 pages
Proc. SPIE 7744, Visual Communications and Image Processing 2010, 77442F (4 August 2010); doi: 10.1117/12.863822
Show Author Affiliations
Soonjong Jin, Hanyang Univ. (Korea, Republic of)
Changryoul Choi, Hanyang Univ. (Korea, Republic of)
Joohyun Lee, Hanyang Univ. (Korea, Republic of)
Jechang Jeong, Hanyang Univ. (Korea, Republic of)

Published in SPIE Proceedings Vol. 7744:
Visual Communications and Image Processing 2010
Pascal Frossard; Houqiang Li; Feng Wu; Bernd Girod; Shipeng Li; Guo Wei, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?