This Article 
 Bibliographic References 
 Add to: 
2-D Shape Classification Using Hidden Markov Model
November 1991 (vol. 13 no. 11)
pp. 1172-1184

The authors present a planar shape recognition approach based on the hidden Markov model and autoregressive parameters. This approach segments closed shapes to make classifications at a finer level. The algorithm can tolerate a lot of shape contour perturbation and a moderate amount of occlusion. An orientation scheme is described to make the overall classification insensitive to shape orientation. Excellent recognition results have been reported. A distinct advantage of the approach is that the classifier does not have to be trained again when a new class of shapes is added.

[1] B. K. P. Horn,Robot Vision. New York: McGraw-Hill, 1986.
[2] T. Pavlidis, "Algorithms for shape analysis of contour and waveforms,"IEEE Trans. Patt. Anal. Machine Intell., vol. PAMI-2, no. 4, pp. 301-312, July 1980.
[3] C. T. Zahn and R. Z. Roskies, "Fourier descriptions for plane closed curves,IEEE Trans. Comput., vol. C-21, no. 3, pp. 269-281, Mar. 1972.
[4] G. H. Granlund, "Fourier preprocessing for hand print character recognition,"IEEE Trans. Comput., vol. C-21, pp. 195-2-1, 1972.
[5] H. Freeman, "Computer processing of line-drawing images,"Computer Surveys, vol. 6, no. 1, Mar. 1974.
[6] J. W. McKee and J. K. Aggarwal, "Computer recognition of partial views of curved objects,"IEEE Trans. Comput., vol. C-26, no. 8, pp. 790-800, 1977.
[7] T. P. Pavlidis, "Polygonal approximation by Newton's method,"IEEE Trans. Comput., vol. C-26, no. 8, pp. 800-807, Aug. 1977.
[8] H. Blum, "A transformation for extracting new descriptions of shape," inProc. Symp. Models Perception Speech Visual Form. Cambridge, MA: MIT Press, 1964.
[9] H. Y. Feng and T. Pavlidis, "Decomposition of polygons into simpler components: Feature extraction for syntactic pattern recognition,"IEEE Trans. Comput., vol. C-24, pp. 636-650, 1975.
[10] L. G. Shapiro and R. M. Haralick, "Decomposition of two-dimensional shapes by graph-theoretic clustering,"IEEE Trans. Patt. Anal. Machine Intell., vol. PAMI-1, pp. 10-20, 1979.
[11] F. Moktarian and A. Mackworth, "Scale-based description and recognition of planar curves and two-dimensional shapes,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-8, no. 1, pp. 34-43, Jan. 1986.
[12] S. P. Smith and A. K. Jain, "Chord distribution for shape matching,"Comput. Graphics Image Processing, vol. 20, pp. 259-271, 1982.
[13] Z. You and A. K. Jain, "Performance evaluation of shape matching via chord length distribution,"Comput. Vision Graphics Image Processing, vol. 28, pp. 185-198, 1984.
[14] R. L. Kashyap and R. Chellappa, "Stochastic models for closed boundary analysis: Representation and reconstruction,"IEEE Trans. Inform. Theory, vol. IT-27, no. 5, pp. 627-637, Sept. 1981.
[15] S. R. Dubois and F. H. Glanz, "An autoregressive model approach to two-dimensional shape classification,"IEEE Trans. Patt. Anal. Machine Intell., vol. PAMI-8, no. 1, pp. 55-66, Jan. 1986.
[16] M. Das, M.J Paulik, and N. K. Loh, "A bivariate autoregressive modeling technique for analysis and classification of planar shapes,"IEEE Trans. Patt. Anal. Machine Intell., vol. PAMI-12, no. 1, pp. 97-103, Jan. 1990.
[17] L. R. Rabiner and B. H. Juang, "An introduction to hidden Markov models,"IEEE ASSP Mag., pp. 4-16, Jun. 1986.
[18] L. R. Rabiner, B. H. Juang, S. E. Levinson, and M. M. Sondhi, "Recognition of isolated digits using hidden Markov models with continuous mixture densities,"AT&T Tech. J., vol. 64, no. 6, pp. 1211-1234, July-Aug., 1985.
[19] B.-H Juang and L. R. Rabiner, "The segmentalK-means algorithm for estimating parameters of hidden Markov models,"IEEE Trans. Accoust. Speech Signal Processing, vol. ASSP-38, no. 9, pp. 1639-1641, Sept. 1990.
[20] L. R. Rabiner, J. G. Wilpon, and B.-J. Juang, "A segmentalk-means training procedure for connected word recognition,"AT&T Tech. J., vol. 65, no. 3, pp. 21-31, May/June 1986.
[21] A. Kundu, Y. He, and P. Bahl, "Recognition of handwritten word: First and second order hidden Markov model based approach,"Patt. Recognition, vol. 22, no. 3, pp. 283-297, 1989.
[22] G. D. Forney, Jr., "The Viterbi algorithm," Proc. IEEE, vol. 61, no. 3, pp. 263-278, Mar. 1973.
[23] T. W. Anderson and L. A. Goodman, "Statistical inference about Markov chains,"Annals Math. Stat., vol. 28, pp. 89-110, 1957.
[24] W. H. Beyer (Ed.),Handbook of Tables for Probability and Statistics (2nd ed.), Cleveland, OH: Chemical Rubber, 1968.

Index Terms:
pattern recognition; segmentation; 2-D shape classification; hidden Markov model; planar shape recognition; autoregressive parameters; shape contour perturbation; occlusion; orientation scheme; shape orientation; Markov processes; pattern recognition
Y. He, A. Kundu, "2-D Shape Classification Using Hidden Markov Model," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 13, no. 11, pp. 1172-1184, Nov. 1991, doi:10.1109/34.103276
Usage of this product signifies your acceptance of the Terms of Use.