Performance Re-Evaluation on "Codewords Distribution-Based Optimal Combination of Equal-Average Equal-Variance Equal-Norm Nearest Neighbor Fast Search Algorithm for Vector Quantization Encoding"

In the re-evaluated paper, Xie et al. proposed a new fast search algorithm for vector quantization encoding, which optimized the priority checking order of variance and norm inequality in order to speed up the encoding procedure. CPU time of different encoding algorithms is given to support their al...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on image processing Jg. 27; H. 2; S. 718 - 720
Hauptverfasser: Wang, Yang, Pan, Zhibin, Li, Rui
Format: Journal Article
Sprache:Englisch
Veröffentlicht: United States IEEE 01.02.2018
Schlagworte:
Algorithm design and analysis
codewords distribution
fast search algorithm
Image coding
Microprocessor chips
Nearest neighbor searches
priority checking order
Search problems
Signal processing algorithms
Vector quantization
ISSN:1057-7149, 1941-0042, 1941-0042
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In the re-evaluated paper, Xie et al. proposed a new fast search algorithm for vector quantization encoding, which optimized the priority checking order of variance and norm inequality in order to speed up the encoding procedure. CPU time of different encoding algorithms is given to support their algorithm. However, first, some of the experimental data in the re-evaluated paper are unreasonable and unrepeatable. And second, as an improved algorithm of equal-average equal-variance equal-norm nearest neighbor fast search algorithm, the re-evaluated algorithm in fact cannot achieve a better performance than the existing improved equal-average equal-variance nearest neighbor fast search algorithm. In this paper, these two problems are analyzed, re-evaluated, and discussed in detail.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1057-7149
1941-0042
1941-0042
DOI:10.1109/TIP.2017.2763820