[PD] OT: faster than Fourier transform
pedro.lopes at ist.utl.pt
Wed Jan 25 23:10:54 CET 2012
quote them: "A recording, on the other hand, of all possible instruments
each playing all possible notes at once wouldn’t be sparse — but neither
would it be a signal that anyone cares about."
If I didn't get it wrong: I think they mention the "premise" is
the opposite of white noise, thus signals do not exhibit the behavior of
white noise (spread out through all spectrum). Once again, its just a tool,
and tools are useful for certain cases, and not useful for other cases.
Like the hammer.
On Wed, Jan 25, 2012 at 11:03 PM, Mathieu Bouchard <matju at artengine.ca>wrote:
> Le 2012-01-20 à 23:55:00, Andy Farnell a écrit :
> Considering the paper is unpublished and sparse decomposition is a pretty
>> heavy topic I thought that is a really nice bit of science journalism by
>> Larry Hardesty. Since periodic music signals probably fit the bill quite
>> well it's good news for our kind of work.
> Does it have better upper bounds ?
> If not, it doesn't change much for realtime.
> E.g. if I feed something somewhat like a white noise to this FFT, what
> exactly will it try skipping ? Every harmonic will be fairly nonzero.
> | Mathieu BOUCHARD ----- téléphone : +1.514.383.3801 ----- Montréal, QC
> Pd-list at iem.at mailing list
> UNSUBSCRIBE and account-management ->
Pedro Lopes (HCI Researcher / MSc)
contact: pedro.lopes at ist.utl.pt
website: http://web.ist.utl.pt/pedro.lopes /
http://pedrolopesresearch.wordpress.com/ | http://twitter.com/plopesresearch
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Pd-list