Hubert scan and image compression

Proceedings - International Conference on Pattern Recognition

Volumn 15, Issue 3, 2000, Pages 207-210

  Biswas, Sambhunath ^a  

^a INDIAN STATISTICAL INSTITUTE   (India)

Author keywords

Bezier bernstein polynomial; Hilbert image; Huffman coding; Index Hilbert scan

Indexed keywords

CODES (SYMBOLS); IMAGE CODING; SPEECH RECOGNITION;

ABSOLUTE ERROR; BERNSTEIN POLYNOMIAL; COMPRESSION RATES; GRAY LEVEL IMAGE; HILBERT; HUFFMAN CODING; SCANNED IMAGES; SPACE-FILLING CURVE;

IMAGE COMPRESSION;

EID: 12744255701     PISSN: 10514651     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Article

References (7)

1. A. J. Cole. Compaction technique for raster scan graphics using space filling curves. Computer Journal, 30:87-92, 1987.
2. S. Kamata, N. Niimi, and E. Kawaguchi. A gray image compression using Hubert scan. In Proc. ICPR, pages 905-909, 1996.
3. B. Moghaddam, K. J. Hintz, and C. V. Stewart. Space filling curves for image compression. In Proc. SPIE conf. Automatic Object Recognition, volume 1471, pages 414-421, 1991.
4. J. Quinqueton and M. Berthod. A locally adaptive Peano scanning algorithm. IEEE Trans. Pattern Anal. Machine Intell., 3:403-412, 1981.
5. N. Sorek and Y. Y. Zeevi. On-line visual data compression along a one dimensional scan. In Proc. SPIE conf. Visual Communication and Image Processing, volume 1001, pages 764-770, 1988.
6. R. J. Stevens, A. F. Lehar, and F. H. Preston. Manipulation and presentation of multidimensional image data using peano scan. IEEE Trans. Pattern Anal. Machine Intell., 5:520-526, 1983.
7. W.Skarbek, T. Agui, and M. Nikajima. Compression of dithered binary images using Hubert scan. Trans. IEICE, 72:1235-1242, 1989.