Robust estimation of point process intensity features using k-minimal spanning trees

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 1997, Pages 74-

  Hero, Alfred O ^a   Michel, Olivier ^b  

^a UNIVERSITY OF MICHIGAN   (United States)

^b UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; PATTERN RECOGNITION; RANDOM PROCESSES; ROBUSTNESS (CONTROL SYSTEMS);

MINIMAL SPANNING TREES (MST); POINT PROCESS INTENSITY FEATURES; RENYI ENTROPY;

TREES (MATHEMATICS);

EID: 0030718270     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.1997.612989     Document Type: Conference Paper

References (3)

1. R. Hoffman and A. K. Jain, "A test of randomness based on the minimal spanning tree," Pattern Recognition Letters, pp. 175-180, 1983.
2. R. Ravi, R. Sundaram, M. Marathe, D. Rosenkrantz, and S. Ravi, "Spanning trees short and small,", pp.
3. J. M. Steele, "Growth rates of euclidean minimal spanning trees with power weighted edges," Ann. Probab., 546-555, 1994. pp. 1767-1787, 1988.