Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
IEICE Technical Committee Submission System
Conference Paper's Information		 Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2010-02-19 15:30
Development of a Path Search Method in Candiate Character Network Using Recursicve Transition Network.
Toshikazu Takahashi, Takeshi Nagasaki, Masashi Koga (Hitachi) PRMU2009-231
Abstract (in Japanese) (See Japanese page) 
(in English) We have developed a novel linguistical matching method (called "3.5 generation RTN matching") operated on context free grammar and recognition hypothesis network. The OCR can identify character recognition result using this matching method and linguistical dictionary. This method treats two types of graph model. First is recognition hypothesis network which made from handwritten or printed character string image. The recognition hypothesis network represents segmentation hypothesis and character recognition candidates as directed graph model. Second is recursive transition network (RTN) representing context free grammar. In the conventional linguistical matching method, linguistical dictionary such as address notation was stored as word set having hierarchical structure. It was suitable for small address dictionary, but not for high-complex address such as Kyoto city including huge number of address variation. This method uses RTN as linguistical dictionary to reduce dictionary size. The linguistical matching algorithm must collate two types of graph structure under the limitation of memory size and computational resource. To solve this problem, we have expanded the search tree concept into the search forest (a set of search tree) and developed an effective branch-cutting method for the search forest.
Keyword (in Japanese) (See Japanese page) 
(in English) OCR / Word Matching / Recursive Transition Network / Search Tree / / / /  
Reference Info. IEICE Tech. Rep., vol. 109, no. 418, PRMU2009-231, pp. 141-146, Feb. 2010.
Paper # PRMU2009-231 
Date of Issue 2010-02-11 (PRMU) 
ISSN Print edition: ISSN 0913-5685    Online edition: ISSN 2432-6380
Copyright
and
reproduction		 All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF PRMU2009-231

Conference Information
Committee PRMU  
Conference Date 2010-02-18 - 2010-02-19 
Place (in Japanese) (See Japanese page) 
Place (in English) Tokyo Univ. of Agriculture and Technology 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To PRMU 
Conference Code 2010-02-PRMU 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Development of a Path Search Method in Candiate Character Network Using Recursicve Transition Network. 
Sub Title (in English)  
Keyword(1) OCR  
Keyword(2) Word Matching  
Keyword(3) Recursive Transition Network  
Keyword(4) Search Tree  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Toshikazu Takahashi  
1st Author's Affiliation Hitachi, Ltd., Central Research Laboratory (Hitachi)
2nd Author's Name Takeshi Nagasaki  
2nd Author's Affiliation Hitachi, Ltd., Central Research Laboratory (Hitachi)
3rd Author's Name Masashi Koga  
3rd Author's Affiliation Hitachi, Ltd., Mechanical Engineering Research Laboratory (Hitachi)
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2010-02-19 15:30:00 
Presentation Time 30 minutes 
Registration for PRMU 
Paper # PRMU2009-231 
Volume (vol) vol.109 
Number (no) no.418 
Page pp.141-146 
#Pages 6 
Date of Issue 2010-02-11 (PRMU) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan