Dynamic-Programming based one-dimensional 2-dimensional character-recognition algorithm with branched references

Dynamic-Programming based one-dimensional 2-dimensional character-recognition algorithm with branched references

0.00 Avg rating0 Votes
Article ID: iaor19962238
Country: United States
Volume: 78
Issue: 10
Start Page Number: 1307
End Page Number: 1312
Publication Date: Oct 1995
Journal: Transactions of the Institute of Electronics, Information and Communication Engineers
Authors: ,
Abstract:

A Dynamic Programming based elastic matching method called the Branched Reference Rubber Matching was investigated. As in Rubber String Matching, the reference pattern is represented as a sequence of direction specified vectors and the input pattern as two dimensional dot pattern. In order to improve the coping of topological variations in input pattern, the reference patterns allow partial pattern alternatives and misses. Effect on the recognition time is almost negligible. Experimental results show the effectiveness of the proposed algorithm.

Reviews

Required fields are marked *. Your email address will not be published.