Structural Descriptions and Inexact Matching

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn PAMI-3, Issue 5, 1981, Pages 504-519

  Shapiro, Linda G ^a   Haralick, Robert M ^a  

^a VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

Author keywords

Backtracking; forward checking; inexact matching; look ahead matching; relational homomorphism; relaxation; structural description; tree search

Indexed keywords

COMPUTER GRAPHICS;

EID: 0019612308     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.1981.4767144     Document Type: Article

References (18)

1. C. L. Barnhart Ed., The American College Dictionary. New York: Random House, 1958.
2. H. G. Barrow, A. P. Ambler, and R. M. Burstall, “Some techniques for recognizing structure in pictures,” in Frontiers of Pattern Recognition, S. Watanabe, Ed. New York: Academic, 1972, pp. 1–29.
3. L. S. Davis, “Hierarchical relaxation for shape analysis,” in Proc. IEEE Conf. Pattern Recog. Image Processing, 1978, pp. 275–279.
4. J. Gasching, “A general backtrack algorithm that eliminates most redundant tests,” in Proc. 5th Int. Joint Conf. Artificial Intell., 1972, p. 457.
5. R. M. Haralick and J. Kartus, “Arrangements, homomorphisms, and discrete relaxation,” IEEE Trans. Syst., Man, Cyber., vol. SMC-8, pp. 600-612, Aug. 1978.
6. R. M. Haralick, L. S. Davis, A. Rosenfeld, and D. Milgram, “Reduction operations for constraint satisfaction,” Informat. Sci., vol. 14, pp. 199–219, 1978.
7. R. M. Haralick, “Scene analysis, homomorphisms, and arrangements,” in Computer Vision Systems, A. Hanson, and E. Riseman, Eds. New York, Academic, 1978.
8. R. M. Haralick and L. G. Shapiro, “The consistent labeling problem: Part 1,” IEEE Trans. Pattern. Anal. Machine Intell., vol. PAMI-1, Apr. 1979, pp. 173–184.
9. R. M. Haralick and G. L. Elliott, “Increasing tree search efficiency for constraint satisfaction problems,” in Proc. 6th Int. Joint Conf. Artificial Intell., 1979.
10. A. Mackworth, “Consistency in networks of relations, “Artificial Intell., vol. 8, pp. 99–118, 1977.
11. U. Montanari, “Networks of constraints: Fundamental properties and applications to picture processing,” Informat. Sci.,. vol. 7, pp. 95–132, 1974.
12. A. Rosenfeld, R. A. Hummel, and S. W. Zucker, “Scene labeling by relaxation operations,” IEEE Trans. Syst., Man, Cyber., vol. SMC-6, pp. 420–433, June 1976.
13. L. G. Shapiro, “A structural model of shape,” IEEE Trans. Pattern Anal. Machine Intell., 1980.
14. L. G. Shapiro and R. M. Haralick, “A general spatial data structure,” in Proc. IEEE Conf. Pattern Recog. Image Process., Chicago, IL, May 31-June 2, 1978, pp. 238–289.
15. W. H. Tsai and K. S. Fu, “Error-correcting isomorphisms of attributed relational graphs for pattern analysis,” School Elec. Eng., Purdue Univ., 1979.
16. J. R. Ullman, “An algorithm for subgraph isomorphism,” J. ACM, vol. 23, pp. 31–42, Jan. 1976.
17. D. L. Waltz, “Generating semantic descriptions from drawings of scenes with shadows,” MIT Tech. Rep. A1271, Nov. 1972.
18. S. W. Zucker and J. L. Mohammed, “A hierarchical relaxation system for line labeling and grouping,” in Proc. IEEE Conf. Pattern Recog. Image Process., 1978, pp. 410–415.