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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Logical DP Matching for Detecting Similar Subsequence


    Contributors:

    Conference:

    Asian Conference on Computer Vision ; 2007 ; Tokyo, Japan November 18, 2007 - November 22, 2007


    Published in:

    Computer Vision – ACCV 2007 ; Chapter : 59 ; 628-637


    Publication date :

    2007-01-01


    Size :

    10 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    Subsequence matching algorithm between number trend sequences

    Suling, J. / Dangyang, C. | British Library Online Contents | 2007


    Dynamic time warping under subsequence

    Han, Shengchuan / Zhang, Lisheng | British Library Conference Proceedings | 2022


    Driving dispatching command checking method based on longest common subsequence

    ZENG YI / WANG ZIWEI / LI ZHI et al. | European Patent Office | 2025

    Free access

    Algorithms for Detecting Logical Dependences in Recognition by Precedents

    Kovshov, N. K. / Moiseev, V. A. / Ryazanov, V. V. | British Library Online Contents | 2005