Printed Character Recognition by Matching Partial Patterns

• Item type: InfP(1)
• 公開日: 1977-01-01
• タイトル: Printed Character Recognition by Matching Partial Patterns
• タイトル / 言語: en
• タイトル: Printed Character Recognition by Matching Partial Patterns
• 言語: eng
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• 著者所属: Research and Development Laboratories Kokusai Denshin Denwa Co. Ltd.
• 著者所属: Kokusai Denshin Denwa Co. Ltd.
• 著者所属(英): en
• 著者所属(英): Research and Development Laboratories, Kokusai Denshin Denwa Co., Ltd.
• 著者所属(英): en
• 著者所属(英): Kokusai Denshin Denwa Co., Ltd.
• 著者名: Akira, Kurematsu; Seiichi, Inoue
• 著者名(英): Akira, Kurematsu; Seiichi, Inoue
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: A method to recognize printed characters by matching partial patterns is introduced. Those partial patterns like line segments. various corners. or separated segments are extracted from sample patterns and stored in a memory. Values of similarity are calculated by correlating those partial patterns and small regions of input patterns at predetermined positions. The scores are counted on the basis of similarity value and weight value for each character. The input pattern is determined to be the character which gives the max1mum sum of scores. The advantages of this method are that it is not strongly affected by the noises like spots and grains and the required memory capacity is smaller than that needed for the whole pattern matching method. Results of simulation for 40 alphanumeric and symbo1 characters of ISO-B font are shown.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: A method to recognize printed characters by matching partial patterns is introduced. Those partial patterns like line segments. various corners. or separated segments are extracted from sample patterns and stored in a memory. Values of similarity are calculated by correlating those partial patterns and small regions of input patterns at predetermined positions. The scores are counted on the basis of similarity value and weight value for each character. The input pattern is determined to be the character which gives the max1mum sum of scores. The advantages of this method are that it is not strongly affected by the noises like spots and grains and the required memory capacity is smaller than that needed for the whole pattern matching method. Results of simulation for 40 alphanumeric and symbo1 characters of ISO-B font are shown.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AA00674393
• 書誌情報: Information Processing in Japan; 巻 17, 号 0, p. 70-74, 発行日 1977-01-01
• 出版者 / 言語: ja
• 出版者: 情報処理学会