Online Handwritten Bangla Character Recognition Using Frechet Distance and Distance Based Features

Sen, Shibaprasad; Chakraborty, Jewel; Chatterjee, Snehanjan; Mitra, Rohit; Sarkar, Ram

doi:10.1007/978-981-13-9361-7_6

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2020

2023

Publication Types

Select...

Other1

Book1

Article1

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Fréchet distance is well studied. Alt and Godau [4] gave a polynomial time algorithm to compute the Fréchet distance between two curves, sparking research in many applications, such as character recognition [12] or navigation on road maps [13]. One can also define the Fréchet distance between other objects like surfaces [3] or polygons [5].…”

Section: Introductionmentioning

confidence: 99%

Computing the Fréchet distance of trees and graphs of bounded tree width

Buchin,

Krivošija,

Neuhaus

2020

Preprint

View full text Add to dashboard Cite

We give algorithms to compute the Fréchet distance of trees and graphs with bounded tree width. Our algorithms run in O(n 2 ) time for trees of bounded degree, and O(n 2 √ n log n) time for trees of arbitrary degree. For graphs of bounded tree width we show one can compute the Fréchet distance in FPT (fixed parameter tractable) time. ACM Subject Classification Theory of computation → Design and analysis of algorithmsKeywords and phrases Fréchet distance, trees, bounded tree width, graph isomorphism

show abstract