By Topic

Affine-invariant recognition of gray-scale characters using global affine transformation correlation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Wakahara, T. ; NTT Cyber Solutions Lab., Nippon Telegraph & Telephone Corp., Kanagawa, Japan ; Kimura, Y. ; Tomono, A.

Describes a technique of gray-scale character recognition that offers both noise tolerance and affine-invariance. The key ideas are twofold. First is the use of normalized cross-correlation as a matching measure to realize noise tolerance. Second is the application of global affine transformation (GAT) to the input image so as to achieve affine-invariant correlation with the target image. In particular, optimal GAT is efficiently determined by the successive iteration method using topographic features of gray-scale images as matching constraints. We demonstrate the high matching ability of the proposed GAT correlation method using gray-scale images of numerals subjected to random Gaussian noise and a wide range of affine transformation. Moreover, extensive recognition experiments show that the achieved recognition rate of 94.3 percent against rotation within 30 degrees, scale change within 30 percent, and translation within 20 percent of the character width along with random Gaussian noise is sufficiently high compared to the 42.8 percent offered by simple correlation

Published in:

Pattern Analysis and Machine Intelligence, IEEE Transactions on  (Volume:23 ,  Issue: 4 )