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.
Logical DP Matching for Detecting Similar Subsequence
Asian Conference on Computer Vision ; 2007 ; Tokyo, Japan November 18, 2007 - November 22, 2007
01.01.2007
10 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
Common Motion , Motion Primitive , Sequential Pattern , Dynamic Time Warping , Frequent Subsequence Pattern Recognition , Artificial Intelligence , Algorithm Analysis and Problem Complexity , Computer Science , Biometrics , Image Processing and Computer Vision , Computer Imaging, Vision, Pattern Recognition and Graphics
Subsequence matching algorithm between number trend sequences
British Library Online Contents | 2007
|Dynamic time warping under subsequence
British Library Conference Proceedings | 2022
|Driving dispatching command checking method based on longest common subsequence
Europäisches Patentamt | 2025
|Algorithms for Detecting Logical Dependences in Recognition by Precedents
British Library Online Contents | 2005
|