This Article 
 Bibliographic References 
 Add to: 
Shape Matching Using LAT and its Application to Handwritten Numeral Recognition
June 1994 (vol. 16 no. 6)
pp. 618-629

This paper describes an iterative technique for gradually deforming a mask binary image with successive local affine transformation (LAT) operations so as to yield the best match to an input binary image as one new and promising approach toward robust handwritten character recognition. The method uses local shapes in the sense that the LAT of each point at one location is optimized using locations of other points by means of least-squares data fitting using Gaussian window functions. It also uses a multiscale refinement technique that decreases the spread of window functions with each iteration. Especially in handwritten character recognition, structural information is indispensable for robust shape matching or discrimination. The method is enhanced to explicitly incorporate structures by weighting the above least-squares criterion with similarity measures of both topological and geometric features of the mask and input images. Moreover, deformation constraints are imposed on each iteration, not only to promote and stabilize matching convergence but also to suppress an excessive matching process. Shape matching experiments have been successfully carried out using skeletons of totally unconstrained handwritten numerals.

[1] T. Wakahara, "Dot image matching using local affine transformation," inProc. 10th Int. Conf. Pattern Recognit., 1990, pp. 837-841.
[2] D. Marr and T. Poggio, "Cooperative computation of stereo disparity,"Science, vol. 194, pp. 283-287, 1976.
[3] L. S. Davis and A. Rosenfeld, "An application of relaxation labeling to spring-loaded template matching," inProc. 3rd Int. Conf. Pattern Recognit., 1976, pp. 591-597.
[4] S. Ranade and A. Rosenfeld, "Point pattern matching by relaxation,"Pattern Recognit., vol. 12, pp. 269-275, 1980.
[5] S. T. Barnard and W. B. Thompson, "Disparity analysis of images,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-2, no. 4, pp. 333-340, 1980.
[6] U. Montanari, "On the optimal detection of curves in noisy pictures,"Comm. ACM, vol. 14, pp. 335-345, 1971.
[7] H. Yamada and T. Kasvand, "DP matching method for recognition of occluded, reflective and transparent objects with unconstrained background and illumination," inProc. 8th Int. Conf. Pattern Recognit., 1986, pp. 95-98.
[8] A. A. Amini, T. E. Weymouth, and R. C. Jain, "Using dynamic programming for solving variational problems in vision,"IEEE Trans. Pattern Anal. Machine Intell., vol. 12, no. 9, pp. 855-867, 1990.
[9] H. S. Baird,Model-Based Image Matching Using Location, Cambridge, MA: MIT Press, 1986.
[10] A. K. C. Wong, "An algorithm for constellation matching," inProc. 8th Int. Conf. Pattern Recognition, 1986, pp. 546-554.
[11] B. K. P. Horn and B. G. Schunck, "Determining optical flow,"Artificial Intell., vol. 17, pp. 185-203, 1981.
[12] B. D. Lucas and T. Kanade, "An iterative image registration technique with an application to stereo vision," inProc. Int. Joint Conf. Artificial Intelligence, 1981, pp. 674-679.
[13] M. Kass, A. Witkin, and D. Terzopoulos, "SNAKES: Active contour models," inProc. Int. Conf. Comput. Vision, 1987, pp. 259-268.
[14] B. Widrow, "The rubber mask technique,"Pattern Recognit., vol. 5, pp. 175-211, 1973.
[15] H. P. Moravec, "Towards automatic visual obstacle avoidance," inProc. Int. Joint Conf. Artificial Intell., 1977, p. 584.
[16] D. J. Burr, "Elastic matching of line drawings,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-3, no. 6, pp. 708-713, 1981.
[17] W. E. L. Grimson, "Computational experiments with a feature-based stereo algorithm,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI- 7, no. 1, pp. 17-34, 1985.
[18] C. Y. Suen, "Distinctive features in the automatic recognition of handprinted characters,"Signal Processing, vol. 4, pp. 193-207, 1982.
[19] S. Mori, "Research on machine recognition of handprinted characters,"Comput. Processing Chinese&Oriental Languages, vol. 1, no. 1, pp. 24-39, 1983.
[20] S. Mori, C. Y. Suen, and K. Yamamoto, "Historical review of ocr research and development,"Proc. IEEE, vol. 80, no. 7, pp. 1029-1058, July 1992.
[21] Mathematical Society of Japan,Encyclopedic Dictionary of Mathematics. Cambridge, MA: MIT Press, 1977.
[22] N. Draper and H. Smith,Applied Regression Analysis. New York: Wiley, 1966.
[23] R. O. Duda and P. E. Hart,Pattern Classification and Scene Analysis. New York: Wiley, 1973.
[24] T. Poggio, V. Torre, and C. Koch, "Computational vision and regularization theory,"Nature, vol. 317, pp. 314-319, 1985.
[25] X. Huang, Y. Ariki, and M. Jack,Hidden Markov Models for Speech Recognition. Edinburgh: Edinburgh Univ. Press, 1990.
[26] L. Wang and T. Pavlidis, "Direct gray-scale extraction of features for character recognition,"IEEE Trans. Pattern Anal. Machine Intell., vol. 15, no. 10, pp. 1053-1067, Oct. 1993.
[27] R. M. Haralick, L. T. Watson, and T. J. Laffey, "The topographic primal sketch,"Int. J. Robotics of Res., vol. 2, pp. 50-72, 1983.

Index Terms:
character recognition; topology; least squares approximations; curve fitting; optimisation; iterative methods; shape matching; handwritten numeral recognition; iterative technique; local affine transformation; binary image; character recognition; least-squares data fitting; Gaussian window functions; multiscale refinement; geometric features; topology; deformation constraints; skeletons; optimisation
T. Wakahara, "Shape Matching Using LAT and its Application to Handwritten Numeral Recognition," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 16, no. 6, pp. 618-629, June 1994, doi:10.1109/34.295906
Usage of this product signifies your acceptance of the Terms of Use.