Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A fast search algorithm for vector quantization using mean pyramids of codewords

From MaRDI portal
Publication:2726602
Jump to:navigation, search

DOI10.1109/26.380218zbMath1159.94347OpenAlexW2116076246MaRDI QIDQ2726602

Chang-Hsing Lee, Ling-Hwei Chen

Publication date: 18 July 2001

Published in: IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/26.380218



Mathematics Subject Classification ID

Source coding (94A29)


Related Items (4)

Fast and versatile algorithm for nearest neighbor search based on a lower bound tree ⋮ Hadamard transform based fast codeword search algorithm for high-dimensional VQ encoding ⋮ Hierarchy-oriented searching algorithms using alternative duplicate codewords for vector quantization mechanism ⋮ Fast incremental algorithm for speeding up the computation of binarization







This page was built for publication: A fast search algorithm for vector quantization using mean pyramids of codewords

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2726602&oldid=15583937"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 13:51.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki