Image compression techniques: A survey in lossless and lossy algorithms
AJ Hussain, A Al-Fayadh, N Radi - Neurocomputing, 2018 - Elsevier
The bandwidth of the communication networks has been increased continuously as results
of technological advances. However, the introduction of new services and the expansion of …
of technological advances. However, the introduction of new services and the expansion of …
A fast mean-distance-ordered partial codebook search algorithm for image vector quantization
SW Ra, JK Kim - IEEE Transactions on Circuits and Systems II …, 2002 - ieeexplore.ieee.org
A new fast search algorithm for vector quantization using the mean of image vectors is
proposed. The codevectors are sorted according to their component means, and the search …
proposed. The codevectors are sorted according to their component means, and the search …
[PDF][PDF] Fast k-dimensional tree algorithms for nearest neighbor search with application to vector quantization encoding
V Ramasubramanian, KK Paliwal - IEEE Transactions on Signal …, 1992 - scholar.archive.org
In this paper, fast search algorithms are proposed and studied for vector quantization
encoding using the K-dimensional (Kd) tree structure. Here, the emphasis is on the optimal …
encoding using the K-dimensional (Kd) tree structure. Here, the emphasis is on the optimal …
Predicting unseen triphones with senones
In large-vocabulary speech recognition, we often encounter triphones that are not covered in
the training data. These unseen triphones are usually backed off to their corresponding …
the training data. These unseen triphones are usually backed off to their corresponding …
Fast closest codeword search algorithms for vector quantisation
CH Lee, LH Chen - IEE Proceedings-Vision, Image and Signal Processing, 1994 - IET
One of the most serious problems for vector quantisation is the high computational
complexity of searching for the closest codeword in the codebook design and encoding …
complexity of searching for the closest codeword in the codebook design and encoding …
A fast search algorithm for vector quantization using mean pyramids of codewords
CH Lee, LH Chen - IEEE Transactions on communications, 1995 - ieeexplore.ieee.org
One of the most serious problems for vector quantization, especially for high dimensional
vectors, is the high computational complexity of searching for the closest codeword in the …
vectors, is the high computational complexity of searching for the closest codeword in the …
Fast VQ encoding by an efficient kick-out condition
KS Wu, JC Lin - IEEE Transactions on Circuits and Systems for …, 2000 - ieeexplore.ieee.org
A new fast approach to the nearest codeword search using a single kick-out condition is
proposed. The nearest codeword found by the proposed approach is identical to the one …
proposed. The nearest codeword found by the proposed approach is identical to the one …
Vector quantization for texture classification
GF McLean - IEEE Transactions on Systems, Man, and …, 1993 - ieeexplore.ieee.org
A method for classifying and coding textures that is based upon transform vector
quantization is presented. Techniques for texture classification and vector quantization …
quantization is presented. Techniques for texture classification and vector quantization …
An improved VQ codebook search algorithm using principal component analysis
We present an improved codebook search algorithm in this paper. We call it thedouble test
of principal components (DTPC). This algorithm speeds up the codebook search by …
of principal components (DTPC). This algorithm speeds up the codebook search by …
[图书][B] Innovations in local modeling for time series prediction
JN McNames - 1999 - search.proquest.com
INFORMATION TO USERS Page 1 INFORMATION TO USERS This manuscript has been
reproduced from the microfilm master. UMI films the text directly from the original or copy …
reproduced from the microfilm master. UMI films the text directly from the original or copy …