A fast encoding algorithm for vector quantization

In this letter, we present a fast encoding algorithm for vector quantization that uses two characteristics of a vector, mean, and variance. Although a similar method using these features was already proposed, it handles these features separately, On the other hand, the proposed algorithm utilizes th...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE signal processing letters Ročník 4; číslo 12; s. 325 - 327
Hlavní autoři: Baek, SeongJoon, Jeon, Bumki, Sung, Koeng-Mo
Médium: Journal Article
Jazyk:angličtina
Vydáno: IEEE 01.12.1997
Témata:
Acceleration
Bit rate
Computational complexity
Computational modeling
Encoding
Image coding
Nearest neighbor searches
Signal processing algorithms
Tree data structures
Vector quantization
ISSN:1070-9908, 1558-2361
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this letter, we present a fast encoding algorithm for vector quantization that uses two characteristics of a vector, mean, and variance. Although a similar method using these features was already proposed, it handles these features separately, On the other hand, the proposed algorithm utilizes these features simultaneously to save computation time all the more. Since the proposed algorithm rejects those codewords that are impossible to be the nearest codeword, it produces the same output as the conventional full search algorithm. The simulation results confirm the effectiveness of the proposed algorithm.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1070-9908
1558-2361
DOI:10.1109/97.650035