Name
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. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1109/ICPR.2002.1044709 | Pattern Recognition, 2002. Proceedings. 16th International Conference |
Keywords | Field | DocType |
dynamic programming,heuristic programming,image motion analysis,image segmentation,image sequences,piecewise polynomial techniques,video signal processing,basketball,dynamic programming,global optimum segmentation,gravitational motion,model fitting error,nongravitational motion,ordered data,piecewise polynomial parts,single curves,split-and-merge heuristic,trajectories,trajectory segmentation,video sequences | Spline (mathematics),Dynamic programming,Computer vision,Scale-space segmentation,Pattern recognition,Computer science,Segmentation,Segmentation-based object categorization,Image segmentation,Artificial intelligence,Optimization problem,Piecewise | Conference |
Volume | ISSN | ISBN |
1 | 1051-4651 | 0-7695-1695-X |
Citations | PageRank | References |
25 | 1.31 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Richard Mann | 1 | 25 | 1.31 |
| Jepson, A.D. | 2 | 402 | 81.91 |
| Thomas El-Maraghi | 3 | 32 | 2.92 |