Logical DP matching for detecting similar subsequence

Authors:
Seiichi Uchida;Akihiro Mori;Ryo Kurazume;Rin-Ichiro Taniguchi;Tsutomu Hasegawa
Affiliations:
Kyushu University, Fukuoka, Japan;Toshiba Corporation, Tokyo, Japan;Kyushu University, Fukuoka, Japan;Kyushu University, Fukuoka, Japan;Kyushu University, Fukuoka, Japan
Venue:
ACCV'07 Proceedings of the 8th Asian conference on Computer vision - Volume Part I
Year:
2007

Citing 4
Cited 2

A Survey of Methods and Strategies in Character Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Automated Derivation of Primitives for Movement Classification

Autonomous Robots
Discovery of Time-Series Motif from Multi-Dimensional Data Based on MDL Principle

Machine Learning
A Survey of Elastic Matching Techniques for Handwritten Character Recognition

IEICE - Transactions on Information and Systems

Detecting repeated motion patterns via dynamic programming using motion density

ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Detecting frequent patterns in video using partly locality sensitive hashing

ACCV'10 Proceedings of the 2010 international conference on Computer vision - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

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.