895 search results - page 48 / 179 » Approximate convex decomposition |
107
click to vote
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
The accurate localization of facial features plays a fundamental
role in any face recognition pipeline. Constrained
local models (CLM) provide an effective approach to localizati...
111
click to vote
COMPGEOM
2005
ACM
14 years 11 months ago
2005
ACM
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...
116
click to vote
SMA
2009
ACM
15 years 4 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
NIPS
2008
14 years 11 months ago
2008
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
ICASSP
2010
IEEE
14 years 10 months ago
2010
IEEE
In this paper, we consider the problem of minimizing a non-smooth convex problem using first-order methods. The number of iterations required to guarantee a certain accuracy for ...