Related Experiment Video
Updated: Jan 9, 2026

Deciphering High-Resolution 3D Chromatin Organization via Capture Hi-C
Published on: October 14, 2022
Fast Fourier transform is a training-free, ultrafast, highly efficient, and fully interpretable approach for
Max Ward1, Bac Dao2, Amitava Datta1
1School of Physics, Mathematics, and Computer Sciences, University of Western Australia, Perth, Australia.
Abstract:
Improving the efficiency of data compression remains essential for feature selection and data modelling. Current approaches for compressing epigenomic/genomic data highly rely on autoencoder that requires substantial computing resources, parameter fine-tuning, training, and time. Here, we developed a training-free, Fast Fourier Transform (FFT)-based method, for data compression with high efficiency and full interpretability. Our FFT method compresses epigenomic data of histone modification up to 1,000-fold while still maintaining high reconstruction fidelity (cosine similarity, 99.7%), does not require any training and completes ultrafast within 70 ms on GPU or 20 s on CPU opposite to extensive training in hours/days for autoencoder on GPU/CPU, and offers full interpretability of compressed features from frequency components of original signals in contrast to the uninterpretable "black box" from autoencoder. This enables high accuracy in the classification model prediction (AUC, 0.960). Thus, our novel FFT method represents a major paradigm shift in data compression.
Related Concept Videos
Fast Fourier Transform
The computational efficiency of the FFT becomes...
Continuous -time Fourier Transform
Discrete Fourier Transform
Basic signals of Fourier Transform
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at...
Discrete-time Fourier transform
One of the notable...
Convergence of Fourier Series
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...

