Abstract
A logical dynamic programming (DP) matching algorithm is proposed for extracting similar subpatterns from two sequential patterns. In the proposed algorithm, local similarity between two patterns is measured by a logical function, called support. The DP matching with the support can extract all similar subpatterns simultaneously while compensating nonlinear fluctuation. The performance of the proposed algorithm was evaluated qualitatively and quantitatively via an experiment of extracting motion primitives, i.e., common subpatterns in gesture patterns of different classes. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Uchida, S., Mori, A., Kurazume, R., Taniguchi, R. I., & Hasegawa, T. (2007). Logical DP matching for detecting similar subsequence. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4843 LNCS, pp. 628–637). Springer Verlag. https://doi.org/10.1007/978-3-540-76386-4_59
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
