Sciweavers

207 search results - page 3 / 42
» Convexity of the Proximal Average
Sort
View
ICASSP
2011
IEEE
12 years 9 months ago
Proximal splitting methods for depth estimation
Stereo matching is an active area of research in image processing. In a recent work, a convex programming approach was developed in order to generate a dense disparity field. In ...
Mireille El Gheche, Jean-Christophe Pesquet, Jouma...
JGO
2011
149views more  JGO 2011»
13 years 18 days ago
A logarithmic-quadratic proximal point scalarization method for multiobjective programming
We present a proximal point method to solve multiobjective problems based on the scalarization for maps. We build a family of a convex scalar strict representation of a convex map...
Ronaldo Gregório, Paulo Roberto Oliveira
CCCG
2008
13 years 7 months ago
Improved Bounds on the Average Distance to the Fermat-Weber Center of a Convex Object
We show that for any convex object Q in the plane, the average distance between the Fermat-Weber center of Q and the points in Q is at least 4(Q)/25, and at most 2(Q)/(3 3), wher...
A. Karim Abu-Affash, Matthew J. Katz
ADCM
2007
100views more  ADCM 2007»
13 years 5 months ago
An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphi
Motivated by the method for the reconstruction of 3D objects from a set of parallel cross sections, based on the binary operation between 2D sets termed “metric average”, we de...
Evgeny Lipovetsky, Nira Dyn
ISAAC
2009
Springer
98views Algorithms» more  ISAAC 2009»
14 years 6 days ago
New Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex Body
The Fermat-Weber center of a planar body Q is a point in the plane from which the average distance to the points in Q is minimal. We first show that for any convex body Q in the ...
Adrian Dumitrescu, Csaba D. Tóth