417 search results - page 3 / 84 » Convex Shape Decomposition |
CVPR
2008
IEEE
14 years 7 months ago
2008
IEEE
In this work, we introduce a novel implicit representation of shape which is based on assigning to each pixel a probability that this pixel is inside the shape. This probabilistic...
CVPR
2008
IEEE
14 years 7 months ago
2008
IEEE
We present a practical algorithm that provably achieves the global optimum for a class of bilinear programs commonly arising in computer vision applications. Our approach relies o...
ICRA
2002
IEEE
13 years 10 months ago
2002
IEEE
We present a new algorithm that enables a convex shaped robot to explore an unknown planar workspace, i.e., an unknown configuration space diffeomorphic to SE(2). This new algor...
ALT
2004
Springer
14 years 2 months ago
2004
Springer
The decomposition method is currently one of the major methods for solving the convex quadratic optimization problems being associated with support vector machines. For a special c...
GC
2007
Springer
13 years 5 months ago
2007
Springer
We propose a novel subdivision of the plane that consists of both convex polygons and pseudotriangles. This pseudo-convex decomposition is significantly sparser than either conve...