Proceedings 15th International Conference on Pattern Recognition. ICPR-2000
DOI: 10.1109/icpr.2000.906144
|View full text |Cite
|
Sign up to set email alerts
|

Recognition of unconstrained handwritten numeral strings by composite segmentation method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 5 publications
0
2
0
Order By: Relevance
“…However, it requires a large dictionary for recognition. Different distance metrics to compute the distance between CCs (Euclidean distance, Convex hull, bounding box, average run length) have been proposed for word segmentation in handwritten [129]- [131] documents. Recognition-based approaches have been proposed for printed [132], handwritten documents [130], [133].…”
Section: Game Theorymentioning
confidence: 99%
See 1 more Smart Citation
“…However, it requires a large dictionary for recognition. Different distance metrics to compute the distance between CCs (Euclidean distance, Convex hull, bounding box, average run length) have been proposed for word segmentation in handwritten [129]- [131] documents. Recognition-based approaches have been proposed for printed [132], handwritten documents [130], [133].…”
Section: Game Theorymentioning
confidence: 99%
“…Flooding the morphological surface and segmenting the input into catchment and basin: Pri, handwritten [128] Hybrid Combination of above approaches: Hist [141] Script-specific: Hist [112], [114], [115], [119], [129], [141], [142], Urdu [143], Persian [109], Chinese [124], [126], English [144], [145] Brahmi: Hw Devanagari [142], Pri Devanagari [146], Bangla [147], Gurmukhi [111] Word Segmentation Distance metric Different metrics to compute the distance between CCs (Euclidean distance, Convex hull, bounding box, average run length): Hw [129]- [131] Recognition Feedback from recognition system; Finds word boundaries based on classification algorithms (Scale space, k-means clustering, Hough transform): Pri [132], Hw [130],…”
Section: Watershedmentioning
confidence: 99%