By Topic

Using hidden Markov model for Chinese business card recognition

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
$33 $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

4 Author(s)

Business card recognition is a difficult problem. Characters in business card are small with diverse font types. An approach using the left-right hidden Markov model is proposed for business card recognition. The hidden Markov model will output a top-10 candidate list as its recognition result. A postprocessing stage is followed to improve the recognition result. The postprocessing stage uses a bigram table as linguistic information to search for the optimized recognition result from the top-10 candidate list. Our experiments are built on the recognition of company item and address item in Chinese business cards. Bigram table and hidden Markov models are trained with a telephony database. 100 address items and 30 company items are used for testing. Experimental results reveal the validity of our proposed method

Published in:

Image Processing, 2001. Proceedings. 2001 International Conference on  (Volume:1 )

Date of Conference: