125 search results - page 5 / 25 » Semidefinite representation of convex sets |
CVPR
2008
IEEE
14 years 9 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...
JMLR
2008
13 years 7 months ago
2008
Regularized kernel discriminant analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. Its performance depends on the selection of kernel...
ICRA
1994
IEEE
13 years 12 months ago
1994
IEEE
This paper describes an efficient algorithm for computing the distance between non-convex objects. Objects are modeled as the union of a set of convex components. From this model ...
MP
2006
13 years 7 months ago
2006
The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set probl...
ECCV
2010
Springer
13 years 5 months ago
2010
Springer
Given a set of points corresponding to a 2D projection of a non-planar shape, we would like to obtain a representation invariant to articulations (under no self-occlusions). It is ...