Skip to main content
Article thumbnail
Location of Repository

The optimal temporal common subsequence

By Aihua Zheng, Xiaoyi Zhou, Jixin Ma and Miltos Petridis

Abstract

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

Topics: QA75
Publisher: IEEE Computer Society
Year: 2010
OAI identifier: oai:gala.gre.ac.uk:3886
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://gala.gre.ac.uk/3886/1/1... (external link)
  • http://www.gre.ac.uk/schools/c... (external link)
  • http://www.gre.ac.uk/schools/c... (external link)
  • http://www.gre.ac.uk/schools/c... (external link)
  • http://ieeexplore.ieee.org/xpl... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.