895 search results - page 2 / 179 » Approximate convex decomposition |
ICML
2010
IEEE
13 years 12 months ago
2010
IEEE
Approximate MAP inference in graphical models is an important and challenging problem for many domains including computer vision, computational biology and natural language unders...
ECCV
2010
Springer
13 years 8 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 ...
SCIA
2009
Springer
14 years 5 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
We analyze a class of estimators based on a convex relaxation for solving highdimensional matrix decomposition problems. The observations are the noisy realizations of the sum of ...
TSMC
2008
13 years 10 months ago
2008
In this paper, we propose a geometric approach to the theory of evidence based on convex geometric interpretations of its two key notions of belief function (b.f.) and Dempster...