pith. sign in

arxiv: 1206.4116 · v1 · pith:YPS5RV4Rnew · submitted 2012-06-19 · 📊 stat.ML · cs.AI

Dependence Maximizing Temporal Alignment via Squared-Loss Mutual Information

classification 📊 stat.ML cs.AI
keywords alignmentlsdtwsequencestemporalcomputerdifferentinformationmutual
0
0 comments X
read the original abstract

The goal of temporal alignment is to establish time correspondence between two sequences, which has many applications in a variety of areas such as speech processing, bioinformatics, computer vision, and computer graphics. In this paper, we propose a novel temporal alignment method called least-squares dynamic time warping (LSDTW). LSDTW finds an alignment that maximizes statistical dependency between sequences, measured by a squared-loss variant of mutual information. The benefit of this novel information-theoretic formulation is that LSDTW can align sequences with different lengths, different dimensionality, high non-linearity, and non-Gaussianity in a computationally efficient manner. In addition, model parameters such as an initial alignment matrix can be systematically optimized by cross-validation. We demonstrate the usefulness of LSDTW through experiments on synthetic and real-world Kinect action recognition datasets.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.