Trajectory segmentation using dynamic programming
Richard Mann,Allan D. Jepson,T.F. El-Maraghi +2 more
- 11 Aug 2002
- Vol. 1, pp 10331-10331
TL;DR: It is shown that for ordered data, the global optimum segmentation can be found by dynamic programming and the approach is easily extended to handle different segment types and top down information about segment boundaries, when available.
read more
Abstract: We consider the segmentation of a trajectory into piecewise polynomial parts, or possibly other forms. Segmentation is typically formulated as an optimization problem which trades off model fitting error versus the cost of introducing new segments. Heuristics such as split-and-merge are used to find the best segmentation. We show that for ordered data (e.g., single curves or trajectories) the global optimum segmentation can be found by dynamic programming. The approach is easily extended to handle different segment types and top down information about segment boundaries, when available. We show segmentation results for video sequences of a basketball undergoing gravitational and nongravitational motion.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Warped K-Means: An algorithm to cluster sequentially-distributed data
Luis A. Leiva,Enrique Vidal +1 more
TL;DR: This work revisit the well-known K-means algorithm and provides a general method to properly cluster sequentially-distributed data and presents Warped K-Means (WKM), a multi-purpose partitional clustering procedure that minimizes the sum of squared error criterion while imposing a hard sequentiality constraint in the classification step.
78
Interactive Feature Tracking using K-D Trees and Dynamic Programming
A. Buchanan,Andrew Fitzgibbon +1 more
- 17 Jun 2006
TL;DR: The work presented is a significant foundation for a powerful off-line feature tracking system, particularly in the context of interactive applications.
76
Fast track matching and event detection
Tao Ding,Mario Sznaier,Octavia Camps +2 more
- 23 Jun 2008
TL;DR: This paper addresses the problems of track stitching and dynamic event detection in a sequence of frames with a simple, computationally inexpensive approach that achieves these goals in a unified way.
An adaptive approach for online segmentation of multi-dimensional mobile data
Tian Guo,Zhixian Yan,Karl Aberer +2 more
- 20 May 2012
TL;DR: An adaptive model for segmenting real-time accelerometer data from smartphones is designed, which is able to dynamically select suitable dimensions to build a model, and adaptively pick up a proper model.
A Quick Search Method for Audio Signals Based on a Piecewise Linear Representation of Feature Trajectories
TL;DR: A new method for a quick similarity-based search through long unlabeled audio streams to detect and locate audio clips provided by users using the segment-based Karhunen-Loeve (KL) transform.
References
Nonparametric segmentation of curves into various representations
Paul L. Rosin,Geoff West +1 more
TL;DR: The operation and performance of an algorithm for segmenting connected points into a combination of representations such as lines, circular, elliptical and superelliptical arcs, and polynomials is described and demonstrated.
243
The Computational Perception of Scene Dynamics
TL;DR: This work presents an implemented computational theory that derives dynamic descriptions of interacting objects directly from camera input, based on an analysis of the Newtonian mechanics of a simplified scene model.
101
Dynamical encoding of cursive handwriting
Yoram Singer,Naftali Tishby +1 more
TL;DR: A model-based approach to on-line cursive handwriting analysis and recognition is presented and evaluated, resulting in a discrete motor control representation of the continuous pen motion, via the quantized levels of the model parameters.
67
A maximum likelihood N-camera stereo algorithm
Cox
- 21 Jun 1994
TL;DR: This paper extends results of a maximum likelihood two-frame stereo algorithm to the case of N cameras, and explicitly model occlusion between features of the principal pair, but the possibility of occlusions in the N-2 additional views is also modelled.
57
Minimum description length based 2D shape description
M. Li
- 11 May 1993
TL;DR: The problem of 2-D shape description, particularly with contour partitioning, grouping, and classification in terms of straight and curved, based on the minimum description length (MDL) criterion and shape-fitting techniques, is discussed.
27
Related Papers (5)
Jae-Gil Lee,Jiawei Han,Kyu-Young Whang +2 more
- 11 Jun 2007
Jia Wang,Hanqing Lu,G. Eude,Qingshan Liu +3 more
- 01 Jan 2004