GPU accelerated greedy algorithms for compressed sensing

DOI10.1007/S12532-013-0056-5zbMATH Open1300.65038OpenAlexW2116953231MaRDI QIDQ744210FDOQ744210

Jeffrey D. Blanchard, Jared Tanner

Publication date: 6 October 2014

Published in: Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12532-013-0056-5

zbMATH Keywords

sparse approximationcombinatorial optimizationcompressed sensingparallel computinggreedy algorithmsgraphics processing unitscosampHTPIHTNIHTsubspace pursuit

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Parallel numerical computation (65Y05) Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Probing the Pareto Frontier for Basis Pursuit Solutions
• Fast <it>k</it>-selection algorithms for graphics processing units
• Matching pursuits with time-frequency dictionaries
• Decoding by Linear Programming
• Stable signal recovery from incomplete and inaccurate measurements
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Compressed sensing
• Sparse Reconstruction by Separable Approximation
• Iterative hard thresholding for compressed sensing
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Greed is Good: Algorithmic Results for Sparse Approximation
• Sparse nonnegative solution of underdetermined linear equations by linear programming
• Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
• Sparse Approximate Solutions to Linear Systems
• High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension
• Matrix recipes for hard thresholding methods
• Subspace Pursuit for Compressive Sensing Signal Reconstruction
• Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
• Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
• Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
• For most large underdetermined systems of equations, the minimal 𝓁₁‐norm near‐solution approximates the sparsest near‐solution
• Selection by distributive partitioning
• GPU accelerated greedy algorithms for compressed sensing

Cited In (4)

• GPU accelerated greedy algorithms for compressed sensing
• Expander \(\ell_0\)-decoding
• CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
• Performance comparisons of greedy algorithms in compressed sensing

Uses Software

• Matlab
• CUDA
• SPGL1
• CoSaMP
• Thrust
• GAGA
• ggks

This page was built for publication: GPU accelerated greedy algorithms for compressed sensing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744210)