메뉴 건너뛰기




Volumn 2003-January, Issue , 2003, Pages 223-232

Codelet parsing: quadratic-time, sequential, adaptive algorithms for lossy compression

Author keywords

Adaptive algorithm; Data compression

Indexed keywords

ADAPTIVE ALGORITHMS; ALGORITHMS; IMAGE MATCHING;

EID: 33751060632     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.2003.1194013     Document Type: Conference Paper
Times cited : (4)

References (20)
  • 2
    • 0029779158 scopus 로고    scopus 로고
    • Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm
    • E.-H. Yang and J. C. Kieffer, "Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm," IEEE Trans. Inform. Theory, vol. 42, no. 1, pp. 239-245, 1996.
    • (1996) IEEE Trans. Inform. Theory , vol.42 , Issue.1 , pp. 239-245
    • Yang, E.-H.1    Kieffer, J.C.2
  • 3
    • 0031236412 scopus 로고    scopus 로고
    • A suboptimal lossy data compression based on approximate pattern matching
    • T. Luczak and W. Szpankowski, "A suboptimal lossy data compression based on approximate pattern matching," IEEE Trans. Inform. Theory, vol. 43, pp. 1439-1451, 1997.
    • (1997) IEEE Trans. Inform. Theory , vol.43 , pp. 1439-1451
    • Luczak, T.1    Szpankowski, W.2
  • 4
    • 0018019231 scopus 로고
    • Compression of individual sequences via variable-rate coding
    • J. Ziv and A. Lempel, "Compression of individual sequences via variable-rate coding," IEEE Trans. Inform. Theory, vol. 24, no. 5, pp. 530-536, 1978.
    • (1978) IEEE Trans. Inform. Theory , vol.24 , Issue.5 , pp. 530-536
    • Ziv, J.1    Lempel, A.2
  • 5
    • 33747472001 scopus 로고
    • Universal decoding for finite-state channels
    • J. Ziv, "Universal decoding for finite-state channels," IEEE Trans. Inform. Theory, vol. 31, no. 4, pp. 453-460, 1985.
    • (1985) IEEE Trans. Inform. Theory , vol.31 , Issue.4 , pp. 453-460
    • Ziv, J.1
  • 6
    • 0030151231 scopus 로고    scopus 로고
    • An on-line universal lossy data compression algorithm via continuous codebook refinement - Part i: Basic results
    • Z. Zhang and V. K. Wei, "An on-line universal lossy data compression algorithm via continuous codebook refinement-part i: Basic results," IEEE Trans. Inform. Theory, vol. 42, no. 3, pp. 803-821, 1996.
    • (1996) IEEE Trans. Inform. Theory , vol.42 , Issue.3 , pp. 803-821
    • Zhang, Z.1    Wei, V.K.2
  • 7
    • 0035089002 scopus 로고    scopus 로고
    • Natural type selection in adaptive lossy compression
    • R. Zamir and K. Rose, "Natural type selection in adaptive lossy compression," IEEE Trans. Inform. Theory, vol. 47, no. 1, pp. 99-111, 2001.
    • (2001) IEEE Trans. Inform. Theory , vol.47 , Issue.1 , pp. 99-111
    • Zamir, R.1    Rose, K.2
  • 9
    • 0031647294 scopus 로고    scopus 로고
    • On the performance of data compression algorithms based upon string matching
    • E.-H. Yang and J. C. Kieffer, "On the performance of data compression algorithms based upon string matching," IEEE Trans. Inform. Theory, vol. 44, pp. 47-65, 1998.
    • (1998) IEEE Trans. Inform. Theory , vol.44 , pp. 47-65
    • Yang, E.-H.1    Kieffer, J.C.2
  • 11
    • 33747765106 scopus 로고
    • On-line adaptive vector quantization with variable size codebook entries
    • C. Constantinescu and J. A. Storer, "On-line adaptive vector quantization with variable size codebook entries," in Data Compression Conf., pp. 32-41, 1993.
    • (1993) Data Compression Conf. , pp. 32-41
    • Constantinescu, C.1    Storer, J.A.2
  • 12
    • 0028449880 scopus 로고
    • Improved techniques for single-pass vector quantization
    • C. Constantinescu and J. A. Storer, "Improved techniques for single-pass vector quantization," Proceedings of the IEEE, vol. 82, no. 6, pp. 933-939, 1994.
    • (1994) Proceedings of the IEEE , vol.82 , Issue.6 , pp. 933-939
    • Constantinescu, C.1    Storer, J.A.2
  • 14
    • 0027599792 scopus 로고
    • An algorithm for source coding subject to a fidelity criterion, based on string matching
    • Y. Steinberg and M. Gutman, "An algorithm for source coding subject to a fidelity criterion, based on string matching," IEEE Trans. Inform. Theory, vol. 39, no. 3, pp. 877-886, 1993.
    • (1993) IEEE Trans. Inform. Theory , vol.39 , Issue.3 , pp. 877-886
    • Steinberg, Y.1    Gutman, M.2
  • 15
    • 0033356515 scopus 로고    scopus 로고
    • An implementable lossy version of the Lempel-Ziv algorithm - Part i: Optimality for memoeyless sources
    • I. Kontoyiannis, "An implementable lossy version of the Lempel-Ziv algorithm - part i: Optimality for memoeyless sources," IEEE Trans. Inform. Theory, vol. 45, no. 7, pp. 2293-2305, 1999.
    • (1999) IEEE Trans. Inform. Theory , vol.45 , Issue.7 , pp. 2293-2305
    • Kontoyiannis, I.1
  • 19
    • 39049171441 scopus 로고    scopus 로고
    • Adaptive parametric vector quantization by natural type selection
    • Y. Kochman and R. Zamir, "Adaptive parametric vector quantization by natural type selection," in Data Compression Conference, pp. 392-401, 2002.
    • (2002) Data Compression Conference , pp. 392-401
    • Kochman, Y.1    Zamir, R.2
  • 20
    • 0033101247 scopus 로고    scopus 로고
    • Variable-rate trellis source encoding
    • E.-H. Yang and Z. Zhang, "Variable-rate trellis source encoding," IEEE Trans. Inform. Theory, vol. 45, no. 2, pp. 586-608, 1999.
    • (1999) IEEE Trans. Inform. Theory , vol.45 , Issue.2 , pp. 586-608
    • Yang, E.-H.1    Zhang, Z.2


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