Fetching the paper…
Reading the bibliography…
The problem of $L_p$-norm constrained coding is to convert signal into code that lies inside an $L_p$-ball and most faithfully reconstructs the signal.
T. Pfister, J. Charles, and A. Zisserman, “Flowing convnets for human pose estimation in videos,” in ICCV , 2015, pp. 1913–1921
1921
Earlier work this paper cites.
M. Frank and P. Wolfe, “An algorithm for quadratic programming,” Naval Research Logistics , vol. 3, no. 1-2, pp. 95–110, 1956
1956
Earlier work this paper cites.
A. Krogh and J. A. Hertz, “A simple weight decay can improve generalization,” in NIPS , 1992, pp. 950–957
1992
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.
R. Tibshirani, “Regression shrinkage and selection via the lasso,” Journal of the Royal Statistical Society. Series B (Methodological) , pp. 267–288, 1996
1996
Earlier work this paper cites.
B. 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.
S. Hochreiter and J. Schmidhuber, “Long short-term memory,” Neural Computation , vol. 9, no. 8, pp. 1735–1780, 1997
1997
Earlier work this paper cites.
Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner, “Gradient-based learning applied to document recognition,” Proceedings of the IEEE , vol. 86, no. 11, pp. 2278–2324, 1998
1998
Earlier work this paper cites.
S. S. Chen, D. L. Donoho, and M. A. Saunders, “Atomic decomposition by basis pursuit,” SIAM Review , vol. 43, no. 1, pp. 129–159, 2001
2001
Earlier work this paper cites.
D. L. Donoho, “For most large underdetermined systems of linear equations the minimal ℓ 1 \ell_{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.
D. L. Donoho, “Compressed sensing,” IEEE Transactions on Information Theory , vol. 52, no. 4, pp. 1289–1306, 2006
2006
Earlier work this paper cites.
M. Elad and M. Aharon, “Image denoising via learned dictionaries and sparse representation,” in CVPR , vol. 1, 2006, pp. 895–900
2006
Earlier work this paper cites.
M. Aharon, M. Elad, and A. Bruckstein, “ K 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.
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. Ranzato, F.-J. Huang, Y.-L. Boureau, and Y. LeCun, “Unsupervised learning of invariant feature hierarchies with applications to object recognition,” in CVPR , 2007, pp. 1–8
2007
Earlier work this paper cites.
R. Chartrand and V. Staneva, “Restricted isometry properties and nonconvex compressive sensing,” Inverse Problems , vol. 24, no. 3, p. 035020, 2008
2008
Earlier work this paper cites.
H. Lee, C. Ekanadham, and A. Y. Ng, “Sparse deep belief net model for visual area V2,” in NIPS , 2008, pp. 873–880
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.
D. Krishnan and R. Fergus, “Fast image deconvolution using hyper-Laplacian priors,” in NIPS , 2009, pp. 1033–1041
2009
Earlier work this paper cites.
J. Yang, K. Yu, Y. Gong, and T. Huang, “Linear spatial pyramid matching using sparse coding for image classification,” in CVPR , 2009, pp. 1794–1801
2009
Earlier work this paper cites.
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
Earlier work this paper cites.
K. Jarrett, K. Kavukcuoglu, and Y. LeCun, “What is the best multi-stage architecture for object recognition?” in ICCV . IEEE, 2009, pp. 2146–2153
2009
Earlier work this paper cites.
Y. Lyubarskii and R. Vershynin, “Uncertainty principles and vector quantization,” IEEE Transactions on Information Theory , vol. 56, no. 7, pp. 3491–3501, 2010
2010
Earlier work this paper cites.
K. Gregor and Y. LeCun, “Learning fast approximations of sparse coding,” in ICML , 2010, pp. 399–406
2010
Earlier work this paper cites.
S. Lyu, “Divisive normalization: Justification and effectiveness as efficient coding transform,” in NIPS , 2010, pp. 1522–1530
2010
Earlier work this paper cites.
J.-J. Fuchs, “Spread representations,” in ASILOMAR , 2011, pp. 814–817
2011
Earlier work this paper cites.
M. Kloft, U. Brefeld, S. Sonnenburg, and A. Zien, “ l p l_{p} -norm multiple kernel learning,” Journal of Machine Learning Research , vol. 12, pp. 953–997, 2011
2011
Earlier work this paper cites.
S. Ross, D. Munoz, M. Hebert, and J. A. Bagnell, “Learning message-passing inference machines for structured prediction,” in CVPR , 2011, pp. 2737–2744
2011
Earlier work this paper cites.
P. Arbelaez, M. Maire, C. Fowlkes, and J. Malik, “Contour detection and hierarchical image segmentation,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 33, no. 5, pp. 898–916, 2011
2011
Cited alongside, same era.
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
Cited alongside, same era.
V. Chandrasekaran, B. Recht, P. A. Parrilo, and A. S. Willsky, “The convex geometry of linear inverse problems,” Foundations of Computational Mathematics , vol. 12, no. 6, pp. 805–849, 2012
2012
Cited alongside, same era.
H. C. Burger, C. J. Schuler, and S. Harmeling, “Image denoising: Can plain neural networks compete with BM3D?” in CVPR . IEEE, 2012, pp. 2392–2399
2012
Cited alongside, same era.
Z. Wang, Y. Yang, S. Chang, Q. Ling, and T. S. Huang, “Learning a deep ℓ ∞ \ell_{\infty} encoder for hashing,” in IJCAI , 2016, pp. 2174–2180
2016
Later among the works it cites.
S. Wang, S. Fidler, and R. Urtasun, “Proximal deep structured models,” in NIPS , 2016, pp. 865–873
2016
Later among the works it cites.
J. Sun, H. Li, and Z. Xu, “Deep ADMM-net for compressive sensing MRI,” in NIPS , 2016, pp. 10–18
2016
Later among the works it cites.
Z. Wang, S. Chang, J. Zhou, M. Wang, and T. S. Huang, “Learning a task-specific deep architecture for clustering,” in SDM . SIAM, 2016, pp. 369–377
2016
Later among the works it cites.
Z. Wang, D. Liu, S. Chang, Q. Ling, Y. Yang, and T. S. Huang, “D3: Deep dual-domain based fast restoration of JPEG-compressed images,” in CVPR , 2016, pp. 2764–2772
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Jaggi, “Revisiting Frank-Wolfe: Projection-free sparse convex optimization.” in ICML , 2013, pp. 427–435
2013
Cited alongside, same era.
2013
Cited alongside, same era.
H. Bristow, A. Eriksson, and S. Lucey, “Fast convolutional sparse coding,” in CVPR . IEEE, 2013, pp. 391–398
2013
Cited alongside, same era.
2013
Cited alongside, same era.
M. Lin, Q. Chen, and S. Yan, “Network in network,” arXiv preprint arXiv:1312.4400 , 2013
2013
Cited alongside, same era.
J. Bruna and S. Mallat, “Invariant scattering convolution networks,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 35, no. 8, pp. 1872–1886, 2013
2013
Cited alongside, same era.
2014
Cited alongside, same era.
U. Schmidt and S. Roth, “Shrinkage fields for effective image restoration,” in CVPR , 2014, pp. 2774–2781
2014
Cited alongside, same era.
2016
Later among the works it cites.
B. Xin, Y. Wang, W. Gao, D. Wipf, and B. Wang, “Maximal sparsity with deep networks?” in NIPS , 2016, pp. 4340–4348
2016
Later among the works it cites.
2016
Later among the works it cites.
U. S. Kamilov and H. Mansour, “Learning optimal nonlinearities for iterative thresholding algorithms,” IEEE Signal Processing Letters , vol. 23, no. 5, pp. 747–751, 2016
2016
Later among the works it cites.
C.-Y. Lee, P. W. Gallagher, and Z. Tu, “Generalizing pooling functions in convolutional neural networks: Mixed, gated, and tree,” in Artificial Intelligence and Statistics , 2016, pp. 464–472
2016
Later among the works it cites.
2016
Later among the works it cites.
2016
Later among the works it cites.
K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in CVPR , 2016, pp. 770–778
2016
Later among the works it cites.
Z. Wang, J. Yang, H. Zhang, Z. Wang, Y. Yang, D. Liu, and T. S. Huang, Sparse coding and its applications in computer vision . World Scientific, 2016
2016
Later among the works it cites.
C. Dong, C. C. Loy, K. He, and X. Tang, “Image super-resolution using deep convolutional networks,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 38, no. 2, pp. 295–307, 2016
2016
Later among the works it cites.
2016
Later among the works it cites.
Z. Wang, J. Liu, S. Huang, X. Wang, and S. Chang, “Transformed anti-sparse learning for unsupervised hashing,” in BMVC , 2017, pp. 1–12
2017
Later among the works it cites.
Z. Wang, S. Huang, J. Zhou, and T. S. Huang, “Doubly sparsifying network,” in IJCAI . AAAI Press, 2017, pp. 3020–3026
2017
Later among the works it cites.
L. Zhang, G. Wang, D. Romero, and G. B. Giannakis, “Randomized block Frank-Wolfe for convergent large-scale learning,” IEEE Transactions on Signal Processing , vol. 65, no. 24, pp. 6448–6461, 2017
2017
Later among the works it cites.
2017
Later among the works it cites.
K. Zhang, W. Zuo, Y. Chen, D. Meng, and L. Zhang, “Beyond a Gaussian denoiser: Residual learning of deep CNN for image denoising,” IEEE Transactions on Image Processing , vol. 26, no. 7, pp. 3142–3155, 2017
2017
Later among the works it cites.
N. Bansal, X. Chen, and Z. Wang, “Can we gain more from orthogonality regularizations in training deep networks?” in NIPS , 2018, pp. 4261–4271
2018
Closest in time.
J. Zhang and B. Ghanem, “ISTA-Net: Interpretable optimization-inspired deep network for image compressive sensing,” in CVPR , 2018, pp. 1828–1837
2018
Closest in time.
X. Chen, J. Liu, Z. Wang, and W. Yin, “Theoretical linear convergence of unfolded ISTA and its practical weights and thresholds,” in NIPS , 2018, pp. 9061–9071
2018
Closest in time.
D. Liu, B. Wen, X. Liu, Z. Wang, and T. S. Huang, “When image denoising meets high-level vision tasks: A deep learning approach,” in IJCAI . AAAI Press, 2018, pp. 842–848
2018
Closest in time.
H. Sreter and R. Giryes, “Learned convolutional sparse coding,” in ICASSP , 2018, pp. 2191–2195
2018
Closest in time.
H. Xu, Z. Wang, H. Yang, D. Liu, and J. Liu, “Learning simple thresholded features with sparse support recovery,” IEEE Transactions on Circuits and Systems for Video Technology, DOI: 10.1109/TCSVT.2019.2901713 , 2019
2019
Closest in time.
J. Liu, X. Chen, Z. Wang, and W. Yin, “ALISTA: Analytic weights are as good as learned weights in LISTA,” ICLR 2019, https://openreview.net/forum?id=B1lnzn0ctQ , 2019
2019
Closest in time.