DocumentCode
2448469
Title
Fast cyclic edit distance computation with weighted edit costs in classification
Author
Peris, Guillermo ; Marzal, Andrés
Author_Institution
Departament de Llenguatges i Sistemes Informatics, Univ. Jaume I, Castello, Spain
Volume
4
fYear
2002
fDate
2002
Firstpage
184
Abstract
Cyclic edit distances are a good measure of contour shapes dissimilarity. A branch and bound algorithm that speeds up the computation of cyclic edit distances with arbitrary weights for the edit operations is presented. The algorithm is modified to work with an external bound that further accelerates the computation when applied to classification problems.
Keywords
handwritten character recognition; pattern classification; set theory; tree searching; branch and bound algorithm; classification; contour shapes dissimilarity; edit operations; fast cyclic edit distance computation; weighted edit costs; Acceleration; Computational efficiency; Cost function; Pattern recognition; Reactive power; Shape measurement;
fLanguage
English
Publisher
ieee
Conference_Titel
Pattern Recognition, 2002. Proceedings. 16th International Conference on
ISSN
1051-4651
Print_ISBN
0-7695-1695-X
Type
conf
DOI
10.1109/ICPR.2002.1047428
Filename
1047428
Link To Document