Referenced Items are not available for this document.
In this paper we present a fast algorithm to reduce the computational complexity of block motion estimation. The reduction is obtained from the use of a new hexagonal subsampling pattern and the domain decimation method introduced by Cheng and Chan (see Proc. IEEE ICASSP, vol.4, p.2313, 1996). The multiple candidates search method is also introduced to improve the robustness of the algorithm. Computer simulation shows that the performance is very close to that of the full search
Published in:
Image Processing, 1996. Proceedings., International Conference on
(Volume:1
)
Date of Conference: 16-19 Sep 1996
- Page(s):
- 497 - 500 vol.2
- Meeting Date :
- 16 Sep 1996-19 Sep 1996
- Print ISBN:
- 0-7803-3259-8
- INSPEC Accession Number:
- 5577312
- Conference Location :
- Lausanne
- Digital Object Identifier :
- 10.1109/ICIP.1996.560900
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
