Pub Date : 1997-08-18DOI: 10.1109/ICDAR.1997.620663
Eiki Ishidera, D. Nishiwaki, Keiji Yamada
We describe a new handwritten address recognition method which can correct the errors occurring in line extraction, character segmentation, and character recognition as a possible means of avoiding the error accumulation which occurs during the recognition sequence in conventional methods. We formulate the address recognition method as a minimum cost search problem. We define the character recognition cost which estimates the reliability of the character recognition result, the arrangement cost which estimates the plausibility of the character string's spatial arrangement, and the word knowledge cost which estimates the plausibility of the linguistic conditions. By using a combination of these costs, the proposed method can recognize an address which has not been extracted as a single line from input images by a conventional method. The efficiency of the proposed method is evaluated through an experiment using 600 Japanese mail images. An address recognition rate of 79.38% was obtained.
{"title":"Unconstrained Japanese address recognition using a combination of spatial information and word knowledge","authors":"Eiki Ishidera, D. Nishiwaki, Keiji Yamada","doi":"10.1109/ICDAR.1997.620663","DOIUrl":"https://doi.org/10.1109/ICDAR.1997.620663","url":null,"abstract":"We describe a new handwritten address recognition method which can correct the errors occurring in line extraction, character segmentation, and character recognition as a possible means of avoiding the error accumulation which occurs during the recognition sequence in conventional methods. We formulate the address recognition method as a minimum cost search problem. We define the character recognition cost which estimates the reliability of the character recognition result, the arrangement cost which estimates the plausibility of the character string's spatial arrangement, and the word knowledge cost which estimates the plausibility of the linguistic conditions. By using a combination of these costs, the proposed method can recognize an address which has not been extracted as a single line from input images by a conventional method. The efficiency of the proposed method is evaluated through an experiment using 600 Japanese mail images. An address recognition rate of 79.38% was obtained.","PeriodicalId":435320,"journal":{"name":"Proceedings of the Fourth International Conference on Document Analysis and Recognition","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133426938","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1997-08-18DOI: 10.1109/ICDAR.1997.620620
A. Vossepoel, K. Schutte, Carl F. P. Delanghe
An algorithm is presented that allows one to perform skeletonization of large maps with much lower memory requirements than with the straightforward approach. The maps are divided into overlapping tiles, which are skeletonized separately, using a Euclidean distance transform. The amount of overlap is controlled by the maximum expected width of any map component and the maximum size of what is considered as a small component. Next, the skeleton parts are connected again at the middle of the overlap zones. Some examples are given for efficient memory utilization in tiling an A0 size map into a predefined number of tiles or into tiles of a predefined (square) size. The algorithm is also suited for a parallel implementation of skeletonization.
{"title":"Memory efficient skeletonization of utility maps","authors":"A. Vossepoel, K. Schutte, Carl F. P. Delanghe","doi":"10.1109/ICDAR.1997.620620","DOIUrl":"https://doi.org/10.1109/ICDAR.1997.620620","url":null,"abstract":"An algorithm is presented that allows one to perform skeletonization of large maps with much lower memory requirements than with the straightforward approach. The maps are divided into overlapping tiles, which are skeletonized separately, using a Euclidean distance transform. The amount of overlap is controlled by the maximum expected width of any map component and the maximum size of what is considered as a small component. Next, the skeleton parts are connected again at the middle of the overlap zones. Some examples are given for efficient memory utilization in tiling an A0 size map into a predefined number of tiles or into tiles of a predefined (square) size. The algorithm is also suited for a parallel implementation of skeletonization.","PeriodicalId":435320,"journal":{"name":"Proceedings of the Fourth International Conference on Document Analysis and Recognition","volume":" 29","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132041884","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1997-08-18DOI: 10.1109/ICDAR.1997.620572
A. Amin
Machine simulation of human reading has been the subject of intensive research for almost three decades. A large number of research papers and reports have already been published on Latin, Chinese and Japanese characters. However, little work has been conducted on the automatic recognition of Arabic characters because of the complexity of printed and handwritten text, and this problem is still an open research field. The main objective of this paper is to present the state of Arabic character recognition research throughout the last two decades.
{"title":"Off line Arabic character recognition: a survey","authors":"A. Amin","doi":"10.1109/ICDAR.1997.620572","DOIUrl":"https://doi.org/10.1109/ICDAR.1997.620572","url":null,"abstract":"Machine simulation of human reading has been the subject of intensive research for almost three decades. A large number of research papers and reports have already been published on Latin, Chinese and Japanese characters. However, little work has been conducted on the automatic recognition of Arabic characters because of the complexity of printed and handwritten text, and this problem is still an open research field. The main objective of this paper is to present the state of Arabic character recognition research throughout the last two decades.","PeriodicalId":435320,"journal":{"name":"Proceedings of the Fourth International Conference on Document Analysis and Recognition","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130272094","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1997-08-18DOI: 10.1109/ICDAR.1997.619874
M. Nakagawa, Takao Higashiyama, Yukiko Yamanaka, S. Sawada, Levan Higashigawa, K. Akiyama
The paper presents a database of on-line handwritten character patterns sampled in a sequence of sentences without any instructions. The sentences according to which character patterns are collected have been picked up from newspaper to include 1227 frequently appearing character categories with the result that they are composed of about 10000 characters and include 1537 JIS 1st level character categories. The rest of the JIS 1st level 1808 categories have been added at the end of the above text and written one by one. The total text has been commonly employed for collecting script patterns from a number of people. Patterns offered were inspected and omissions and wrong patterns were rewritten. The authors collected data from 80 people and made the 12000/spl times/80 patterns available from February 1996. More patterns are being collected. The paper describes the characteristics of this database as well as several tools to collect patterns.
{"title":"On-line handwritten character pattern database sampled in a sequence of sentences without any writing instructions","authors":"M. Nakagawa, Takao Higashiyama, Yukiko Yamanaka, S. Sawada, Levan Higashigawa, K. Akiyama","doi":"10.1109/ICDAR.1997.619874","DOIUrl":"https://doi.org/10.1109/ICDAR.1997.619874","url":null,"abstract":"The paper presents a database of on-line handwritten character patterns sampled in a sequence of sentences without any instructions. The sentences according to which character patterns are collected have been picked up from newspaper to include 1227 frequently appearing character categories with the result that they are composed of about 10000 characters and include 1537 JIS 1st level character categories. The rest of the JIS 1st level 1808 categories have been added at the end of the above text and written one by one. The total text has been commonly employed for collecting script patterns from a number of people. Patterns offered were inspected and omissions and wrong patterns were rewritten. The authors collected data from 80 people and made the 12000/spl times/80 patterns available from February 1996. More patterns are being collected. The paper describes the characteristics of this database as well as several tools to collect patterns.","PeriodicalId":435320,"journal":{"name":"Proceedings of the Fourth International Conference on Document Analysis and Recognition","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133875351","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1997-08-18DOI: 10.1109/ICDAR.1997.619827
Jin-Yong Yoo, Min-Ki Kim, Sang-Yong Han, Young-Bin Kwon
The off-line handwritten characters recorded on prescribed form documents may be overwritten by the lines of the form documents. Overwritten characters should be isolated in order to be recognized more effectively. However, removal of the lines causes breaks in the overwritten characters. Consequently, a character restoration process is necessary. In this paper, the shape types of overwritten characters are analyzed and a method of restoring characters that have been broken by line removal is proposed. A 97% correct restoration ratio was obtained through this method.
{"title":"Line removal and restoration of handwritten characters on the form documents","authors":"Jin-Yong Yoo, Min-Ki Kim, Sang-Yong Han, Young-Bin Kwon","doi":"10.1109/ICDAR.1997.619827","DOIUrl":"https://doi.org/10.1109/ICDAR.1997.619827","url":null,"abstract":"The off-line handwritten characters recorded on prescribed form documents may be overwritten by the lines of the form documents. Overwritten characters should be isolated in order to be recognized more effectively. However, removal of the lines causes breaks in the overwritten characters. Consequently, a character restoration process is necessary. In this paper, the shape types of overwritten characters are analyzed and a method of restoring characters that have been broken by line removal is proposed. A 97% correct restoration ratio was obtained through this method.","PeriodicalId":435320,"journal":{"name":"Proceedings of the Fourth International Conference on Document Analysis and Recognition","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133960902","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1997-08-18DOI: 10.1109/ICDAR.1997.619836
F. Cesarini, E. Francesconi, M. Gori, S. Marinai, Jianqing Sheng, G. Soda
Much attention has recently been paid to the recognition of graphical objects, such as company logos and trademarks. Recognizing these objects facilitates the recognition of document classes. Some promising results have been achieved by using autoassociator-based artificial neural networks (AANN) in the presence of homogeneously distributed noise. However, the performance drops significantly when dealing with spot-noisy logos, where strips or blobs produce a partial obstruction of the pictures. We propose a new approach for training AANNs especially conceived for dealing with spot noise. The basic idea is to introduce new metrics for assessing the reproduction error in AANNs. The proposed algorithm, referred to as spot-backpropagation (S-BP), is significantly more robust with respect to spot-noise than classical Euclidean norm-based backpropagation (BP). Our experimental results are based on a database of 88 real logos that are artificially corrupted by spot-noise.
{"title":"A neural-based architecture for spot-noisy logo recognition","authors":"F. Cesarini, E. Francesconi, M. Gori, S. Marinai, Jianqing Sheng, G. Soda","doi":"10.1109/ICDAR.1997.619836","DOIUrl":"https://doi.org/10.1109/ICDAR.1997.619836","url":null,"abstract":"Much attention has recently been paid to the recognition of graphical objects, such as company logos and trademarks. Recognizing these objects facilitates the recognition of document classes. Some promising results have been achieved by using autoassociator-based artificial neural networks (AANN) in the presence of homogeneously distributed noise. However, the performance drops significantly when dealing with spot-noisy logos, where strips or blobs produce a partial obstruction of the pictures. We propose a new approach for training AANNs especially conceived for dealing with spot noise. The basic idea is to introduce new metrics for assessing the reproduction error in AANNs. The proposed algorithm, referred to as spot-backpropagation (S-BP), is significantly more robust with respect to spot-noise than classical Euclidean norm-based backpropagation (BP). Our experimental results are based on a database of 88 real logos that are artificially corrupted by spot-noise.","PeriodicalId":435320,"journal":{"name":"Proceedings of the Fourth International Conference on Document Analysis and Recognition","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124554860","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1997-08-18DOI: 10.1109/ICDAR.1997.619851
R. Kashi, Jianying Hu, W. Nelson, William Turin
A method for the automatic verification of on-line handwritten signatures using both global and local features as described. The global and local features capture various aspects of signature shape and dynamics of signature production. The authors demonstrate that with the addition to the global features of a local feature based on the signature likelihood obtained from hidden Markov models (HMM) the performance of signature verification improves significantly. The current version of the program, has 2.5% equal error rate. At the 1% false rejection (FR) point, the addition of the local information to the algorithm with only global features reduced the false acceptance (FA) rate from 13% to 5%.
{"title":"On-line handwritten signature verification using hidden Markov model features","authors":"R. Kashi, Jianying Hu, W. Nelson, William Turin","doi":"10.1109/ICDAR.1997.619851","DOIUrl":"https://doi.org/10.1109/ICDAR.1997.619851","url":null,"abstract":"A method for the automatic verification of on-line handwritten signatures using both global and local features as described. The global and local features capture various aspects of signature shape and dynamics of signature production. The authors demonstrate that with the addition to the global features of a local feature based on the signature likelihood obtained from hidden Markov models (HMM) the performance of signature verification improves significantly. The current version of the program, has 2.5% equal error rate. At the 1% false rejection (FR) point, the addition of the local information to the algorithm with only global features reduced the false acceptance (FA) rate from 13% to 5%.","PeriodicalId":435320,"journal":{"name":"Proceedings of the Fourth International Conference on Document Analysis and Recognition","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114762096","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1997-08-18DOI: 10.1109/ICDAR.1997.619842
Youbin Chen, Xiaoqing Ding, Youshou Wu
A new method to extract crossing line features for off-line handwritten Chinese character recognition is proposed in this paper. Firstly, the input pattern is nonlinearly normalized in order to compensate for shape variations. Secondly, the normalized pattern is separated into four subpatterns according to the four kinds of elementary strokes. Thirdly, the four subpatterns are uniformly divided into M/spl times/M cells respectively. In every cell, the crossing lines are counted. Then a 4M/sup 2/-dimensional feature vector is generated. An off-line handwritten Chinese character recognition system is built based on this feature. Our experiments have demonstrated the effectiveness of the method proposed in this paper.
{"title":"Off-line handwritten Chinese character recognition based on crossing line feature","authors":"Youbin Chen, Xiaoqing Ding, Youshou Wu","doi":"10.1109/ICDAR.1997.619842","DOIUrl":"https://doi.org/10.1109/ICDAR.1997.619842","url":null,"abstract":"A new method to extract crossing line features for off-line handwritten Chinese character recognition is proposed in this paper. Firstly, the input pattern is nonlinearly normalized in order to compensate for shape variations. Secondly, the normalized pattern is separated into four subpatterns according to the four kinds of elementary strokes. Thirdly, the four subpatterns are uniformly divided into M/spl times/M cells respectively. In every cell, the crossing lines are counted. Then a 4M/sup 2/-dimensional feature vector is generated. An off-line handwritten Chinese character recognition system is built based on this feature. Our experiments have demonstrated the effectiveness of the method proposed in this paper.","PeriodicalId":435320,"journal":{"name":"Proceedings of the Fourth International Conference on Document Analysis and Recognition","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114782584","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1997-08-18DOI: 10.1109/ICDAR.1997.619832
J. Mao, R. Lorie, K. Mohiuddin
We describe a prototype system for reading IATA flight coupons. The system exploits various characteristics of IATA coupons to determine reliably coupon types and field boundaries, and to minimize the amount of manual keying. In particular, we propose a method for extracting and recognizing fixed-pitch characters on noisy images with a complex background. The method does not require a complete drop-out of background, pre-printed text, or lines before recognition, and allows for recovering partially damaged characters (e.g., overlap with form content, handwritten annotations, etc.).
{"title":"A system for automatically reading IATA flight coupons","authors":"J. Mao, R. Lorie, K. Mohiuddin","doi":"10.1109/ICDAR.1997.619832","DOIUrl":"https://doi.org/10.1109/ICDAR.1997.619832","url":null,"abstract":"We describe a prototype system for reading IATA flight coupons. The system exploits various characteristics of IATA coupons to determine reliably coupon types and field boundaries, and to minimize the amount of manual keying. In particular, we propose a method for extracting and recognizing fixed-pitch characters on noisy images with a complex background. The method does not require a complete drop-out of background, pre-printed text, or lines before recognition, and allows for recovering partially damaged characters (e.g., overlap with form content, handwritten annotations, etc.).","PeriodicalId":435320,"journal":{"name":"Proceedings of the Fourth International Conference on Document Analysis and Recognition","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127422069","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1997-08-18DOI: 10.1109/ICDAR.1997.620667
Wang Song, Ma Feng, X. Shaowei
The contradiction between the high recognition accuracy and the low rejection rate in automatic bank check recognition has not been solved successfully. In this paper, a fault-tolerant Chinese bank check recognition system is presented to solve the contradiction between the need for low-error-recognition probability and the need for low-refused-recognition probability. The main idea is to use a dynamic cipher code (which is to be widely applied in China) to lower both of them. This system achieves a high recognition rate and a high reliability simultaneously when automatically processing Chinese bank checks with dynamic cipher codes. A practical scheme of fault-tolerant recognition of bank checks is given in this paper, and experiments show the performance of our fault-tolerant technique.
{"title":"A Chinese bank check recognition system based on the fault tolerant technique","authors":"Wang Song, Ma Feng, X. Shaowei","doi":"10.1109/ICDAR.1997.620667","DOIUrl":"https://doi.org/10.1109/ICDAR.1997.620667","url":null,"abstract":"The contradiction between the high recognition accuracy and the low rejection rate in automatic bank check recognition has not been solved successfully. In this paper, a fault-tolerant Chinese bank check recognition system is presented to solve the contradiction between the need for low-error-recognition probability and the need for low-refused-recognition probability. The main idea is to use a dynamic cipher code (which is to be widely applied in China) to lower both of them. This system achieves a high recognition rate and a high reliability simultaneously when automatically processing Chinese bank checks with dynamic cipher codes. A practical scheme of fault-tolerant recognition of bank checks is given in this paper, and experiments show the performance of our fault-tolerant technique.","PeriodicalId":435320,"journal":{"name":"Proceedings of the Fourth International Conference on Document Analysis and Recognition","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121011227","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：