Bidirectional Deformable Matching with Application to Handwritten Character Extraction

  • Authors:
  • Kwok-Wai Cheung;Dit-Yan Yeung;Roland T. Chin

  • Affiliations:
  • Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong;Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong;Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong

  • Venue:
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • Year:
  • 2002

Quantified Score

Hi-index 0.17

Visualization

Abstract

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.