2013 IEEE Workshop on Applications of Computer Vision (WACV) 2013
DOI: 10.1109/wacv.2013.6475061
|View full text |Cite
|
Sign up to set email alerts
|

Handwritten text segmentation using average longest path algorithm

Abstract: Offline handwritten text recognition is a very challenging problem. Aside

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 19 publications
(12 citation statements)
references
References 23 publications
(21 reference statements)
0
12
0
Order By: Relevance
“…The outcomes of the algorithms are in the form of lines, words and characters (see Figs. 1,2,3,4,5,6,7,8,9,10,11,12,13). The PPTRPRT technique starts its execution with the preprocessing algorithm by extracting text regions and segmenting text lines from English offline handwritten cursive script images (see Fig.…”
Section: Experiments and Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…The outcomes of the algorithms are in the form of lines, words and characters (see Figs. 1,2,3,4,5,6,7,8,9,10,11,12,13). The PPTRPRT technique starts its execution with the preprocessing algorithm by extracting text regions and segmenting text lines from English offline handwritten cursive script images (see Fig.…”
Section: Experiments and Resultsmentioning
confidence: 99%
“…Dhaval et al [1] tested segmentation by evaluating the local stroke geometry (imposed the width, height and aspect-ratio constraints in resultant characters), without making limiting assumptions on the characters size and number of characters in a word. This approach found the segmented text with the most average liveliness of the resulting characters.…”
Section: Related Workmentioning
confidence: 99%
“…This problem is difficult and may be resolved by jointly segmenting and recognizing the characters [27], [37], such a problem can be formulated as a multi-class classification problem with a large range of small snippets extracted from the different prototypes of characters [25].…”
Section: Manuscript Recognition Problemmentioning
confidence: 99%
“…The adaptive RLSA is a substitution to the traditional RLSA in the meaning that auxiliary smoothing constraints are set expressing geometrical characteristics of vicinal bridged components. The satisfaction of these constraints is continued by substitution of background pixels with foreground pixels [43]. Saoi et al propose following stages: decomposing color image into RGB channel images and making 2D Wavelet Transform of each decomposed image, then using the unsupervised pixel block categorization with the k-means algorithm in incorporated feature vector space and integrating outputs of three channels by logical OR [44].…”
Section: Related Workmentioning
confidence: 99%