15485 search results - page 2851 / 3097 » Computing Optimal Subsets |
166
click to vote
CVPR
2001
IEEE
16 years 8 months ago
2001
IEEE
We approach the problem of 2-D and 3-D puzzle solving by matching the geometric features of puzzle pieces three at a time. First, we define an affinity measure for a pair of piece...
168
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
This paper presents an algebro-geometric solution to the problem of segmenting an unknown number of subspaces of unknown and varying dimensions from sample data points. We represen...
211
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Most tracking algorithms are based on the maximum a posteriori (MAP) solution of a probabilistic framework called Hidden Markov Model, where the distribution of the object state a...
203
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
Interactive digital matting, the process of extracting a foreground object from an image based on limited user input, is an important task in image and video editing. From a compu...
190
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
We address the problem of detecting complex articulated objects and their pose in 3D range scan data. This task is very difficult when the orientation of the object is unknown, an...