Anzeige
Erschienen in:
2005 | OriginalPaper | Buchkapitel
Dynamic Time Warping of Cyclic Strings for Shape Matching
verfasst von : Andrés Marzal, Vicente Palazón
Erschienen in: Pattern Recognition and Image Analysis
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Cyclic strings are strings with no starting or ending point, such as those describing a closed contour. We present a new algorithm to compute a similarity measure between two cyclic sequences based on Dynamic Time Warping. The algorithm computes the optimal alignment between both sequences and is based on the cyclic edit distance algorithm proposed by Maes. The algorithm runs in
O
(
mnlg
m
) time, where
m
and
n
are the lengths of the compared strings. Experiments on a shape classification and shape retrieval with a public database are presented.