Automatic extraction of time-frequency skeletons with minimal spanning trees

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

Volumn 1, Issue , 2000, Pages 89-92

  Michel, Olivier ^a   Flandrin, Patrick ^a   Hero, Alfred O ^b  

^a UNIVERSITÉ DE LYON   (France)

^b University of Michigan   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXTRACTION; MUSCULOSKELETAL SYSTEM; ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; FUNCTIONS; INFORMATION THEORY; PARAMETER ESTIMATION; PROBABILITY DENSITY FUNCTION; RANDOM PROCESSES; SET THEORY; SIGNAL ENCODING; TREES (MATHEMATICS);

ASYMPTOTIC PROPERTIES; AUTOMATIC EXTRACTION; MINIMAL SPANNING TREE; MULTICOMPONENTS; NEW APPLICATIONS; NON-PARAMETRIC ENTROPY ESTIMATION; TIME FREQUENCY; TIME-FREQUENCY DISTRIBUTIONS;

SIGNAL PROCESSING; SIGNAL DETECTION;

AUTOMATIC EXTRACTION; MINIMAL SPANNING TREES; MULTICOMPONENT CHIRP LIKE SIGNALS; PARAMETRIC ENTROPY ESTIMATION; TIME FREQUENCY DISTRIBUTION; TIME FREQUENCY SKELETONS;

EID: 0033708877     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICASSP.2000.861871     Document Type: Conference Paper

References (9)

1. A.O. Hero, O. Michel, "Robust entropy estimation strategies based on edge weighted random graphs, " SPIE'98, San Diego (CA), 1998.
2. A.O. Hero, O. Michel, "Asymptotic theory of greedy approximations to minimal Appoints random graphs, " IEEE Trans, on Info. Theory, vol. 45, pp. 1921-1938, 1999.
3. A.O. Hero, O. Michel, "Robust estimation of point process intensity features using fc-minimal spanning trees, " Proc. of ISIT'97, Ulm (Germany), p. 74, 1997.
4. R. Ravi, M. Marathe, D. Rosenkrantz, S. Ravi, "Spanning trees short or small, " in Proc. 5th Annual ACM- SIAM Symp. on Discrete Algo., pp. 546-555, 1994.
5. J.M. Steele, "Growth rates of euclidean minimal spanning trees with power weighted edges, " Ann. Prob., vol. 16, pp. 1767-1787, 1988.
6. J. Beardwood, J. H. Halton, J. M. Hammersley, "The shortest path through many points, " Proc. Cambridge Phil. Soc., vol. 55, pp. 299-327, 1959.
7. O. Michel, A.O. Hero, "Pruned MST's for entropy estimation and outlier rejection, " IEEE-IT Workshop on Detection, Classification and Imaging, Santa-Fe (NM), 1999.
8. R. Hoffman, A. K. Jain, "A test of randomness based on the minimal spanning tree, " Patt. Rec. Lett., vol. 1, pp. 175-180, 1983.
9. D. Banks, M. Lavine, H.J. Newton, "The MST for nonparametric regression and structure discovery, " in Comp. Science and Stat. Proc. of the 24th Symp. on the Interface, pp. 370-374, 1992.