Name
Abstract | ||
|---|---|---|
Markov chain Monte Carlo (MCMC) sampling methods have gained much popularity among researchers in signal processing. The Gibbs and the Metropolis-Hastings (1954, 1970) algorithms, which are the two most popular MCMC methods, have already been employed in resolving a wide variety of signal processing problems. A drawback of these algorithms is that in general, they cannot guarantee that the samples are drawn exactly from a target distribution. New Markov chain-based methods have been proposed, and they produce samples that are guaranteed to come from the desired distribution. They are referred to as perfect samplers. We review some of them, with the emphasis being given to the algorithm coupling from the past (CFTP). We also provide two signal processing examples where we apply perfect sampling. In the first, we use perfect sampling for restoration of binary images and, in the second, for multiuser detection of CDMA signals |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1109/78.978389 | IEEE Transactions on Signal Processing |
Keywords | Field | DocType |
code division multiple access,image restoration,coupling from the past,signal detection,signal processing,markov chain,sampling methods,markov chain monte carlo,binary image,metropolis hastings algorithm,monte carlo methods,metropolis hastings,markov processes | Signal processing,Mathematical optimization,Multidimensional signal processing,Markov chain Monte Carlo,Coupling from the past,Metropolis–Hastings algorithm,Computer science,Markov chain,Image processing,Algorithm,Speech recognition,Sampling (statistics) | Journal |
Volume | Issue | ISSN |
50 | 2 | 1053-587X |
Citations | PageRank | References |
18 | 1.61 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Djuric, P.M. | 1 | 1997 | 250.42 |
| Y. Huang | 2 | 69 | 8.02 |
| Tadesse Ghirmai | 3 | 41 | 6.45 |