Sciweavers

1397 search results - page 2 / 280
» Algorithms for Proximity Problems on Colored Point Sets
Sort
View
MOR
2010
120views more  MOR 2010»
13 years 4 months ago
Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Lojasiewicz In
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : Rn → ...
Hedy Attouch, Jérôme Bolte, Patrick R...
SIAMJO
2010
128views more  SIAMJO 2010»
13 years 16 days ago
Solving Log-Determinant Optimization Problems by a Newton-CG Primal Proximal Point Algorithm
We propose a Newton-CG primal proximal point algorithm for solving large scale log-determinant optimization problems. Our algorithm employs the essential ideas of the proximal poi...
Chengjing Wang, Defeng Sun, Kim-Chuan Toh
ICIP
2003
IEEE
14 years 7 months ago
Robust object boundary determination using a locally adaptive level set algorithm
This paper introduces a level set methodology for the precise boundary localization of image objects within an indicated region, designed to be particularly robust against weak or...
Eftychios Sifakis, George Tziritas
IROS
2006
IEEE
163views Robotics» more  IROS 2006»
13 years 11 months ago
Pair-wise Registration of 3D/Color Data Sets with ICP
- The ICP (Iterative Closest Point) algorithm remains a very popular method for the registration of 3D data sets, when an initial guess of the relative pose between them is known. ...
Lounis Douadi, Marie-José Aldon, Andr&eacut...
TASE
2010
IEEE
13 years 15 days ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen