Logical DP matching for detecting similar subsequence

Seiichi Uchida, Akihiro Mori, Ryo Kurazume, Rin Ichiro Taniguchi, Tsutomu Hasegawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationComputer Vision - ACCV 2007 - 8th Asian Conference on Computer Vision, Proceedings
PublisherSpringer Verlag
Number of pages10
EditionPART 1
ISBN (Print)9783540763857
Publication statusPublished - 2007
Event8th Asian Conference on Computer Vision, ACCV 2007 - Tokyo, Japan
Duration: Nov 18 2007Nov 22 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume4843 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other8th Asian Conference on Computer Vision, ACCV 2007

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Logical DP matching for detecting similar subsequence'. Together they form a unique fingerprint.

Cite this