MATCHING DEVICE

PROBLEM TO BE SOLVED: To provide a matching device for character recognition, capable of reducing the cost by reducing the size of an LSI circuit when performing matching of an unknown character with dictionary characters by parallel processing. SOLUTION: The matching device 17 comprises a RAM 3, a...

Full description

Saved in:
Bibliographic Details
Main Author SAKAGAMI HIROFUMI
Format Patent
LanguageEnglish
Published 02.04.2009
Subjects
CALCULATING
COMPUTING
COUNTING
PHYSICS
Online AccessGet full text

Cover

More Information
Summary:PROBLEM TO BE SOLVED: To provide a matching device for character recognition, capable of reducing the cost by reducing the size of an LSI circuit when performing matching of an unknown character with dictionary characters by parallel processing. SOLUTION: The matching device 17 comprises a RAM 3, a ROM 4 and an LSI 5. The LSI 5 includes a CPU 50 and a circuit part 51 constituting a rewritable circuit. In the circuit part 51, after a first circuit including a plurality of distance calculation circuits for calculating a distance between an unknown character and a dictionary character using feature quantity data of the unknown character and feature quantity data of the dictionary character and a selection circuit for selecting P distances with the smallest value and character codes corresponding to the distances is formed, a second circuit including a permutation circuit for outputting the distance and the character code corresponding to the distance in the ascending order of the value is constituted. COPYRIGHT: (C)2009,JPO&INPIT
Bibliography:Application Number: JP20070239238