Trajectory Segmentation Using Dynamic Programming

  title={Trajectory Segmentation Using Dynamic Programming},
  author={Richard Mann and Allan D. Jepson and Thomas F. El-Maraghi},
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 (eg., single curves or trajectories) the global optimum segmentation can be found by dynamic programming. The approach is easily extended to… CONTINUE READING
Highly Cited
This paper has 41 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 29 extracted citations


Publications referenced by this paper.
Showing 1-9 of 9 references

Zisserman.Visual Reconstruction

  • A. A. Blake
  • 1987
2 Excerpts

Perceptual Organization and Visual Recognition

  • D. Lowe
  • 1985
3 Excerpts

Similar Papers

Loading similar papers…