loading...
Fast Cyclic Edit Distance Computation with Weighted Edit Costs in Classification
Quebec City, QC, Canada August 11-August 15
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPR.2002.104742816th International Conference on Patt ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Guillermo Peris, Universitat Jaume I
Andrés Marzal, Universitat Jaume I
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.
Citation:
Guillermo Peris, Andrés Marzal, "Fast Cyclic Edit Distance Computation with Weighted Edit Costs in Classification," icpr, vol. 4, pp.40184, 16th International Conference on Pattern Recognition (ICPR'02) - Volume 4, 2002
Usage of this product signifies your acceptance of the Terms of Use.