.png){kind=icon}
Return
A fast algorithm for bidimensional EMD
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2005.855548.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this letter, we describe a new method for bidimensional empirical mode decomposition (EMD). This decomposition is based on Delaunay triangulation and on piecewise cubic polynomial interpolation. Particular attention is devoted to boundary conditions that are crucial for the feasibility of the bidimensional EMD. The study of the behavior of the decomposition on a different kind of image shows its efficiency in terms of computational cost, and the decomposition of Gaussian white noises leads to bidimensional selective filter banks.
Keywords:
Delaunay triangulation
empirical mode decomposition (EMD)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W
Organization
No organization information available
Cited Papers
Bird Conservation in Response to Global Change: from Ornithology to Policy. A report on the BOU's 150th anniversary conference held at the University of Leicester, 8–10 April 2008.png)
Ibis
OAAI
IbisIF0
OAAIShareSaveShareSave no more
no more