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, ...
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...
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 ...
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 ...
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...