Publication

Multichannel Sampling with Unknown Gains and Offsets: A Fast Reconstruction Algorithm

Publications associées (76)

The diachronic development of Debussy’s musical style: a corpus study with Discrete Fourier Transform

Martin Alois Rohrmeier, Johannes Hentschel, Gabriele Cecchetti, Sabrina Laneve, Ludovica Schaerf

Claude Debussy’s personal style is typically characterised as a departure from earlier diatonic tonality, including a greater variety of pitch-class materials organised in fragmented yet coherent compositions. Exploiting the music-theoretical interpretabil ...
2023

The Claude Debussy Solo Piano Corpus

Martin Alois Rohrmeier, Johannes Hentschel, Gabriele Cecchetti, Sabrina Laneve, Ludovica Schaerf

This dataset originates from the DCML corpus initiative and contains musicological research data. For more information, please refer to its documentation page https://dcmlab.github.io/debussy_piano Please cite this dataset as Laneve, S., Schaerf ...
EPFL Infoscience2023

pyFFS: A Python Library for Fast Fourier Series Computation and Interpolation with GPU Acceleration

Martin Vetterli, Paul Hurley, Eric Bezzam, Sepand Kashani, Matthieu Martin Jean-André Simeoni

Fourier transforms are an often necessary component in many computational tasks, and can be computed efficiently through the fast Fourier transform (FFT) algorithm. However, many applications involve an underlying continuous signal, and a more natural choi ...
2022

Construction of optimal spectral methods in phase retrieval

Florent Gérard Krzakala, Lenka Zdeborová

We consider the phase retrieval problem, in which the observer wishes to recover a n-dimensional real or complex signal X⋆ from the (possibly noisy) observation of |ΦX⋆|, in which Φ is a matrix of size m×n. We consider a \emph{high-dimensional} setting whe ...
2021

Fourier Sampling in Signal Processing and Numerical Linear Algebra

Amir Zandieh

This thesis focuses on developing efficient algorithmic tools for processing large datasets. In many modern data analysis tasks, the sheer volume of available datasets far outstrips our abilities to process them. This scenario commonly arises in tasks incl ...
EPFL2020

CPGD: Cadzow Plug-and-Play Gradient Descent for Generalised FRI

Martin Vetterli, Paul Hurley, Matthieu Martin Jean-André Simeoni, Adrien Georges Jean Besson

Finite rate of innovation (FRI) is a powerful reconstruction framework enabling the recovery of sparse Dirac streams from uniform low-pass filtered samples. An extension of this framework, called generalised FRI (genFRI), has been recently proposed for han ...
2020

Energy-based comparison between the Fourier-Galerkin method and the finite element method

Thomas Willem Jan de Geus

The Fourier-Galerkin method (in short FFTH) has gained popularity in numerical homogenisation because it can treat problems with a huge number of degrees of freedom. Because the method incorporates the fast Fourier transform (FFT) in the linear solver, it ...
ELSEVIER2020

A Universal Sampling Method for Reconstructing Signals with Simple Fourier Transforms

Mikhail Kapralov, Amir Zandieh

Reconstructing continuous signals based on a small number of discrete samples is a fundamental problem across science and engineering. We are often interested in signals with "simple" Fourier structure - e.g., those involving frequencies within a bounded r ...
ASSOC COMPUTING MACHINERY2019

A Fourier-accelerated volume integral method for elastoplastic contact

Jean-François Molinari, Guillaume Anciaux, Lucas Henri Galilée Frérot

The contact of solids with rough surfaces plays a fundamental role in physical phenomena such as friction, wear, sealing, and thermal transfer. However, its simulation is a challenging problem due to surface asperities covering a wide range of length-scale ...
2019

Streaming Low-Rank Matrix Approximation With An Application To Scientific Simulation

Volkan Cevher, Alp Yurtsever

This paper argues that randomized linear sketching is a natural tool for on-the-fly compression of data matrices that arise from large-scale scientific simulations and data collection. The technical contribution consists in a new algorithm for constructing ...
2019

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.