A Structural Model of Shape

Shape description and recognition is an important and interesting problem in scene analysis. Our approach to shape description is a formal model of a shape consisting of a set of primitives, their properties, and their interrelationships. The primitives are the simple parts and intrusions of the shape which can be derived through the graph-theoretic clustering procedure described in [31]. The interrelationships are two ternary relations on the primitives: the intrusion relation which relates two simple parts that join to the intrusion they surround and the protrusion relation which relates two intrusions to the protrusion between them. Using this model, a shape matching procedure that uses a tree search with look-ahead to find mappings from a prototype shape to a candidate shape has been developed. An experimental Snobol4 implementation has been used to test the program on hand-printed character data with favorable results.

[1]  Hooshang Hemami,et al.  Identification of Three-Dimensional Objects Using Fourier Descriptors of the Boundary Curve , 1974, IEEE Trans. Syst. Man Cybern..

[2]  Tomas Lozano-Perez,et al.  Parsing Intensity Profiles , 1977 .

[3]  B. Rosenberg.  The analysis of convex blobs , 1972, Comput. Graph. Image Process..

[4]  Theodosios Pavlidis,et al.  Representation of figures by labeled graphs , 1972, Pattern Recognit..

[5]  Harry G. Barrow,et al.  SOME TECHNIQUES FOR RECOGNISING STRUCTURES IN PICTURES , 1972 .

[6]  Ashok K. Agrawala,et al.  A sequential approach to the extraction of shape features , 1977 .

[7]  Larry S. Davis,et al.  Understanding Shape: Angles and Sides , 1977, IEEE Transactions on Computers.

[8]  K S Fu,et al.  Syntactic Shape Recognition Using Attributed Grammars. , 1978 .

[9]  Alan C. Shaw,et al.  Parsing of Graph-Representable Pictures , 1970, JACM.

[10]  S. L. Horowitz,et al.  Peak Recognition in Waveforms , 1977 .

[11]  Kiyoshi Maruyama.  Study of visual shape perception , 1972 .

[12]  R M Haralick,et al.  The consistent labeling problem: part I. , 1979, IEEE transactions on pattern analysis and machine intelligence.

[13]  Robert M. Haralick,et al.  Decomposition of Two-Dimensional Shapes by Graph-Theoretic Clustering , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[14]  King-Sun Fu,et al.  A Syntactic Approach to Shape Recognition Using Attributed Grammars , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

[15]  Robert M. Haralick,et al.  Arrangements, Homomorphisms, and Discrete Relaxation , 1978, IEEE Transactions on Systems, Man, and Cybernetics.

[16]  Theodosios Pavlidis,et al.  A review of algorithms for shape analysis , 1978 .

[17]  Theodosios Pavlidis,et al.  Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern Recognition , 1975, IEEE Transactions on Computers.

[18]  Ralph Roskies,et al.  Fourier Descriptors for Plane Closed Curves , 1972, IEEE Transactions on Computers.

[19]  Larry S. Davis,et al.  Shape Matching Using Relaxation Techniques , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[20]  King-Sun Fu,et al.  Shape Discrimination Using Fourier Descriptors , 1977, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[21]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[22]  Herbert Freeman,et al.  Computer Processing of Line-Drawing Images , 1974, CSUR.

[23]  B. Rosenberg,et al.  Computing Dominant Points on Simple Shapes , 1974, Int. J. Man Mach. Stud..

[24]  Murray Eden,et al.  Handwriting and pattern recognition , 1962, IRE Trans. Inf. Theory.

[25]  Ming-Kuei Hu,et al.  Visual pattern recognition by moment invariants , 1962, IRE Trans. Inf. Theory.

[26]  J. F. O'Callaghan,et al.  Recovery of perceptual shape organizations from simple closed boundaries , 1974, Comput. Graph. Image Process..

[27]  Gösta H. Granlund,et al.  Fourier Preprocessing for Hand Print Character Recognition , 1972, IEEE Transactions on Computers.

[28]  Franz L. Alt,et al.  Digital Pattern Recognition by Moments , 1962, JACM.

[29]  Theodosios Pavlidis,et al.  A Hierarchical Syntactic Shape Analyzer , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[30]  D. Corneil,et al.  An Efficient Algorithm for Graph Isomorphism , 1970, JACM.

[31]  King-Sun Fu,et al.  A Clustering Procedure for Syntactic Patterns , 1977, IEEE Transactions on Systems, Man, and Cybernetics.