162 search results - page 1 / 33 » Trajectory Segmentation Using Dynamic Programming |
ICPR
2002
IEEE
14 years 5 months ago
2002
IEEE
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...
ICPR
2008
IEEE
13 years 11 months ago
2008
IEEE
A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of ...
EACL
2003
ACL Anthology
13 years 6 months ago
2003
ACL Anthology
In this paper we introduce a dynamic programming algorithm to perform linear text segmentation by global minimization of a segmentation cost function which consists of: (a) within...
NIPS
1993
13 years 6 months ago
1993
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...
TIP
2010
12 years 11 months ago
2010
This paper proposes an approach for recognizing human activities (more specifically, pedestrian trajectories) in video sequences, in a surveillance context. A system for automatic ...