Re: [music-dsp] Faster Fourier transform from 2012?

[Ross Bencina]

[Sorry about my previous truncated message, Thuderbird is buggy.]

I wonder what the practical musical applications of sFFT are, and 
whether any work has been published in this area since 2012?



> http://groups.csail.mit.edu/netmit/sFFT/hikp12.pdf

Last time I looked at this paper, it seemed to me that sFFT would 
correctly return the highest magnitude FFT bins irrespective of the 
sparsity of the signal. That could be useful for spectral peak-picking 
based algorithms such as SMS sinusoid/noise decomposition and related 
pitch-tracking techniques. I'm not sure how efficient sFFT is for 
"dense" audio vectors however.



More generally, Compressive Sensing was a hot topic a few years back. 
There is at least one EU-funded research project looking at audio-visual 
applications:

http://www.spartan-itn.eu/#2|

And Mark Plumbley has a couple of recent co-publications:
http://www.surrey.ac.uk/cvssp/people/mark_plumbley/

No doubt there is other work in the field.

Cheers,

Ross.
___
dupswapdrop: music-dsp mailing list
music-dsp@music.columbia.edu
https://lists.columbia.edu/mailman/listinfo/music-dsp

Re: [music-dsp] Faster Fourier transform from 2012?

[Ross Bencina]

On 22/08/2016 3:08 AM, Max Little wrote:

indeed there are
faster algorithms than the FFT if the signal is 'sparse' (or
approximately sparse) in the Fourier domain. This is essentially the
same idea as in compressed sensing, where you can 'beat' the Nyquist
criterion for sparse signals.

___
dupswapdrop: music-dsp mailing list
music-dsp@music.columbia.edu
https://lists.columbia.edu/mailman/listinfo/music-dsp

Re: [music-dsp] Faster Fourier transform from 2012?

[Max Little]

Not sure what you mean by this being 'real', but indeed there are
faster algorithms than the FFT if the signal is 'sparse' (or
approximately sparse) in the Fourier domain. This is essentially the
same idea as in compressed sensing, where you can 'beat' the Nyquist
criterion for sparse signals. Have a look at:

http://groups.csail.mit.edu/netmit/sFFT/hikp12.pdf

Max


On 21 August 2016 at 15:30, Alan Wolfe  wrote:
> This article has been getting shared and reshared by some graphics
> professionals / researchers I know on twitter.
>
> The article itself and arxiv paper are from 2012 though, which makes me
> wonder why we haven't heard more about this?
>
> Does anyone know if this is real?
>
> http://m.phys.org/news/2012-01-faster-than-fast-fourier.html
>
>
> ___
> dupswapdrop: music-dsp mailing list
> music-dsp@music.columbia.edu
> https://lists.columbia.edu/mailman/listinfo/music-dsp



-- 
Max Little (www.maxlittle.net)
Associate Professor, Aston University
TED Fellow (fellows.ted.com/profiles/max-little)
Visiting Associate Professor, MIT
Senior Research Fellow, University of Oxford
Room MB312, Aston University
Aston Triangle, Birmingham, B4 7ET, UK
UK +44 7710 609564/+44 121 204 5327
Skype dr.max.little
___
dupswapdrop: music-dsp mailing list
music-dsp@music.columbia.edu
https://lists.columbia.edu/mailman/listinfo/music-dsp

[music-dsp] Faster Fourier transform from 2012?

[Alan Wolfe]

This article has been getting shared and reshared by some graphics
professionals / researchers I know on twitter.

The article itself and arxiv paper are from 2012 though, which makes me
wonder why we haven't heard more about this?

Does anyone know if this is real?

http://m.phys.org/news/2012-01-faster-than-fast-fourier.html
___
dupswapdrop: music-dsp mailing list
music-dsp@music.columbia.edu
https://lists.columbia.edu/mailman/listinfo/music-dsp