Title :
Predictive partial search algorithm for vector quantisation
Abstract :
One main difficulty associated with vector quantisation is the computational complexity incurred in minimum distortion encoding. The use of vector class prediction, together with the partial distance search algorithm of Bei and Gray (1985) is shown to reduce the computational complexity involved in the minimum distortion vector quantisation of image data.
Keywords :
computational complexity; computerised picture processing; data compression; encoding; computational complexity reduction; image data; minimum distortion encoding; minimum distortion vector quantisation; partial distance search algorithm; predictive partial search algorithm; vector class prediction; vector quantisation;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19911072