Sciweavers

1092 search results - page 28 / 219
» Convex Methods for Transduction
Sort
View
ISVC
2010
Springer
13 years 5 months ago
Split Bregman Method for Minimization of Region-Scalable Fitting Energy for Image Segmentation
Abstract. In this paper, we incorporated the global convex segmentation method and the split Bregman technique into the region-scalable fitting energy model. The new proposed metho...
Yunyun Yang, Chunming Li, Chiu-Yen Kao, Stanley Os...
ECCV
2008
Springer
14 years 9 months ago
Solving Image Registration Problems Using Interior Point Methods
Abstract. This paper describes a novel approach to recovering a parametric deformation that optimally registers one image to another. The method proceeds by constructing a global c...
Camillo J. Taylor, Arvind Bhusnurmath
JMIV
2008
268views more  JMIV 2008»
13 years 7 months ago
A Fast Marching Method for the Area Based Affine Distance
In this paper we consider the problem of computing the area-based affine distance for a convex domain in the plane. Since this affine distance satisfies a non-homogeneous Monge-Amp...
Moacyr A. H. B. da Silva, Ralph Teixeira, Sin&eacu...
JGO
2011
149views more  JGO 2011»
13 years 2 months 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
APPML
2007
91views more  APPML 2007»
13 years 7 months ago
Steplength selection in interior-point methods for quadratic programming
We present a new strategy for choosing primal and dual steplengths in a primal-dual interior-point algorithm for convex quadratic programming. Current implementations often scale ...
Frank E. Curtis, Jorge Nocedal