Novel cross-diamond-hexagonal search algorithms for fast block motion estimation

We propose two cross-diamond-hexagonal search (CDHS) algorithms, which differ from each other by their sizes of hexagonal search patterns. These algorithms basically employ two cross-shaped search patterns consecutively in the very beginning steps and switch using diamond-shaped patterns. To further...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on multimedia 2005-02, Vol.7 (1), p.16-22
Main Authors: CHEUNG, Chun-Ho, PO, Lai-Man
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Blocking
Broadcasting. Videocommunications. Audiovisual
Coding, codes
Computational complexity
Corners
Cross-center-biased property
cross-diamond-hexagonal search
Diamonds
Exact sciences and technology
IEC standards
Information, signal and communications theory
ISO standards
Maintenance engineering
Motion estimation
Multimedia
Search algorithms
Searching
Shape
Signal and communications theory
Switches
Telecommunications
Telecommunications and information theory
Transform coding
Video coding
Video sequences
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We propose two cross-diamond-hexagonal search (CDHS) algorithms, which differ from each other by their sizes of hexagonal search patterns. These algorithms basically employ two cross-shaped search patterns consecutively in the very beginning steps and switch using diamond-shaped patterns. To further reduce the checking points, two pairs of hexagonal search patterns are proposed in conjunction with candidates found located at diamond corners. Experimental results show that the proposed CDHSs perform faster than the diamond search (DS) by about 144% and the cross-diamond search (CDS) by about 73%, whereas similar prediction quality is still maintained.
ISSN:1520-9210
1941-0077
DOI:10.1109/TMM.2004.840609