A fast approximation algorithm for tree-sparse recovery

No abstract is available for this paper.

• Publication year

  2014

• Venue

  2014 IEEE International Symposium on Information Theory

• Publication date

  2014-08-11

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/ISIT.2014.6875152
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Nearly Linear-Time Model-Based Compressive Sensing

  2014cited by this paper
• An Exact Tree Projection Algorithm for Wavelets

  2013influential reference
• Compressed Sensing

  2012cited by this paper
• Structured Compressed Sensing: From Theory to Applications

  2011cited by this paper
• Tree-Guided Group Lasso for Multi-Task Regression with Structured Sparsity

  2009cited by this paper
• Model-Based Compressive Sensing

  2008influential reference
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples

  2008cited by this paper
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

  2004cited by this paper
• Optimal tree approximation with wavelets

  1999influential reference
• Wavelet-based statistical signal processing using hidden Markov models

  1998cited by this paper
• A wavelet tour of signal processing

  1998cited by this paper
• CART AND BEST-ORTHO-BASIS: A CONNECTION'

  1997influential reference
• A signal-dependent time-frequency representation: fast algorithm for optimal kernel design

  1994cited by this paper
• Trading Accuracy for Simplicity in Decision Trees

  1994cited by this paper
• Embedded image coding using zerotrees of wavelet coefficients

  1993cited by this paper

• LCNet: Lightweight Cycle Network Driven by Physical and Deep Prior for Compressed Sensing

  2025cites this paper
• Stochastic Variance-Reduced Iterative Hard Thresholding in Graph Sparsity Optimization

  2024cites this paper
• A Fast Multi-Scale Generative Adversarial Network for Image Compressed Sensing

  2022cites this paper
• Multiscale deep network for compressive sensing image reconstruction

  2022cites this paper
• SWDGAN: GAN-based sampling and whole image denoising network for compressed sensing image reconstruction

  2021cites this paper
• Image Compressed Sensing Using Non-Local Neural Network

  2021cites this paper
• Sparse representations and compressive sampling approaches in engineering mechanics: A review of theoretical concepts and diverse applications

  2020cites this paper
• Dual Averaging Method for Online Graph-structured Sparsity

  2019cites this paper
• Stochastic Iterative Hard Thresholding for Graph-structured Sparsity Optimization

  2019cites this paper
• Wavelet Tree Parsing with Freeform Lensing

  2019cites this paper
• Coupled Compressive Sensing : Sequential Reinforcement Approach

  2018cites this paper
• Towards Sample-Optimal Methods for Solving Random Quadratic Equations with Structure

  2018influential citation
• Algorithms above the noise floor

  2018cites this paper
• A generic top-level mechanism for accelerating signal recovery in compressed sensing

  2017cites this paper
• Better Approximations for Tree Sparsity in Nearly-Linear Time

  2017cites this paper
• Fast, Sample-Efficient Algorithms for Structured Phase Retrieval

  2017cites this paper
• DR2-Net: Deep Residual Reconstruction Network for Image Compressive Sensing

  2017cites this paper
• Improved Algorithms For Structured Sparse Recovery

  2017cites this paper
• Information theoretic limits for linear prediction with graph-structured sparsity

  2017cites this paper
• Inexact Gradient Projection and Fast Data Driven Compressed Sensing

  2017cites this paper
• Sample-Efficient Algorithms for Recovering Structured Signals From Magnitude-Only Measurements

  2017cites this paper
• Phase Retrieval Using Structured Sparsity: A Sample Efficient Algorithmic Framework

  2017cites this paper
• Graph-Structured Sparse Optimization for Connected Subgraph Detection

  2016cites this paper
• Quantitative Recovery Conditions for Tree-Based Compressed Sensing

  2016cites this paper
• A Generalized Matching Pursuit Approach for Graph-Structured Sparsity

  2016cites this paper
• Bilevel feature selection in nearly-linear time

  2016cites this paper
• BM3D-AMP: A new image recovery algorithm based on BM3D denoising

  2015cites this paper
• Sparse group covers and greedy tree approximations

  2015influential citation
• Fast Algorithms for Structured Sparsity (ICALP 2015 Invited Tutorial)

  2015influential citation
• Research Interests The explosion in the number of data sources of various modalities positioned across the globe

  2014cites this paper
• Nearly Linear-Time Model-Based Compressive Sensing

  2014influential citation
• From Denoising to Compressed Sensing

  2014cites this paper
• Approximation Algorithms for Model-Based Compressive Sensing

  2014cites this paper