The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Applications of entropic spanning graphs
Abstract
This article presents applications of entropic spanning graphs to imaging and feature clustering applications. Entropic spanning graphs span a set of feature vectors in such a way that the normalized spanning length of the graph converges to the entropy of the feature distribution as the number of random feature vectors increases. This property makes these graphs naturally suited to applications where entropy and information divergence are used as discriminants: texture classification, feature clustering, image indexing, and image registration. Among other areas, these problems arise in geographical information systems, digital libraries, medical information processing, video indexing, multisensor fusion, and content-based retrieval.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
Huber, P. J. (1981) · Wiley Series in Probability and Statistics · doi:10.1002/0471725250 · Cited by 7,066
On the shortest spanning subtree of a graph and the traveling salesman problem
Kruskal, J. B. (1956) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1956-0078686-7 · Cited by 5,088
Shortest Connection Networks And Some Generalizations
Prim, R. C. (1957) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1957.tb01515.x · Cited by 4,565
Wiley Series in Probability and Statistics
(2008) · Wiley series in probability and statistics · doi:10.1002/series1345 · Cited by 4,217
On Measures of Entropy and Information
Rényi, A. (1961) · Project Euclid (Cornell University) · Cited by 4,031
Detection, Estimation, and Modulation Theory, Part I
Van Trees, H. L. (2001) · John Wiley & Sons, Inc. eBooks · doi:10.1002/0471221082 · Cited by 3,891
An Introduction to Signal Detection and Estimation
Poor, H. V. (1988) · Springer Texts in Electrical Engineering · doi:10.1007/978-1-4757-3863-6 · Cited by 3,149
Alignment by Maximization of Mutual Information
Viola, P., & Wells III, W. M. (1997) · International Journal of Computer Vision · doi:10.1023/a:1007958904918 · Cited by 2,610
Mixture models : inference and applications to clustering
McLachlan, G. J., & Basford, K. E. (1988) · M. Dekker eBooks · Cited by 2,094
Elements of Information Theory
Phoenix, S. J. D. (1992) · Journal of Modern Optics · doi:10.1080/09500349214551641 · Cited by 1,380
Information-type measures of difference of probability distributions and indirect observation
Csiszár, I. (1967) · Studia Scientiarum Mathematicarum Hungarica · Cited by 1,332
Asymptotic Methods in Statistical Decision Theory
Cam, L. L. (1986) · Springer Series in Statistics · doi:10.1007/978-1-4612-4946-7 · Cited by 1,317
Statistical Estimation: Asymptotic Theory
Samaniego, F. J. (2014) · Chapman & Hall/CRC eBooks · doi:10.1201/b16414-10 · Cited by 1,155
Alignment by maximization of mutual information
Viola, P., & Wells, W. M. (2002) · Proceedings of IEEE International Conference on Computer Vision · doi:10.1109/iccv.1995.466930 · Cited by 1,082
The shortest path through many points
Beardwood, J., Halton, J. H., & Hammersley, J. M. (1959) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s0305004100034095 · Cited by 937
Asymptotically optimal block quantization
Gersho, A. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1056067 · Cited by 863
A Test for Normality Based on Sample Entropy
Vasicek, O. (1976) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1976.tb01566.x · Cited by 673
Distance measures for signal processing and pattern recognition
Basseville, M. (1989) · Signal Processing · doi:10.1016/0165-1684(89)90079-0 · Cited by 615
(1997) · SZTAKI Publication Repository (Hungarian Academy of Sciences) · Cited by 598
Mixture Models: Inference and Applications to Clustering.
Hand, D. J., McLachlan, G. J., & Basford, K. E. (1989) · Applied Statistics · doi:10.2307/2348072 · Cited by 392
Estimation of Integral Functionals of a Density
Birgé, L., & Massart, P. (1995) · The Annals of Statistics · doi:10.1214/aos/1176324452 · Cited by 203
A nonparametric estimation of the entropy for absolutely continuous distributions (Corresp.)
Ahmad, I., & Lin, P.-E. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055550 · Cited by 199
Hall, P., & Morton, S. C. (1993) · Annals of the Institute of Statistical Mathematics · doi:10.1007/bf00773669 · Cited by 193
Estimation of entropy and other functionals of a multivariate density
Joe, H. (1989) · Annals of the Institute of Statistical Mathematics · doi:10.1007/bf00057735 · Cited by 177
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
Arora, S. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63248-4_5 · Cited by 136
Asymptotic theory of greedy approximations to minimal k-point random graphs
Hero, A. O., & Michel, O. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.782114 · Cited by 114
Self-citationEstimation of the entropy and information of absolutely continuous random variables
Mokkadem, A. (1989) · IEEE Transactions on Information Theory · doi:10.1109/18.42194 · Cited by 68
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
Arora, S. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646145 · Cited by 61
Image registration with minimum spanning tree algorithm
Ma, B., Hero, A. O., Gorman, J., & Michel, O. (2002) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.2000.901000 · Cited by 56
Self-citationInformation-theoretic bounds on target recognition performance based on degraded image data
Jain, A., Moulin, P., Miller, M. I., & Ramchandran, K. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1033209 · Cited by 45
f -information measures in medical image registration
Pluim, J. P. W., Maintz, J. B. A., & Viergever, M. A. (2001) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.431132 · Cited by 28
Cited by
Deformable medical image registration: a survey
Sotiras, A., Davatzikos, C., & Paragios, N. (2013) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2013.2265603 · Cited by 1,587
“In [270, 271], a Minimum Spanning Tree (MST) was used to estimate the RE and the optimal transformation was estimated by minimizing it.”
MethodMSM: a new flexible framework for Multimodal Surface Matching
Robinson, E. C., Jbabdi, S., Glasser, M. F., Andersson, J., Burgess, G. C., Harms, M. P., Smith, S. M., Van Essen, D. C., & Jenkinson, M. (2014) · NeuroImage · doi:10.1016/j.neuroimage.2014.05.069 · Cited by 640
Families of Alpha- Beta- and Gamma- Divergences: Flexible and Robust Measures of Similarities
Cichocki, A., & Amari, S.-I. (2010) · Entropy · doi:10.3390/e12061532 · Cited by 459
Efficient Mean-Shift Tracking via a New Similarity Measure
Yang, C., Duraiswami, R., & Davis, L. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.139 · Cited by 313
Geodesic Entropic Graphs for Dimension and Entropy Estimation in Manifold Learning
Costa, J. A., & Hero, A. O. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.831130 · Cited by 288
Self-citation
Metadata
- Authors
- Hero, A. O., Ma, B., Michel, O. J. J., & Gorman, J.
- Venue
- IEEE Signal Processing Magazine
- Published
- 2002-09
- Volume
- 19
- Issue
- 5
- Pages
- 85-95
- ISSN
- 1053-5888 (ISSN-L)
- OpenAlex
- W2060677448
- Cited by
- 266
- References
- 34
- FWCI
- 20.22
- 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.