843 search results - page 15 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
TIP
1998
13 years 7 months ago
1998
Abstract—We propose a method for the reconstruction of signals and images observed partially through a linear operator with a large support (e.g., a Fourier transform on a sparse...
ICIP
2008
IEEE
14 years 1 months ago
2008
IEEE
We propose an algorithm for the binarization of document images degraded by uneven light distribution, based on the Markov Random Field modeling with Maximum A Posteriori probabil...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
MIA
2010
13 years 2 months ago
2010
We propose a framework for intensity-based registration of images by linear transformations, based on a discrete Markov Random Field (MRF) formulation. Here, the challenge arises ...
ICDE
2012
IEEE
11 years 9 months ago
2012
IEEE
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...