Residual coding in document image compression

IEEE Transactions on Image Processing

Volumn 9, Issue 6, 2000, Pages 961-969

  Kia, Omid E ^a,b   Doermann, David S ^c  

^a IEEE

^b IMACOM Inc   (United States)

^c UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; IMAGE COMPRESSION; IMAGE RECONSTRUCTION; MATHEMATICAL MODELS; PATTERN MATCHING;

CLUSTERING ALGORITHM; COMPRESSION RATIO; DOCUMENT IMAGE COMPRESSION; JOINT BILEVEL IMAGE EXPERTS GROUP; RESIDUAL CODING;

IMAGE CODING;

EID: 0033685861     PISSN: 10577149     EISSN: None     Source Type: Journal    
DOI: 10.1109/83.846239     Document Type: Article

References (35)

1. A. Gersho and R. Gray, Vector Quantization and Signal Compression. Norwell, MA: Kluwer, 1992.
2. A. Jain, Fundamentals of Digital Image Processing. Englewood Cliffs, NJ: Prentice-Hall, 1989.
3. M. F. Barnsley and L. P. Hurd, Fractal Image Compression. Wellesley, MA: Peters, 1993.
4. C. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, pp. 623-656, 1948.
5. R. Gallager, "Variations on a theme by Huffman," IEEE Trans. Inform. Theory, vol. 24, pp. 668-674, 1978.
6. J. Vitter, "Design and analysis of dynamic Huffman codes," J. Assoc. Comput. Mach., vol. 34, pp. 825-845, 1987.
7. T. Huang, "Run length coding and its extensions," in Picture Bandwidth Compression, T. Huang and O. Tretiak, Eds. New York: Gordon and Breach, 1972, pp. 231-264.
8. W. Pennebaker and J. Mitchell, "Probability estimation for the Q-coder," IBM J. Res. Develop., vol. 32, pp. 737-752, 1988.
9. O. Kia, D. Doermann, A. Rosenfeld, and R. Chellappa, "Symbolic compression and processing of document images," Comput. Vis. Image Understand., vol. 70, pp. 335-349, 1998.
10. R. Ascher and G. Nagy, "A means for achieving a high degree of compaction on scan-digitized printed text," IEEE Trans. Comput., vol. 23, pp. 1174-1179, 1974.
11. M. Atallah, Y. Genin, and W. Szpakowski, "Pattern matching image compression: Algorithmic and empirical results," Comput. Sci. Dept., Purdue Univ., West Lafayette, IN, Tech. Rep. CSD TR-95-083, 1995.
12. O. Johnsen, J. Segen, and G. Cash, "Coding of two-level pictures by pattern matching and substitution," Bell Syst. Tech. J., vol. 62, pp. 2513-2545, 1983.
13. K. Mohiuddin, "Pattern matching with application to binary image compression," Ph.D. dissertation, Stanford Univ., Stanford, CA, 1982.
14. K. Mohiuddin, J. Rissanen, and R. Arps, "Lossless binary image compression based on pattern matching," in Proc. Int. Conf. Computers, Systems, Signal Processing, 1984, pp. 447-451.
15. I. Witten, A. Moffat, and T. Bell, Managing Gigabytes: Compressing and Indexing Documents and Images. New York: Van Nostrand Reinhold, 1994.
16. P. Howard, "Lossless and lossy compression of text images by soft pattern matching," in Proc. IEEE Data Compression Conf., 1996, pp. 210-219.
17. W. Pratt, P. Capitant, W. Chen, E. Hamilton, and R. Willis, "Combining symbol matching facsimile data compression system," Proc. IEEE, vol. 68, pp. 786-796, 1980.
18. M. Holt and C. Xydeas, "Recent developments in image data compression for digital facsimile," ICL Tech. J., pp. 123-146, 1986.
19. M. Holt, "A fast binary template matching algorithm for document image data compression," in Proc. Int. Conf. Pattern Recognition, 1988, pp. 230-239.
20. S. Inglis and I. Witten, "Compression-based template matching," in Proc. IEEE Data Compression Conf., 1994.
21. Q. Zhang and J. Danskin, "Entropy-based pattern matching for document image compression," in Proc. Int. Conf. Image Processing, vol. 2, 1996, pp. 221-224.
22. P. Sarkar, "Random phase spatial sampling effects in digitized patterns," M.S. thesis, Rensselaer Polytech. Inst, Troy, NY, 1994.
23. P. Sarkar, G. Nagy, D. Lopresti, and J. Zhou, "Spatial sampling of printed patterns," IEEE Trans. Pattern Anal. Machine Intell., vol. 20, pp. 344-351, 1998.
24. T. Kanungo, R. M. Haralick, and I. T. Phillips, "Global and local document degradation models," in Proc. Int. Conf. Document Analysis Recognition, 1993, pp. 730-734.
25. A. Rosenfeld and J. Pfaltz, "Distance functions on digital pictures," Pattern Recognit., vol. 1, pp. 33-61, 1968.
26. H. Samet, "Distance transform for images represented by quadtrees," IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-4, pp. 298-303, 1982.
27. T. Boult, "Dynamic digital distance maps in two dimensions," IEEE Trans. Robot. Automat., vol. 6, pp. 590-597, 1990.
28. T. Hirata, "A unified linear-time algorithm for computing distance maps," Inf. Process. Lett., vol. 58, pp. 129-133, 1996.
29. F. Laymarie and M. Levine, "Fast raster scan distance propagation on the discrete rectangular lattice," Comput., Vis., Graph., Image Process.: Image Understand., vol. 55, pp. 84-94, 1992.
30. B. Verwer, P. Verbeek, and S. Dekker, "An efficient uniform cost algorithm applied to distance transforms," IEEE Trans. Pattern Anal. Machine Intell., vol. 11, pp. 425-429, 1989.
31. F. Wahl, "A new distance mapping and its use for shape measurement on binary patterns," Comput. Vis., Graph., Image Process., vol. 23, pp. 218-226, 1983.
32. T. Cover and J. Thomas, Elements of Information Theory. New York: Wiley, 1991.
33. R. Haralick, UW English Document Image Database I: A Database of Document Images for OCR Research, CD-ROM.
34. S. Inglis, "Lossless document image compression," Ph.D. dissertation, Univ. Waikato, New Zealand, 1999.
35. I. Witten, T. Bell, H. Emberson, S. Inglis, and A. Moffat, "Textual image compression: Two-stage lossy/lossless encoding of textual images," Proc. IEEE, vol. 82, pp. 878-888, 1994.