Fast search algorithm for edge-oriented block matching algorithm

Yui Lam Chan, Ko Chenug Hui, Wan Chi Siu

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

Abstract

The edge-oriented block matching algorithm (EOMBA) provides a better motion-compensated prediction along moving edges in comparison with the traditional intensity-based block motion estimation methods. However, the accuracy of the motion vectors of blocks containing the boundary between the moving objects and the still area is critical in the EOBMA. Consequently, the full search algorithm (FSA) with a large search window is used to ensure its accuracy. In order to reduce the computational complexity of the motion estimation of these blocks, a fast search algorithm for the EOBMA is proposed in this paper. The proposed algorithm employs the edge feature to locate initial search points such that the computational burden of the motion estimation of these boundary blocks must be reduced. Results on applying the proposed algorithm to the EOBMA show that the proposed search strategy is able to strengthen the EOBMA.
Original languageEnglish
Title of host publicationProceedings of 2001 International Symposium on Intelligent Multimedia, Video and Speech Processing, ISIMP 2001
Pages225-228
Number of pages4
Publication statusPublished - 1 Dec 2001
Event2001 International Symposium on Intelligent Multimedia, Video and Speech Processing, ISIMP 2001 - Hong Kong, Hong Kong
Duration: 2 May 20014 May 2001

Conference

Conference2001 International Symposium on Intelligent Multimedia, Video and Speech Processing, ISIMP 2001
CountryHong Kong
CityHong Kong
Period2/05/014/05/01

ASJC Scopus subject areas

  • Computer Science(all)

Cite this