2527 search results - page 420 / 506 » Discrete optimization in computer vision |
ICML
2008
IEEE
14 years 11 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
ISBI
2006
IEEE
14 years 10 months ago
2006
IEEE
Mutual information (MI) based image-registration methods that use histograms are known to suffer from the so-called binning problem, caused by the absence of a principled techniqu...
STOC
2009
ACM
14 years 10 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
STOC
2009
ACM
14 years 10 months ago
2009
ACM
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
ICIAP
2001
Springer
14 years 10 months ago
2001
Springer
In this article a texturefeature extraction scheme based on M-band waveletpacketframes is investigated. Thefeatures so extracted are usedfor segmentation of satellite images which...