560 search results - page 48 / 112 » Level-set methods for convex optimization |
139
Voted
ESSMAC
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. We consider a linear system, such as an estimator or a controller, in which several signals are transmitted over wireless communication channels. With the coding and medi...
124
Voted
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract— We consider a convex unconstrained optimization problem that arises in a network of agents whose goal is to cooperatively optimize the sum of the individual agent objec...
141
Voted
SIAMJO
2010
15 years 1 months ago
2010
Abstract. Sequential quadratic programming (SQP) methods form a class of highly efficient algorithms for solving nonlinearly constrained optimization problems. Although second deri...
148
Voted
ICIP
2007
IEEE
16 years 5 months ago
2007
IEEE
In this paper, we present a novel active contour model, in which the traditional gradient descent optimization is replaced by graph cut optimization. The basic idea is to first de...
133
click to vote
ECCV
2008
Springer
15 years 5 months ago
2008
Springer
Active contour formulations predominate current minimization of the Mumford-Shah functional (MSF) for image segmentation and filtering. Unfortunately, these formulations necessitat...