Robust entropy estimation strategies based on edge weighted random graphs

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 3459, Issue , 1998, Pages 250-261

  Hero III, Alfred O ^a   Michel, Olivier ^b  

^a The Department of Civil and Environmental Engineering   (United States)

^b UNIVERSITÉ DE LYON   (France)

Author keywords

Entropy estimation; Mutual information; Pattern recognition; Random graph theory; Spatial processes

Indexed keywords

BAYESIAN NETWORKS; DIFFERENTIAL EQUATIONS; ENTROPY; FUNCTIONS; GRAPH THEORY; INFERENCE ENGINES; INVERSE PROBLEMS; METHOD OF MOMENTS; PATTERN RECOGNITION; PROBABILITY DENSITY FUNCTION; SUBSIDENCE; TOPOLOGY; TREES (MATHEMATICS);

CONSISTENT ESTIMATORS; ENTROPY ESTIMATION; FRACTIONAL ORDERS; GREEDY ALGORITHMS; GREEDY APPROXIMATIONS; INFLUENCE FUNCTIONS; MINIMAL SPANNING TREES; MULTI-DIMENSIONAL; MUTUAL INFORMATION; NATURAL EXTENSIONS; NP-HARD PROBLEMS; OUT-LIERS; PARTITIONING METHODS; POTENTIAL FUNCTIONS; RANDOM GRAPH THEORY; RANDOM GRAPHS; RANDOM SAMPLES; RENYI ENTROPIES; SPATIAL PROCESSES;

RANDOM PROCESSES;

EID: 0010485985     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.323804     Document Type: Conference Paper

References (25)

1. R. Ravi, M. Marathe, D. Rosenkrantz, and S. Ravi, "Spanning trees short or small," in Proc. 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 546-555, (Arlington, VA), 1994.
2. F. R. Hampel, Contributions to the theory of robust estimation. PhD thesis, Univ. of California -Berkeley, 1968.
3. A. Hero and O. Michel, "Asymptotic theory of greedy approximations to minimal K-point random graphs," Tech. Rep. 315, Communications and Signal Processing Laboratory (CSPL), Dept. EECS, The Univ. of Michigan, Ann Arbor MI 48109-2122, June 1998.
4. C. Redmond and J. E. Yukich, "Limit theorems and rates of convergence for Euclidean functionals," Ann. Applied Probab. 4(4), pp. 1057-1073, 1994.
5. A. Jam and J. Mamer, "Approximations for the random minimal spanning tree with applications to network provisioning," Oper. Res. 36(4), pp. 575-584, 1988.
6. R. C. Prim, "Shortest connection networks and some generalizations," Bell Syst. Tech. Journ., pp. 1389-1401, 1957.
7. J. H. Friedman and L. C. Rafsky, "Multivariate generalizations of the wald-wolfowitz and smirnov two-sample tests," Annals of Statistics (4), pp. 697-717, 1979.
8. G. Toussaint, "The relative neighborhood graph of a finite planar set," Pattern Recognition , pp. 261-268, 1980.
9. C. Zahn, "Graph-theoretical methods for detecting and describing Gestalt clusters," IEEE Trans. on Computers , pp. 68-86, 1971.
10. D. Banks, M. Lavine, and H. J. Newton, "The minimal spanning tree for nonparametric regression and structure discovery," in Computing Science and Statistics. Proceedings of the 24th Symposium on the Interface, H. J. Newton, ed., pp. 370-374, 1992.
11. R. Hoffman and A. K. Jam, "A test of randomness based on the minimal spanning tree," Pattern Recognition Letters , pp. 175-180, 1983.
12. A. A. Zelikovsky and D. D. Lozevanu, "Minimal and bounded trees," in Proceedings of Tezele Congres XVIII Acad. Romano-Americaine, pp. 25-26, (Kishinev), 1993.
13. I. Ahmad and P.-E. Lin, "A nonparametric estimation of the entropy for absolutely continuous distributions," IEEE Trans. on Inform. Theory , pp. 664-668, 1976.
14. H. Joe, "On the estimation of entropy and other functionals of a multivariate density," Ann. Inst. Statist. Math. ' pp. 683-697, 1989.
15. S. C. Hall, Peter Morton, "On the estimation of entropy," Ann. Inst. Statist. Math. , pp. 69-88, 1993.
16. A. Gersho, "Asymptotically optimal block quantization," IEEE Trans. on Inform. Theory IT-28, pp. 373-380, 1979.
17. D. N. Neuhoff, "On the asymptotic distribution of th eerros in vector quantization," IEEE Trans. on Inform. Theory IT-42, pp. 461-468, March 1996.
18. J. Eckman and D. Ruelle, "Ergodic theory of chaos and strange attractors," Rev. Mod. Phys 57, pp. 617-656, 1985.
19. J. Farmer, "Dimension, fractal measures and chaotic dynamics," in Evolution of order and chaos, pp. 228-246, 1982.
20. P. Viola and W. Wells, "Alignment by maximization of mutual information," in Proc. of 5th Int. Conf. on Computer Vision, MIT, vol. 1, pp. 16-23, 1995.
21. J. C. Chambers and T. J. Hastie, Statistical models in S, Wadsworth, Pacific Grove, CA, 1992.
22. O. Vasicek, "A test for normality based on sample entropy," J. Royal Statistical Society, Ser. B , pp. 54-59, 1976.
23. A. Hero and O. Michel, "Robust estimation of point process intensity features using K-minimal spanning trees," in Proc. of IEEE Symposium on Information Theory, (Ulm, Germany), July 1997.
24. R. Ravi, M. Marathe, D. Rosenkrantz, and S. Ravi, "Spanning trees - short or small," SIAM Journal on Discrete Math 9, pp. 178-200, 1996.
25. P. J. Huber, Robust Statistics, Wiley, New York, 1981.