Sciweavers

2527 search results - page 70 / 506
» Discrete optimization in computer vision
Sort
View
ECCV
2006
Springer
14 years 12 months ago
An Integral Solution to Surface Evolution PDEs Via Geo-cuts
We introduce a new approach to modelling gradient flows of contours and surfaces. While standard variational methods (e.g. level sets) compute local interface motion in a different...
Yuri Boykov, Vladimir Kolmogorov, Daniel Cremers, ...
SCALESPACE
2007
Springer
14 years 4 months ago
Bounds on the Minimizers of (nonconvex) Regularized Least-Squares
This is a theoretical study on the minimizers of cost-functions composed of an ℓ2 data-fidelity term and a possibly nonsmooth or nonconvex regularization term acting on the di...
Mila Nikolova
HEURISTICS
2002
122views more  HEURISTICS 2002»
13 years 9 months ago
Complete Local Search with Memory
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...
Diptesh Ghosh, Gerard Sierksma
ICPR
2008
IEEE
14 years 11 months ago
Nonlocal graph regularization for image colorization
In this paper we present a simple colorization method that relies on nonlocal graph regularization. We introduce nonlocal discrete differential operators and a family of weighted ...
Abderrahim Elmoataz, Olivier Lezoray, Vinh-Thong T...
ICPR
2004
IEEE
14 years 11 months ago
Bernoulli Mixture Models for Binary Images
Mixture modelling is a hot area in pattern recognition. Although most research in this area has focused on mixtures for continuous data, there are many pattern recognition tasks f...
Alfons Juan, Enrique Vidal