Pub Date : 1996-04-01DOI: 10.1109/ICDAR.1995.602011
A. Agarwal, Karim Hussein, Amar Gupta, P. Wang
This paper discusses a technique for locating the courtesy amount block on bank checks. In the analysis and recognition process, connected components in the image are identified first. Then, strings are constructed on the basis of proximity and horizontal alignment of characters. Next, a set of rules and heuristics are applied to these strings to choose the correct one. The chosen string is only accepted if it passes a verification test, which includes an attempt to recognize the currency sign. A deterministic finite automaton system is then used for segmenting the handprinted courtesy amount. Finally, the separated components are passed on to a neural network based recognition system.
{"title":"Detection of courtesy amount block on bank checks","authors":"A. Agarwal, Karim Hussein, Amar Gupta, P. Wang","doi":"10.1109/ICDAR.1995.602011","DOIUrl":"https://doi.org/10.1109/ICDAR.1995.602011","url":null,"abstract":"This paper discusses a technique for locating the courtesy amount block on bank checks. In the analysis and recognition process, connected components in the image are identified first. Then, strings are constructed on the basis of proximity and horizontal alignment of characters. Next, a set of rules and heuristics are applied to these strings to choose the correct one. The chosen string is only accepted if it passes a verification test, which includes an attempt to recognize the currency sign. A deterministic finite automaton system is then used for segmenting the handprinted courtesy amount. Finally, the separated components are passed on to a neural network based recognition system.","PeriodicalId":273519,"journal":{"name":"Proceedings of 3rd International Conference on Document Analysis and Recognition","volume":"558 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124119888","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 : 1995-08-14DOI: 10.1109/ICDAR.1995.602065
Hong Guo, Xiaoqing Ding, Zhong Zhang, F. Guo, Youshou Wu
This paper focuses on the realization of a bilingual Chinese-English OCR system. First, the Twice-Segment Algorithm is used for segmentation of documents with Chinese and English characters mixed. Then the comprehensive recognition method is employed to improve the robustness of Chinese character recognition. A new measurement of robustness of OCR recognition performance is also put forward here. Finally, exciting experimental results are given.
{"title":"Realization of a high-performance bilingual Chinese-English OCR system","authors":"Hong Guo, Xiaoqing Ding, Zhong Zhang, F. Guo, Youshou Wu","doi":"10.1109/ICDAR.1995.602065","DOIUrl":"https://doi.org/10.1109/ICDAR.1995.602065","url":null,"abstract":"This paper focuses on the realization of a bilingual Chinese-English OCR system. First, the Twice-Segment Algorithm is used for segmentation of documents with Chinese and English characters mixed. Then the comprehensive recognition method is employed to improve the robustness of Chinese character recognition. A new measurement of robustness of OCR recognition performance is also put forward here. Finally, exciting experimental results are given.","PeriodicalId":273519,"journal":{"name":"Proceedings of 3rd International Conference on Document Analysis and Recognition","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115438973","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 : 1995-08-14DOI: 10.1109/ICDAR.1995.602031
Ré Audouin, L. Shastri
The neural network learning algorithm presented in the paper splits the problem of handwritten digit recognition into easy steps by learning character classes incrementally: at each step, the neurons most relevant to the considered class are fixed so that subsequent classes will not disrupt the knowledge already acquired, but will be able to use it. A new relevance measure is also defined, for which a cheap approximation can be computed. The advantage of the attribution scheme starts to show even for small experiments, but should become more obvious as the number of classes increases. Picking only a few relevant features for each class, and sharing them between classes, constrains learning and improves generalization. Experiments were limited to pre-segmented digits, but our use of a spatio-temporal network architecture makes their extension to unsegmented strings straightforward.
{"title":"Incremental character recognition with feature attribution","authors":"Ré Audouin, L. Shastri","doi":"10.1109/ICDAR.1995.602031","DOIUrl":"https://doi.org/10.1109/ICDAR.1995.602031","url":null,"abstract":"The neural network learning algorithm presented in the paper splits the problem of handwritten digit recognition into easy steps by learning character classes incrementally: at each step, the neurons most relevant to the considered class are fixed so that subsequent classes will not disrupt the knowledge already acquired, but will be able to use it. A new relevance measure is also defined, for which a cheap approximation can be computed. The advantage of the attribution scheme starts to show even for small experiments, but should become more obvious as the number of classes increases. Picking only a few relevant features for each class, and sharing them between classes, constrains learning and improves generalization. Experiments were limited to pre-segmented digits, but our use of a spatio-temporal network architecture makes their extension to unsegmented strings straightforward.","PeriodicalId":273519,"journal":{"name":"Proceedings of 3rd International Conference on Document Analysis and Recognition","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115482278","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 : 1995-08-14DOI: 10.1109/ICDAR.1995.601972
S. Randriamasy
A set-based benchmarking method has been previously presented for page segmentation. The author proposes to adapt it to address bloc location on grey level images of various layouts and visual quality. For each mailpiece, a ground truth file describing the address bloc lines is compared with the automatically located zones meant to contain them. The pixels forming the ground truth lines are extracted by an adaptive binarization on the manually located zones. The algorithm allows ABL to locate lines partially, to provide several solutions, and the contents-related importance of a text line is reflected numerically. It provides an explicit error diagnosis together with a numerical evaluation.
{"title":"A set-based benchmarking method for address bloc location on arbitrarily complex grey level images","authors":"S. Randriamasy","doi":"10.1109/ICDAR.1995.601972","DOIUrl":"https://doi.org/10.1109/ICDAR.1995.601972","url":null,"abstract":"A set-based benchmarking method has been previously presented for page segmentation. The author proposes to adapt it to address bloc location on grey level images of various layouts and visual quality. For each mailpiece, a ground truth file describing the address bloc lines is compared with the automatically located zones meant to contain them. The pixels forming the ground truth lines are extracted by an adaptive binarization on the manually located zones. The algorithm allows ABL to locate lines partially, to provide several solutions, and the contents-related importance of a text line is reflected numerically. It provides an explicit error diagnosis together with a numerical evaluation.","PeriodicalId":273519,"journal":{"name":"Proceedings of 3rd International Conference on Document Analysis and Recognition","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124799928","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 : 1995-08-14DOI: 10.1109/ICDAR.1995.602028
F. Chang, Yung-Ping Cheng, Yao-Sheng Huang
Although there are thousands of many commonly used Chinese characters, they are actually composed of a lower number of stroke sub-patterns. Thus, in the task of recognizing optical Chinese characters, it is worthwhile to first identify the sub-patterns and then the whole characters composed of them. In such a hierarchical approach, however, decision mistakes at lower-levels can easily propagate into upper-levels to cause a high mis-recognition rate. To remedy this problem we devise a method called hierarchical flexible matching (HFM). The idea is to minimize the decision burdens at lower levels by allowing possibly conflicting sub-patterns to be identified from the same pool of primitives. The collection of these sub-patterns is then matched against some pre-specified models. In doing so, a metric is used to measure how well a candidate model is mapped into the given collection and how many primitives are covered by this mapping. We apply the HFM method to the font-indepdendent recognition of printed Chinese characters and have acquired very promising results.
{"title":"Hierarchical flexible matching for recognition of Chinese characters","authors":"F. Chang, Yung-Ping Cheng, Yao-Sheng Huang","doi":"10.1109/ICDAR.1995.602028","DOIUrl":"https://doi.org/10.1109/ICDAR.1995.602028","url":null,"abstract":"Although there are thousands of many commonly used Chinese characters, they are actually composed of a lower number of stroke sub-patterns. Thus, in the task of recognizing optical Chinese characters, it is worthwhile to first identify the sub-patterns and then the whole characters composed of them. In such a hierarchical approach, however, decision mistakes at lower-levels can easily propagate into upper-levels to cause a high mis-recognition rate. To remedy this problem we devise a method called hierarchical flexible matching (HFM). The idea is to minimize the decision burdens at lower levels by allowing possibly conflicting sub-patterns to be identified from the same pool of primitives. The collection of these sub-patterns is then matched against some pre-specified models. In doing so, a metric is used to measure how well a candidate model is mapped into the given collection and how many primitives are covered by this mapping. We apply the HFM method to the font-indepdendent recognition of printed Chinese characters and have acquired very promising results.","PeriodicalId":273519,"journal":{"name":"Proceedings of 3rd International Conference on Document Analysis and Recognition","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122228130","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 : 1995-08-14DOI: 10.1109/ICDAR.1995.602130
Chin Lu, K. H. Lee, H. Chen
Well designed thesauri can represent semantic/conceptual knowledge so as to reveal relationships among different elements in documents, thus serving as a critical tool in intelligent text retrieval systems and document analysis systems. In this paper, we present a thesaurus system, referred to as TheSys, which can be used as a tool for users to build thesauri according to their own requirements. It is our goal to design a comprehensive thesaurus building tool which can be used in any field of specialty rather than targeting for a particular specialty field. People can use our system to build an electronic thesaurus in any specialty field required for a specific application. We propose a thesaurus model, referred to as the thesaurus frame, which uses weighted links, to represent semantic relationships among concepts and terms. Our approach is to use a set of controlled terms, referred to as semantemes, to build the thesaurus frame. This approach can effectively reduce the size of the thesaurus yet the intelligence of the thesaurus is not compromised.
{"title":"TheSys-a comprehensive thesaurus system for intelligent document analysis and text retrieval","authors":"Chin Lu, K. H. Lee, H. Chen","doi":"10.1109/ICDAR.1995.602130","DOIUrl":"https://doi.org/10.1109/ICDAR.1995.602130","url":null,"abstract":"Well designed thesauri can represent semantic/conceptual knowledge so as to reveal relationships among different elements in documents, thus serving as a critical tool in intelligent text retrieval systems and document analysis systems. In this paper, we present a thesaurus system, referred to as TheSys, which can be used as a tool for users to build thesauri according to their own requirements. It is our goal to design a comprehensive thesaurus building tool which can be used in any field of specialty rather than targeting for a particular specialty field. People can use our system to build an electronic thesaurus in any specialty field required for a specific application. We propose a thesaurus model, referred to as the thesaurus frame, which uses weighted links, to represent semantic relationships among concepts and terms. Our approach is to use a set of controlled terms, referred to as semantemes, to build the thesaurus frame. This approach can effectively reduce the size of the thesaurus yet the intelligence of the thesaurus is not compromised.","PeriodicalId":273519,"journal":{"name":"Proceedings of 3rd International Conference on Document Analysis and Recognition","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116998856","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 : 1995-08-14DOI: 10.1109/ICDAR.1995.602093
P. Rhee, T. Fujisaki
In this paper, we present the framework design of IDAP (Intelligent Document Assistant Processor) with the capability of intelligent user interface for pen-based computer systems. No conventional computer user interface can compete with pen and paper until now in terms of convenience and ease of use in generating documents. The system gets roughly drawn documents from users, and generates neat documents satisfiable to users. Rough document includes handwritten texts, hand-drawn tables, hand-drawn diagrams, handwritten mathematical expressions. The satisfaction of users is at least as important as the functionality and performance in pen-based system. Therefore, sophisticated user interface is critical for a successful design. Intelligent user interface methodology is employed to make the system more intelligent, natural, and ease of use. Human-computer interaction model called H-COS is proposed for pen-based applications, and the model is applied to design IDAP.
{"title":"Intelligent document assistant processor for pen-based computing systems","authors":"P. Rhee, T. Fujisaki","doi":"10.1109/ICDAR.1995.602093","DOIUrl":"https://doi.org/10.1109/ICDAR.1995.602093","url":null,"abstract":"In this paper, we present the framework design of IDAP (Intelligent Document Assistant Processor) with the capability of intelligent user interface for pen-based computer systems. No conventional computer user interface can compete with pen and paper until now in terms of convenience and ease of use in generating documents. The system gets roughly drawn documents from users, and generates neat documents satisfiable to users. Rough document includes handwritten texts, hand-drawn tables, hand-drawn diagrams, handwritten mathematical expressions. The satisfaction of users is at least as important as the functionality and performance in pen-based system. Therefore, sophisticated user interface is critical for a successful design. Intelligent user interface methodology is employed to make the system more intelligent, natural, and ease of use. Human-computer interaction model called H-COS is proposed for pen-based applications, and the model is applied to design IDAP.","PeriodicalId":273519,"journal":{"name":"Proceedings of 3rd International Conference on Document Analysis and Recognition","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128700792","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 : 1995-08-14DOI: 10.1109/ICDAR.1995.602027
Y. Hamamoto, S. Uchimura, K. Masamizu, S. Tomita
A method for handprinted Chinese character recognition based on Gabor filters is proposed. The Gabor approach to character recognition is intuitively appealing because it is inspired by a multi-channel filtering theory for processing visual information in the early stages of the human visual system. The performance of a character recognition system using Gabor features is demonstrated on the ETL-8 character set. Mental results show that the Gabor features yielded an error rate of 2.4% versus the error rate of 4.4% obtained by using a popular feature extraction method.
{"title":"Recognition of handprinted Chinese characters using Gabor features","authors":"Y. Hamamoto, S. Uchimura, K. Masamizu, S. Tomita","doi":"10.1109/ICDAR.1995.602027","DOIUrl":"https://doi.org/10.1109/ICDAR.1995.602027","url":null,"abstract":"A method for handprinted Chinese character recognition based on Gabor filters is proposed. The Gabor approach to character recognition is intuitively appealing because it is inspired by a multi-channel filtering theory for processing visual information in the early stages of the human visual system. The performance of a character recognition system using Gabor features is demonstrated on the ETL-8 character set. Mental results show that the Gabor features yielded an error rate of 2.4% versus the error rate of 4.4% obtained by using a popular feature extraction method.","PeriodicalId":273519,"journal":{"name":"Proceedings of 3rd International Conference on Document Analysis and Recognition","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130676481","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 : 1995-08-14DOI: 10.1109/ICDAR.1995.598934
Jean-Pierre Dodel, R. Shinghal
A symbolic/neural approach to recognize unconstrained handwritten cursive amounts in bank cheques is proposed. Features like ascenders and descenders are extracted from the binary image of the amount. Depending on the features extracted, some words are recognized entirely symbolically, some words entirely neurally, and the remaining both symbolically and neurally. Results of preliminary experiments are provided.
{"title":"Symbolic/neural recognition of cursive amounts on bank cheques","authors":"Jean-Pierre Dodel, R. Shinghal","doi":"10.1109/ICDAR.1995.598934","DOIUrl":"https://doi.org/10.1109/ICDAR.1995.598934","url":null,"abstract":"A symbolic/neural approach to recognize unconstrained handwritten cursive amounts in bank cheques is proposed. Features like ascenders and descenders are extracted from the binary image of the amount. Depending on the features extracted, some words are recognized entirely symbolically, some words entirely neurally, and the remaining both symbolically and neurally. Results of preliminary experiments are provided.","PeriodicalId":273519,"journal":{"name":"Proceedings of 3rd International Conference on Document Analysis and Recognition","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123886853","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 : 1995-08-14DOI: 10.1109/ICDAR.1995.598975
R. Sabourin, Ginette Genest
For pt.I see Proc. 12th ICPR, p.450-3. In a real situation, the choice of the best representation R(/spl gamma/) for the implementation of a signature verification system able to cope with all types of handwriting is a very difficult task. This study is original in that the design of the integrated classifiers E(x) is based on a large number of individual classifiers e/sub k/(x) (or signature representations R(/spl gamma/)) in an attempt to overcome in some way the need for feature selection. In this paper, the authors present a first systematical evaluation of a multi-classifier-based approach for off-line signature verification. Two types of integrated classifiers based on kNN or minimum distance classifiers and 15 types of representation related to the ESC used as a shape factor have been evaluated using a signature database of 800 images (20 writers/spl times/40 signatures per writer) in the context of random forgeries.
{"title":"An extended-shadow-code based approach for off-line signature verification. II. Evaluation of several multi-classifier combination strategies","authors":"R. Sabourin, Ginette Genest","doi":"10.1109/ICDAR.1995.598975","DOIUrl":"https://doi.org/10.1109/ICDAR.1995.598975","url":null,"abstract":"For pt.I see Proc. 12th ICPR, p.450-3. In a real situation, the choice of the best representation R(/spl gamma/) for the implementation of a signature verification system able to cope with all types of handwriting is a very difficult task. This study is original in that the design of the integrated classifiers E(x) is based on a large number of individual classifiers e/sub k/(x) (or signature representations R(/spl gamma/)) in an attempt to overcome in some way the need for feature selection. In this paper, the authors present a first systematical evaluation of a multi-classifier-based approach for off-line signature verification. Two types of integrated classifiers based on kNN or minimum distance classifiers and 15 types of representation related to the ESC used as a shape factor have been evaluated using a signature database of 800 images (20 writers/spl times/40 signatures per writer) in the context of random forgeries.","PeriodicalId":273519,"journal":{"name":"Proceedings of 3rd International Conference on Document Analysis and Recognition","volume":"392 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123392194","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
扫码关注我们
求助内容：
应助结果提醒方式：