Enhanced hexagonal search for fast block motion estimation

Authors:
Ce Zhu;Xiao Lin;L. Chau;Lai-Man Po
Affiliations:
Sch. of Electr. & Electron. Eng., Nanyang Technilogical Univ., Singapore, Singapore;-;-;-
Venue:
IEEE Transactions on Circuits and Systems for Video Technology
Year:
2004

Citing 0
Cited 20

Paralleled Two-Pass Hexagonal Algorithm for Motion Estimation

HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
A region-based selective optical flow back-projection for genuine motion vector estimation

Pattern Recognition
An improved variable-size block-matching algorithm

Multimedia Tools and Applications
Small-diamond-based search algorithm for fast block motion estimation

Image Communication
Modeling of pattern-based block motion estimation and its application

IEEE Transactions on Circuits and Systems for Video Technology
Algorithm/architecture co-exploration of visual computing on emergent platforms: overview and future prospects

IEEE Transactions on Circuits and Systems for Video Technology
Early determination of zero-quantized 8 × 8 DCT coefficients

IEEE Transactions on Circuits and Systems for Video Technology
A video coding technique using octagonal motion search and BTC-PF method for fast reconstruction

AST/UCMA/ISA/ACN'10 Proceedings of the 2010 international conference on Advances in computer science and information technology
Motion estimation using two-stage predictive search algorithms based on joint spatio-temporal correlation information

Expert Systems with Applications: An International Journal
Efficient starting point decision for enhanced hexagonal search

ISVC'11 Proceedings of the 7th international conference on Advances in visual computing - Volume Part II
Content adaptive fast motion estimation based on spatio-temporal homogeneity analysis and motion classification

Pattern Recognition Letters
Linear algorithm and hexagonal search based two-pass algorithm for motion estimation

CAIP'05 Proceedings of the 11th international conference on Computer Analysis of Images and Patterns
A fast lossless multi-resolution motion estimation algorithm using selective matching units

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I
One-Point hexagonal inner search for fast motion estimation

ISVC'05 Proceedings of the First international conference on Advances in Visual Computing
Linear hashtable method predicted hexagonal search algorithm with spatial related criterion

SCIA'05 Proceedings of the 14th Scandinavian conference on Image Analysis
Linear hashtable motion estimation algorithm for distributed video processing

Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Linear predicted hexagonal search algorithm with moments

ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part I
Complexity-Controllable motion estimation for real-time video encoder

ICIAR'05 Proceedings of the Second international conference on Image Analysis and Recognition
Efficient h.264 encoding based on skip mode early termination

PSIVT'06 Proceedings of the First Pacific Rim conference on Advances in Image and Video Technology
Lossless video compression based on backward adaptive pixel-based fast motion estimation

Image Communication

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fast block motion estimation normally consists of low-resolution coarse search and the following fine-resolution inner search. Most motion estimation algorithms developed attempt to speed up the coarse search without considering accelerating the focused inner search. On top of the hexagonal search method recently developed, an enhanced hexagonal search algorithm is proposed to further improve the performance in terms of reducing number of search points and distortion, where a novel fast inner search is employed by exploiting the distortion information of the evaluated points. Our experimental results substantially justify the merits of the proposed algorithm.