A new diamond search algorithm for fast block-matching motion estimation

Based on the study of motion vector distribution from several commonly used test image sequences, a new diamond search (DS) algorithm for fast block-matching motion estimation (BMME) is proposed in this paper. Simulation results demonstrate that the proposed DS algorithm greatly outperforms the well...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on image processing Jg. 9; H. 2; S. 287 - 290
Hauptverfasser: Zhu, S, Ma, K K
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York, NY IEEE 2000
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
Applied sciences
Bandwidth
Blocking
Computational modeling
Computer simulation
Exact sciences and technology
Image processing
Image sequences
Information, signal and communications theory
Mathematical analysis
Motion estimation
Searching
Signal processing
Signal processing algorithms
Telecommunications and information theory
Testing
Transform coding
Vectors (mathematics)
Video coding
Video compression
Video sequences
Experimental result
Motion estimation
Image processing
Image sequence
Data compression
Video signal
Numerical simulation
Implementation
Search algorithm
Block matching
ISSN:1057-7149, 1941-0042
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Based on the study of motion vector distribution from several commonly used test image sequences, a new diamond search (DS) algorithm for fast block-matching motion estimation (BMME) is proposed in this paper. Simulation results demonstrate that the proposed DS algorithm greatly outperforms the well-known three-step search (TSS) algorithm. Compared with the new three-step search (NTSS) algorithm, the DS algorithm achieves close performance but requires less computation by up to 22% on average. Experimental results also show that the DS algorithm is better than the four-step search (4SS) and block-based gradient descent search (BBGDS), in terms of mean-square error performance and required number of search points.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ObjectType-Correspondence-1
ISSN:1057-7149
1941-0042
DOI:10.1109/83.821744