Online Convolutional Dictionary Learning

K. Engan, S. O. Aase, and J. H. Husøy, “Method of optimal directions for frame design,” in Proc. IEEE Int. Conf. Acoust. Speech Signal Process. (ICASSP) , vol. 5, 1999, pp. 2443–2446. doi: 10.1109/icassp.1999.760624

1999

Earlier work this paper cites.

M. Aharon, M. Elad, and A. M. 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. doi: 10.1109/tsp.2006.881199

2006

Earlier work this paper cites.

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. doi: 10.1137/080716542

2009

Earlier work this paper cites.

K. Skretting and K. Engan, “Recursive least squares dictionary learning algorithm,” IEEE Transactions on Signal Processing , vol. 58, no. 4, pp. 2121–2130, Apr. 2010. doi: 10.1109/tsp.2010.2040671

2010

Earlier work this paper cites.

J. Mairal, F. Bach, J. Ponce, and G. Sapiro, “Online learning for matrix factorization and sparse coding,” Journal of Machine Learning Research , vol. 11, pp. 19–60, 2010

2010

Earlier work this paper cites.

M. D. Zeiler, D. Krishnan, G. W. Taylor, and R. Fergus, “Deconvolutional networks,” in Proc. IEEE Conf. Comp. Vis. Pat. Recog. (CVPR) , Jun. 2010, pp. 2528–2535. doi: 10.1109/cvpr.2010.5539957

2010

Earlier work this paper cites.

C. Lu, J. Shi, and J. Jia, “Online robust dictionary learning,” in Proc. IEEE Conf. Comp. Vis. Pat. Recog. (CVPR) , June 2013, pp. 415–422. doi: 10.1109/CVPR.2013.60

2013

Cited alongside, same era.

H. Bristow, A. Eriksson, and S. Lucey, “Fast convolutional sparse coding,” in Proc. IEEE Conf. Comp. Vis. Pat. Recog. (CVPR) , Jun. 2013, pp. 391–398. doi: 10.1109/CVPR.2013.57

2013

Cited alongside, same era.

J. Mairal, F. Bach, and J. Ponce, “Sparse modeling for image and vision processing,” Foundations and Trends in Computer Graphics and Vision , vol. 8, no. 2-3, pp. 85–283, 2014. doi: 10.1561/0600000058

2014

Cited alongside, same era.

Y. Naderahmadian, M. A. Tinati, and S. Beheshti, “Generalized adaptive weighted recursive least squares dictionary learning,” Signal Processing , vol. 118, pp. 89–96, 2016. doi: 10.1016/j.sigpro.2015.06.013

2015

Cited alongside, same era.

B. Wohlberg, “Efficient algorithms for convolutional sparse representations,” IEEE Transactions on Image Processing , vol. 25, no. 1, pp. 301–315, Jan. 2016. doi: 10.1109/TIP.2015.2495260

2015

Later among the works it cites.

M. Šorel and F. Šroubek, “Fast convolutional sparse coding using matrix inversion lemma,” Digital Signal Processing , vol. 55, pp. 44–51, 2016. doi: 10.1016/j.dsp.2016.04.012

2016

Later among the works it cites.

B. Wohlberg, “Convolutional sparse representation of color images,” in Proc. IEEE Southwest Symposium on Image Analysis and Interpretation (SSIAI) , Santa Fe, NM, USA, Mar. 2016, pp. 57–60. doi: 10.1109/SSIAI.2016.7459174

2016

Later among the works it cites.

——, “Boundary handling for convolutional sparse representations,” in Proc. IEEE Conf. Image Process. (ICIP) , Phoenix, AZ, USA, Sep. 2016, pp. 1833–1837. doi: 10.1109/ICIP.2016.7532675

2016

Later among the works it cites.