Document Image Decoding Using Markov Source Models

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 16, Issue 6, 1994, Pages 602-617

  Kopec, Gary E ^a   Chou, Philip A ^a  

^a PALO ALTO RESEARCH CENTER   (United States)

Author keywords

Document recognition; image decoding; Markov sources; stochastic grammars; text recognition

Indexed keywords

ALGORITHMS; CHARACTER RECOGNITION; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL GRAMMARS; DATA COMMUNICATION SYSTEMS; DATABASE SYSTEMS; DYNAMIC PROGRAMMING; IMAGE CODING; IMAGE RECONSTRUCTION; MATHEMATICAL MODELS; PATTERN RECOGNITION SYSTEMS; RANDOM PROCESSES;

DOCUMENT RECOGNITION; FINITE STATE TRANSDUCER; IMAGE DECODER; IMAGE DECODING; IMAGE GENERATOR; MARKOV SOURCE MODELS; NOISY CHANNEL; STOCHASTIC GRAMMARS;

DECODING;

EID: 0028443675     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.295905     Document Type: Article

References (27)

1. Adobe Systems Inc., PostScript Language Reference Manual, second ed. Reading: Addison-Wesley, 1990.
2. H. Abelson and A. diSessa, Turtle Geometry. Cambridge, MA: MIT Press, 1980.
3. O. Agazzi, S. Kuo, E. Levin, and R. Pieraccini, “Connected and degraded text recognition using planar hidden Markov models,” in Proc. 1993 IEEE Int. Conf. Acoust., Speech and Signal Processing, Minneapolis, MN, vol. V, Apr. 27-30, 1993, pp. 113-116.
4. J. C. Anigbogu and A. Belaiiid, “Application of hidden Markov models to multifont text recognition,” in Proc. Int. Conf. Document Anal. and Recognit., Saint-Malo, France, September, 1991, pp. 785-793.
5. H. Baird, “Document image defect models,” in Proc. IAPR Workshop on Syntactic and Structural Pattern Recognit., Murray Hill, NJ, June 1990.
6. L. Bahl, F. Jelinek, and R. Mercer, “A maximum likelihood approach to continuous speech recognition,” IEEE Trans. Pattern Anal. Machine ll., vol. PAMI-5, no. 2, pp. 179-190, Mar. 1983.
7. F. Chen, L. Wilcox, and D. Bloomberg, “Word spotting in scanned images using hidden Markov models,” in Proc. 1993 IEEE Int. Conf. Acoust., Speech and Signal Processing, Minneapolis, MN, vol. V, Apr. 27-30, 1993, pp. 1-4.
8. M. Chen, A. Kundu, and J. Zhou, “Off-line handwritten word recognition using a hidden Markov model type stochastic network,” to appear in IEEE Trans. Pattern Anal. Machine Inell.
9. P. Chou, “Recognition of equations using a two-dimensional stochastic context-free grammar,” presented at the SPIE Visual Common. Image Processing (IV), Philadelphia, PA, vol. 1199, Nov. 1989, 852-863.
10. C. Goldfarb, The SGML Handbook. Oxford: Oxford Univ. Press, 1991.
11. J. Hoperoft and J. Ullman, Introduction to Automata Theory, Languages and Computation. 1979.
12. X. Huang, Y. Ariki, and M. Jack, Hidden Markov Models for Speech Recognition. Edinburgh: Edinburgh Univ. Press, 1990.
13. F. Jelinek, “Continuous speech recognition b y statistical methods,” Proc. IEEE, vol. 64, no. 4, 532-556 Apr. 1976.
14. R. Karp, R. Miller, and S. Winograd, “The organization of computations for uniform recurrence equations,” J. ACM, vol. 14, pp. 563-590, 1967.
15. G. Kopec and S. Bagley, “Editing Images of Text,” in EP90, R. Furuta, Ed. Cambridge: Cambridge Univ. Press, 1990; also rep. P92-000150 (ISTL-92-3), Xerox Palo Alto Res. Center, Palo Alto, CA, Nov. 1992.
16. G. Kopec, “Row-major scheduling of image decoders,” Rep. P92-00061 (EDL-92-5), XEROX Palo Alto Res. Center, Palo Alto, CA, June 1992.
17. G. Kopec, “Least-squares font metric estimation from images,” IEEE Trans. Image Processing, vol. 2, no. 4, pp. 510-519, Oct. 1993.
18. L. Lamport, LaTeX, A Document Preparation System. Reading: Addison-Wesley, 1986.
19. Pacific Bell, Smart Yellow Pages, Palo Alto, Redwood City and Menlo Park, 1992.
20. C. Papadimitriou and K. Steiglitz, Combinatorial Optimization. Englewood Cliffs: Prentice-Hall, 1982.
21. P. Prusinkiewicz and J. Hanan, Lindenmayer Systems, Fractals and Plants (Lecture Notes in Biomathematics), no. 79. Berlin: Springer-Verlag, 1989.
22. S. Rao, “Regular iterative algorithms and their implementations on processor arrays,” Ph.D. thesis, Stanford Univ., Oct. 1985.
23. R. Rubenstein, Digital Typography. Reading: Addison-Wesley, 1988.
24. D. Sankoff and J. Kruskal, Eds., Time Warps, String Edits and Macro-molecules: The Theory and Practice of Sequence Comparison. Reading, MA: Addison-Wesley, 1983.
25. M. Tomita, “Parsing 2-dimensional language,” in ACM Int. Workshop on Parsing Technol., 1989, pp. 414-424.
26. K. Wong, G. Casey, and F. Wahl, “Document analysis system,” IBM J. Res. Develop., vol. 26, no. 6, pp. 647-656, Nov. 1982.
27. J. Vlontzos and S.Y. Kung, “Hidden Markov models for character recognition,” in Proc. 1989 IEEE Int. Conf. Acoust., Speech and Signal Processing, Glasgow, Scotland, May 23-26, 1989, pp. 1719-1722.