Sciweavers

7351 search results - page 287 / 1471
» Segmenting Point Sets
Sort
View
179
Voted
CVPR
2007
IEEE
16 years 8 months ago
Segmenting Motions of Different Types by Unsupervised Manifold Clustering
We propose a novel algorithm for segmenting multiple motions of different types from point correspondences in multiple affine or perspective views. Since point trajectories associ...
Alvina Goh, René Vidal
WACV
2008
IEEE
16 years 1 months ago
Tracking and Segmentation of Highway Vehicles in Cluttered and Crowded Scenes
Monitoring highway traffic is an important application of computer vision research. In this paper, we analyze congested highway situations where it is difficult to track individ...
Goo Jun, J. K. Aggarwal, Muhittin Gökmen
SWAT
2010
Springer
218views Algorithms» more  SWAT 2010»
15 years 11 months ago
Optimal Exploration of Terrains with Obstacles
A mobile robot represented by a point moving in the plane has to explore an unknown terrain with obstacles. Both the terrain and the obstacles are modeled as arbitrary polygons. W...
Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, ...
ESA
2008
Springer
96views Algorithms» more  ESA 2008»
15 years 8 months ago
Stabbing Convex Polygons with a Segment or a Polygon
Let O = {O1, . . . , Om} be a set of m convex polygons in R2 with a total of n vertices, and let B be another convex k-gon. A placement of B, any congruent copy of B (without refle...
Pankaj K. Agarwal, Danny Z. Chen, Shashidhara K. G...
160
Voted
CCCG
2007
15 years 8 months ago
The Ordinary Line Problem Revisited
Let P be a set of n points in the plane. A connecting line of P is a line that passes through at least two of its points. A connecting line is called ordinary if it is incident on...
Asish Mukhopadhyay, Eugene Greene