The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Image segmentation by data-driven markov chain monte carlo
Abstract
This paper presents a computational paradigm called Data-Driven Markov Chain Monte Carlo (DDMCMC) for image segmentation in the Bayesian statistical framework. The paper contributes to image segmentation in four aspects. First, it designs efficient and well-balanced Markov Chain dynamics to explore the complex solution space and, thus, achieves a nearly global optimal solution independent of initial segmentations. Second, it presents a mathematical principle and a K-adventurers algorithm for computing multiple distinct solutions from the Markov chain sequence and, thus, it incorporates intrinsic ambiguities in image segmentation. Third, it utilizes data-driven (bottom-up) techniques, such as clustering and edge detection, to compute importance proposal probabilities, which drive the Markov chain dynamics and achieve tremendous speedup in comparison to the traditional jump-diffusion methods. Fourth, the DDMCMC paradigm provides a unifying framework in which the role of many existing segmentation algorithms, such as, edge detection, clustering, region growing, split-merge, snake/balloon, and region competition, are revealed as either realizing Markov chain dynamics or computing importance proposal probabilities. Thus, the DDMCMC paradigm combines and generalizes these segmentation methods in a principled way. The DDMCMC paradigm adopts seven parametric and nonparametric image models for intensity and color at various regions. We test the DDMCMC paradigm extensively on both color and gray-level images and some results are reported in this paper.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
A Computational Approach to Edge Detection
Canny, J. (1986) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1986.4767851 · Cited by 30,004
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
Kass, M., Witkin, A., & Terzopoulos, D. (1988) · International Journal of Computer Vision · doi:10.1007/bf00133570 · Cited by 17,070
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
Osher, S., & Sethian, J. A. (1988) · Journal of Computational Physics · doi:10.1016/0021-9991(88)90002-2 · Cited by 14,062
Martin, D., Fowlkes, C., Tal, D., & Malik, J. (2002) · Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001 · doi:10.1109/iccv.2001.937655 · Cited by 8,216
Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
GREEN, P. J. (1995) · Biometrika · doi:10.1093/biomet/82.4.711 · Cited by 5,930
Mean shift, mode seeking, and clustering
Cheng, Y. (1995) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.400568 · Cited by 3,856
Nonuniversal critical dynamics in Monte Carlo simulations
Swendsen, R. H., & Wang, J.-S. (1987) · Physical Review Letters · doi:10.1103/physrevlett.58.86 · Cited by 2,844
Region competition: unifying snakes, region growing, and Bayes/MDL for multiband image segmentation
Zhu, S. C., & Yuille, A. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.537343 · Cited by 1,913
Self-citationMean shift analysis and applications
Comaniciu, D., & Meer, P. (1999) · Proceedings of the Seventh IEEE International Conference on Computer Vision · doi:10.1109/iccv.1999.790416 · Cited by 987
Contour tracking by stochastic propagation of conditional density
Isard, M., & Blake, A. (1996) · Lecture Notes in Computer Science · doi:10.1007/bfb0015549 · Cited by 869
Filters, Random Fields and Maximum Entropy (FRAME): Towards a Unified Theory for Texture Modeling
Zhu, S. C., Wu, Y., & Mumford, D. (1998) · International Journal of Computer Vision · doi:10.1023/a:1007925832420 · Cited by 652
Self-citationRepresentations of Knowledge in Complex Systems
Grenander, U., & Miller, M. I. (1994) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1994.tb02000.x · Cited by 603
Rates of convergence of the Hastings and Metropolis algorithms
Mengersen, K. L., & Tweedie, R. L. (1996) · The Annals of Statistics · doi:10.1214/aos/1033066201 · Cited by 553
Constructing simple stable descriptions for image partitioning
Leclerc, Y. G. (1989) · International Journal of Computer Vision · doi:10.1007/bf00054839 · Cited by 520
Minimax Entropy Principle and Its Application to Texture Modeling
Zhu, S. C., Wu, Y. N., & Mumford, D. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1627 · Cited by 420
Self-citationMultiple resolution segmentation of textured images
Bouman, C., & Liu, B. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.67641 · Cited by 350
Occlusion Models for Natural Images: A Statistical Study of a Scale-Invariant Dead Leaves Model
Lee, A. B., Mumford, D., & Huang, J. (2001) · International Journal of Computer Vision · doi:10.1023/a:1011109015675 · Cited by 229
Stochastic models for generic images
Mumford, D., & Gidas, B. (2001) · Quarterly of Applied Mathematics · doi:10.1090/qam/1811096 · Cited by 173
Detecting boundaries in a vector field
Lee, H.-C., & Cok, D. R. (1991) · IEEE Transactions on Signal Processing · doi:10.1109/78.80971 · Cited by 158
Sclaroff, S., & Isidoro, J. R. (2002) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.1998.710860 · Cited by 145
Sclaroff, S., & Isidoro, J. R. (1998) · International Conference on Computer Vision · Cited by 139
Unsupervised image segmentation
Barker, S. A., & Rayner, P. J. (2002) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1998.678094 · Cited by 12
Sampling, resampling and colour constancy
Forsyth, D. A. (2003) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.1999.786955 · Cited by 11
Cited by
Image retrieval: Ideas, influences, and trends of the new age
Datta, R., Joshi, D., Li, J., & Wang, J. Z. (2008) · ACM Computing Surveys · doi:10.1145/1348246.1348248 · Cited by 3,040
Random Walks for Image Segmentation
Grady, L. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.233 · Cited by 2,624
An introduction to MCMC for machine learning.
Andrieu, C., de Freitas, N., Doucet, A., & Jordan, M. I. (2003) · Machine Learning · doi:10.1023/a:1020281327116 · Cited by 2,451
Learning multi-label scene classification
Boutell, M. R., Luo, J., Shen, X., & Brown, C. M. (2004) · Pattern Recognition · doi:10.1016/j.patcog.2004.03.009 · Cited by 2,296
Hierarchical Bayesian inference in the visual cortex
Lee, T. S., & Mumford, D. (2003) · Journal of the Optical Society of America A · doi:10.1364/josaa.20.001434 · Cited by 1,473
Metadata
- Authors
- Tu, Z., & Zhu, S.-C.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2002-05
- Volume
- 24
- Issue
- 5
- Pages
- 657-673
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2106110775
- Cited by
- 565
- References
- 27
- FWCI
- 35.94
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.