The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Multiple resolution segmentation of textured images
Abstract
A multiple resolution algorithm is presented for segmenting images into regions with differing statistical behavior. In addition, an algorithm is developed for determining the number of statistically distinct regions in an image and estimating the parameters of those regions. Both algorithms use a causal Gaussian autoregressive model to describe the mean, variance, and spatial correlation of the image textures. Together, the algorithms can be used to perform unsupervised texture segmentation. The multiple resolution segmentation algorithm first segments images at coarse resolution and then progresses to finer resolutions until individual pixels are classified. This method results in accurate segmentations and requires significantly less computation than some previously known methods. The field containing the classification of each pixel in the image is modeled as a Markov random field. Segmentation at each resolution is then performed by maximizing the a posteriori probability of this field subject to the resolution constraint. At each resolution, the a posteriori probability is maximized by a deterministic greedy algorithm which iteratively chooses the classification of individual pixels or pixel blocks. The unsupervised parameter estimation algorithm determines both the number of textures and their parameters by minimizing a global criterion based on the AIC information criterion. Clusters corresponding to the individual textures are formed by alternately estimating the cluster parameters and repartitioning the data into those clusters. Concurrently, the number of distinct textures is estimated by combining clusters until a minimum of the criterion is reached.>
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
A new look at the statistical model identification
Akaike, H. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100705 · Cited by 51,879
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
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
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Spatial Interaction and the Statistical Analysis of Lattice Systems
Besag, J. (1974) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1974.tb00999.x · Cited by 6,067
The Art of Computer Programming
Whitesides, G. E. (1970) · Nuclear Science and Engineering · doi:10.13182/nse70-a19705 · Cited by 6,008
Maximum Likelihood from Incomplete Data via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1976) · Cited by 4,517
Pattern Classification and Scene Analysis
Thompson, M., Duda, R. O., & Hart, P. E. (1974) · Leonardo · doi:10.2307/1573081 · Cited by 4,495
Baum, L. E., Petrie, T., Soules, G., & Weiss, N. (1970) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177697196 · Cited by 4,297
On the Statistical Analysis of Dirty Pictures
Besag, J. (1986) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1986.tb01412.x · Cited by 4,191
Mixture Densities, Maximum Likelihood and the EM Algorithm
Redner, R. A., & Walker, H. F. (1984) · SIAM Review · doi:10.1137/1026034 · Cited by 2,693
Modeling and Segmentation of Noisy and Textured Images Using Gibbs Random Fields
Derin, H., & Elliott, H. (1987) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1987.4767871 · Cited by 977
10.2 Maximum Likelihood from Incomplete Data
(2024) · Hierarchical Quantile Modeling · doi:10.1051/978-2-7598-3719-9.c026 · Cited by 780
Silvey, S. D. (2017) · Routledge eBooks · doi:10.1201/9780203738641 · Cited by 552
Estimation and choice of neighbors in spatial-interaction models of images
Kashyap, R., & Chellappa, R. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056610 · Cited by 428
Advances in mathematical models for image processing
Jain, A. K. (1981) · Proceedings of the IEEE · doi:10.1109/proc.1981.12021 · Cited by 402
Image Analysis Using Multigrid Relaxation Methods
Terzopoulos, D. (1986) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1986.4767767 · Cited by 370
Computing motion using analog and binary resistive networks
Hutchinson, J., Koch, C., Luo, J., & Mead, C. (1988) · Computer · doi:10.1109/2.31 · Cited by 298
Cited by
Texture analysis and classification with tree-structured wavelet transform
Chang, T., & Kuo, C.-C. J. (1993) · IEEE Transactions on Image Processing · doi:10.1109/83.242353 · Cited by 1,334
A generalized Gaussian image model for edge-preserving MAP estimation
Bouman, C., & Sauer, K. (1993) · IEEE Transactions on Image Processing · doi:10.1109/83.236536 · Cited by 884
Self-citationGeodesic Active Regions and Level Set Methods for Supervised Texture Segmentation
Paragios, N., & Deriche, R. (2002) · International Journal of Computer Vision · doi:10.1023/a:1014080923068 · Cited by 754
Texture classification and segmentation using multiresolution simultaneous autoregressive models
Mao, J., & Jain, A. K. (1992) · Pattern Recognition · doi:10.1016/0031-3203(92)90099-5 · Cited by 648
A multiscale random field model for Bayesian image segmentation
Bouman, C. A., & Shapiro, M. (1994) · IEEE Transactions on Image Processing · doi:10.1109/83.277898 · Cited by 605
Self-citation
Metadata
- Authors
- Bouman, C., & Liu, B.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1991
- Volume
- 13
- Issue
- 2
- Pages
- 99-113
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2126397022
- Cited by
- 350
- References
- 19
- FWCI
- 17.83
- 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.