Cargando…
A New Surrogating Algorithm by the Complex Graph Fourier Transform (CGFT)
The essential step of surrogating algorithms is phase randomizing the Fourier transform while preserving the original spectrum amplitude before computing the inverse Fourier transform. In this paper, we propose a new method which considers the graph Fourier transform. In this manner, much more flexi...
Autores principales: | Belda, Jordi, Vergara, Luis, Safont, Gonzalo, Salazar, Addisson, Parcheta, Zuzanna |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7515288/ https://www.ncbi.nlm.nih.gov/pubmed/33267473 http://dx.doi.org/10.3390/e21080759 |
Ejemplares similares
-
Computing the Partial Correlation of ICA Models for Non-Gaussian Graph Signal Processing
por: Belda, Jordi, et al.
Publicado: (2018) -
Semi-Supervised Bayesian Classification of Materials with Impact-Echo Signals
por: Igual, Jorge, et al.
Publicado: (2015) -
Mathematics of multidimensional Fourier transform algorithms
por: Burrus, C S, et al.
Publicado: (1993) -
Fast Fourier transform and convolution algorithms
por: Nussbaumer, Henri J
Publicado: (1981) -
Fast Fourier transform and convolution algorithms
por: Nussbaumer, Henri J
Publicado: (1982)