Fetching the paper…
Reading the bibliography…
Compressed Sensing (CS) is a novel technique for simultaneous signal sampling and compression based on the existence of a sparse representation of signal and a projected dictionary $PD$, where $P\in\mathbb{R}^{m\times d}$ is the projection matrix and $D\in\mathbb{R}^{d\times n}$ is the dictionary.
L. Welch, Lower bounds on the maximum cross correlation of signals (corresp.), IEEE Transactions on Information theory (1974) 397–399
1974
Earlier work this paper cites.
Y. C. Pati, R. Rezaiifar, P. Krishnaprasad, Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition, in: Signals, Systems and Computers, 1993. 1993 Conference Record of The Twenty-Seventh Asilomar Conference on, IEEE, 1993, pp. 40–44
1993
Earlier work this paper cites.
B. K. Natarajan, Sparse approximate solutions to linear systems, SIAM Journal on Computing 24 (2) (1995) 227–234
1995
Earlier work this paper cites.
S. S. Chen, D. L. Donoho, M. A. Saunders, Atomic decomposition by basis pursuit, SIAM Journal on Scientific Computing 20 (1) (1998) 33–61
1998
Earlier work this paper cites.
R. R. Tyrrell, W. Roger (Eds.), Variational Analysis, Springer, 1998
1998
Earlier work this paper cites.
K. Schnass, P. Vandergheynst, Dictionary preconditioning for greedy algorithms, IEEE Transactions on Signal Processing 56 (5) (2008) 1994–2002
2002
Earlier work this paper cites.
R. Gribonval, M. Nielsen, Sparse representations in unions of bases, IEEE Transactions on Information Theory 49 (12) (2003) 3320–3325
2003
Earlier work this paper cites.
D. L. Donoho, M. Elad, Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 \ell_{1} minimization, Proceedings of the National Academy of Sciences 100 (5) (2003) 2197–2202
2003
Earlier work this paper cites.
J. A. Tropp, Greed is good: Algorithmic results for sparse approximation, IEEE Transactions on Information Theory 50 (10) (2004) 2231–2242
2004
Earlier work this paper cites.
Y. Nesterov, Smooth minimization of non-smooth functions, Mathematical Programming 103 (1) (2005) 127–152
2005
Cited alongside, same era.
E. J. Candès, J. Romberg, T. Tao, Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information, IEEE Transactions on Information Theory 52 (2) (2006) 489–509
2006
Cited alongside, same era.
D. L. Donoho, Compressed sensing, IEEE Transactions on Information Theory 52 (4) (2006) 1289–1306
2006
Cited alongside, same era.
E. J. Candes, T. Tao, Near-optimal signal recovery from random projections: Universal encoding strategies?, IEEE Transactions on Information Theory 52 (12) (2006) 5406–5425
2006
Cited alongside, same era.
M. Elad, Optimized projections for compressed sensing, IEEE Transactions on Signal Processing 55 (12) (2007) 5695–5702
2007
Cited alongside, same era.
H. Rauhut, Compressive sensing and structured random matrices, Theoretical foundations and numerical methods for sparse recovery 9 (2010) 1–92
2010
Later among the works it cites.
B. Li, Y. Shen, J. Li, Dictionaries construction using alternating projection method in compressive sensing, IEEE Signal Processing Letters 18 (11) (2011) 663–666
2011
Later among the works it cites.
G. Puy, P. Vandergheynst, Y. Wiaux, On variable density compressive sampling, IEEE Signal Processing Letters 18 (10) (2011) 595–598
2011
Later among the works it cites.
H. Attouch, J. Bolte, B. F. Svaiter, Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized gauss–seidel methods, Mathematical Programming 137 (1-2) (2013) 91–129
2013
Later among the works it cites.
J. Mairal, Optimization with first-order surrogate functions, in: International Conference on Machine Learning, 2013, pp. 783–791
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
E. Candes, J. Romberg, Sparsity and incoherence in compressive sampling, Inverse problems 23 (3) (2007) 969
2007
Cited alongside, same era.
Y. S. John Duchi, Shai Shalev-Shwartz, T. Chandra, Efficient projections onto the ℓ 1 \ell_{1} -ball for learning in high dimensions, in: International Conference of Machine Learning, 2008
2008
Cited alongside, same era.
J. M. Duarte-Carvajalino, G. Sapiro, Learning to sense sparse signals: Simultaneous sensing matrix and sparsifying dictionary optimization, IEEE Transactions on Image Processing 18 (7) (2009) 1395–1408
2009
Cited alongside, same era.
J. Xu, Y. Pi, Z. Cao, Optimized projection matrix for compressive sensing, EURASIP Journal on Advances in Signal Processing 2010 (2010) 43
2010
Cited alongside, same era.
M. Eald, Sparse and redundant representations: From theory to applications in signal and image processing, Springer
Cited in the paper.
2013
Later among the works it cites.
C. Bao, Y. Quan, H. Ji, A convergent incoherent dictionary learning algorithm for sparse coding, in: European Conference on Computer Vision, Springer, 2014, pp. 302–316
2014
Later among the works it cites.
S. S. Jérôme Bolte, M. Teboullez, Proximal alternating linearized minimization for nonconvex and nonsmooth problems, Mathematical Programming 146 (1-2) (2014) 459–494
2014
Later among the works it cites.
D. Barchiesi, M. D. Plumbley, Learning incoherent dictionaries for sparse approximation using iterative projections and rotations, IEEE Transactions on Signal Processing 61 (8) (2013) 2055–2065
2065
Closest in time.