Efficient convolutional sparse coding

Wohlberg, Brendt

Efficient convolutional sparse coding

Patent · Tue Jun 20 00:00:00 EDT 2017

OSTI ID:1364429

Wohlberg, Brendt

Computationally efficient algorithms may be applied for fast dictionary learning solving the convolutional sparse coding problem in the Fourier domain. More specifically, efficient convolutional sparse coding may be derived within an alternating direction method of multipliers (ADMM) framework that utilizes fast Fourier transforms (FFT) to solve the main linear system in the frequency domain. Such algorithms may enable a significant reduction in computational cost over conventional approaches by implementing a linear solver for the most critical and computationally expensive component of the conventional iterative algorithm. The theoretical computational cost of the algorithm may be reduced from O(M.sup.3N) to O(MN log N), where N is the dimensionality of the data and M is the number of elements in the dictionary. This significant improvement in efficiency may greatly increase the range of problems that can practically be addressed via convolutional sparse representations.

View Patent

Research Organization:: Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)

Sponsoring Organization:: USDOE

DOE Contract Number:: AC52-06NA25396

Assignee:: Los Alamos National Security, LLC

Patent Number(s):: 9,684,951

Application Number:: 14/668,900

OSTI ID:: 1364429

Country of Publication:: United States

Language:: English

References (23)

