Sciweavers

1352 search results - page 14 / 271
» An algorithm for minimizing the Mumford-Shah functional
Sort
View
TSP
2010
13 years 2 months ago
Independent component analysis by entropy bound minimization
A novel (differential) entropy estimator is introduced where the maximum entropy bound is used to approximate the entropy given the observations, and is computed using a numerical ...
Xi-Lin Li, Tülay Adali
PPSN
2004
Springer
14 years 25 days ago
An Improved Evaluation Function for the Bandwidth Minimization Problem
This paper introduces a new evaluation function, called δ, for the Bandwidth Minimization Problem for Graphs (BMPG). Compared with the classical β evaluation function used, our Î...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
CORR
2008
Springer
133views Education» more  CORR 2008»
13 years 7 months ago
Estimating divergence functionals and the likelihood ratio by convex risk minimization
We develop and analyze M-estimation methods for divergence functionals and the likelihood ratios of two probability distributions. Our method is based on a non-asymptotic variatio...
XuanLong Nguyen, Martin J. Wainwright, Michael I. ...
ECCV
2002
Springer
14 years 9 months ago
What Energy Functions Can Be Minimized via Graph Cuts?
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
Vladimir Kolmogorov, Ramin Zabih
CVPR
2009
IEEE
15 years 2 months ago
Minimizing Sparse Higher Order Energy Functions of Discrete Variables
Higher order energy functions have the ability to encode high level structural dependencies between pixels, which have been shown to be extremely powerful for image labeling pro...
Carsten Rother (Microsoft Research Cambridge), Pus...