Abstract
Previous research in model-based 2 – D object recognition has compared the scene representation either with each model in a database of models or with each of a collection of features belonging to a database of models until the scene was completely analyzed. In other words, these techniques were model-driven and lacked a data-driven indexing mechanism for model retrieval. In this paper, we develop such an indexing mechanism. This mechanism is part of an overall scheme called SMITH (Shape Matching Utilizing Indexed Hypothesis Generation and Testing) for 2-D object recognition which is based on a dynamic programming implementation of attributed string matching. It is computationally efficient and works effectively for both non-occluded and occluded shapes. Another advantage of our technique is that models may be inserted or deleted with relatively little cost.
This research has been partially supported by the Institute for Manufacturing Research at Wayne State University.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anderson, K.R. and Gaby, J.E., ‘Dynamic Waveform Matching,’ Information Sciences, Volume 31 (1983), pp. 221–242
Ayache, N. and Faugeras, O.D., ‘HYPER - A New Approach for the Recognition and Position of Two-Dimensional Objects,’ IEEE Transactions on Pattern Analysis and Machine Intelligence, Volume PAMI-8 (1986), pp. 44–54
Bahl, L.R. and Jelinek, F., ‘Decoding for Channels with Insertions, Deletions, and Substitutions with Applications to Speech Recognition,’ IEEE Transactions on Information Theory, Volume IT-21 (1975), pp. 404–411
Bhanu, B. and Faugeras, O.D., ‘Shape Matching of Two-Dimensional Objects,’ IEEE Transactions on Pattern Analysis and Machine Intelligence, Volume PAMI-6 (1984), pp. 137–156
Bolles, R.C. and Cain, R.A., ‘Recognizing and Locating Partially Visible Objects: The Local-Feature-Focus Method,’ International Journal of Robotics Research, Volume 1 (1982), pp. 57–82
Davis, L.S., ‘Shape Matching Using Relaxation Techniques,’ IEEE Transactions on Pattern Analysis and Machine Intelligence, Volume PAMI-1 (1979), pp. 60–72
Duda, R.O. and Hart, P.E., Pattern Classification and Scene Analysis, John Wiley and Sons, New York, 1973
Grosky, W.I. and Lu, Y., ‘A Generalized Pattern Matching Approach to the Design of a Pictorial Index Mechanism,’ Computer Vision, Graphics, and Image Processing, To Appear
Knoll, T.F. and Jain, R.C., ‘Recognizing Partially Visible Objects Using Feature Indexed Hypotheses’, IEEE Journal of Robotics and Automation, Volume RA-2 (1986), pp. 3–13
Lowrance, R. and Wagner, R.A., ‘An Extension of the String-to-String Correction. Problem,’ Journal of the ACM, Volume 22 (1975), pp. 177–183
Lu, S.Y. and Fu, K.S., ‘A Sentence-to-Sentence Clustering Procedure for Pattern Analysis,’ IEEE Transactions on Systems, Man, and Cybernetics, Volume SMC-8 (1978), pp. 381–389
Mehrotra, R. and Grosky, W.I., ‘REMINDS: A Relational Model-Based Integrated Image and Text Database Management System,’ Proceedings of the IEEE Computer Society Workshop on Computer Architecture for Pattern Analysis and Image Database Management, Miami, Florida, November 1985, pp. 348–354
Myers, C.S. and Rabiner, L.R., ‘A Level Building Dynamic Time Warping Algorithm for Connected Word Recognition,’, IEEE Transactions on Acoustics, Speech, and Signal Processing, Volume ASSP-29 (1981), pp. 284–297
Myers, C.S. and Rabiner, L.R., ‘Connected Digit Recognition Using a Level Building DTW Algorithm,’ IEEE Transactions on Acoustics, Speech, and Signal Processing, Volume ASSP-29 (1981), pp. 351–363
Pavlidis, T., Structural Pattern Recognition, Springer-Verlag, New York, 1977
Pavlidis, T., ‘A Review of Algorithms for Shape Analysis,’ Computer Graphics and Image Processing, Volume 7 (1978), pp. 243–258
Perkins, W.A., ‘A Model-Based Vision System for Industrial Parts,’ IEEE Transactions on Computers, Volume C-27 (1979), pp. 126–143
Rosenfeld, A. and Johnston, E., ‘Angle Detection on Digital Curves,’ IEEE Transactions on Computers, Volume C-22 (1973), pp. 875–878
Sakoe, H. and Chiba, S., ‘Dynamic Programming Optimization for Spoken Word Recognition,’ IEEE Transactions on Acoustics, Speech, and Signal Processing, Volume ASSP-26 (1978), pp. 43–49
Turney, J.L., Mudge, T.N., and Volz, R.A., ‘Recognizing Partially Occluded Parts,’ IEEE Transactions on Pattern Analysis and Machine Intelligence, Volume PAMI-7 (1985), pp. 410–421
Tsai, W.H. and Yu, S.S., ‘Attributed String Matching with Merging for Shape Recognition,’ IEEE Transactions on Pattern Analysis and Machine Intelligence, Volume PAMI-7 (1985), pp. 453–462
Wagner, R.A. and Fischer, M.J., ‘The String-to-String Correction Problem,’ Journal of the ACM, Volume 21 (1975), pp. 168–173
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mehrotra, R., Grosky, W.I. (1988). Smith: An Efficient Model-Based two Dimensional Shape Matching Technique. In: Ferraté, G., Pavlidis, T., Sanfeliu, A., Bunke, H. (eds) Syntactic and Structural Pattern Recognition. NATO ASI Series, vol 45. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83462-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-83462-2_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-83464-6
Online ISBN: 978-3-642-83462-2
eBook Packages: Springer Book Archive