Fetching the paper…
Reading the bibliography…
Sparse coding or sparse dictionary learning has been widely used to recover underlying structure in many kinds of natural data.
T. Szele, “Kombinatorikai vizsgalatok az iranyitott teljes graffal kapcsolatban,” Mat. Fiz. Lapok , vol. 50, pp. 223–256, 1943
1943
Earlier work this paper cites.
P. Erdős, “Some remarks on the theory of graphs,” Bull. Amer. Math. Soc , vol. 53, no. 2, pp. 292–294, 1947
1947
Earlier work this paper cites.
F. Attneave, “Informational aspects of visual perception,” Psychol. Rev. , vol. 61, pp. 183–93, 1954
1954
Earlier work this paper cites.
H. B. Barlow, “Sensory mechanisms, the reduction of redundancy, and intelligence,” in Proc. of the Symposium on the Mechanization of Thought Processes , D. Blake and A. Utlley, Eds., vol. 2, 1959, pp. 537–574
1959
Earlier work this paper cites.
G. Hinton, “Connectionist learning procedures,” Artificial intelligence , vol. 40, no. 1-3, pp. 185–234, 1989
1989
Earlier work this paper cites.
P. Comon, “Independent component analysis, a new concept?” Signal processing , vol. 36, no. 3, pp. 287–314, 1994
1994
Earlier work this paper cites.
A. Bell and T. Sejnowski, “An information-maximization approach to blind separation and blind deconvolution,” Neural computation , vol. 7, no. 6, pp. 1129–1159, 1995
1995
Earlier work this paper cites.
B. Olshausen and D. Field, “Emergence of simple-cell receptive field properties by learning a sparse code for natural images,” Nature , vol. 381, no. 6583, pp. 607–609, 1996
1996
Earlier work this paper cites.
J. Hurri, A. Hyvärinen, J. Karhunen, and E. Oja, “Image feature extraction using independent component analysis,” in Proc. NORSIG , 1996, pp. 475–478
1996
Earlier work this paper cites.
A. Bell and T. Sejnowski, “Learning the higher-order structure of a natural sound,” Network: Computation in Neural Systems , vol. 7, no. 2, pp. 261–266, 1996
1996
Earlier work this paper cites.
A. Bell and T. Sejnowski, “The Òindependent componentsÓ of natural scenes are edge filters,” Vision research , vol. 37, no. 23, pp. 3327–3338, 1997
1997
Earlier work this paper cites.
J. van Hateren and A. van der Schaaf, “Independent component filters of natural images compared with simple cells in primary visual cortex,” Proceedings of the Royal Society of London. Series B: Biological Sciences , vol. 265, no. 1394, pp. 359–366, 1998
1998
Earlier work this paper cites.
S. Chen, D. Donoho, and M. Saunders, “Atomic decomposition by basis pursuit,” SIAM review , vol. 43, p. 129, 2001
2001
Earlier work this paper cites.
E. Candes and T. Tao, “Decoding by linear programming,” Information Theory, IEEE Transactions on , vol. 51, no. 12, pp. 4203–4215, 2005
2005
Earlier work this paper cites.
E. Smith and M. Lewicki, “Efficient auditory coding,” Nature , vol. 439, no. 7079, pp. 978–982, 2006
2006
Earlier work this paper cites.
M. Aharon, M. Elad, and A. Bruckstein, “On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them,” Linear Algebra and its Applications , vol. 416, no. 1, pp. 48–67, 2006
2006
Cited alongside, same era.
D. Donoho, “Compressed sensing,” Information Theory, IEEE Transactions on , vol. 52, no. 4, pp. 1289–1306, 2006
2006
Cited alongside, same era.
M. Rehn and F. Sommer, “A network that uses few active neurones to code visual input predicts the diverse shapes of cortical receptive fields,” Journal of Computational Neuroscience , vol. 22, no. 2, pp. 135–146, 2007
2007
Cited alongside, same era.
R. Baraniuk, M. Davenport, R. DeVore, and M. Wakin, “A simple proof of the restricted isometry property for random matrices,” Constructive Approximation , vol. 28, no. 3, pp. 253–263, 2008
2008
Cited alongside, same era.
N. Alon and J. Spencer, The probabilistic method . Wiley-Interscience, 2011, vol. 73
2011
Closest in time.
J. Bourgain, S. Dilworth, K. Ford, S. Konyagin, and D. Kutzarova, “Explicit constructions of RIP matrices and related problems,” Duke Mathematical Journal , vol. 159, no. 1, pp. 145–185, 2011
2011
Closest in time.
A. Coates and A. Ng, “The importance of encoding versus training with sparse coding and vector quantization,” in Proc. of the 28th International Conference on Machine Learning (ICML) , L. Getoor and T. Scheffer, Eds., New York, NY, 2011, pp. 921–928
2011
Closest in time.
R. Rigamonti, M. Brown, and V. Lepetit, “Are sparse representations really relevant for image classification?” in Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on . IEEE, 2011, pp. 1545–1552
2011
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. Yang, K. Yu, Y. Gong, and T. Huang, “Linear spatial pyramid matching using sparse coding for image classification,” in Computer Vision and Pattern Recognition (CVPR), 2009 IEEE Conference on . IEEE, 2009, pp. 1794–1801
2009
Cited alongside, same era.
J. M. Hughes, D. J. Graham, and D. N. Rockmore, “Quantification of artistic style through sparse coding analysis in the drawings of Pieter Bruegel the Elder,” Proc. of the National Academy of Sciences , vol. 107, no. 4, pp. 1279–1283, 2010
2010
Cited alongside, same era.
W. Coulter, C. Hillar, G. Isley, and F. Sommer, “Adaptive compressed sensing: A new class of self-organizing coding models for neuroscience,” in Acoustics Speech and Signal Processing (ICASSP), 2010 IEEE International Conference on . IEEE, 2010, pp. 5494–5497
2010
Cited alongside, same era.
G. Isely, C. Hillar, and F. T. Sommer, “Deciphering subsampled data: adaptive compressive sampling as a principle of brain communication,” in Advances in Neural Information Processing Systems 23 , J. Lafferty, C. K. I. Williams, J. Shawe-Taylor, R. Zemel, and A. Culotta, Eds., 2010, pp. 910–918
2010
Cited alongside, same era.
C. Hillar, “Problem 11534,” American Mathematical Monthly , vol. 117, no. 9, p. 835, 2010
2010
Cited alongside, same era.
J. Mairal, F. Bach, J. Ponce, and G. Sapiro, “Online learning for matrix factorization and sparse coding,” The Journal of Machine Learning Research , vol. 11, pp. 19–60, 2010
2010
Cited alongside, same era.
R. Gribonval and K. Schnass, “Dictionary identification–sparse matrix-factorization via ℓ 1 \ell_{1} -minimization,” Information Theory, IEEE Transactions on , vol. 56, no. 7, pp. 3523–3539, 2010
2010
Cited alongside, same era.
Y.-L. Boureau, F. Bach, Y. LeCun, and J. Ponce, “Learning mid-level features for recognition,” in Computer Vision and Pattern Recognition (CVPR), 2010 IEEE Conference on . IEEE, 2010, pp. 2559–2566
2010
Cited alongside, same era.
N. L. Carlson, V. L. Ming, and M. R. DeWeese, “Sparse codes for speech predict spectrotemporal receptive fields in the inferior colliculus,” PLoS Comput Biol , vol. 8, no. 7, p. e1002594, 2012
2012
Closest in time.
A. Balavoine, J. Romberg, and C. Rozell, “Convergence and rate analysis of neural networks for sparse approximation,” Neural Networks and Learning Systems, IEEE Transactions on , vol. 23, no. 9, pp. 1377–1389, 2012
2012
Closest in time.
S. Li, F. Gao, G. Ge, and S. Zhang, “Deterministic construction of compressed sensing matrices via algebraic curves,” Information Theory, IEEE Transactions on , vol. 58, no. 8, pp. 5035–5041, 2012
2012
Closest in time.
D. A. Spielman, H. Wang, and J. Wright, “Exact recovery of sparsely-used dictionaries,” in Proceedings of the Twenty-Third international joint conference on Artificial Intelligence . AAAI Press, 2013, pp. 3087–3090
2013
Closest in time.
2013
Closest in time.
2013
Closest in time.
2013
Closest in time.
H. Monajemi, S. Jafarpour, M. Gavish, Stat 330 / CME 362 Collaboration, and D. L. Donoho, “Deterministic matrices matching the compressed sensing phase transitions of gaussian random matrices,” Proc. of the National Academy of Sciences , vol. 110, no. 4, pp. 1181–1186, 2013
2013
Closest in time.
G. Agarwal, I. H. Stevenson, A. Berényi, K. Mizuseki, G. Buzsáki, and F. T. Sommer, “Spatially distributed local fields in the hippocampus encode rat position,” Science , vol. 344, no. 6184, pp. 626–630, 2014
2014
Closest in time.