50 search results - page 5 / 10 » On Unconstrained Quasi-Submodular Function Optimization |
CVPR
2003
IEEE
14 years 9 months ago
2003
IEEE
We present a novel algorithm for optimally segmenting dynamic scenes containing multiple rigidly moving objects. We cast the motion segmentation problem as a constrained nonlinear...
SIAMJO
2010
13 years 5 months ago
2010
Proximal bundle methods have been shown to be highly successful optimization methods for unconstrained convex problems with discontinuous first derivatives. This naturally leads ...
IPCO
2010
13 years 5 months ago
2010
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
Beam search is used to maintain tractability in large search spaces at the expense of completeness and optimality. We study supervised learning of linear ranking functions for con...
ICIP
2005
IEEE
14 years 9 months ago
2005
IEEE
Restoring binary images is a problem which arises in various application fields. In our paper, this problem is considered in a variational framework: the sought-after solution min...