Sample-optimal average-case sparse Fourier Transform in two dimensions

2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013

Volumn , Issue , 2013, Pages 1258-1265

  Ghazi, Badih ^a   Hassanieh, Haitham ^a   Indyk, Piotr ^a   Katabi, Dina ^a   Price, Eric ^a   Shi, Lixin ^a  

^a USA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER SCIENCE; CONTROL ENGINEERING;

AVERAGE CASE; LOWER BOUNDS; SAMPLE COMPLEXITY; SIGNAL MODELS; SUBLINEAR TIME ALGORITHMS; TWO-DIMENSION;

DISCRETE FOURIER TRANSFORMS;

EID: 84897734712     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/Allerton.2013.6736670     Document Type: Conference Paper

References (32)

1. A. Akavia. Deterministic sparse Fourier approximation via fooling arithmetic progressions. COLT, pages 381-393, 2010
2. A. Akavia, S. Goldwasser, and S. Safra. Proving hard-core predicates using list decoding. FOCS, 44:146-159, 2003
3. M. Akcakaya and V. Tarokh. A frame construction and a universal distortion bound for sparse representations. Signal Processing, IEEE Transactions on, 56(6):2443-2450, june 2008
4. O. C. Andronesi, G. S. Kim, E. Gerstner, T. Batchelor, A. A. Tzika, V. R. Fantin, M. G. V. Heiden, and A. G. Sorensen. Detection of 2-hydroxyglutarate in idh-mutated glioma patients by in vivo spectral-editing and 2d correlation magnetic resonance spectroscopy. 4:116ra4, 2012
5. V. Bahskarna and K. Konstantinides. Image and video compression standards : algorithms and architectures. Kluwer Academic Publishers, 1995
6. P. Boufounos, V. Cevher, A. C. Gilbert, Y. Li, and M. J. Strauss. What's the frequency, kenneth?: Sublinear fourier sampling off the grid. RANDOM/APPROX, 2012
7. E. Candes and T. Tao. Near optimal signal recovery from random projections: Universal encoding strategies. IEEE Trans. on Info.Theory, 2006
8. Y. Chan and V. Koo. An Introduction to Synthetic Aperture Radar (SAR). Progress In Electromagnetics Research B, 2008
9. B. Ghazi, H. Hassanieh, P. Indyk, D. Katabi, E. Price, and L. Shi. Sample-Optimal Average-Case Sparse Fourier Transform in Two Dimensions. arXiv:1303.1209, 2013
10. A. Gilbert, S. Guha, P. Indyk, M. Muthukrishnan, and M. Strauss. Near-optimal sparse Fourier representations via sampling. STOC, 2002
11. A. Gilbert, M. Muthukrishnan, and M. Strauss. Improved time bounds for near-optimal space Fourier representations. SPIE Conference, Wavelets, 2005
12. B. G. Haskell, A. Puri, and A. N. Netravali. Digital video : an introduction to MPEG-2. Chapman and Hall, 1997
13. H. Hassanieh, F. Adib, D. Katabi, and P. Indyk. Faster gps via the sparse fourier transform. MOBICOM, 2012
14. H. Hassanieh, P. Indyk, D. Katabi, and E. Price. Near-optimal algorithm for sparse Fourier transform. STOC, 2012
15. H. Hassanieh, P. Indyk, D. Katabi, and E. Price. Simple and practical algorithm for sparse Fourier transform. SODA, 2012
16. M. Iwen. Improved approximation guarantees for sublineartime Fourier algorithms. Applied And Computational Harmonic Analysis, 2012
17. M. A. Iwen. Combinatorial sublinear-time Fourier algorithms. Foundations of Computational Mathematics, 10:303-338, 2010
18. M. A. Iwen, A. Gilbert, and M. Strauss. Empirical evaluation of a sub-linear time sparse dft algorithm. Communications in Mathematical Sciences, 5, 2007
19. A. Kak and M. Slaney. Principles of Computerized Tomographic Imaging. Society for Industrial and Applied Mathematics, 2001
20. K. Kazimierczuk and V. YU. Accelerated nmr spectroscopy by using compressed sensing. Angewandte Chemie International Edition, 2011
21. D. Lawlor, Y. Wang, and A. Christlieb. Adaptive sub-linear time fourier algorithms. arXiv:1207.6368, 2012
22. M. Lustig, D. Donoho, J. Santos, and J. Pauly. Compressed sensing mri. Signal Processing Magazine, IEEE, 25(2):72-82, 2008
23. Y. Mansour. Randomized interpolation and approximation of sparse polynomials. ICALP, 1992
24. D. Nishimura. Principles of Magnetic Resonance Imaging. Society for Industrial and, 2010
25. S. Pawar and K. Ramchandran. Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(k log k) complexity . In ISIT, 2013
26. E. Price and D. P. Woodruff. (1+?)-Approximate sparse recovery. FOCS, 2011
27. E. E. Schadt, M. D. Linderman, J. Sorenson, L. Lee, and G. P. Nolan. Computational solutions to large-scale data management and analysis. 2011
28. L. Shi, O. Andronesi, H. Hassanieh, B. Ghazi, D. Katabi, and E. Adalsteinsson. MRS Sparse-FFT: Reducing Acquisition Time and Artifacts for In Vivo 2D Correlation Spectroscopy. In ISMRM'13, Int. Society for Magnetic Resonance in Medicine Annual Meeting and Exhibition, 2013
29. E. Sidky. What does compressive sensing mean for X-ray CT and comparisons with its MRI application. In Conference on Mathematics of Medical Imaging, 2011
30. G. Wallace. The JPEG still picture compression standard. Communications of the ACM, 1991
31. O. Yilmaz. Seismic Data Analysis: Processing, Inversion, and Interpretation of Seismic Data. Society of Exploration Geophysicists, 2008
32. J. Yoo, S. Becker, M. Loh, M. Monge, E. Cand̀es, and A. ENeyestanak. A 100MHz-2GHz 12.5x subNyquist rate receiver in 90nm CMOS. In IEEE RFIC, 2012.