DocumentCode
149632
Title
Graph Empirical Mode Decomposition
Author
Tremblay, Nicolas ; Borgnat, Pierre ; Flandrin, Patrick
Author_Institution
Phys. Lab., Ecole Normale Super. de Lyon, Lyon, France
fYear
2014
fDate
1-5 Sept. 2014
Firstpage
2350
Lastpage
2354
Abstract
An extension of Empirical Mode Decomposition (EMD) is defined for graph signals. EMD is an algorithm that decomposes a signal in an addition of modes, in a local and data-driven manner. The proposed Graph EMD (GEMD) for graph signals is based on careful considerations on key points of EMD: defining the extrema, interpolation procedure, and the sifting process stopping criterion. Examples of GEMD are shown on the 2D grid and on two examples of sensor networks. Finally the effect of the graph´s connectivity on the algorithm´s performance is discussed.
Keywords
graph theory; interpolation; signal processing; GEMD; graph EMD; graph empirical mode decomposition; graph signals; interpolation procedure; sensor networks; sifting process; signal decomposition; Chirp; Empirical mode decomposition; Interpolation; Manifolds; Signal processing algorithms; Three-dimensional displays; Empirical Mode Decomposition; Graph interpolation; Graph signal processing;
fLanguage
English
Publisher
ieee
Conference_Titel
Signal Processing Conference (EUSIPCO), 2014 Proceedings of the 22nd European
Conference_Location
Lisbon
Type
conf
Filename
6952850
Link To Document