Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/10166
Title: Fast search algorithm for edge-oriented block matching algorithm
Authors: Chan, YL 
Hui, KC
Siu, WC 
Issue Date: 2001
Source: Proceedings of 2001 International Symposium on Intelligent Multimedia, Video and Speech Processing, ISIMP 2001, 2001, p. 225-228 How to cite?
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.
Description: 2001 International Symposium on Intelligent Multimedia, Video and Speech Processing, ISIMP 2001, Hong Kong, 2-4 May 2001
URI: http://hdl.handle.net/10397/10166
ISBN: 9628576623
9789628576623
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

34
Last Week
2
Last month
Checked on Aug 21, 2017

Google ScholarTM

Check



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.