Pub Date : 1995-08-14DOI: 10.1109/ICDAR.1995.598993
Hiroki Mori, Hirotomo Aso, S. Makino
N-gram model is widely applied to various pattern recognition system because it well represents local features of natural languages. In this paper, we describe a contextual postprocessing method using a trigram model of character for Japanese document recognition, and its advantage is revealed by practical experiments. The model is automatically obtained by statistical processing of training documents. The ability to reduce ambiguity is evaluated by the perplexity. In the processing, two smoothing methods are examined, and the predictive power of the deleted interpolation method is shown to be superior. For leading articles, the perplexity reduced to about 22 when using deleted interpolation. The output from OCR is processed very fast using a Viterbi algorithm. Experimental results of recognition for three kinds of documents show that the error correction rates are ranged from 75 to over 90 percent.
{"title":"Japanese document recognition based on interpolated n-gram model of character","authors":"Hiroki Mori, Hirotomo Aso, S. Makino","doi":"10.1109/ICDAR.1995.598993","DOIUrl":"https://doi.org/10.1109/ICDAR.1995.598993","url":null,"abstract":"N-gram model is widely applied to various pattern recognition system because it well represents local features of natural languages. In this paper, we describe a contextual postprocessing method using a trigram model of character for Japanese document recognition, and its advantage is revealed by practical experiments. The model is automatically obtained by statistical processing of training documents. The ability to reduce ambiguity is evaluated by the perplexity. In the processing, two smoothing methods are examined, and the predictive power of the deleted interpolation method is shown to be superior. For leading articles, the perplexity reduced to about 22 when using deleted interpolation. The output from OCR is processed very fast using a Viterbi algorithm. Experimental results of recognition for three kinds of documents show that the error correction rates are ranged from 75 to over 90 percent.","PeriodicalId":273519,"journal":{"name":"Proceedings of 3rd International Conference on Document Analysis and Recognition","volume":"5 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":"126434114","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.599013
Chi Fang, J. Hull
An hypothesis testing approach for recognizing machine-printed words is presented in this paper. Based on knowledge of the document font and candidates for the identity of a word, this approach searches a tree of word decisions to generate and test hypotheses for character recognition and segmentation. The search starts at each sequential character position from both ends of a word image and proceeds inward. The accumulated cost of reaching a certain partial recognition decision is combined with the estimate of the potential cost to reach a goal state using an A* search algorithm. The proposed algorithm compensates for local degradations by relying on global characteristics of a word image. Tests of the algorithm show a recognition rate of 98.93% on degraded scanned document images with touching characters.
{"title":"A hypothesis testing approach to word recognition using an A* search algorithm","authors":"Chi Fang, J. Hull","doi":"10.1109/ICDAR.1995.599013","DOIUrl":"https://doi.org/10.1109/ICDAR.1995.599013","url":null,"abstract":"An hypothesis testing approach for recognizing machine-printed words is presented in this paper. Based on knowledge of the document font and candidates for the identity of a word, this approach searches a tree of word decisions to generate and test hypotheses for character recognition and segmentation. The search starts at each sequential character position from both ends of a word image and proceeds inward. The accumulated cost of reaching a certain partial recognition decision is combined with the estimate of the potential cost to reach a goal state using an A* search algorithm. The proposed algorithm compensates for local degradations by relying on global characteristics of a word image. Tests of the algorithm show a recognition rate of 98.93% on degraded scanned document images with touching characters.","PeriodicalId":273519,"journal":{"name":"Proceedings of 3rd International Conference on Document Analysis and Recognition","volume":"2006 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":"125552697","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.602041
H. Wehbi, H. Oulhadj, J. Lemoine, É. Petit
For the analytic on-line recognition of handwriting, the range of pattern recognition problems can be described by the severity of letter segmentation required. More difficult problems require an interaction of letter segmentation and recognition. These problems include overlapping discretely written characters, pure cursive writing, and mixed cursive and discrete writing. To these problems concerning the letter segmentation, the word segmentation problems is added. Since a script can contain numbers, capital letters as well as lowercase letters, it is necessary to have a system able to recognize them. This paper describes an on-line system for identifying and recognizing numeral characters and capital letters in handwriting sentences. This system provides two segmentation modules: the first one is to isolate the word drawings within a sentence, and the other one is to separate numeral characters and capital letters from a mixed writing prior to their recognition.
{"title":"Numeral characters and capital letters segmentation recognition in mixed handwriting context","authors":"H. Wehbi, H. Oulhadj, J. Lemoine, É. Petit","doi":"10.1109/ICDAR.1995.602041","DOIUrl":"https://doi.org/10.1109/ICDAR.1995.602041","url":null,"abstract":"For the analytic on-line recognition of handwriting, the range of pattern recognition problems can be described by the severity of letter segmentation required. More difficult problems require an interaction of letter segmentation and recognition. These problems include overlapping discretely written characters, pure cursive writing, and mixed cursive and discrete writing. To these problems concerning the letter segmentation, the word segmentation problems is added. Since a script can contain numbers, capital letters as well as lowercase letters, it is necessary to have a system able to recognize them. This paper describes an on-line system for identifying and recognizing numeral characters and capital letters in handwriting sentences. This system provides two segmentation modules: the first one is to isolate the word drawings within a sentence, and the other one is to separate numeral characters and capital letters from a mixed writing prior to their recognition.","PeriodicalId":273519,"journal":{"name":"Proceedings of 3rd International Conference on Document Analysis and Recognition","volume":"1 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":"130449291","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.598995
S. Senda, M. Minoh, I. Katsuo
A fast algorithm for the minimum distance classifier (MDC) is proposed. The MDC has been used in various areas of pattern recognition because it is simple and fast compared with other complicated classifiers. The algorithm proposed is much faster than the exhaustive one that calculates all the distances straighforwardly. Our algorithm, which produces the same output as the exhaustive, omits redundant calculations according to Karhunen-Loeve expansion. From the KL-expansion of the prototype patterns, we form a subspace of the feature space, in which the order of examining the prototypes is decided adaptive to a given unknown pattern. We have applied the algorithm to recognition of handprinted Kanji characters and measured its performance on the ETL9B database. As a result, the theoretical and practical speedups were 10-20 and 4-9, respectively.
{"title":"A fast algorithm for the minimum distance classifier and its application to Kanji character recognition","authors":"S. Senda, M. Minoh, I. Katsuo","doi":"10.1109/ICDAR.1995.598995","DOIUrl":"https://doi.org/10.1109/ICDAR.1995.598995","url":null,"abstract":"A fast algorithm for the minimum distance classifier (MDC) is proposed. The MDC has been used in various areas of pattern recognition because it is simple and fast compared with other complicated classifiers. The algorithm proposed is much faster than the exhaustive one that calculates all the distances straighforwardly. Our algorithm, which produces the same output as the exhaustive, omits redundant calculations according to Karhunen-Loeve expansion. From the KL-expansion of the prototype patterns, we form a subspace of the feature space, in which the order of examining the prototypes is decided adaptive to a given unknown pattern. We have applied the algorithm to recognition of handprinted Kanji characters and measured its performance on the ETL9B database. As a result, the theoretical and practical speedups were 10-20 and 4-9, respectively.","PeriodicalId":273519,"journal":{"name":"Proceedings of 3rd International Conference on Document Analysis and Recognition","volume":"64 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":"116599454","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.598990
Wei Wu, Wei Lu, M. Sakauchi
In this paper we propose a new framework of object-oriented model named MTDM (Matching Tree Driving Model) for drawing understanding and verify its ability of noise absorption. MTDM makes use of descriptions of object-oriented style and is an integration of static and dynamic description of recognition target. Static descriptions are for representation of abstract features so that description of structure and restriction become easier. At the same time static descriptions can be independent of matching procedures of recognition target. The dynamic descriptions are for matching control of recognition target in the form of tree structure named matching tree. Matching procedures for complex targets can be easily described with multiple matching trees. By application to several typical engineering drawings, particularly drawings with noises and distortions MTDM is proven to be suitable for multipurpose and multitarget platform.
本文提出了一种新的面向对象模型框架——匹配树驱动模型(Matching Tree Driving model, MTDM)，用于绘图理解和验证其吸噪能力。MTDM采用面向对象的描述方式，是识别目标静态描述和动态描述的结合。静态描述用于表示抽象特征，以便更容易地描述结构和限制。同时，静态描述可以独立于识别目标的匹配过程。动态描述以树状结构的形式对识别目标进行匹配控制，称为匹配树。复杂目标的匹配过程可以用多个匹配树来描述。通过对几种典型工程图，特别是带有噪声和畸变的图的应用，证明了MTDM算法适用于多用途、多目标平台。
{"title":"An object-oriented model for drawing understanding and its ability of noise absorption","authors":"Wei Wu, Wei Lu, M. Sakauchi","doi":"10.1109/ICDAR.1995.598990","DOIUrl":"https://doi.org/10.1109/ICDAR.1995.598990","url":null,"abstract":"In this paper we propose a new framework of object-oriented model named MTDM (Matching Tree Driving Model) for drawing understanding and verify its ability of noise absorption. MTDM makes use of descriptions of object-oriented style and is an integration of static and dynamic description of recognition target. Static descriptions are for representation of abstract features so that description of structure and restriction become easier. At the same time static descriptions can be independent of matching procedures of recognition target. The dynamic descriptions are for matching control of recognition target in the form of tree structure named matching tree. Matching procedures for complex targets can be easily described with multiple matching trees. By application to several typical engineering drawings, particularly drawings with noises and distortions MTDM is proven to be suitable for multipurpose and multitarget platform.","PeriodicalId":273519,"journal":{"name":"Proceedings of 3rd International Conference on Document Analysis and Recognition","volume":"26 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120937177","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.602128
R. Safari, N. Narasimhamurthi, M. Shridhar, M. Ahmadi
In this paper, a technique for registering filled-in forms is presented. The technique determines the transformations that is required to convert a filled-in form to match a known master and then extracts filled-in information. This method involves determining corresponding points between the master and the filled-in form and using this correspondence to determine the appropriate transformation. The correspondence problem is solved using results from projective geometry.
{"title":"Document registration using projective geometry","authors":"R. Safari, N. Narasimhamurthi, M. Shridhar, M. Ahmadi","doi":"10.1109/ICDAR.1995.602128","DOIUrl":"https://doi.org/10.1109/ICDAR.1995.602128","url":null,"abstract":"In this paper, a technique for registering filled-in forms is presented. The technique determines the transformations that is required to convert a filled-in form to match a known master and then extracts filled-in information. This method involves determining corresponding points between the master and the filled-in form and using this correspondence to determine the appropriate transformation. The correspondence problem is solved using results from projective geometry.","PeriodicalId":273519,"journal":{"name":"Proceedings of 3rd International Conference on Document Analysis and Recognition","volume":"157 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":"132909443","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.599001
D. Lopresti, Jiangying Zhou, G. Nagy, Prateek Sarkar
In this paper we examine the effects of random-phase spatial sampling on the optical character recognition process. We start by presenting a detailed analysis in the case of 1-dimensional patterns. Empirical data demonstrate that our model is accurate. We then give experimental results for more complex, 2-dimensional patterns (i.e. printed, scanned characters). Spatial sampling seems to account for a significant amount of the variability seen in practice.
{"title":"Spatial sampling effects in optical character recognition","authors":"D. Lopresti, Jiangying Zhou, G. Nagy, Prateek Sarkar","doi":"10.1109/ICDAR.1995.599001","DOIUrl":"https://doi.org/10.1109/ICDAR.1995.599001","url":null,"abstract":"In this paper we examine the effects of random-phase spatial sampling on the optical character recognition process. We start by presenting a detailed analysis in the case of 1-dimensional patterns. Empirical data demonstrate that our model is accurate. We then give experimental results for more complex, 2-dimensional patterns (i.e. printed, scanned characters). Spatial sampling seems to account for a significant amount of the variability seen in practice.","PeriodicalId":273519,"journal":{"name":"Proceedings of 3rd International Conference on Document Analysis and Recognition","volume":"63 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":"134296729","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.598978
M. Cheriet, J. N. Said, C. Suen
We present a formal model for processing gray-scale images of business forms such as bank cheques. The formal model is based on a new hybrid-based approach namely the base lines. In fact, to segment handwritten and hand-printed data from bank cheques, knowledge rules and base lines will have important roles to segment and extract the information from bank cheques. The architectural design as well as the major components of the system is discussed in full detail. Moreover, the significant use of the morphological followed by the topological processing on gray-scale images is used as a major aspect to restore the lost information after the elimination of the background and the base lines from the gray-scale cheques.
{"title":"A formal model for document processing of business forms","authors":"M. Cheriet, J. N. Said, C. Suen","doi":"10.1109/ICDAR.1995.598978","DOIUrl":"https://doi.org/10.1109/ICDAR.1995.598978","url":null,"abstract":"We present a formal model for processing gray-scale images of business forms such as bank cheques. The formal model is based on a new hybrid-based approach namely the base lines. In fact, to segment handwritten and hand-printed data from bank cheques, knowledge rules and base lines will have important roles to segment and extract the information from bank cheques. The architectural design as well as the major components of the system is discussed in full detail. Moreover, the significant use of the morphological followed by the topological processing on gray-scale images is used as a major aspect to restore the lost information after the elimination of the background and the base lines from the gray-scale cheques.","PeriodicalId":273519,"journal":{"name":"Proceedings of 3rd International Conference on Document Analysis and Recognition","volume":"172 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":"132246066","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.599036
K. Summers
Automatic derivation of logical document structure from generic layout would enable the development of many highly flexible electronic document manipulation tools. This problem can be divided into the segmentation of text into pieces and the classification of these pieces as particular logical structures. This paper proposes an approach to the classification of logical document structures, according to their distance from predefined prototypes. The prototypes consider linguistic information minimally, thus relying minimally on the accuracy of OCR and decreasing language-dependence. Different classes of logical structures and the differences in the requisite information for classifying them are discussed. A prototype format is proposed, existing prototypes and a distance measurement are described, and performance results are provided.
{"title":"Near-wordless document structure classification","authors":"K. Summers","doi":"10.1109/ICDAR.1995.599036","DOIUrl":"https://doi.org/10.1109/ICDAR.1995.599036","url":null,"abstract":"Automatic derivation of logical document structure from generic layout would enable the development of many highly flexible electronic document manipulation tools. This problem can be divided into the segmentation of text into pieces and the classification of these pieces as particular logical structures. This paper proposes an approach to the classification of logical document structures, according to their distance from predefined prototypes. The prototypes consider linguistic information minimally, thus relying minimally on the accuracy of OCR and decreasing language-dependence. Different classes of logical structures and the differences in the requisite information for classifying them are discussed. A prototype format is proposed, existing prototypes and a distance measurement are described, and performance results are provided.","PeriodicalId":273519,"journal":{"name":"Proceedings of 3rd International Conference on Document Analysis and Recognition","volume":"297 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":"132369823","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.598998
K. H. Lin, Rey-Long Liu, V. Soo
The thematic knowledge can bridge the gap between semantic entities and syntactic constituents. In document understanding, the correctness and the efficiency could be improved if the thematic knowledge is available. In this paper, we propose a semi-automatic method to acquire thematic knowledge of Chinese verbs by exploiting syntactic clues. The syntactic clues, which may be collected by most existing syntactic processors, reduce the hypothesis space of the theta roles. The ambiguities may be further resolved by the evidences from a trainer. A set of heuristics based on linguistic constraints are employed to guide the ambiguity resolution process. To acquire thematic information for verbs, the argument structures of the verbs must be extracted first. A template matching method is used to extract the argument structure of verbs.
{"title":"Interactive acquisition of thematic information of Chinese verbs for judicial verdict document understanding using templates, syntactic clues, and heuristics","authors":"K. H. Lin, Rey-Long Liu, V. Soo","doi":"10.1109/ICDAR.1995.598998","DOIUrl":"https://doi.org/10.1109/ICDAR.1995.598998","url":null,"abstract":"The thematic knowledge can bridge the gap between semantic entities and syntactic constituents. In document understanding, the correctness and the efficiency could be improved if the thematic knowledge is available. In this paper, we propose a semi-automatic method to acquire thematic knowledge of Chinese verbs by exploiting syntactic clues. The syntactic clues, which may be collected by most existing syntactic processors, reduce the hypothesis space of the theta roles. The ambiguities may be further resolved by the evidences from a trainer. A set of heuristics based on linguistic constraints are employed to guide the ambiguity resolution process. To acquire thematic information for verbs, the argument structures of the verbs must be extracted first. A template matching method is used to extract the argument structure of verbs.","PeriodicalId":273519,"journal":{"name":"Proceedings of 3rd International Conference on Document Analysis and Recognition","volume":"77 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":"114043561","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
扫码关注我们
求助内容：
应助结果提醒方式：