5 April 1985 Shape Recognition Of Complex Objects By Syntactical Primitives
Author Affiliations +
Proceedings Volume 0548, Applications of Artificial Intelligence II; (1985) https://doi.org/10.1117/12.948413
Event: 1985 Technical Symposium East, 1985, Arlington, United States
The paper describes a pattern recognition method based on syntactic image analysis applicable in autonomous systems of robot vision for the purpose of pattern detection or classification. The discrimination of syntactic elements is realized by polygonal approximation of contours employing a very fast algorithm based upon coding, local pixel logic and methods of choice instead of numerical methods. Semantic information is derived from attributes calculated from the filtered shape vector. No a priori information on image objects is required, and the choice of starting point is determined by finding the significant directions on the shape vector. The radius of recognition sphere is minimum Euclidian distance, i.e. maximum similarity between the unknown model and each individual grammar created in the learning phase. By keeping information on derivations of individual syntactic elements, an alternative of parsing recognition is left. The analysis is very flexible, and permits the recognition of highly distorted or even partially visible objects. The output from syntactic analyzer is the measure of irregularity, and the method is thus applicable in any application where sample deformation is being examined.
© (1985) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
D. Lenger and H. Cipovic "Shape Recognition Of Complex Objects By Syntactical Primitives", Proc. SPIE 0548, Applications of Artificial Intelligence II, (5 April 1985); doi: 10.1117/12.948413; https://doi.org/10.1117/12.948413


Fast Path Planning In Unstructured, Dynamic, 3-D Worlds
Proceedings of SPIE (March 25 1986)
Hypothetico-deductive diagnoses
Proceedings of SPIE (February 29 1992)
The Diagnosis Kernel
Proceedings of SPIE (December 31 1989)
TS: a test-split algorithm for inductive learning
Proceedings of SPIE (August 31 1993)
Plausible Reasoning In Expert Systems For Troubleshooting
Proceedings of SPIE (March 28 1988)

Back to Top