Method of optimal directions for frame design Engan, K.; Aase, S. O.; Hakon Husoy, J. 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing https://doi.org/10.1109/ICASSP.1999.760624	conference	January 1999
Supervised translation-invariant sparse coding Yang, Jianchao; Yu, Kai; Huang, Thomas 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition https://doi.org/10.1109/CVPR.2010.5539958	conference	June 2010
From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images Bruckstein, Alfred M.; Donoho, David L.; Elad, Michael SIAM Review, Vol. 51, Issue 1, p. 34-81 https://doi.org/10.1137/060657704	journal	February 2009
Unsupervised learning of sparse and shift-invariant decompositions of polyphonic music Blumensath, T.; Davies, M. 2004 IEEE International Conference on Acoustics, Speech, and Signal Processing https://doi.org/10.1109/ICASSP.2004.1327156	conference	January 2004
A Sherman–Morrison approach to the solution of linear systems Egidi, N.; Maponi, P. Journal of Computational and Applied Mathematics, Vol. 189, Issue 1-2, p. 703-718 https://doi.org/10.1016/j.cam.2005.02.013	journal	May 2006
Sparse and shift-Invariant representations of music Blumensath, T.; Davies, M. IEEE Transactions on Audio, Speech and Language Processing, Vol. 14, Issue 1, p. 50-57 https://doi.org/10.1109/TSA.2005.860346	journal	January 2006
Dictionary Learning with Large Step Gradient Descent for Sparse Representations Mailhé, Boris; Plumbley, Mark D.; Theis, Fabian Latent Variable Analysis and Signal Separation, p. 231-238 https://doi.org/10.1007/978-3-642-28551-6_29	book	January 2012
General design algorithm for sparse frame expansions Skretting, Karl; Husøy, John Håkon; Aase, Sven Ole Signal Processing, Vol. 86, Issue 1, p. 117-126 https://doi.org/10.1016/j.sigpro.2005.04.013	journal	January 2006
Image compression using learned dictionaries by RLS-DLA and compared with K-SVD Skretting, Karl; Engan, Kjersti 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) https://doi.org/10.1109/ICASSP.2011.5946782	conference	May 2011
Task-Driven Dictionary Learning Mairal, J.; Bach, F.; Ponce, J. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 34, Issue 4, p. 791-804 https://doi.org/10.1109/TPAMI.2011.156	journal	April 2012
Adaptive deconvolutional networks for mid and high level feature learning Zeiler, Matthew D.; Taylor, Graham W.; Fergus, Rob 2011 International Conference on Computer Vision https://doi.org/10.1109/ICCV.2011.6126474	conference	November 2011
Explicit Shift-Invariant Dictionary Learning Rusu, Cristian; Dumitrescu, Bogdan; Tsaftaris, Sotirios A. IEEE Signal Processing Letters, Vol. 21, Issue 1, p. 6-9 https://doi.org/10.1109/LSP.2013.2288788	journal	January 2014
Fast Image Recovery Using Variable Splitting and Constrained Optimization Afonso, Manya V.; Bioucas-Dias, José M.; Figueiredo, Mário A. T. IEEE Transactions on Image Processing, Vol. 19, Issue 9, p. 2345-2356 https://doi.org/10.1109/TIP.2010.2047910	journal	September 2010
An Augmented Lagrangian Approach to the Constrained Optimization Formulation of Imaging Inverse Problems Afonso, M. V.; Bioucas-Dias, José M.; Figueiredo, Mário A. T. IEEE Transactions on Image Processing, Vol. 20, Issue 3, p. 681-695 https://doi.org/10.1109/TIP.2010.2076294	journal	March 2011
Multi-Scale Dictionary Learning Using Wavelets Ophir, Boaz; Lustig, Michael; Elad, Michael IEEE Journal of Selected Topics in Signal Processing, Vol. 5, Issue 5, p. 1014-1024 https://doi.org/10.1109/JSTSP.2011.2155032	journal	September 2011
Non-local sparse models for image restoration Mairal, Julien; Bach, Francis; Ponce, Jean 2009 IEEE 12th International Conference on Computer Vision https://doi.org/10.1109/ICCV.2009.5459452	conference	September 2009
Alternating Direction Method with Self-Adaptive Penalty Parameters for Monotone Variational Inequalities He, B. S.; Yang, H.; Wang, S. L. Journal of Optimization Theory and Applications, Vol. 106, Issue 2, p. 337-356 https://doi.org/10.1023/A:1004603514434	journal	August 2000
Atomic Decomposition by Basis Pursuit Chen, Scott Shaobing; Donoho, David L.; Saunders, Michael A. SIAM Review, Vol. 43, Issue 1 https://doi.org/10.1137/S003614450037906X	journal	January 2001
Updating the Inverse of a Matrix Hager, William W. SIAM Review, Vol. 31, Issue 2, p. 221-239 https://doi.org/10.1137/1031049	journal	June 1989
Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers Boyd, Stephen; Parikh, Neal; Chu, Eric https://doi.org/10.1561/2200000016	book	January 2011
Deconvolutional networks Zeiler, Matthew D.; Krishnan, Dilip; Taylor, Graham W. 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition https://doi.org/10.1109/CVPR.2010.5539957	conference	June 2010
Learning mid-level features for recognition Boureau, Y-Lan; Bach, Francis; LeCun, Yann 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition https://doi.org/10.1109/CVPR.2010.5539963	conference	June 2010
A fast proximal method for convolutional sparse coding Chalasani, Rakesh; Principe, Jose C.; Ramakrishnan, Naveen 2013 International Joint Conference on Neural Networks (IJCNN 2013 - Dallas), The 2013 International Joint Conference on Neural Networks (IJCNN) https://doi.org/10.1109/IJCNN.2013.6706854	conference	August 2013

Similar Records

Monaural Music Source Separation using Convolutional Sparse Coding

Journal Article · Thu Aug 04 00:00:00 EDT 2016 · IEEE/ACM Transactions on Audio, Speech, and Language Processing · OSTI ID:1495128

Efficient Algorithms for Convolutional Sparse Representations

Journal Article · Tue Oct 27 00:00:00 EDT 2015 · IEEE Transactions on Image Processing · OSTI ID:1471324

Convolutional Dictionary Regularizers for Tomographic Inversion

Conference · Wed May 01 00:00:00 EDT 2019 · OSTI ID:1511929

Related Subjects

97 MATHEMATICS AND COMPUTING

Efficient convolutional sparse coding

Citation Formats

References (23)

Similar Records

Related Subjects