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...

Descripción completa

Detalles Bibliográficos
Autores principales: Belda, Jordi, Vergara, Luis, Safont, Gonzalo, Salazar, Addisson, Parcheta, Zuzanna
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2019
Materias:
Article
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

Internet

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