Sciweavers

27 search results - page 2 / 6
» Fast Resampling Using Vector Quantization
Sort
View
PRL
2006
96views more  PRL 2006»
13 years 6 months ago
Fast codebook search algorithms based on tree-structured vector quantization
Tree-Structured Vector Quantization (TSVQ) is a highly efficient technique for locating an appropriate codeword for each input vector. The algorithm does not guarantee that the sel...
Chin-Chen Chang, Yu-Chiang Li, Jun-Bin Yeh
SGP
2007
13 years 8 months ago
Fast normal vector compression with bounded error
We present two methods for lossy compression of normal vectors through quantization using "base" polyhedra. The first revisits subdivision-based quantization. The second...
Eric J. Griffith, Michal Koutek, Frits H. Post
INTERSPEECH
2010
13 years 27 days ago
The use of subvector quantization and discrete densities for fast GMM computation for speaker verification
Last year, we showed that the computation of a GMM-UBMbased speaker verification (SV) system may be sped up by 30 times by using a high-density discrete model (HDDM) on the NIST 2...
Guoli Ye, Brian Mak
DCC
1999
IEEE
13 years 10 months ago
Performance of Quantizers on Noisy Channels Using Structured Families of Codes
Abstract--Achievable distortion bounds are derived for the cascade of structured families of binary linear channel codes and binary lattice vector quantizers. It is known that for ...
András Méhes, Kenneth Zeger
ICMCS
2006
IEEE
159views Multimedia» more  ICMCS 2006»
14 years 3 days ago
Image Vector Quantization Indices Recovery using Lagrange Interpolation
Vector quantization (VQ) is an efficient coding algorithm due to its fast decoding efficiency. Indices of VQ will be lost during the transmission because of the signal interferenc...
Yung-Gi Wu, Chia-Hao Wu