This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Bidirectional Deformable Matching with Application to Handwritten Character Extraction
August 2002 (vol. 24 no. 8)
pp. 1133-1139

To achieve integrated segmentation and recognition in complex scenes, the model-based approach has widely been accepted as a promising paradigm. However, the performance is still far from satisfactory when the target object is highly deformed and the level of outlier contamination is high. In this paper, we first describe two Bayesian frameworks, one for classifying input patterns and another for detecting target patterns in complex scenes using deformable models. Then, we show that the two frameworks are similar to the forward-reverse setting of Hausdorff matching and that their matching and discriminating properties are complementary to each other. By properly combining the two frameworks, we propose a new matching scheme called bidirectional matching. This combined approach inherits the advantages of the two Bayesian frameworks. In particular, we have obtained encouraging empirical results on shape-based pattern extraction, using a subset of the CEDAR handwriting database containing handwritten words of highly varying shape.

[1] K.W. Cheung, D.Y. Yeung, and R.T. Chin, “A Bidirectional Matching Algorithm for Deformable Pattern Detection with Application to Handwritten Word Retrieval,” Proc. Seventh Int'l Conf. Computer Vision, pp. 1105-1110, Sept. 1999.
[2] K.W. Cheung, “Bayesian Frameworks for Deformable Pattern Recognition and Retrieval.,” PhD thesis, Dept. of Computer Science, the Hong Kong Univ. of Science and Technology, (). Jan. 2000.
[3] K.W. Cheung, D.Y. Yeung, and R.T. Chin, “A Bayesian Framework for Deformable Pattern Recognition with Application to Handwritten Character Recognition,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 20, no. 12, pp. 1382-1388, Dec. 1998.
[4] P. Dayan, G.E. Hinton, R.M. Neal, and R.S. Zemel, The Helmholtz Machine Neural Computation, vol. 7, no. 5, pp. 889-904, 1995.
[5] A.P. Dempster, N.M. Laird, and D.B. Rubin, “Maximum-Likelihood from Incomplete Data via the EM Algorithm,” J. Royal Statistical Soc., Series B, vol. 39, pp. 1-38, 1977.
[6] M.P. Dubuisson Jolly, S. Lakshmanan, and A.K. Jain, “Vehicle Segmentation and Classification Using Deformable Templates,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 3, pp. 293-308, Mar. 1996.
[7] D.P. Huttenlocher, G.A. Klanderman, and W.J. Rucklidge, “Comparing Images Using the Hausdorff Distance,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, no. 9, pp. 850-863, Sept. 1993.
[8] A.K. Jain, Y. Zhong, and S. Lakshmanan, Object Matching Using Deformable Templates IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 3, pp. 267-278, Mar. 1996.
[9] M. Kass, A. Witkin, and D. Terzopoulos, “Snakes: Active Contour Models,” Int'l J. Computer Vision, vol. 1, no. 4, pp. 321-331, 1987.
[10] D.J.C. MacKay, “Bayesian Interpolation,” Neural Computation, vol. 4, no. 3, pp. 415-447, 1992.
[11] M. Revow, C.K.I. Williams, and G.E. Hinton, “Using Generative Models for Handwritten Digit Recognition,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 6, pp. 592-606, June 1996.
[12] W. Rucklidge, Efficient Visual Recognition Using the Hausdorff Distance. Berlin: Springer, 1996.
[13] A.L. Yuille, P.W. Hallinan, and D.S. Cohen, "Feature extraction from faces using deformable templates," Int'l J. Computer Vision, vol. 8, no. 2, 133-144, 1992.

Index Terms:
Model-based segmentation, deformable models, Bayesian inference, bidirectional matching, Hausdorff matching.
Citation:
Kwok-Wai Cheung, Dit-Yan Yeung, Roland T. Chin, "Bidirectional Deformable Matching with Application to Handwritten Character Extraction," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, no. 8, pp. 1133-1139, Aug. 2002, doi:10.1109/TPAMI.2002.1024135
Usage of this product signifies your acceptance of the Terms of Use.