✦ LIBER ✦

Statistical quantization for similarity search

✍ Scribed by Wang, Qi; Zhu, Guokang; Yuan, Yuan

Book ID: 124119965
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 813 KB
Volume: 124
Category: Article
ISSN: 1077-3142
DOI: 10.1016/j.cviu.2014.03.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Combining Approximation Techniques and V

Combining Approximation Techniques and Vector Quantization for Adaptable Similarity Search

✍ Christian Böhm; Hans-Peter Kriegel; Thomas Seidl 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 590 KB

Empirical statistical estimates for sequ

Empirical statistical estimates for sequence similarity searches

✍ William R Pearson 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 409 KB

Rank hash similarity for fast similarity

✍ Lu, Min; Huang, YaLou; Xie, MaoQiang; Liu, Jie 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 760 KB

Efficient Algorithms for Similarity Sear

Efficient Algorithms for Similarity Search

✍ S. Rajasekaran; Y. Hu; J. Luo; H. Nick; P.M. Pardalos; S. Sahni; G. Shaw 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 217 KB

Learning vector quantization for (dis-)s

Learning vector quantization for (dis-)similarities

✍ Hammer, Barbara; Hofmann, Daniela; Schleif, Frank-Michael; Zhu, Xibin 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 464 KB

Fast Search Methods for Spectral Quantiz

Fast Search Methods for Spectral Quantization

✍ John Leis; Sridha Sridharan 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 123 KB

In this paper, we examine the computational requirements for the split-vector class of vector quantizers when applied to low-rate speech spectrum quantization. The split-vector quantization techniques are able to reduce the complexity and storage requirements of the 24-bit per frame spectral quantiz