Sciweavers

167 search results - page 19 / 34
» Speeeding Up Markov Chain Monte Carlo Algorithms
Sort
View
ICASSP
2008
IEEE
16 years 15 days ago
Image inpainting with a wavelet domain Hidden Markov tree model
We present a novel technique for image inpainting, the problem of filling-in missing image parts. Image inpainting is ill-posed and we adopt a probabilistic model-based approach ...
George Papandreou, Petros Maragos, Anil Kokaram
ICCV
2007
IEEE
16 years 8 months ago
Contour Grouping Based on Local Symmetry
The paper deals with grouping of edges to contours of shapes using only local symmetry and continuity. Shape skeletons are used to generate the search space for a version of the M...
Nagesh Adluru, Longin Jan Latecki, Rolf Lakäm...
ICIP
2004
IEEE
16 years 7 months ago
Efficient proposal distributions for MCMC image segmentation
We present methods to obtain computationally efficient proposal distributions for Bayesian reversible jump Markov chain Monte Carlo (RJMCMC) based image segmentation. The slow con...
Timo Kostiainen, Jouko Lampinen
ICASSP
2011
IEEE
14 years 9 months ago
Bayesian Compressive Sensing for clustered sparse signals
In traditional framework of Compressive Sensing (CS), only sparse prior on the property of signals in time or frequency domain is adopted to guarantee the exact inverse recovery. ...
Lei Yu, Hong Sun, Jean-Pierre Barbot, Gang Zheng
UAI
2000
15 years 7 months ago
Minimum Message Length Clustering Using Gibbs Sampling
The K-Means and EM algorithms are popular in clustering and mixture modeling due to their simplicity and ease of implementation. However, they have several significant limitations...
Ian Davidson