Pub Date : 2002-08-06DOI: 10.1109/IWFHR.2002.1030913
L. Vuurpijl, Lambert Schomaker, E. Broek
In this paper, the image retrieval system Vind(x) is described. The architecture of the system and first user-experiences are reported. Using Vind(x), users on the Internet may cooperatively annotate objects in paintings by use of the pen or mouse. The collected data can be searched through query-by-drawing techniques, but can also serve as an (ever-growing) training and benchmark set for the development of automated image retrieval systems of the future. Several other examples of cooperative annotation are presented in order to underline the importance of this concept for the design of pattern recognition systems and the labeling of large quantities of scanned documents or online data.
{"title":"Vind(x): using the user through cooperative annotation","authors":"L. Vuurpijl, Lambert Schomaker, E. Broek","doi":"10.1109/IWFHR.2002.1030913","DOIUrl":"https://doi.org/10.1109/IWFHR.2002.1030913","url":null,"abstract":"In this paper, the image retrieval system Vind(x) is described. The architecture of the system and first user-experiences are reported. Using Vind(x), users on the Internet may cooperatively annotate objects in paintings by use of the pen or mouse. The collected data can be searched through query-by-drawing techniques, but can also serve as an (ever-growing) training and benchmark set for the development of automated image retrieval systems of the future. Several other examples of cooperative annotation are presented in order to underline the importance of this concept for the design of pattern recognition systems and the labeling of large quantities of scanned documents or online data.","PeriodicalId":114017,"journal":{"name":"Proceedings Eighth International Workshop on Frontiers in Handwriting Recognition","volume":"159 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114433885","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 : 2002-08-06DOI: 10.1109/IWFHR.2002.1030922
A. Bensefia, A. Nosary, T. Paquet, L. Heutte
This communication deals with the problem of writer identification. If the assumption of writing individuality is true then graphical fragments that constitute it should be individual too. Therefore we propose a morphological grapheme based analysis to make writer identification. Template Matching is the core of the approach. The redundancy of the individual patterns in a writing, defined as the writer's invariants, allows to compress the handwritten texts while maintaining good identification performance. Two series of tests are reported. The first series is designed to evaluate the relevance of our approach of identification on a basis of 88 writers by evaluating the influence of the text representation (with or without invariants) on the quality of the method. The method gives about 97,7% of correct identification when using large compressed samples of handwriting. The second series of tests is designed to evaluate the influence of the sample size of the writing to be identified on the quality of the method. It is shown that writer identification can reach a correct identification rate of 92,9% using only samples of 50 graphemes of each writing.
{"title":"Writer identification by writer's invariants","authors":"A. Bensefia, A. Nosary, T. Paquet, L. Heutte","doi":"10.1109/IWFHR.2002.1030922","DOIUrl":"https://doi.org/10.1109/IWFHR.2002.1030922","url":null,"abstract":"This communication deals with the problem of writer identification. If the assumption of writing individuality is true then graphical fragments that constitute it should be individual too. Therefore we propose a morphological grapheme based analysis to make writer identification. Template Matching is the core of the approach. The redundancy of the individual patterns in a writing, defined as the writer's invariants, allows to compress the handwritten texts while maintaining good identification performance. Two series of tests are reported. The first series is designed to evaluate the relevance of our approach of identification on a basis of 88 writers by evaluating the influence of the text representation (with or without invariants) on the quality of the method. The method gives about 97,7% of correct identification when using large compressed samples of handwriting. The second series of tests is designed to evaluate the influence of the sample size of the writing to be identified on the quality of the method. It is shown that writer identification can reach a correct identification rate of 92,9% using only samples of 50 graphemes of each writing.","PeriodicalId":114017,"journal":{"name":"Proceedings Eighth International Workshop on Frontiers in Handwriting Recognition","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115036705","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 : 2002-08-06DOI: 10.1109/IWFHR.2002.1030883
Claus Bahlmann, B. Haasdonk, H. Burkhardt
In this paper we describe a novel classification approach for online handwriting recognition. The technique combines dynamic time warping (DTW) and support vector machines (SVMs) by establishing a new SVM kernel. We call this kernel Gaussian DTW (GDTW) kernel. This kernel approach has a main advantage over common HMM techniques. It does not assume a model for the generative class conditional densities. Instead, it directly addresses the problem of discrimination by creating class boundaries and thus is less sensitive to modeling assumptions. By incorporating DTW in the kernel function, general classification problems with variable-sized sequential data can be handled. In this respect the proposed method can be straightforwardly applied to all classification problems, where DTW gives a reasonable distance measure, e.g., speech recognition or genome processing. We show experiments with this kernel approach on the UNIPEN handwriting data, achieving results comparable to an HMM-based technique.
{"title":"Online handwriting recognition with support vector machines - a kernel approach","authors":"Claus Bahlmann, B. Haasdonk, H. Burkhardt","doi":"10.1109/IWFHR.2002.1030883","DOIUrl":"https://doi.org/10.1109/IWFHR.2002.1030883","url":null,"abstract":"In this paper we describe a novel classification approach for online handwriting recognition. The technique combines dynamic time warping (DTW) and support vector machines (SVMs) by establishing a new SVM kernel. We call this kernel Gaussian DTW (GDTW) kernel. This kernel approach has a main advantage over common HMM techniques. It does not assume a model for the generative class conditional densities. Instead, it directly addresses the problem of discrimination by creating class boundaries and thus is less sensitive to modeling assumptions. By incorporating DTW in the kernel function, general classification problems with variable-sized sequential data can be handled. In this respect the proposed method can be straightforwardly applied to all classification problems, where DTW gives a reasonable distance measure, e.g., speech recognition or genome processing. We show experiments with this kernel approach on the UNIPEN handwriting data, achieving results comparable to an HMM-based technique.","PeriodicalId":114017,"journal":{"name":"Proceedings Eighth International Workshop on Frontiers in Handwriting Recognition","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122022696","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 : 2002-08-06DOI: 10.1109/IWFHR.2002.1030955
C. Stefano, A. Marcelli
This paper presents a method for locating the points where most likely joints between successive characters within a word occur. The proposed method, whose basic assumptions follow from handwriting generation studies, relies upon a set of morphological criteria applied to both the ligatures and the terminal regions of successive characters in order to decide the most appropriate position for the segmentation points. It does not exploit any temporal information, but rather it manipulates shape information, thus is suitable for both online and off-line handwriting processing. An experimental procedure, adopted to quantitatively evaluate the performance of the proposed algorithm without using any classification method, is also introduced.
{"title":"From ligatures to characters: a shape-based algorithm for handwriting segmentation","authors":"C. Stefano, A. Marcelli","doi":"10.1109/IWFHR.2002.1030955","DOIUrl":"https://doi.org/10.1109/IWFHR.2002.1030955","url":null,"abstract":"This paper presents a method for locating the points where most likely joints between successive characters within a word occur. The proposed method, whose basic assumptions follow from handwriting generation studies, relies upon a set of morphological criteria applied to both the ligatures and the terminal regions of successive characters in order to decide the most appropriate position for the segmentation points. It does not exploit any temporal information, but rather it manipulates shape information, thus is suitable for both online and off-line handwriting processing. An experimental procedure, adopted to quantitatively evaluate the performance of the proposed algorithm without using any classification method, is also introduced.","PeriodicalId":114017,"journal":{"name":"Proceedings Eighth International Workshop on Frontiers in Handwriting Recognition","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125683637","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 : 2002-08-06DOI: 10.1109/IWFHR.2002.1030954
D. You, Gyeonghwan Kim
A slant correction method for handwritten Korean strings based on analysis of stroke distribution, which reflects structural properties of Korean characters, is presented in this paper. The method aims to deal with typical problems which have been frequently observed in slant correction of handwritten Korean strings with conventional approaches developed for English/European languages. Extracted strokes from a line of text image are classified into two clusters: vertical and diagonal. Gaussian modeling is applied to each of the clusters and the slant angle is estimated from the model which represents the vertical strokes. Experimental results support the effectiveness of the proposed method. For the performance comparison 1,600 handwritten address sting images were used, and success rate of 96.7%, which is much higher than other conventional approaches, has been achieved.
{"title":"Slant correction of handwritten strings based on structural properties of Korean characters","authors":"D. You, Gyeonghwan Kim","doi":"10.1109/IWFHR.2002.1030954","DOIUrl":"https://doi.org/10.1109/IWFHR.2002.1030954","url":null,"abstract":"A slant correction method for handwritten Korean strings based on analysis of stroke distribution, which reflects structural properties of Korean characters, is presented in this paper. The method aims to deal with typical problems which have been frequently observed in slant correction of handwritten Korean strings with conventional approaches developed for English/European languages. Extracted strokes from a line of text image are classified into two clusters: vertical and diagonal. Gaussian modeling is applied to each of the clusters and the slant angle is estimated from the model which represents the vertical strokes. Experimental results support the effectiveness of the proposed method. For the performance comparison 1,600 handwritten address sting images were used, and success rate of 96.7%, which is much higher than other conventional approaches, has been achieved.","PeriodicalId":114017,"journal":{"name":"Proceedings Eighth International Workshop on Frontiers in Handwriting Recognition","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127781914","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 : 2002-08-06DOI: 10.1109/IWFHR.2002.1030902
Jue Wang, Chenyu Wu, Ying-Qing Xu, H. Shum, Liang Ji
In this paper an integrated approach for modeling, learning and synthesizing personal cursive handwriting is proposed. Cursive handwriting is modeled by a tri-unit handwriting model, which focuses on both the handwritten letters and the interconnection strokes of adjacent letters. Handwriting strokes are formed from generative models that are based on control points and B-spline curves. In the two-step learning process, a template-based matching algorithm and a data congealing algorithm are first proposed to extract training vectors from handwriting samples, and then letter style models and concatenation style models are trained separately. In the synthesis process, isolated letters and ligature strokes are generated from the learned models and concatenated with each other to produce the whole word trajectory, with guidance from a deformable model. Experimental results show that the proposed system can effectively learn the individual style of cursive handwriting and has the ability to generate novel handwriting of the same style.
{"title":"Learning-based cursive handwriting synthesis","authors":"Jue Wang, Chenyu Wu, Ying-Qing Xu, H. Shum, Liang Ji","doi":"10.1109/IWFHR.2002.1030902","DOIUrl":"https://doi.org/10.1109/IWFHR.2002.1030902","url":null,"abstract":"In this paper an integrated approach for modeling, learning and synthesizing personal cursive handwriting is proposed. Cursive handwriting is modeled by a tri-unit handwriting model, which focuses on both the handwritten letters and the interconnection strokes of adjacent letters. Handwriting strokes are formed from generative models that are based on control points and B-spline curves. In the two-step learning process, a template-based matching algorithm and a data congealing algorithm are first proposed to extract training vectors from handwriting samples, and then letter style models and concatenation style models are trained separately. In the synthesis process, isolated letters and ligature strokes are generated from the learned models and concatenated with each other to produce the whole word trajectory, with guidance from a deformable model. Experimental results show that the proposed system can effectively learn the individual style of cursive handwriting and has the ability to generate novel handwriting of the same style.","PeriodicalId":114017,"journal":{"name":"Proceedings Eighth International Workshop on Frontiers in Handwriting Recognition","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125379263","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 : 2002-08-06DOI: 10.1109/IWFHR.2002.1030957
S. Al-Maadeed, D. Elliman, C. Higgins
In this paper we present a new database for off-line Arabic handwriting recognition, together with associated preprocessing procedures. We have developed a new database for the collection, storage and retrieval of Arabic handwritten text (AHDB). This is an advance both in terms of the size of the database as well as the number of different writers involved. We further designed an innovative, simple yet powerful, in place tagging procedure for our database. It enables us to easily extract the bitmaps of words. We also constructed a preprocessing class, which contains some useful preprocessing operations. In this paper the most popular words in Arabic writing were identified for the first time, using an associated program.
{"title":"A data base for Arabic handwritten text recognition research","authors":"S. Al-Maadeed, D. Elliman, C. Higgins","doi":"10.1109/IWFHR.2002.1030957","DOIUrl":"https://doi.org/10.1109/IWFHR.2002.1030957","url":null,"abstract":"In this paper we present a new database for off-line Arabic handwriting recognition, together with associated preprocessing procedures. We have developed a new database for the collection, storage and retrieval of Arabic handwritten text (AHDB). This is an advance both in terms of the size of the database as well as the number of different writers involved. We further designed an innovative, simple yet powerful, in place tagging procedure for our database. It enables us to easily extract the bitmaps of words. We also constructed a preprocessing class, which contains some useful preprocessing operations. In this paper the most popular words in Arabic writing were identified for the first time, using an associated program.","PeriodicalId":114017,"journal":{"name":"Proceedings Eighth International Workshop on Frontiers in Handwriting Recognition","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131268630","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 : 2002-08-06DOI: 10.1109/IWFHR.2002.1030912
G. Seni
This paper presents a novel handwriting input user interface (UI)for small portable devices with a touch-enabled screen. This UI includes a writing area on the screen that behaves as a "treadmill" such that electronic ink input is immediately moved from right to left while it is being entered, giving the user the feeling of writing text on a virtual "ticker-tape". This method allows the user to write continuously without running out of writing space, and takes up very little screen real-estate to implement. The UI communicates with a recognition engine capable of recognizing continuously input handwritten text and that can buffer incomplete ink entries. The UI technique described, unlike prior interfaces in which space constraints limit the ability to continuously write on the device screen and thus slow text input, allows the full throughput benefit of continuous text input to be realized within a very small writing space.
{"title":"Treadmill ink - enabling continuous pen input on small devices","authors":"G. Seni","doi":"10.1109/IWFHR.2002.1030912","DOIUrl":"https://doi.org/10.1109/IWFHR.2002.1030912","url":null,"abstract":"This paper presents a novel handwriting input user interface (UI)for small portable devices with a touch-enabled screen. This UI includes a writing area on the screen that behaves as a \"treadmill\" such that electronic ink input is immediately moved from right to left while it is being entered, giving the user the feeling of writing text on a virtual \"ticker-tape\". This method allows the user to write continuously without running out of writing space, and takes up very little screen real-estate to implement. The UI communicates with a recognition engine capable of recognizing continuously input handwritten text and that can buffer incomplete ink entries. The UI technique described, unlike prior interfaces in which space constraints limit the ability to continuously write on the device screen and thus slow text input, allows the full throughput benefit of continuous text input to be realized within a very small writing space.","PeriodicalId":114017,"journal":{"name":"Proceedings Eighth International Workshop on Frontiers in Handwriting Recognition","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127752842","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 : 2002-08-06DOI: 10.1109/IWFHR.2002.1030887
S. Uchida, H. Sakoe
A fast elastic matching based handwritten character recognition method is investigated. In the method, an unconstrained elastic matching technique, where the matching is optimized locally and individually on each pixel, is utilized together with its a posteriori evaluation based on the eigen-deformations of handwritten characters. Our experimental results show that high recognition rates can be attained by the present method with feasible computations.
{"title":"A handwritten character recognition method based on unconstrained elastic matching and eigen-deformations","authors":"S. Uchida, H. Sakoe","doi":"10.1109/IWFHR.2002.1030887","DOIUrl":"https://doi.org/10.1109/IWFHR.2002.1030887","url":null,"abstract":"A fast elastic matching based handwritten character recognition method is investigated. In the method, an unconstrained elastic matching technique, where the matching is optimized locally and individually on each pixel, is utilized together with its a posteriori evaluation based on the eigen-deformations of handwritten characters. Our experimental results show that high recognition rates can be attained by the present method with feasible computations.","PeriodicalId":114017,"journal":{"name":"Proceedings Eighth International Workshop on Frontiers in Handwriting Recognition","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131824305","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 : 2002-08-06DOI: 10.1109/IWFHR.2002.1030888
Jun-ichi Tokuno, Nobuhito Inami, Shigeki Matsuda, M. Nakai, H. Shimodaira, S. Sagayama
Describes context-dependent substroke hidden Markov models (HMMs)for on-line handwritten recognition of cursive Kanji and Hiragana characters. In order to tackle this problem, we have proposed the substroke HMM approach where a modeling unit "substroke" that is much smaller than a whole character is employed and each character is modeled as a concatenation of only 25 kinds of substroke HMMs. One of the drawbacks of this approach is that the recognition accuracy deteriorates in the case of scribbled characters, and characters where the shape of the substrokes varies a lot. We show that the context-dependent substroke modeling which depends on how the substroke connects to the adjacent substrokes is effective for achieving robust recognition of low quality characters, The successive state splitting algorithm which was mainly developed for speech recognition is employed to construct the context dependent substroke HMMs. Experimental results show that the correct recognition rate improved from 88% to 92% for cursive Kanji handwriting and from 90% to 98% for Hiragana handwriting.
{"title":"Context-dependent substroke model for HMM-based on-line handwriting recognition","authors":"Jun-ichi Tokuno, Nobuhito Inami, Shigeki Matsuda, M. Nakai, H. Shimodaira, S. Sagayama","doi":"10.1109/IWFHR.2002.1030888","DOIUrl":"https://doi.org/10.1109/IWFHR.2002.1030888","url":null,"abstract":"Describes context-dependent substroke hidden Markov models (HMMs)for on-line handwritten recognition of cursive Kanji and Hiragana characters. In order to tackle this problem, we have proposed the substroke HMM approach where a modeling unit \"substroke\" that is much smaller than a whole character is employed and each character is modeled as a concatenation of only 25 kinds of substroke HMMs. One of the drawbacks of this approach is that the recognition accuracy deteriorates in the case of scribbled characters, and characters where the shape of the substrokes varies a lot. We show that the context-dependent substroke modeling which depends on how the substroke connects to the adjacent substrokes is effective for achieving robust recognition of low quality characters, The successive state splitting algorithm which was mainly developed for speech recognition is employed to construct the context dependent substroke HMMs. Experimental results show that the correct recognition rate improved from 88% to 92% for cursive Kanji handwriting and from 90% to 98% for Hiragana handwriting.","PeriodicalId":114017,"journal":{"name":"Proceedings Eighth International Workshop on Frontiers in Handwriting Recognition","volume":"293 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131944852","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
扫码关注我们
求助内容：
应助结果提醒方式：