The Problem of Sparse Image Coding
Journal of Mathematical Imaging and Vision
A Comparison of Signal Compression Methods by Sparse Solution of Linear Systems
WIRN VIETRI 2002 Proceedings of the 13th Italian Workshop on Neural Nets-Revised Papers
Approximation bounds for some sparse kernel regression algorithms
Neural Computation
Advanced lectures on machine learning
Some greedy learning algorithms for sparse regression and classification with mercer kernels
The Journal of Machine Learning Research
General design algorithm for sparse frame expansions
Signal Processing
Fast implementation of orthogonal greedy algorithm for tight wavelet frames
Signal Processing - Sparse approximations in signal and image processing
On the stability of the basis pursuit in the presence of noise
Signal Processing - Sparse approximations in signal and image processing
Breakdown of equivalence between the minimal l1-norm solution and the sparsest solution
Signal Processing - Sparse approximations in signal and image processing
Extensions of compressed sensing
Signal Processing - Sparse approximations in signal and image processing
Algorithms for simultaneous sparse approximation: part II: Convex relaxation
Signal Processing - Sparse approximations in signal and image processing
Active learning via transductive experimental design
ICML '06 Proceedings of the 23rd international conference on Machine learning
Data streams: algorithms and applications
Foundations and Trends® in Theoretical Computer Science
Digital Signal Processing
Kernel least-squares models using updates of the pseudoinverse
Neural Computation
Full regularization path for sparse principal component analysis
Proceedings of the 24th international conference on Machine learning
Denoising by sparse approximation: error bounds based on rate-distortion theory
EURASIP Journal on Applied Signal Processing
Texture classification using sparse frame-based representations
EURASIP Journal on Applied Signal Processing
Sparse representations are most likely to be the sparsest possible
EURASIP Journal on Applied Signal Processing
Algorithms for subset selection in linear regression
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Sparse coding via thresholding and local competition in neural circuits
Neural Computation
AMBROSia: An Autonomous Model-Based Reactive Observing System
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
On Sparsity Maximization in Tomographic Particle Image Reconstruction
Proceedings of the 30th DAGM symposium on Pattern Recognition
Optimal Solutions for Sparse Principal Component Analysis
The Journal of Machine Learning Research
Algorithm 890: Sparco: A Testing Framework for Sparse Reconstruction
ACM Transactions on Mathematical Software (TOMS)
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Multi-task Feature Selection Using the Multiple Inclusion Criterion (MIC)
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I
Updates for nonlinear discriminants
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
False data injection attacks against state estimation in electric power grids
Proceedings of the 16th ACM conference on Computer and communications security
A plurality of sparse representations is better than the sparsest one alone
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Spatio-temporal prediction in video coding by best approximation
PCS'09 Proceedings of the 27th conference on Picture Coding Symposium
ISBI'09 Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro
A sparsity detection framework for on-off random access channels
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
On the equivalence between the MMSE receiver and Tikhonov regularization
SoftCOM'09 Proceedings of the 17th international conference on Software, Telecommunications and Computer Networks
Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting
IEEE Transactions on Information Theory
Necessary and sufficient conditions for sparsity pattern recovery
IEEE Transactions on Information Theory
Stagewise weak gradient pursuits
IEEE Transactions on Signal Processing
Relaxed conditions for sparse signal recovery with general concave priors
IEEE Transactions on Signal Processing
On semi-supervised learning and sparsity
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Sparse approximate solution of partial differential equations
Applied Numerical Mathematics
A Fast Hybrid Algorithm for Large-Scale l1-Regularized Logistic Regression
The Journal of Machine Learning Research
A bidirectional greedy heuristic for the subspace selection problem
SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
Variance-component based sparse signal reconstruction and model selection
IEEE Transactions on Signal Processing
Model-based compressive sensing
IEEE Transactions on Information Theory
Theoretical and empirical results for recovery from multiple measurements
IEEE Transactions on Information Theory
Information-theoretic limits on sparse signal recovery: dense versus sparse measurement matrices
IEEE Transactions on Information Theory
Sparse approximation through boosting for learning large scale kernel machines
IEEE Transactions on Neural Networks
Dictionary identification: sparse matrix-factorization via l1-minimization
IEEE Transactions on Information Theory
Greedy sparse signal reconstruction from sign measurements
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Two conditions for equivalence of 0-norm solution and 1-norm solution in sparse representation
IEEE Transactions on Neural Networks
IEEE Transactions on Signal Processing
Modified-CS: modifying compressive sensing for problems with partially known support
IEEE Transactions on Signal Processing
Sparse representation: extract adaptive neighborhood for multilabel classification
PRICAI'10 Proceedings of the 11th Pacific Rim international conference on Trends in artificial intelligence
Matrix sparsification and the sparse null space problem
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Hybrid compressive sampling via a new total variation TVL1
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part VI
Sound field reproduction using the Lasso
IEEE Transactions on Audio, Speech, and Language Processing
Optimized projection matrix for compressive sensing
EURASIP Journal on Advances in Signal Processing
False data injection attacks against state estimation in electric power grids
ACM Transactions on Information and System Security (TISSEC)
Minimum Description Length Penalization for Group and Multi-Task Sparse Learning
The Journal of Machine Learning Research
Journal of Visual Communication and Image Representation
SIAM Journal on Scientific Computing
Model-Based Multiple Rigid Object Detection and Registration in Unstructured Range Data
International Journal of Computer Vision
Identification of switched linear systems via sparse optimization
Automatica (Journal of IFAC)
Compressive evaluation in human motion tracking
ACCV'10 Proceedings of the 10th Asian conference on Computer vision - Volume Part IV
Diversity in ranking via resistive graph centers
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Sparsity Driven People Localization with a Heterogeneous Network of Cameras
Journal of Mathematical Imaging and Vision
Effective summarization of large-scale web images
MM '11 Proceedings of the 19th ACM international conference on Multimedia
Improved Bounds on Restricted Isometry Constants for Gaussian Matrices
SIAM Journal on Matrix Analysis and Applications
Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
SIAM Journal on Optimization
SIAM Journal on Optimization
Building a sparse kernel classifier on riemannian manifold
VSMM'06 Proceedings of the 12th international conference on Interactive Technologies and Sociotechnical Systems
On iterative compressed sensing reconstruction of sparse non-negative vectors
Proceedings of the 4th International Symposium on Applied Sciences in Biomedical and Communication Technologies
Sparse and silent coding in neural circuits
Neurocomputing
Iterative reweighted l1 design of sparse FIR filters
Signal Processing
Recovery of sparse representations by polytope faces pursuit
ICA'06 Proceedings of the 6th international conference on Independent Component Analysis and Blind Signal Separation
Column subset selection via sparse approximation of SVD
Theoretical Computer Science
Optimization with Sparsity-Inducing Penalties
Foundations and Trends® in Machine Learning
A compressive sensing scheme of frequency sparse signals for mobile and wearable platforms
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part II
Online learning in the embedded manifold of low-rank matrices
The Journal of Machine Learning Research
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Scalable Video Coding Using Compressive Sensing
Bell Labs Technical Journal
Compressed sensing and Cholesky decomposition on FPGAs and GPUs
Parallel Computing
Optimal exact least squares rank minimization
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Coherence Pattern-Guided Compressive Sensing with Unresolved Grids
SIAM Journal on Imaging Sciences
Adaptive Compressed Image Sensing Using Dictionaries
SIAM Journal on Imaging Sciences
Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization
SIAM Journal on Optimization
Sparsity without the complexity: loss localisation using tree measurements
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part I
Strengthening hash families and compressive sensing
Journal of Discrete Algorithms
Cost of not splitting in routing: characterization and estimation
IEEE/ACM Transactions on Networking (TON)
Journal of Approximation Theory
Image collection summarization via dictionary learning for sparse representation
Pattern Recognition
MOEA/D with iterative thresholding algorithm for sparse optimization problems
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
Accelerated Linearized Bregman Method
Journal of Scientific Computing
Compressive light field photography using overcomplete dictionaries and optimized projections
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
A note on the hardness of sparse approximation
Information Processing Letters
Greedy sparsity-constrained optimization
The Journal of Machine Learning Research
Sparse activity and sparse connectivity in supervised learning
The Journal of Machine Learning Research
Classification approach based on non-negative least squares
Neurocomputing
Most Tensor Problems Are NP-Hard
Journal of the ACM (JACM)
A comparison of typical ℓp minimization algorithms
Neurocomputing
Predicting cognitive data from medical images using sparse linear regression
IPMI'13 Proceedings of the 23rd international conference on Information Processing in Medical Imaging
Sparse projections of medical images onto manifolds
IPMI'13 Proceedings of the 23rd international conference on Information Processing in Medical Imaging
Attribute-efficient evolvability of linear functions
Proceedings of the 5th conference on Innovations in theoretical computer science
Theoretical Computer Science
Engineering Applications of Artificial Intelligence
Robust multivariate autoregression for anomaly detection in dynamic product ratings
Proceedings of the 23rd international conference on World wide web
A note on sparse least-squares regression
Information Processing Letters
Sleep posture analysis using a dense pressure sensitive bedsheet
Pervasive and Mobile Computing
Matrix Recipes for Hard Thresholding Methods
Journal of Mathematical Imaging and Vision
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Unsupervised images segmentation via incremental dictionary learning based sparse representation
Information Sciences: an International Journal
Hi-index | 0.50 |
The following problem is considered: given a matrix $A$ in ${\bf R}^{m \times n}$, ($m$ rows and $n$ columns), a vector $b$ in ${\bf R}^m$, and ${\bf \epsilon} 0$, compute a vector $x$ satisfying $\| Ax - b \|_2 \leq {\bf \epsilon}$ if such exists, such that $x$ has the fewest number of non-zero entries over all such vectors. It is shown that the problem is NP-hard, but that the well-known greedy heuristic is good in that it computes a solution with at most $\left\lceil 18 \mbox{ Opt} ({\bf \epsilon}/2) \|{\bf A}^+\|^2_2 \ln(\|b\|_2/{\bf \epsilon}) \right\rceil$ non-zero entries, where $\mbox{Opt}({\bf \epsilon}/2)$ is the optimum number of nonzero entries at error ${\bf \epsilon}/2$, ${\bf A}$ is the matrix obtained by normalizing each column of $A$ with respect to the $L_2$ norm, and ${\bf A}^+$ is its pseudo-inverse.