Fetching the paper…
Reading the bibliography…
Sparse representation has attracted much attention from researchers in fields of signal processing, image processing, computer vision and pattern recognition.
J. Cooley and J. Tukey, “An algorithm for the machine calculation of complex fourier series,” Mathematics of computation , vol. 19, no. 90, pp. 297–301, 1965
1965
Earlier work this paper cites.
S. Mehrotra, “On the implementation of a primal-dual interior point method,” SIAM Journal on optimization , vol. 2, no. 4, pp. 575–601, 1992
1992
Earlier work this paper cites.
E. Simoncelli, W. Freeman, E. Adelson, and D. Heeger, “Shiftable multiscale transforms,” IEEE Transactions on Information Theory , vol. 38, no. 2, pp. 587–607, 1992
1992
Earlier work this paper cites.
S. G. Mallat and Z. Zhang, “Matching pursuits with time-frequency dictionaries,” IEEE Transactions on Signal Processing , vol. 41, no. 12, pp. 3397–3415, 1993
1993
Earlier work this paper cites.
Y. C. Pati, R. Rezaiifar, and P. S. Krishnaprasad, “Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition,” in Proceedings of the Twenty-Seventh Asilomar Conference on Signals, Systems and Computers , 1993, pp. 40–44
1993
Earlier work this paper cites.
M. Irani and S. Peleg, “Motion analysis for image enhancement: Resolution, occlusion, and transparency,” Journal of Visual Communication and Image Representation , vol. 4, no. 4, pp. 324–335, 1993
1993
Earlier work this paper cites.
F. Samaria and A. Harter, “Parameterisation of a stochastic model for human face identification,” in Proceedings of the Second IEEE Workshop on Applications of Computer Vision , 1994, pp. 138–142
1994
Earlier work this paper cites.
B. K. Natarajan, “Sparse approximate solutions to linear systems,” SIAM journal on computing , vol. 24, no. 2, pp. 227–234, 1995
1995
Earlier work this paper cites.
D. L. Donoho, “De-noising by soft-thresholding,” IEEE Transactions on Information Theory , vol. 41, no. 3, pp. 613–627, 1995
1995
Earlier work this paper cites.
R. Tibshirani, “Regression shrinkage and selection via the lasso,” Journal of the Royal Statistical Society Series B , pp. 267–288, 1996
1996
Earlier work this paper cites.
E. Simoncelli and E. Adelson, “Noise removal via bayesian wavelet coring,” in International Conference on Image Processing , vol. 1, 1996, pp. 379–382
1996
Earlier work this paper cites.
S. Nene, S. Nayar, and H. Murase, “Columbia object image library (coil-20),” Technical Report CUCS-005-96, Tech. Rep., 1996
1996
Earlier work this paper cites.
S. J. Wright, Primal-dual interior-point methods . SIAM, 1997, vol. 54
1997
Earlier work this paper cites.
A. Olshausen and D. J. Field, “Sparse coding with an overcomplete basis set: A strategy employed by v1?” Vision research , vol. 37, no. 23, pp. 3311–3325, 1997
1997
Earlier work this paper cites.
E. Amaldi and V. Kann, “On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems,” Theoretical Computer Science , vol. 209, no. 1, pp. 237–260, 1998
1998
Earlier work this paper cites.
L. F. Portugal, M. Resende, G. Veiga, and J. Judice, “A truncated primal-infeasible dual-feasible network interior point method,” Networks , vol. 35, no. 2, pp. 91–108, 2000
2000
Earlier work this paper cites.
M. R. Osborne, B. Presnell, and B. A. Turlach, “A new approach to variable selection in least squares problems,” IMA journal of numerical analysis , vol. 20, no. 3, pp. 389–403, 2000
2000
Earlier work this paper cites.
K. Engan, S. O. Aase, and J. H.Husøy, “Multi-frame compression: Theory and design,” Signal Processing , vol. 80, no. 10, pp. 2121–2140, 2000
2000
Earlier work this paper cites.
J. Fan and R. Li, “Variable selection via nonconcave penalized likelihood and its oracle properties,” Journal of the American Statistical Association , vol. 96, no. 456, pp. 1348–1360, 2001
2001
Earlier work this paper cites.
A. Georghiades, P. Belhumeur, and D. Kriegman, “From few to many: Illumination cone models for face recognition under variable lighting and pose,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 23, no. 6, pp. 643–660, 2001
2001
Earlier work this paper cites.
J. Starck, E. Candes, and D. Donoho, “The curvelet transform for image denoising,” Image Processing, IEEE Transactions on , vol. 11, no. 6, pp. 670–684, 2002
2002
Earlier work this paper cites.
W. T. Freeman, T. R. Jones, and E. C. Pasztor, “Example-based super-resolution,” IEEE Computer Graphics and Applications , vol. 22, no. 2, pp. 56–65, 2002
2002
Earlier work this paper cites.
D. Donoho and M. Elad, “Optimally sparse representation in general (nonorthogonal) dictionaries via l 1 l_{1} minimization,” Proceedings of the National Academy of Sciences , vol. 100, no. 5, pp. 2197–2202, 2003
2003
Earlier work this paper cites.
K. Kreutz-Delgado, J. F. Murray, B. D. Rao, K. Engan, T. W. Lee, and T. J. Sejnowski, “Dictionary learning algorithms for sparse representation,” Neural computation , vol. 15, no. 2, pp. 349–396, 2003
2003
Earlier work this paper cites.
A. Nedic, D. Bertsekas, and A. Ozdaglar, “Convex analysis and optimization,” Athena Scientific , 2003
2003
Earlier work this paper cites.
J. A. Tropp, “Greed is good: Algorithmic results for sparse approximation,” IEEE Transactions on Information Theory , vol. 50, no. 10, pp. 2231–2242, 2004
2004
Earlier work this paper cites.
B. Efron, T. Hastie, I. Johnstone, I. Johnstone, and R. Tibshirani, “Least angle regression,” The Annals of statistics , vol. 32, no. 2, pp. 407–499, 2004
2004
Earlier work this paper cites.
I. Daubechies, M. Defrise, and C. D. Mol, “An iterative thresholding algorithm for linear inverse problems with a sparsity constraint,” Communications on pure and applied mathematics , vol. 57, no. 11, pp. 1413–1457, 2004
2004
Earlier work this paper cites.
M. Figueiredo and R. Nowak, “A bound optimization approach to wavelet-based image deconvolution,” in Proceedings of the IEEE International Conference on Image Processing , vol. 2, 2005, pp. II–782–5
2005
Earlier work this paper cites.
D. M. Malioutov, M. Cetin, and A. S. Willsky, “Homotopy continuation for sparse signal representation,” in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP’05) , vol. 5, 2005, pp. v733–v736
2005
Earlier work this paper cites.
E. L. Pennec and S. Mallat, “Sparse geometric image representations with bandelets,” IEEE Transactions on Image Processing , vol. 14, no. 4, pp. 423–438, 2005
2005
Earlier work this paper cites.
M. Do and M. Vetterli, “The contourlet transform: an efficient directional multiresolution image representation,” IEEE Transactions on Image Processing , vol. 14, no. 12, pp. 2091–2106, 2005
2005
Earlier work this paper cites.
A. Buades, B. Coll, and J. M. Morel, “A non-local algorithm for image denoising,” in Computer Vision and Pattern Recognition, 2005. CVPR 2005. IEEE Computer Society Conference on , vol. 2, 2005, pp. 60–65
2005
Earlier work this paper cites.
D. L. Donoho, “Compressed sensing,” IEEE Transactions on Information Theory , vol. 52, no. 4, pp. 1289–1306, 2006
2006
Earlier work this paper cites.
E. J. Candès, J. Romberg, and T. Tao, “Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information,” IEEE Transactions on Information Theory , vol. 52, no. 2, pp. 489–509, 2006
2006
Earlier work this paper cites.
Y. Tsaig and D. L. Donoho, “Extensions of compressed sensing,” Signal processing , vol. 86, no. 3, pp. 549–571, 2006
2006
Earlier work this paper cites.
E. J. Candes, “Compressive sampling,” in Proceedings of the International Congress of Mathematicians: Madrid, August 22-30, 2006: invited lectures , 2006, pp. 1433–1452
2006
Earlier work this paper cites.
J. A. Tropp, A. C. Gilbert, and M. J. Strauss, “Algorithms for simultaneous sparse approximation. part i: Greedy pursuit,” Signal Processing , vol. 86, no. 3, pp. 572–588, 2006
2006
Earlier work this paper cites.
J. A. Tropp, “Algorithms for simultaneous sparse approximation. part ii: Convex relaxation,” Signal Processing , vol. 86, no. 3, pp. 589–602, 2006
2006
Earlier work this paper cites.
J. Chen and X. Huo, “Theoretical results on sparse representations of multiple-measurement vectors,” IEEE Transactions on Signal Processing , vol. 54, no. 12, pp. 4634–4643, 2006
2006
Earlier work this paper cites.
D. Donoho, “For most large underdetermined systems of linear equations the minimal l 1 l_{1} -norm solution is also the sparsest solution,” Communications on pure and applied mathematics , vol. 59, no. 6, pp. 797–829, 2006
2006
Earlier work this paper cites.
E. Candes, J. Romberg, , and T. Tao, “Stable signal recovery from incomplete and inaccurate measurements,” Communications on pure and applied mathematics , vol. 59, no. 8, pp. 1207–1223, 2006
2006
Earlier work this paper cites.
E. Candes and T. Tao, “Near-optimal signal recovery from random projections: Universal encoding strategies?” IEEE Transaction on Information Theory , vol. 52, no. 12, pp. 5406–5425, 2006
2006
Earlier work this paper cites.
C. Ding, D. Zhou, X. He, and H. Zha, “R1-pca: rotational invariant l 1 l_{1} -norm principal component analysis for robust subspace factorization,” in Proceedings of the 23rd international conference on Machine learning , 2006, pp. 281–288
2006
Earlier work this paper cites.
P. Jost, P. Vandergheynst, and P. Frossard, “Tree-based pursuit: Algorithm and properties,” IEEE Transactions on Signal Processing , vol. 54, no. 12, pp. 4685–4697, 2006
2006
Earlier work this paper cites.
C. La and M. N. Do, “Tree-based orthogonal matching pursuit algorithm for signal reconstruction,” in IEEE International Conference on Image Processing , 2006, pp. 1277–1280
2006
Earlier work this paper cites.
Y. H. Dai, W. Hager, K. Schittkowski, and H. Zhang, “The cyclic barzilai—borwein method for unconstrained optimization,” IMA Journal of Numerical Analysis , vol. 26, no. 3, pp. 604–627, 2006
2006
Earlier work this paper cites.
M. D. Plumbley, “Recovery of sparse representations by polytope faces pursuit,” in Independent Component Analysis and Blind Signal Separation , 2006, pp. 206–213
2006
Earlier work this paper cites.
M. E. M. Aharon and A. Bruckstein, “k-svd: An algorithm for designing overcomplete dictionaries for sparse representation,” IEEE Transactions on Signal Processing , vol. 54, no. 11, pp. 4311–4322, 2006
2006
Earlier work this paper cites.
M. Elad and M. Aharon, “Image denoising via sparse and redundant representations over learned dictionaries,” IEEE Transactions on Image Processing , vol. 15, no. 12, pp. 3736–3745, 2006
2006
Earlier work this paper cites.
R. G. Baraniuk, “Compressive sensing,” IEEE signal processing magazine , vol. 24, no. 4, pp. 118–121, 2007
2007
Earlier work this paper cites.
E. Candes and J. Romberg, “Sparsity and incoherence in compressive sampling,” Inverse problems , vol. 23, no. 3, p. 969, 2007
2007
Earlier work this paper cites.
J. A. Tropp and A. C. Gilbert, “Signal recovery from random measurements via orthogonal matching pursuit,” IEEE Transactions on Information Theory , vol. 53, no. 12, pp. 4655–4666, 2007
2007
Earlier work this paper cites.
R. Chartrand, “Exact reconstruction of sparse signals via nonconvex minimization,” IEEE Signal Processing Letters , vol. 14, no. 10, pp. 707–710, 2007
2007
Earlier work this paper cites.
M. Schmidt, G. Fung, and R. Rosales, “Fast optimization methods for l 1 l_{1} regularization: A comparative study and two new approaches,” in Machine Learning: ECML 2007 . Springer, 2007, pp. 286–297
2007
Earlier work this paper cites.
M. Figueiredo, R. D. Nowak, and S. J. Wright, “Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems,” IEEE Journal of Selected Topics in Signal Processing , vol. 1, no. 4, pp. 586–597, 2007
2007
Earlier work this paper cites.
S. J. Kim, K. Koh, M. Lustig, S. Boyd, and D. Gorinevsky, “An interior-point method for large-scale l 1 l_{1} -regularized least squares,” IEEE Journal of Selected Topics in Signal Processing , vol. 1, no. 4, pp. 606–617, 2007
2007
Earlier work this paper cites.
K. Koh, S. J. Kim, and S. P. Boyd, “An interior-point method for large-scale l 1 l_{1} -regularized logistic regression.” Journal of Machine learning research , vol. 8, no. 8, pp. 1519–1555, 2007
2007
Earlier work this paper cites.
E. T. Hale, W. Yin, and Y. Zhang, “A fixed-point continuation method for l 1 l_{1} -regularized minimization with applications to compressed sensing,” Rice University, St, Houston, USA, Tech. Rep., 2007
2007
Earlier work this paper cites.
M. Elad, B. Matalon, and M. Zibulevsky, “Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization,” Applied and Computational Harmonic Analysis , vol. 23, no. 3, pp. 346–367, 2007
2007
Earlier work this paper cites.
K. Dabov, A. Foi, V. Katkovnik, and K. Egiazarian, “Image denoising by sparse 3-d transform-domain collaborative filtering,” IEEE Transactions on Image Processing , vol. 16, no. 8, pp. 2080–2095, 2007
2007
Earlier work this paper cites.
J. M. Bioucas-Dias and M. Figueiredo, “A new twist: two-step iterative shrinkage/thresholding algorithms for image restoration,” IEEE Transactions on Image Processing , vol. 16, no. 12, pp. 2992–3004, 2007
2007
Earlier work this paper cites.
G. Huang, M. Ramesh, T. Berg, and E. Learned-Miller, “Labeled faces in the wild: A database for studying face recognition in unconstrained environments,” Technical Report 07-49, University of Massachusetts, Amherst, Tech. Rep., 2007
2007
Earlier work this paper cites.
S. Mallat, A wavelet tour of signal processing: the sparse way . Academic press, 2008
2008
Earlier work this paper cites.
E. J. Candes and M. B. Wakin, “An introduction to compressive sampling,” IEEE Signal Processing Magazine , vol. 25, no. 2, pp. 21–30, 2008
2008
Earlier work this paper cites.
D. Donoho and Y. Tsaig, “Fast solution of l 1 l_{1} -norm minimization problems when the solution may be sparse.” IEEE Transactions on Information Theory , vol. 54, no. 11, pp. 4789–4812, 2008
2008
Earlier work this paper cites.
R. Chartrand and W. Yin, “Iteratively reweighted algorithms for compressive sensing,” in Proceedings of the IEEE international conference on Acoustics, speech and signal processing , 2008, pp. 3869–3872
2008
Earlier work this paper cites.
R. Saab, R. Chartrand, and O. Yilmaz, “Stable sparse approximations via nonconvex optimization,” in Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing , 2008, pp. 3885–3888
2008
Earlier work this paper cites.
T. T. Do, L. Gan, N. Nguyen, and T. Tran, “Sparsity adaptive matching pursuit algorithm for practical compressed sensing,” in Proceedings of the 42nd Asilomar Conference on Signals, Systems and Computers , 2008, pp. 581–587
2008
Earlier work this paper cites.
M. S. Asif, “Primal dual pursuit: A homotopy based algorithm for the dantzig selector,” Master’s thesis, Georgia Institute of Technology, Atlanta, Georgia, USA, 2008
2008
Earlier work this paper cites.
O. Bryt and M. Elad, “Compression of facial images using the k-svd algorithm,” Journal of Visual Communication and Image Representation , vol. 19, no. 4, pp. 270–282, 2008
2008
Earlier work this paper cites.
J. Yang, J. Wright, Y. Ma, and T. Huang, “Image super-resolution as sparse representation of raw image patches,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , 2008, pp. 1–8
2008
Earlier work this paper cites.
J. Mairal, M. Elad, and G. Sapiro, “Sparse representation for color image restoration,” IEEE Transactions on Image Processing , vol. 17, no. 1, pp. 53–69, 2008
2008
Earlier work this paper cites.
J. Mairal, G. Sapiro, and M. Elad, “Learning multiscale sparse representations for image and video restoration,” Multiscale Modeling and Simulation , vol. 7, no. 1, pp. 214–241, 2008
2008
Earlier work this paper cites.
A. M. Bruckstein, D. L. Donoho, and M. Elad, “From sparse solutions of systems of equations to sparse modeling of signals and images,” SIAM review , vol. 51, no. 1, pp. 34–81, 2009
2009
Cited alongside, same era.
Y. Yuan, X. Li, Y. Pang, X. Lu, and D. Tao, “Binary sparse nonnegative matrix factorization,” IEEE Transactions on Circuits and Systems for Video Technology , vol. 19, no. 5, pp. 772–779, 2009
2009
Cited alongside, same era.
J. Wright, A. Y. Yang, A. Ganesh, S. S. Sastry, and Y. Ma, “Robust face recognition via sparse representation,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 31, no. 2, pp. 210–227, 2009
2009
Cited alongside, same era.
M. Schmidt, G. Fung, and R. Rosales, “Optimization methods for l 1 l_{1} -regularization,” University of British Columbia, West Mall Vancouver, B.C. Canada V6T 1Z4, Tech. Rep., 2009
2009
Cited alongside, same era.
B. Liu, J. Huang, C. Kulikowski, and L. Yang, “Robust tracking using local sparse appearance model and k-selection,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , 2011, pp. 1313–1320
2011
Later among the works it cites.
J. Yang, L. Zhang, Y. Xu, and J. Yang, “Beyond sparsity: The role of l 1 l_{1} -optimizer in pattern classification,” Pattern Recognition , vol. 45, no. 3, pp. 1104–1118, 2012
2012
Later among the works it cites.
Z. Xu, X. Chang, F. Xu, and H. Zhang, “ l 1 / 2 l_{1/2} regularization: A thresholding representation theory and a fast solver,” IEEE Transactions on Neural Networks and Learning Systems , vol. 23, no. 7, pp. 1013–1027, 2012
2012
Later among the works it cites.
D. L. Donoho, Y. Tsaig, I. Drori, and J. Starck, “Sparse solution of underdetermined systems of linear equations by stagewise orthogonal matching pursuit,” IEEE Transactions on Information Theory , vol. 58, no. 2, pp. 1094–1121, 2012
2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Boyd and L. Vandenberghe, Convex optimization . Cambridge university press, 2009
2009
Cited alongside, same era.
D. Needell and R. Vershynin, “Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit,” Foundations of computational mathematics , vol. 9, no. 3, pp. 317–334, 2009
2009
Cited alongside, same era.
J. Liu, S. Ji, and J. Ye, “Multi-task feature learning via efficient l 2 , 1 l_{2,1} -norm minimization,” in Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence , 2009, pp. 339–348
2009
Cited alongside, same era.
D. Needell and J. A. Tropp, “Cosamp: Iterative signal recovery from incomplete and inaccurate samples,” Applied and Computational Harmonic Analysis , vol. 26, no. 3, pp. 301–321, 2009
2009
Cited alongside, same era.
W. Dai and O. Milenkovic, “Subspace pursuit for compressive sensing signal reconstruction,” IEEE Transactions on Information Theory , vol. 55, no. 5, pp. 2230–2249, 2009
2009
Cited alongside, same era.
A. Beck and M. Teboulle, “A fast iterative shrinkage-thresholding algorithm for linear inverse problems,” SIAM Journal on Imaging Sciences , vol. 2, no. 1, pp. 183–202, 2009
2009
Cited alongside, same era.
S. J. Wright, R. D. Nowak, and M. Figueiredo, “Sparse reconstruction by separable approximation,” IEEE Transactions on Signal Processing , vol. 57, no. 7, pp. 2479–2493, 2009
2009
Cited alongside, same era.
D. L. Donoho, A. Maleki, and A. Montanari, “Message-passing algorithms for compressed sensing,” Proceedings of the National Academy of Sciences , vol. 106, no. 45, pp. 18 914–18 919, 2009
2009
Cited alongside, same era.
M. S. Asif and J. Romberg, “Fast and accurate algorithms for re-weighted l 1 l_{1} -norm minimization,” IEEE Transactions on Signal Processing , vol. 61, no. 23, pp. 5905 – 5916, 2012
2012
Later among the works it cites.
J. H. Friedman, “Fast sparse regression and classification,” International Journal of Forecasting , vol. 28, no. 3, pp. 722–738, 2012
2012
Later among the works it cites.
M. Zhou, H. Chen, J. Paisley, L. Ren, L. Li, Z. Xing, D. Dunson, G. Sapiro, and L. Carin, “Nonparametric bayesian dictionary learning for analysis of noisy and incomplete images,” IEEE Transactions on Image Processing , vol. 21, no. 1, pp. 130–144, 2012
2012
Later among the works it cites.
I. Ramirez and G. Sapiro, “An mdl framework for sparse coding and dictionary learning,” IEEE Transactions on Signal Processing , vol. 60, no. 6, pp. 2913–2927, 2012
2012
Later among the works it cites.
S. Kong and D. Wang, “A dictionary learning approach for classification: separating the particularity and the commonality,” in European Conference on Computer Vision (ECCV) , 2012, pp. 186–199
2012
Later among the works it cites.
N. Zhou, Y. Shen, J. Peng, and J. Fan, “Learning inter-related visual dictionary for object recognition,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , 2012, pp. 3490–3497
2012
Later among the works it cites.
L. Ma, C. Wang, B. Xiao, and W. Zhou, “Sparse representation for face recognition based on discriminative low-rank dictionary learning,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , 2012, pp. 2586–2593
2012
Later among the works it cites.
Z. Jiang, G. Zhang, and L. S. Davis, “Submodular dictionary learning for sparse coding,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , 2012, pp. 3418–3425
2012
Later among the works it cites.
L. He, D. Tao, X. Li, and X. Gao, “Sparse representation for blind image quality assessment,” in Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition (CVPR) , 2012, pp. 1146–1153
2012
Later among the works it cites.
J. Zhang, C. Zhao, R. Xiong, S. Ma, and D. Zhao, “Image super-resolution via dual-dictionary learning and sparse representation,” in Proceedings of the IEEE International Symposium on Circuits and Systems (ISCAS) , 2012, pp. 1688–1691
2012
Later among the works it cites.
X. Gao, K. Zhang, D. Tao, and X. Li, “Image super-resolution with sparse neighbor embedding,” IEEE Transactions on Image Processing , vol. 21, no. 7, pp. 3194–3205, 2012
2012
Later among the works it cites.
X. Lu, H. Yuan, P. Yan, Y. Yuan, and X. Li, “Geometry constrained sparse coding for single image super-resolution,” in Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition (CVPR) , 2012, pp. 1648–1655
2012
Later among the works it cites.
W. Deng, J. Hu, and J. Guo, “Extended src: Undersampled face recognition via intraclass variant dictionary,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 34, no. 9, pp. 1864–1870, 2012
2012
Later among the works it cites.
X. Jia, H. Lu, and M. H. Yang, “Visual tracking via adaptive structural local sparse appearance model,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , 2012, pp. 1822–1829
2012
Later among the works it cites.
C. Bao, Y. Wu, H. Ling, and H. Ji, “Real time robust l 1 l_{1} tracker using accelerated proximal gradient approach,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , 2012, pp. 1830–1837
2012
Later among the works it cites.
W. Zhong, H. Lu, and M. H. Yang, “Robust object tracking via sparsity-based collaborative model,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , 2012, pp. 1838–1845
2012
Later among the works it cites.
S. Wang, J. Yang, M. Sun, X. Peng, M. Sun, and C. Zhou, “Sparse tensor discriminant color space for face verification,” IEEE Transactions on Neural Networks and Learning Systems , vol. 23, no. 6, pp. 876–888, 2012
2012
Later among the works it cites.
X. Lu, H. Wu, Y. Yuan, P. Yan, and X. Li, “Manifold regularized sparse nmf for hyperspectral unmixing,” IEEE Transactions on Geoscience and Remote Sensing , vol. 51, no. 5, pp. 2815–2826, 2013
2013
Later among the works it cites.
H. Cheng, Z. Liu, L. Yang, and X. Chen, “Sparse representation and learning in visual recognition: Theory and applications,” Signal Processing , vol. 93, no. 6, pp. 1408–1425, 2013
2013
Later among the works it cites.
N. Parikh and S. Boyd, “Proximal algorithms,” Foundations and Trends in Optimization , vol. 1, no. 3, pp. 123–231, 2013
2013
Later among the works it cites.
L. Qin, Z. C. Lin, Y. Y. She, and C. Zhang, “A comparison of typical l p l_{p} minimization algorithms,” Neurocomputing , vol. 119, pp. 413–424, 2013
2013
Later among the works it cites.
S. Guo, Z. Wang, and Q. Ruan, “Enhancing sparsity via l p l_{p} (0 < < p < < 1) minimization for robust face recognition,” Neurocomputing , vol. 99, pp. 592–602, 2013
2013
Later among the works it cites.
N. B. Karahanoglu and H. Erdogan, “Compressed sensing signal recovery via forward–backward pursuit,” Digital Signal Processing , vol. 23, no. 5, pp. 1539–1548, 2013
2013
Later among the works it cites.
J. Zeng, Z. Xu, B. Zhang, W. Hong, and Y. Wu, “Accelerated l 1 / 2 l_{1/2} regularization based sar imaging via bcr and reduced newton skills,” Signal Processing , vol. 93, no. 7, pp. 1831–1844, 2013
2013
Later among the works it cites.
A. Yang, Z. Zhou, A. Balasubramanian, S. Sastry, and Y. Ma, “Fast l 1 l_{1} -minimization algorithms for robust face recognition,” IEEE Transactions on Image Processing , vol. 22, no. 8, pp. 3234–3246, 2013
2013
Later among the works it cites.
2013
Later among the works it cites.
M. S. Asif, “Dynamic compressive sensing: Sparse recovery algorithms for streaming signals and video,” Ph.D. dissertation, Georgia Institute of Technology, Atlanta, Georgia, Unit State of America, 2013
2013
Later among the works it cites.
M. Yang, L. Van, and L. Zhang, “Sparse variation dictionary learning for face recognition with a single sample per person,” in Proceedings of the IEEE International Conference on Computer Vision (ICCV) , 2013, pp. 689–696
2013
Later among the works it cites.
Z. Jiang, Z. Lin, and L. Davis, “Label consistent k-svd: learning a discriminative dictionary for recognition,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 35, no. 11, pp. 2651–2664, 2013
2013
Later among the works it cites.
S. Gao, I. W. Tsang, and Y. Ma, “Learning category-specific dictionary and shared dictionary for fine-grained image categorization,” IEEE Transactions on Image Processing , vol. 23, no. 2, pp. 623–634, 2013
2013
Later among the works it cites.
Y. Tang, Y. Yuan, P. Yan, and X. Li, “Greedy regression in sparse coding space for single-image super-resolution,” Journal of visual communication and image representation , vol. 24, no. 2, pp. 148–159, 2013
2013
Later among the works it cites.
C. Fernandez-Granda and E. J. Candes, “Super-resolution via transform-invariant group-sparse regularization,” in IEEE International Conference on Computer Vision (ICCV) , 2013, pp. 3336–3343
2013
Later among the works it cites.
P. Cheng, C. Deng, S. Wang, and C. Zhang, “Image denoising via group sparse representation over learned dictionary,” in Proceedings of the Eighth International Symposium on Multispectral Image Processing and Pattern Recognition , 2013, pp. 891 916–891 916
2013
Later among the works it cites.
C. Bao, J. F. Cai, and H. Ji, “Fast sparsity-based orthogonal dictionary learning for image restoration,” in Proceedings of the IEEE International Conference on Computer Vision , 2013, pp. 3384–3391
2013
Later among the works it cites.
W. Dong, L. Zhang, G. Shi, and X. Li, “Nonlocally centralized sparse representation for image restoration,” IEEE Transactions on Image Processing , vol. 22, no. 4, pp. 1620–1630, 2013
2013
Later among the works it cites.
——, “In defense of sparsity based face recognition,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , 2013, pp. 399–406
2013
Later among the works it cites.
T. Zhang, B. Ghanem, S. Liu, C. Xu, and N. Ahuja, “Low-rank sparse coding for image classification,” in Proceedings of the IEEE International Conference on Computer Vision , 2013, pp. 281–288
2013
Later among the works it cites.
Y. Zhang, Z. Jiang, and L. S. Davis, “Learning structured low-rank representations for image classification,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , 2013, pp. 676–683
2013
Later among the works it cites.
D. Tao, L. Jin, Y. Zhao, and X. Li, “Rank preserving sparse learning for kinect based scene classification,” IEEE Transactions on Cybernetics , vol. 43, no. 5, pp. 1406–1417, 2013
2013
Later among the works it cites.
Y. Zhang, Z. Jiang, and L. S. Davis, “Discriminative tensor sparse coding for image classification,” in Proceedings of the British Machine Vision Conference , 2013
2013
Later among the works it cites.
X. Lu, Y. Yuan, and P. Yan, “Robust visual tracking with discriminative sparse learning,” Pattern Recognition , vol. 46, no. 7, pp. 1762–1771, 2013
2013
Later among the works it cites.
N. Wang, J. Wang, and D. Y. Yeung, “Online robust non-negative dictionary learning for visual tracking,” in Proceedings of the IEEE International Conference on Computer Vision , 2013, pp. 657–664
2013
Later among the works it cites.
S. Zhang, H. Yao, X. Sun, and X. Lu, “Sparse coding based visual tracking: Review and experimental comparison,” Pattern Recognition , vol. 46, no. 7, pp. 1772–1788, 2013
2013
Later among the works it cites.
A. Smeulders, D. Chu, R. Cucchiara, S. Calderara, A. Dehghan, and M. Shah, “Visual tracking: An experimental survey,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 36, no. 7, pp. 1442–1468, 2013
2013
Later among the works it cites.
M. Huang, W. Yang, J. Jiang, Y. Wu, Y. Zhang, W. Chen, and Q. Feng, “Brain extraction based on locally linear representation-based classification,” NeuroImage , vol. 92, pp. 322–339, 2014
2014
Later among the works it cites.
X. Lu and X. Li, “Group sparse reconstruction for image segmentation,” Neurocomputing , vol. 136, pp. 41–48, 2014
2014
Later among the works it cites.
Z. Zhang, Z. Li, B. Xie, L. Wang, and Y. Chen, “Integrating globality and locality for robust representation based classification,” Mathematical Problems in Engineering , vol. 2014, 2014
2014
Later among the works it cites.
X. S. Shi, Y. J. Yang, Z. H. Guo, and Z. H. Lai, “Face recognition by sparse discriminant analysis via joint l 2 , 1 l_{2,1} -norm minimization,” Pattern Recognition , vol. 47, no. 7, pp. 2447–2453, 2014
2014
Later among the works it cites.
C. Hou, F. Nie, X. Li, D. Yi, and Y. Wu, “Joint embedding learning and sparse regression: A framework for unsupervised feature selection,” IEEE Transactions on Cybernetics , vol. 44, no. 6, pp. 793–804, 2014
2014
Later among the works it cites.
L. Liu, L. Shao, F. Zheng, and X. Li, “Realistic action recognition via sparsely-constructed gaussian processes,” Pattern Recognition , vol. 47, no. 12, pp. 3819–3827, 2014
2014
Later among the works it cites.
Y. Yuan, X. Lu, and X. Li, “Learning hash functions using sparse reconstruction,” in Proceedings of International Conference on Internet Multimedia Computing and Service , 2014, pp. 14–18
2014
Later among the works it cites.
H. J. Zeng, S. Lin, Y. Wang, and Z. Xu, “ l 1 / 2 l_{1/2} regularization: convergence of iterative half thresholding algorithm,” IEEE Transactions on Signal Processing , vol. 62, no. 9, pp. 2317–2329, 2014
2014
Later among the works it cites.
L. Shao, R. Yan, X. Li, and Y. Liu, “From heuristic optimization to dictionary learning: a review and comprehensive comparison of image denoising algorithms,” IEEE Transactions on Cybernetics , vol. 44, no. 7, pp. 1001–1013, 2014
2014
Later among the works it cites.
C. Bao, H. Ji, Y. Quan, and Z. Shen, “ l 0 l_{0} norm based dictionary learning by proximal methods with global convergence,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , 2014, pp. 3858–3865
2014
Later among the works it cites.
J. Lu, G. Wang, W. Deng, and P. Moulin, “Simultaneous feature and dictionary learning for image set based face recognition,” in European Conference on Computer Vision (ECCV) , 2014, pp. 265–280
2014
Later among the works it cites.
M. Yang, D. Dai, L. Shen, and L. V. Gool, “Latent dictionary learning for sparse representation based classification,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , 2014, pp. 4138–4145
2014
Later among the works it cites.
S. Cai, W. Zuo, L. Zhang, X. Feng, and P. Wang, “Support vector guided dictionary learning,” in European Conference on Computer Vision (ECCV) , 2014, pp. 624–639
2014
Later among the works it cites.
X. Qin, J. Shen, X. Li, and Y. Jia, “A new sparse feature-based patch for dense correspondence,” in Proceedings of the IEEE International Conference on Multimedia and Expo (ICME) , 2014, pp. 1–6
2014
Later among the works it cites.
J. Jiang, L. Zhang, and J. Yang, “Mixed noise removal by weighted encoding with sparse nonlocal regularization,” IEEE Transactions on Image Processing , vol. 23, no. 6, pp. 2651–2662, 2014
2014
Later among the works it cites.
S. Gu, L. Zhang, W. Zuo, and X. Feng, “Weighted nuclear norm minimization with application to image denoising,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , 2014
2014
Later among the works it cites.
J. Zhang, D. Zhao, and W. Gao, “Group-based sparse representation for image restoration,” IEEE Transactions on Image Processing , vol. 34, no. 9, pp. 1864–1870, 2014
2014
Later among the works it cites.
2014
Later among the works it cites.
R. Rigamonti, V. Lepetit, G. González, E. Turetken, F. Benmansour, M. Brown, and P. Fua, “On the relevance of sparsity for image classification,” Computer Vision and Image Understanding , vol. 125, pp. 115–127, 2014
2014
Later among the works it cites.
K. Zhang, L. Zhang, and M. Yang, “Fast compressive tracking,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 36, no. 10, pp. 2002–2015, 2014
2014
Later among the works it cites.
2014
Later among the works it cites.
Z. Zhang, L. Wang, Q. Zhu, Z. Liu, and Y. Chen, “Noise modeling and representation based classification methods for face recognition,” Neurocomputing , vol. 148, pp. 420–429, 2015
2015
Later among the works it cites.
W. He, Y. Zi, B. Chen, F. Wu, and Z. He, “Automatic fault feature extraction of mechanical anomaly on induction motor bearing using ensemble super-wavelet transform,” Mechanical Systems and Signal Processing , vol. 54, pp. 457–480, 2015
2015
Later among the works it cites.
T. Zhang, B. Ghanem, S. Liu, and N. Ahuja, “Robust visual tracking via multi-task sparse learning,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , 2012, pp. 2042–2049
2049
Closest in time.
T. Zhang, B. Ghanem, S. Liu, and N. Ahuja, “Robust visual tracking via multi-task sparse learning,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , 2012, pp. 2042–2049
2049
Closest in time.