메뉴 건너뛰기




Volumn 4, Issue 12, 1997, Pages 325-327

A fast encoding algorithm for vector quantization

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; ENCODING (SYMBOLS); VECTOR QUANTIZATION;

EID: 0031379488     PISSN: 10709908     EISSN: None     Source Type: Journal    
DOI: 10.1109/97.650035     Document Type: Article
Times cited : (77)

References (10)
  • 2
    • 0018918171 scopus 로고
    • An algorithm for vector quantizer design
    • Jan.
    • Y. Linde, A. Buzo, and R. M. Gray, "An algorithm for vector quantizer design," IEEE Trans. Commun., vol. COMM-28, pp. 84-95, Jan. 1980.
    • (1980) IEEE Trans. Commun. , vol.COMM-28 , pp. 84-95
    • Linde, Y.1    Buzo, A.2    Gray, R.M.3
  • 4
    • 0026828784 scopus 로고
    • Fast k-dimensional tree algorithms for nearest neighbor search with application to vector quantization encoding
    • Mar.
    • V. Ramasubramanian and K. K. Paliwal, "Fast k-dimensional tree algorithms for nearest neighbor search with application to vector quantization encoding," IEEE Trans. Signal Processing, vol. 40, pp. 518-531, Mar. 1992.
    • (1992) IEEE Trans. Signal Processing , vol.40 , pp. 518-531
    • Ramasubramanian, V.1    Paliwal, K.K.2
  • 5
    • 0022136084 scopus 로고
    • An improvement of the minimum distortion encoding algorithms for vector quantization and pattern matching
    • Oct.
    • C. D. Bei and R. M. Gray, "An improvement of the minimum distortion encoding algorithms for vector quantization and pattern matching," IEEE Trans. Commun., vol. COMM-33, pp. 1132-1133, Oct. 1985.
    • (1985) IEEE Trans. Commun. , vol.COMM-33 , pp. 1132-1133
    • Bei, C.D.1    Gray, R.M.2
  • 6
    • 0026392379 scopus 로고
    • A fast nearest neighbor search algorithm
    • May
    • M. Orchard, "A fast nearest neighbor search algorithm," in Proc. IEEE ICASSP, May 1991, pp. 2297-2300.
    • (1991) Proc. IEEE ICASSP , pp. 2297-2300
    • Orchard, M.1
  • 7
    • 0026896449 scopus 로고
    • Fast full search equivalent encoding algorithms for image compression using vector quantization
    • July
    • C. M. Huang, Q. Bi, G. S. Stiles, and R. W. Harris, "Fast full search equivalent encoding algorithms for image compression using vector quantization," IEEE Trans. Image Processing, vol. 1, no. 3, July 1992.
    • (1992) IEEE Trans. Image Processing , vol.1 , Issue.3
    • Huang, C.M.1    Bi, Q.2    Stiles, G.S.3    Harris, R.W.4
  • 8
    • 0027039403 scopus 로고
    • Equal-average hyperplane partitioning method for vector quantization of image data
    • L. Guan and M. Kamel, "Equal-average hyperplane partitioning method for vector quantization of image data," Pattern Recognit. Lett., pp. 693-699, 1992.
    • (1992) Pattern Recognit. Lett. , pp. 693-699
    • Guan, L.1    Kamel, M.2
  • 9
    • 0027658829 scopus 로고
    • A fast mean-distance-ordered partial codebook search algorithm for image vector quantization
    • Sept.
    • S. W. Ra and J. K. Kim, "A fast mean-distance-ordered partial codebook search algorithm for image vector quantization," IEEE Trans. Circuits Syst. II, vol. 40, pp. 576-579, Sept. 1993.
    • (1993) IEEE Trans. Circuits Syst. II , vol.40 , pp. 576-579
    • Ra, S.W.1    Kim, J.K.2
  • 10
    • 0028447487 scopus 로고
    • Fast closest codeword search algorithm for vector quantization
    • June
    • C. H. Lee and L. H. Chen, "Fast closest codeword search algorithm for vector quantization," IEE Proc. Vision and Image Signal Processing, June 1994, vol. 141, no. 3.
    • (1994) IEE Proc. Vision and Image Signal Processing , vol.141 , Issue.3
    • Lee, C.H.1    Chen, L.H.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.