A simple compressive sensing algorithm for parallel many-core architectures

Journal of Signal Processing Systems

Volumn 71, Issue 1, 2013, Pages 1-20

  Borghi, Alexandre ^a   Darbon, Jérôme ^b,c   Peyronnet, Sylvain ^a   Chan, Tony F ^c,d   Osher, Stanley ^c  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^b UNIVERSITÉ PARIS SACLAY   (France)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Compressed sensing; Optimization algorithm; Parallel architecture; Vectorized architecture

Indexed keywords

COMPRESSED SENSING; COMPUTER GRAPHICS; GRAPHICS PROCESSING UNIT; MEMORY ARCHITECTURE; PROGRAM PROCESSORS;

CELL PROCESSOR; COMPRESSIVE SENSING; MANY CORE; MANY-CORE ARCHITECTURE; MULTI-CORE PROCESSOR; OPTIMIZATION ALGORITHMS; SENSING PROBLEMS; SHARED MEMORY;

PARALLEL ARCHITECTURES;

EID: 84873701799     PISSN: 19398018     EISSN: 19398115     Source Type: Journal    
DOI: 10.1007/s11265-012-0671-9     Document Type: Article

References (56)

1. Al-Kiswany, S.; Gharaibeh, A.; Santos-Neto, E.; Yuan, G.; & Ripeanu, M. (2008). StoreGPU: Exploiting graphics processing units to accelerate distributed storage systems. In: Proceedings of the 17th international symposium on high performance distributed computing (HPDC) (pp. 165-174).
2. Andrecut, M. (2009). Fast GPU implementation of sparse signal recovery from random projections. Engineering Letters, 17(3), 151-158.
3. Bader, D. A.; & Agarwal, V. (2007). FFTC: Fastest fourier transform for the IBM cell broadband engine. In: S. Aluru, M. Parashar, R. Badrinath, & V. K. Prasanna (Eds.), HiPC, Lecture of Notes in Computer Science (Vol. 4873, pp. 172-184). Springer.
4. Bajwa, W. U.; Haupt, J. D.; Raz, G. M.; Wright, S. J.; & Nowak, R. D. (2007). Toeplitz-structured compressed sensing matrices. In: Proceedings of the 14th IEEE/SP workshop on Statistical Signal Processing (SSP) (pp. 294-298).
5. Bernstein, D. J. (2007). The tangent FFT. In: S. Boztas & H. Feng Lu (Eds.), Lecture notes in computer science, applied algebra, algebraic algorithms and error-correcting codes (Vol. 4851, pp. 291-300). Springer.
6. Bertsekas, D. (1996). Constrained optimization and lagrange multiplier methods. Athena Scientific.
7. Bioucas-Dias, J.; & Figueiredo, M. (2007). A new TwIST: Two-step iterative shrinkage/thresholding algorithms for image restoration. IEEE Transactions on Image Processing, 16(12), 2992-3004.
8. Bredies, K.; & Lorenz, D. A. (2008). Iterated hard shrinkage for minimization problems with sparsity constraints. SIAM Journal on Scientific Computing, 30(2), 657-683.
9. Candès, E.; & Romberg, J. (2006). Quantitative robust uncertainty principles and optimally sparse decompositions. Foundations of Computational Mathematics, 6, 227-254.
10. Candès, E.; Romberg, J.; & Tao, T. (2006). Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Transactions on Information Theory, 52(2), 489-509.
11. Candès, E.; & Tao, T. (2006). Near optimal signal recovery from random projections: universal encoding strategies?. IEEE Transactions on Information Theory, 52(12), 5406-5426.
12. Cevher, V.; Sankaranarayanan, A.; Duarte, M. F.; Reddy, D.; Baraniuk, R. G.; & Chellappa, R. (2008). Compressive sensing for background subtraction. In: Proceedings of the 10th European Conference on Computer Vision (ECCV) (Vol. 5303, pp. 155-168).
13. Chambolle, A.; DeVore, R. A.; Lee, N.-Y.; & Lucier, B. J. (1998). Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage. IEEE Transactions on Image Processing, 7, 319-335.
14. Combettes, P.; & Pesquet, J.-C. (2007). Proximal thresholding algorithm for minimization over orthonormal bases. SIAM Journal on Optimization, 18(4), 1351-1376.
15. Dagum, L.; & Menon, R. (1998). OpenMP: An industry standard API for shared-memory programming. IEEE Computational Science and Engineering, 5(1), 46-55.
16. Daubechies, I.; Defrise, M.; & Mol, C. D. (2004). An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Communications in Pure and Applied Mathematics, 57(11), 1413-1457.
17. DeVore, R. A. (2007). Deterministic constructions of compressed sensing matrices. Journal of Complexity, 4-6(23), 918-925.
18. Diefendorff, K.; Dubey, P.; Hochsprung, R.; & Scale, H. (2000). Altivec extension to PowerPC accelerates media processing. IEEE Micro, 20(2), 85-95.
19. Donoho, D.; Tsaig, Y.; Drori, I.; & Starck, J.-L. (2006). Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit. Tech. rep.
20. Donoho, D. L. (2006). Compressed sensing. IEEE Transactions on Information Theory, 52(4), 1289-1306.
21. Dupe, F.-X.; Fadili, J.; & Starck, J.-L. (2008). A proximal iteration for deconvolving poisson noisy images using sparse representations. IEEE Transactions on Image Processing, 16(12), 2992-3004.
22. Hale, W. Y. E. T.; & Zhang, Y. (2007). A fixed-point continuation method for l1-regularized minimization with applications to compressed sensing. Tech. rep.; Rice University.
23. Elad, M. (2006). Why simple shrinkage is still relevant for redundant representation? IEEE Transactions on Information Theory, 52, 5559-5569.
24. Fabritiis, G. D. (2007). Performance of the cell processor for biomolecular simulations. Computer Physics Communications, 176(11-12), 660-664.
25. Figueiredo, M.; & Nowak, R. (2003). An EM algorithm for wavelet-based image restoration. IEEE Transactions on Image Processing, 12(8), 906-916.
26. Figueiredo, M.; Nowak, R.; & Wright, S. (2007). Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems. IEEE Journal of Selected Topics in Signal Processing, 1(3), 586-598.
27. Frigo, M.; & Johnson, S. (1998). FFTW: an adaptive software architecture for the FFT. In: Proceedings of the IEEE international conference on acoustics, speech and signal processing (Vol. 3, pp. 1381-1384).
28. 1 norm for sparse vectors. In: Proceedings of the 44th Annual Allerton Conference on Communication, Control and Computing (pp. 1411-1418).
29. Goldstein, T.; & Osher, S. (2008). The split Bregman method for l1 regularized problems. Tech. Rep. CAM 08-29, UCLA.
30. Griesse, R.; & Lorenz, D. A. (2008). A semismooth Newton method for Tikhonov functionals with sparsity constraints. Inverse Problems, 24(3).
31. Hegde, C.; Wakin, M.; & Baraniuk, R. (2007). Random projections for manifold learning. In: Neural Information Processing Systems (NIPS).
32. Hiriart-Urruty, J.-B.; & Lemaréchal, C. (1996). Convex analysis and minimization algorithms. Springer, Heidelberg, two volumes - 2nd printing.
33. 1-regularized least squares. IEEE Journal of Selected Topics in Signal Processing, 1(4), 606-617.
34. Kurzak, J.; & Dongarra, J. (2007). Implementation of mixed-precision in solving systems of linear equations on the CELL processor. Concurrency and Computation: Practice and Experience, 19(10), 1371-1385.
35. Lemaréchal, C.; & Sagastizábal, C. (1997). Practical aspects of the Moreau-Yosida regularization: theoretical preliminaries. SIAM Journal on Optimization, 7(2), 367-385.
36. Lieberman, M. D.; Sankaranarayanan, J.; & Samet, H. (2008). A fast similarity join algorithm using graphics processing units. In: Proceedings of the IEEE international conference on data engineering (ICDE) (pp. 1111-1120).
37. Lustig, M.; Donoho, D.; & Pauly, J. M. (2007). Sparse MRI: the application of compressed sensing for rapid MR imaging. Magnetic Resonance in Medicine, 58(6), 1182-1195.
38. Mairal, J.; Bach, F.; Ponce, J.; Sapiro, G.; & Zisserman, A. (2008). Discriminative learned dictionaries for local image analysis. In: IEEE Conf. on computer vision and pattern recognition (CVPR) (pp. 23-28).
39. Moreau, J. (1965). Proximité et dualité dans un espace hilbertien. Bulletin de la S.M.F.; 93, 273-299.
40. Nickolls, J.; Buck, I.; Garland, M.; & Skadron, K. (2008). Scalable parallel programming with CUDA. Queue, 6(2), 40-53.
41. Nikolova, M. (1999). Markovian reconstruction using a GNC approach. IEEE Transactions on Image Processing, 8(9), 1204-1220.
42. Nikolova, M.; Idier, J.; & Mohammad-Djafari, A. (1998). Inversion of large-support ill-posed linear operators using a piecewise Gaussian MRF. IEEE Transactions on Image Processing, 8(4), 571-585.
43. Nikolova, M.; Ng, M. K.; Zhang, S. Q.; & Ching, W. K. (2008). Efficient reconstruction of piecewise constant images using nonsmooth nonconvex minimization. SIAM Journal on Imaging Sciences, 1(1), 2-25.
44. Nowak, R.; & Figueiredo, M. (2001). Fast wavelet-based image deconvolution using the em algorithm. In: Proceedings of the 35th Asilomar conference on signals, systems, and computers (pp. 371-275).
45. O'Brien, K.; O'Brien, K. M.; Sura, Z.; Chen, T.; & Zhang, T. (2008). Supporting OpenMP on cell. International Journal of Parallel Programming, 36(3), 289-311.
46. Owens, J. D.; Luebke, D.; Govindaraju, N.; Harris, M.; Kruger, J.; Lefohn, A. E.; et al. (2007). A survey of general-purpose computation on graphics hardware. Computer Graphics Forum, 26(1), 80-113.
47. Pham, D.; Asano, S.; Bolliger, M.; Day, M. N.; Hofstee, H. P.; Johns, C.; et al. (2005). The design and implementation of a first-generation CELL processor. In: Proceedings of the solid-state circuits conference (pp. 184-185).
48. Seiler, L.; Carmean, D.; Sprangle, E.; Forsyth, T.; Abrash, M.; Dubey, P.; et al. (2008). Larrabee: a many-core x86 architecture for visual computing. In: ACM SIGGRAPH 2008 papers (pp. 1-15). New York, NY, USA: ACM.
49. Tibshirani, R. (2006). Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society Series B, 58, 267-288.
50. Tropp, J. (2006). Just relax: Convex programming methods for identifying sparse signals. IEEE Transactions on Information Theory, 51(3), 1030-1051.
51. Tropp, J. A. (2004). Greed is good: algorithmic results for sparse approximation. IEEE Transactions on Information Theory, 50(10), 2231-2242.
52. Williams, S.; Carter, J.; Oliker, L.; Shalf, J.; & Yelick, K. (2008). Lattice Boltzmann simulation optimization on leading multicore platforms. In IEEE international parallel and distributed processing symposium (pp. 1-14).
53. Williams, S.; Shalf, J.; Oliker, L.; Kamil, S.; Husbands, P.; & Yelick, K. (2006). The potential of the cell processor for scientific computing. In: Proceedings of the 3rd conference on computing frontiers (CF) (pp. 9-20). New York, NY, USA: ACM.
54. Wright, J.; Yang, A.; Ganesh, A.; Sastry, S.; & Ma, Y. (2009). Robust face recognition via sparse representation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 31(2), 210-227.
55. Yin, W.; Osher, S.; Goldfarb, D.; & Darbon, J. (2008). Bregman iterative algorithms for l1-minimization with applications to compressed sensing. SIAM Journal on Imaging Sciences, 1(1), 143-168.
56. Yosida, K. (1965). Functional analysis. Springer.