Efficient Algorithms for Convolutional Sparse Representations

Brendt Wohlberg

doi:10.1109/TIP.2015.2495260

Return

Efficient Algorithms for Convolutional Sparse Representations

2016-01-01

315

Brendt Wohlberg *

DOI：10.1109/TIP.2015.2495260

Original

Save

View PDF

Abstract

En 中文

When applying sparse representation techniques to images, the standard approach is to independently compute the representations for a set of overlapping image patches. This method performs very well in a variety of applications, but results in a representation that is multi-valued and not optimized with respect to the entire image. An alternative representation structure is provided by a convolutional sparse representation, in which a sparse representation of an entire image is computed by replacing the linear combination of a set of dictionary vectors by the sum of a set of convolutions with dictionary filters. The resulting representation is both single-valued and jointly optimized over the entire image. While this form of a sparse representation has been applied to a variety of problems in signal and image processing and computer vision, the computational expense of the corresponding optimization problems has restricted application to relatively small signals and images. This paper presents new, efficient algorithms that substantially improve on the performance of other recent methods, contributing to the development of this type of representation as a practical tool for a wider range of problems.

Keywords:

Sparse representation

sparse coding

dictionary learning

convolutional sparse representation

ADMM

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.