This just in: "...on average, 57 of those [64] frequencies can be discarded with minimal loss of image quality." So says the new paper Simple and Practical Algorithm for Sparse Fourier Transform. The equally dense Nearly Optimal Sparse Fourier Transform, sports algorithms so hip that they have their own webpage: sFFT: Sparse Fast Fourier Transform.
Your milage may have the variance of introduced Gaussian noise.
No other comment except to point out that the papers were presented at the Society for Industrial and Applied Mathematics [SIAM: ACM-SIAM Symposium on Discrete Algorithms (SODA12)] along with dozens of other papers, including:
- A Little Advice Can Be Very Helpful Arkadev Chattopadhyay, Jeff Edmonds, Faith Ellen and Toniann Pitassi
- Popularity vs Maximum cardinality in the stable marriage setting Telikepalli Kavitha
- Race to Idle: New Algorithms for Speed Scaling with a Sleep State Susanne Albers and Antonios Antoniadis
Joking aside, there were many interesting sounding papers:
Subscribe to RSS Feed