The Optimal Temporal Common Subsequence
Based on a formal characterization of time-series and state-sequences, this paper proposes a new algorithm named the Optimal Temporal Common Subsequence (OTCS) to measure the similarity between state-sequences. Distinguishing from the conventional Longest Common Subsequence based measurements, a new concept of common subsequence named temporal common subsequence is proposed to describe the similarity of the temporal order over state-sequences, as well as the similarity of the other two essential and vital temporal characters, i.e., the temporal duration of each state and the temporal gaps between each pair of adjacent states. The experimental results on news video retrieval demonstrate the effectiveness and validity of OTCS.
state-sequence mntchng optimal temporal common subsequence news video retrieval
Aihua Zheng Xiaoyi Zhou Jixin Ma Miltos Petridis
School of Computing and Mathematical Sciences The University of Greenwich. London. UK
国际会议
成都
英文
241-246
2010-06-23（万方平台首次上网日期，不代表论文的发表时间）