Title: Efficient convolutional sparse coding

Abstract

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.

Inventors:

Wohlberg, Brendt

Issue Date:

2017-06-20

Research Org.:

Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

Sponsoring Org.:

USDOE

OSTI Identifier:

1364429

Patent Number(s):

9684951

Application Number:

14/668,900

Assignee:

Los Alamos National Security, LLC

Patent Classifications (CPCs):

H - ELECTRICITY H03 - BASIC ELECTRONIC CIRCUITRY H03M - CODING

G - PHYSICS G06 - COMPUTING G06T - IMAGE DATA PROCESSING OR GENERATION, IN GENERAL

Show more

H - ELECTRICITY H03 - BASIC ELECTRONIC CIRCUITRY H03M - CODING

H03M7/00 - Conversion of a code where information is represented by a given sequence or number of digits to a code where the same {, similar or subset of} information is represented by a different sequence or number of digits

G - PHYSICS G06 - COMPUTING G06T - IMAGE DATA PROCESSING OR GENERATION, IN GENERAL

G06T5/001 - {Image restoration}
G06T2207/20056 - Discrete and fast Fourier transform, [DFT, FFT]
G06T5/004 - {Unsharp masking}

G - PHYSICS G06 - COMPUTING G06F - ELECTRIC DIGITAL DATA PROCESSING

G06F17/14 - Fourier, Walsh or analogous domain transformations {, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms

Show less

DOE Contract Number:  

AC52-06NA25396

Resource Type:

Patent

Resource Relation:

Patent File Date: 2015 Mar 25

Country of Publication:

United States

Language:

English

Subject:

97 MATHEMATICS AND COMPUTING