Two dimensional incremental parsing for image compression

European Signal Processing Conference

Volumn , Issue , 2007, Pages 653-657

  Bae, Soo Hyun ^a   Juang, Biing Hwang ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE PATTERN MATCHING; DISTORTION FUNCTIONS; ESSENTIAL COMPONENT; HIERARCHICAL STRUCTURES; INCREMENTAL PARSING; LOCAL AVERAGE; LOSSY DATA COMPRESSION; MINIMAX; NOISE VISIBILITY; PERCEPTUAL QUALITY; TWO-DIMENSION; TWO-DIMENSIONAL SOURCE; UNIVERSAL COMPRESSION;

IMAGE COMPRESSION; PATTERN MATCHING; SIGNAL PROCESSING; TWO DIMENSIONAL;

ALGORITHMS;

EID: 63549127749     PISSN: 22195491     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. A. Lempel and J. Ziv, "On the complexity of finite sequences," IEEE Trans. Inform. Theory, vol. IT-22, no. 1, pp. 75-81, Jan. 1976.
2. J. Ziv and A. Lempel, "A universal algorithm for sequential data compression," IEEE Trans. Inform. Theory, vol. IT-23, no. 3, pp. 337-343, May. 1977.
3. J. Ziv and A. Lempel, "Compression of individual sequences via variable rate coding," IEEE Trans. Inform. Theory, vol. IT-24, no. 5, pp. 530-536, Sept. 1978.
4. J. Ziv, "Coding theorem for individual sequences," IEEE Trans. Inform. Theory, vol. IT-24, no. 4, pp. 405-412, July. 1978.
5. A. Lempel and J. Ziv, "Compression of two-dimensional data," IEEE Trans. Inform. Theory, vol. IT-32, no. 1, pp. 2-8, Jan. 1986.
6. D. Sheinwald, A. Lempel, and J. Ziv, "Two-dimensional encoding by finite-state encoders," IEEE Trans. Commun., vol. 38, no. 3, pp. 341-347, Mar. 1990.
7. H. Morita and K. Kobayashi, "An extension of LZW coding algorithm to source coding subject to a fidelity criterion," in 4th Joint Swedish-Soviet International Workshop Information Theory, Gotland, Sweden, 1989, pp. 105-109.
8. Y. Steinberg and M. Gutman, "An algorithm for source coding subject to a fidelity criterion, based on string matching," IEEE Trans. Inform. Theory, vol. IT-39, no. 3, pp. 877-886, May 1993.
9. Z. Zhang and V. Wei, "An on-line universal lossy data compression an on-line universal lossy data compression algorithm via continuous codebook refinement. I. Basic results," IEEE Trans. Inform. Theory, vol. IT-42, no. 3, pp. 803-821, May. 1996.
10. T. Łuczak and W. Szpankowski, "A suboptimal lossy data compression based on approximate pattern matching," IEEE Trans. Inform. Theory, vol. IT-43, no. 5, pp. 1439-1451, Sept. 1997.
11. E. H. Yang and J. Kieffer, "On the performance of data compression algorithms based upon string matching," IEEE Trans. Inform. Theory, vol. IT-44, no. 1, pp. 47-65, 1998.
12. M. Alzina, W. Szpankowski, and A. Grama, "2D-pattern matching image and video compression: Theory, algorithms, and experiments," IEEE Trans. Image Processing, vol. 11, no. 3, pp. 318-331, Mar. 2002.
13. T. A. Welch, "A technique for high-performance data compression," IEEE Computer, vol. 17, no. 6, pp. 8-19, June 1984.
14. J. Rissanen, "A universal data compression system," IEEE