Computing the cyclic edit distance for pattern classification by ranking edit paths

DOI10.1007/978-3-540-27868-9_12MaRDI QIDQ5466282zbMATH OpenOpenAlexFDO

Authors Andrés Marzal, Vicente Palazón, Guillermo Peris, Víctor Manuel Jiménez

Publication date 24 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b98738

zbMATH Keywords

Bunke and Bühler algorithmcyclic edit distanceCyclic stringshandwritten text recognitionK shortest pathsOCRstring matching

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Recommendations

• Efficient techniques for a very accurate measurement of dissimilarities between cyclic patterns
• On a cyclic string-to-string correction problem
• scientific article; zbMATH DE number 3845091
• Approximation of graph edit distance based on Hausdorff matching
• Shape matching using edit-distance: An implementation

This page was built for publication: Computing the cyclic edit distance for pattern classification by ranking edit paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5466282)