Structured Document Image Analysis pp 479-499 | Cite as

# Syntactic and Structural Methods in Document Image Analysis

Chapter

## Abstract

We survey applications of syntactic and structural pattern recognition (SSPR) methods to the field of document image analysis, analyze the strengths and weakness of these methods for document image analysis, and discuss other complementary techniques.

## Keywords

Production Rule Document Image Edit Operation Tree Automaton Formal Grammar
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## Preview

Unable to display preview. Download preview PDF.

## References

- [AHPE72]A. V. Aho and T. G. Peterson, “A minimum distance error-correcting parser for context-free languages,”
*SIAM J. Computing4*, pp. 305–312, 1972.CrossRefMathSciNetGoogle Scholar - [AHUL73]A. V. Aho and J. D. Ullman,
*The theory of parsing translation and compiling*. Prentice-Hall, Englewood Cliffs, NJ, 1973.Google Scholar - [BA78]B. S. Baker, “Tree transducers and tree languages.,”
*Inf. Control37*, pp. 241–266, 1978.CrossRefMATHGoogle Scholar - [BE78]D. A. Bell, “Decision trees, tables and lattices,” In B. G. Batchelor (ed.),
*Pattern Recognition*, Plenum Press, 1978.Google Scholar - [BU90]H. Bunke, “String matching for structural pattern recognition,” In H. Bunke & A. Sanfeliu (eds),
*Syntactic and structural pattern recognition: theory and applications*, World Scientific, Singapore, pp. 119–144, 1990.Google Scholar - [BUSA90]H. Bunke and A. Sanfeliu (eds),
*Syntactic and structural pattern recognition: theory and applications*. 1990.MATHGoogle Scholar - [ENRR87]H. Ehrig, M. Nagl, G. Rozenberg, and A. Rosenfeld (eds.),
*Graph grammars and their application to computer science*. Lecture Notes Computer Science 297. Springer-Verlag, Berlin, 1987.MATHGoogle Scholar - [FIN79]N. V. Findler (ed,),
*Associative networks: the representation and use of knowledge by computers*. Academic Press, New York, 1979.Google Scholar - [FU82]K. S. Fu,
*Syntactic pattern recognition and applications*. Prentice-Hall, Englewood Cliffs, NJ, 1982.MATHGoogle Scholar - [FU83]K. S. Fu, “A step towards unification of syntactic and statistical pattern recognition,”
*IEEE Trans. PAMI*5, pp. 200–205, 1983.MATHGoogle Scholar - [GOTH78]R. C. Gonzalez and M. G. Thomason,
*Syntactic pattern recognition*. Addison-Wesley, Reading, MA, 1978.MATHGoogle Scholar - [GHR80]S. L. Graham, M. A. Harrison, and W. L. Ruzzo, “An improved context- free recognizer,”
*ACM Trans. Program Lang, and Syst.*, pp. 415–449, 1980.Google Scholar - [HAR83]R. M. Haralick, “An interpretation for probabilistic relaxation,”
*Comp. Vision, Graphics and Image Processing*22, 1983.Google Scholar - [HOUL79]J. E. Hopcroft and J. D. Ullman,
*Introduction to automata theory, languages and computation*. Addison-Wesley, Reading, MA, 1979.MATHGoogle Scholar - [HUZU83]R. Hummel and S. Zucker,
*On the foundations of relaxation labeling processes*. IEEE Trans. PAMI 5, pp. 267–287, 1983.CrossRefMATHGoogle Scholar - [LEV66]V. I. Levenshtein, “Binary codes capable of correcting deletions, insertions and reversals,”
*Sov. Phys. Dokl.*10 (8), pp. 707–710, 1966.MathSciNetGoogle Scholar - [LU84]S. Y Lu, “A tree matching algorithm based on node splitting and merging,”
*IEEE Trans. PAMI*6, pp. 249–256, 1984.CrossRefMATHGoogle Scholar - [LUFU78]S. Y. Lu and K. S. Fu, “Error-correcting tree automata for syntactic pattern recognition,”
*IEEE Trans. Computers*27, pp. 1040–1053, 1978.CrossRefMATHMathSciNetGoogle Scholar - [LYON74]G. Lyon, “Syntax-directed least-errors analysis for context-free languages: a practical approach,”
*CACM*17, pp. 3–14, 1974.MATHGoogle Scholar - [MIC86]L. Miclet,
*Structural methods in pattern recognition*. North-Oxford Academic, 1986.MATHGoogle Scholar - [MIN75]M. Minsky, “A framework for representing knowledge,” In P. Winston (ed), The psychology of computer vision, McGraw-Hill, New York, 1975.Google Scholar
- [NIL80]N. J. Nilsson,
*Principles of artificial intelligence*. Tioga, Palo Alto, California, 1980.MATHGoogle Scholar - [PAV77]T. Pavlidis,
*Structural pattern recognition*. Springer Series Electrophysics Springer-Verlag, Berlin, 1977.MATHGoogle Scholar - [PEA84]J. Pearl, Heuristics:
*intelligent search strategies for computer problem solving*. Addison-Wesley, Reading, MA, 1984.Google Scholar - [PEA88]J. Pearl,
*Probabilistic reasoning in intelligent systems: networks of plausible inference*. Morgan Kaufmann, 1988.Google Scholar - [ROS 79]A. Rosenfeld,
*Picture languages: formal models for picture recognition*. Academic Press, New York, 1979.MATHGoogle Scholar - [RHZ76]A. Rosenfeld, R. A. Hummel, and S. W. Zucker, “Scene labeling by relaxation operations,”
*IEEE Trans. SMC*6, pp. 420–443, 1976.MATHMathSciNetGoogle Scholar - [SA90]A. Sanfeliu, “Matching tree structures,” In H. Bunke and A. Sanfeliu (eds),
*Syntactic and structural pattern recognition: theory and applications*, World Scientific, Singapore, pp. 145–178, 1990.Google Scholar - [SAFU83]A. Sanfeliu and K. S. Fu, “A distance measure between attributed relational graphs for pattern recognition,”
*IEEE Trans. SMC*13, No. 3, pp. 353–362, 1983.MATHGoogle Scholar - [SHHA90]L. G. Shapiro and R. M. Haralick, “Matching relational structures using discrete relaxation,” In H. Bunke & A. Sanfeliu (eds),
*Syntactic and structural pattern recognition: theory and applications*, World Scientific, Singapore, pp. 179–196, 1990.Google Scholar - [TAI79]K. C. Tai, “The tree to tree correction problem,”
*J. ACM*26, pp. 422–433, 1979.CrossRefMATHMathSciNetGoogle Scholar - [TAN88]E. Tanaka, “Efficient computing algorithms for the Tai metric,”
*Int’l J. Pattern Recognition and Artificial Intelligence*, 1988.Google Scholar - [TAN90]E. Tanaka, “Parsing and error-correcting parsing for string grammars,” In H. Bunke & A. Sanfeliu (eds),
*Syntactic and structural pattern recognition: theory and applications*, World Scientific, Singapore, pp. 55–84, 1990.Google Scholar - [TAFU82]E. Tanaka and K. S. Fu, “Error correcting parsers for formal languages,”
*IEEE Trans. Comp.*31, pp. 327–328, 1982.CrossRefMATHMathSciNetGoogle Scholar - [TSFU85]W. H. Tsai and K. S. Fu, “Attributed string matching with merging for shape recognition,”
*IEEE Trans. PAMI*7, pp. 453–462, 1985.CrossRefGoogle Scholar - [WAL75]D. Waltz, “Understanding line drawings of scenes with shadows,” In P. Winston (ed),
*The psychology of computer vision*, McGraw-Hill, New York, pp. 19–91, 1975.Google Scholar - [YOFU76]K. C. You and K. S. Fu, “An approach to design of a linear binary classifier,”
*Proc. Symp. of Machine Processing of Remotely Sensed Data*, Purdue Univ., 1976.Google Scholar

## Copyright information

© Springer-Verlag Berlin Heidelberg 1992