Perfect Simulation for Image Restoration

REFERENCES

• Aldous , D. Some inequalities for reversible Markov chains . J. London Math. Soc. 1982 , 25 ( 2 ), 561 – 576 .
   Google Scholar
• Besag , J. On the statistical analysis of dirty pictures . J. Roy. Stat. Soc. B 1986 , 48 , 259 – 302 .
   Google Scholar
• Breyer , L.A. ; Roberts , G.O. Catalytic perfect simulation . Methodology and Computing in Applied Probability 2001 , 3 ( 2 ), 161 – 177 .
   Google Scholar
• Diaconis , P. ; Saloff-Coste , L. Comparison theorems for reversible Markov chains . Annals of Applied Probability 1993 , 3 , 696 – 730 .
   Google Scholar
• Doeblin , W. Exposé de la théorie des chains simples constantes de Markov à un nombre fini d'états . Rev. Math. de l'Union Interbalkanique 1933 , 2 , 77 – 105 .
   Google Scholar
• Fill , J.A. ; Machida , M. ; Murdoch , D.J. ; Rosenthal , J.S. Extension of Fill's perfect rejection sampling algorithm to general chains . Random Structures Algorithms 2000 , 17 , 290 – 316 .
   Web of Science ®Google Scholar
• Galbusera , P. ; Lens , L. ; Schenck , T. ; Waiyaki , E. ; Matthysen , E. Genetic variability and gene flow in the globally, critically-endangered Taita thrush . Conservation Genetics 2000 , 1 , 45 – 55 .
   Google Scholar
• Gelfand , A.E. ; Smith , A.F.M. Sampling based approaches to calculating marginal densities . J. Amer. Statist. Assoc. 1990 , 85 , 398 – 409 .
   Web of Science ®Google Scholar
• Gibbs , A. Convergence in the wasserstein metric for Markov chain Monte Carlo algorithms with applications to image restoration . Stochastic Model 2004 , 20 : 473 – 492 .
   Web of Science ®Google Scholar
• Häggström , O. ; Steif , J.E. Propp-Wilson algorithms and finitary codings for high noise Markov random fields . Combin. Probab. Computing 2000 , 9 , 425 – 439 .
   Google Scholar
• Jerrum , M. A very simple algorithm for estimating the number of k-colourings of a low-degree graph. SIAM J. Comput. 1995, 22, 1087–1116.
   Google Scholar
• Luby , M. ; Vigoda , E. Fast convergence of the Gauber dynamics for sampling independent sets . Random Structures Algorithms 1999 , 15 , 229 – 241 .
   Google Scholar
• Murdoch , D.J. ; Green , P.J. Exact sampling from a continuous state space . Scand. J. Statist. 1998 , 25 ( 3 ), 483 – 502 .
   Web of Science ®Google Scholar
• Propp , J.G. ; Wilson , D.B. Exact sampling with coupled Markov chains and applications to statistical mechanics . Random Structures Algorithms 1996 , 9 ( 1–2 ), 223 – 252 .
   Web of Science ®Google Scholar
• Sinclair , A. Algorithms for Random Generation and Counting: a Markov Chain Approach ; Birkhäuser , 1993 .
   Google Scholar
• Wilson , D.B. How to couple from the past using a read-once source of randomness . Random Structures Algorithms 2000 , 16 ( 1 ), 85 – 113 .
   Web of Science ®Google Scholar
• Wilson , D.B. Layered multishift coupling for use in perfect sampling algorithms (with a primer on cftp) . Fields Institute Communications 2000 , 26 , 141 – 176 .
   Google Scholar