Neural Computation
Atomic Decomposition by Basis Pursuit
SIAM Journal on Scientific Computing
Adaptive Sparseness for Supervised Learning
IEEE Transactions on Pattern Analysis and Machine Intelligence
Sparse bayesian learning and the relevance vector machine
The Journal of Machine Learning Research
A Variational Method for Learning Sparse and Overcomplete Representations
Neural Computation
Extensions of compressed sensing
Signal Processing - Sparse approximations in signal and image processing
Pattern Recognition and Machine Learning (Information Science and Statistics)
Pattern Recognition and Machine Learning (Information Science and Statistics)
Deterministic constructions of compressed sensing matrices
Journal of Complexity
Compressed sensing and Bayesian experimental design
Proceedings of the 25th international conference on Machine learning
IEEE Transactions on Signal Processing
Sparse Bayesian learning for basis selection
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
IEEE Transactions on Information Theory
Bayesian and regularization methods for hyperparameter estimation in image restoration
IEEE Transactions on Image Processing
Parameter Estimation in TV Image Restoration Using Variational Distribution Approximation
IEEE Transactions on Image Processing
Robust ISAR imaging based on compressive sensing from noisy measurements
Signal Processing
Bayesian compressive sensing for cluster structured sparse signals
Signal Processing
Robust classification using l2,1-norm based regression model
Pattern Recognition
Block-Based Compressed Sensing of Images and Video
Foundations and Trends in Signal Processing
A Bayesian active learning framework for a two-class classification problem
MUSCLE'11 Proceedings of the 2011 international conference on Computational Intelligence for Multimedia Understanding
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part VI
Journal of Signal Processing Systems
Hi-index | 0.01 |
In this paper, we model the components of the compressive sensing (CS) problem, i.e., the signal acquisition process, the unknown signal coefficients and the model parameters for the signal and noise using the Bayesian framework. We utilize a hierarchical form of the Laplace prior to model the sparsity of the unknown signal. We describe the relationship among a number of sparsity priors proposed in the literature, and show the advantages of the proposed model including its high degree of sparsity. Moreover, we show that some of the existing models are special cases of the proposed model. Using our model, we develop a constructive (greedy) algorithm designed for fast reconstruction useful in practical settings. Unlike most existing CS reconstruction methods, the proposed algorithm is fully automated, i.e., the unknown signal coefficients and all necessary parameters are estimated solely from the observation, and, therefore, no user-intervention is needed. Additionally, the proposed algorithm provides estimates of the uncertainty of the reconstructions.We provide experimental results with synthetic 1-D signals and images, and compare with the state-ofthe-art CS reconstruction algorithms demonstrating the superior performance of the proposed approach.