The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Image classification by a two-dimensional hidden Markov model
Abstract
For block-based classification, an image is divided into blocks, and a feature vector is formed for each block by grouping statistics extracted from the block. Conventional block-based classification algorithms decide the class of a block by examining only the feature vector of this block and ignoring context information. In order to improve classification by context, an algorithm is proposed that models images by two dimensional (2-D) hidden Markov models (HMMs). The HMM considers feature vectors statistically dependent through an underlying state process assumed to be a Markov mesh, which has transition probabilities conditioned on the states of neighboring blocks from both horizontal and vertical directions. Thus, the dependency in two dimensions is reflected simultaneously. The HMM parameters are estimated by the EM algorithm. To classify an image, the classes with maximum a posteriori probability are searched jointly for all the blocks. Applications of the HMM algorithm to document and aerial image segmentation show that the algorithm outperforms CART/sup TM/, LVQ, and Bayes VQ.
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 Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
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
Classification and Regression Trees.
Gordon, A. D., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984) · Biometrics · doi:10.2307/2530946 · Cited by 23,522
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
Classification and regression trees
Praagman, J. (1985) · European Journal of Operational Research · doi:10.1016/0377-2217(85)90321-2 · Cited by 10,053
Fundamentals of speech recognition
Rabiner, L. R., & Juang, B.-H. F. (1993) · Cited by 7,680
Vector Quantization and Signal Compression
Gersho, A., & Gray, R. M. (1992) · Springer eBooks · doi:10.1007/978-1-4615-3626-0 · Cited by 7,003
Self-citationInformation Theory and Reliable Communication.
Lee, P. M., & Gallager, R. T. (1970) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344305 · Cited by 5,399
Maximum likelihood estimation from incomplete data via the EM algorithm
Dempster, A. P. (1977) · Journal of the Royal Statistical Society Series A (Statistics in Society) · Cited by 4,543
Baum, L. E., Petrie, T., Soules, G., & Weiss, N. (1970) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177697196 · Cited by 4,297
Information Theory and Reliable Communication
Bell, D. A. (1969) · Electronics and Power · doi:10.1049/ep.1969.0319 · Cited by 4,012
On the Convergence Properties of the EM Algorithm
Wu, C. F. J. (1983) · The Annals of Statistics · doi:10.1214/aos/1176346060 · Cited by 3,269
Statistical Inference for Probabilistic Functions of Finite State Markov Chains
Baum, L. E., & Petrie, T. (1966) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177699147 · Cited by 2,775
Mathematical Statistics: Basic Ideas and Selected Topics.
Wachter, K. W., Bickel, P. J., & Doksum, K. A. (1979) · Journal of the American Statistical Association · doi:10.2307/2286373 · Cited by 1,886
Markov Random Fields and Their Applications
Kindermann, R., & Snell, J. L. (1980) · Contemporary Mathematics · doi:10.1090/conm/001 · Cited by 1,290
Hidden Markov Models for Speech Recognition
Juang, B. H., & Rabiner, L. R. (1991) · Technometrics · doi:10.1080/00401706.1991.10484833 · Cited by 1,068
Baum, L. E., & Eagon, J. A. (1967) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1967-11751-8 · Cited by 1,036
Hidden Markov Models for Speech Recognition
Huang, X., Ariki, Y., & Jack, M. A. (1991) · Medical Entomology and Zoology · Cited by 744
The DRAGON system--An overview
Baker, J. (1975) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1975.1162650 · Cited by 520
Learning machines: foundations of trainable pattern-classifying systems
Nilsson, N. J. (1965) · Cited by 456
Statistical pattern recognition with neural networks: benchmarking studies.
Kohonen, T., Barna, G., & Chrisley, R. (1988) · Cited by 409
Statistical pattern recognition with neural networks: benchmarking studies
Kohonen, Barna, & Chrisley (1988) · IEEE International Conference on Neural Networks · doi:10.1109/icnn.1988.23829 · Cited by 352
Nearest-Neighbour Systems and the Auto-Logistic Model for Binary Data
Besag, J. E. (1972) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1972.tb00889.x · Cited by 298
Classification of binary random patterns
Abend, K., Harley, T., & Kanal, L. (1965) · IEEE Transactions on Information Theory · doi:10.1109/tit.1965.1053827 · Cited by 251
Stone, M. (1978) · Series Statistics · doi:10.1080/02331887808801414 · Cited by 220
Combining image compression and classification using vector quantization
Oehler, K. L., & Gray, R. M. (1995) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.391396 · Cited by 133
Self-citationThe challenge of spoken language systems: Research directions for the nineties
Cole, R. A., Hirschman, L., Atlas, L., Beckman, M. E., Biermann, A. W., Bush, M. A., Clements, M. A., Cohen, L., Garcia, O., Hanson, B. A., et al. (1995) · IEEE Transactions on Speech and Audio Processing · doi:10.1109/89.365385 · Cited by 126
A curious binary lattice process
Pickard, D. K. (1977) · Journal of Applied Probability · doi:10.2307/3213345 · Cited by 79
Perlmutter, K. O., Perlmutter, S. M., Gray, R. M., Olshen, R. A., & Oehler, K. L. (1996) · IEEE Transactions on Image Processing · doi:10.1109/83.480770 · Cited by 65
Self-citationKanal, L. N. (1980) · Computer Graphics and Image Processing · doi:10.1016/0146-664x(80)90020-9 · Cited by 43
Combining image classification and image compression using vector quantization
Oehler, K. L., & Gray, R. M. (2002) · DCC · doi:10.1109/dcc.1993.253150 · Cited by 28
Self-citation
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
Self-citationAutomatic linguistic indexing of pictures by a statistical modeling approach
Li, J., & Wang, J. Z. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1227984 · Cited by 1,087
Self-citationEphraim, Y., & Merhav, N. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.1003838 · Cited by 798
Permuter, H., Francos, J., & Jermyn, I. (2006) · Pattern Recognition · doi:10.1016/j.patcog.2005.10.028 · Cited by 400
Multi-dimensional Recurrent Neural Networks
Graves, A., Fernández, S., & Schmidhuber, J. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74690-4_56 · Cited by 303
Metadata
- Authors
- Li, J., Najmi, A., & Gray, R. M.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2000
- Volume
- 48
- Issue
- 2
- Pages
- 517-533
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2024581784
- Cited by
- 293
- References
- 31
- FWCI
- 35.42
- 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.