NobleBlocks

Research indexJournal article

Fast search algorithm for edge-oriented block matching algorithm

Chan, Hui, Siu

13 Nov 2002

NobleIDark:/48914/w1/20260515/AD928923DOI10.1109/isimp.2001.925373

Paywalled

The full text is at the publisher

You can read the abstract here, or open it at the publisher.

Read at the publisher

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

Discussion

Citations

Topics

More

Suggest a correction or report