Fast cyclic edit distance computation with weighted edit costs in classification

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.