Fast Convolutional Sparse Coding

June 2013

Fast Convolutional Sparse Coding

Authors:

Hilton Bristow, Anders Eriksson, and Simon Lucey
Conference Paper
Proceedings of (CVPR) Computer Vision and Pattern Recognition

Abstract:

Sparse coding has become an increasingly popular method in learning and vision for a variety of classification, reconstruction and coding tasks. The canonical approach intrinsically assumes independence between observations during learning. For many natural signals however, sparse coding is applied to sub-elements ( i.e. patches) of the signal, where such an assumption is invalid. Convolutional sparse coding explicitly models local interactions through the convolution operator, however the resulting optimization problem is considerably more complex than traditional sparse coding. In this paper, we draw upon ideas from signal processing and Augmented Lagrange Methods (ALMs) to produce a fast algorithm with globally optimal subproblems and super-linear convergence.
@conference{Bristow-2013-17126,
author = {Hilton Bristow And Anders Eriksson And Simon Lucey},
title = {Fast Convolutional Sparse Coding},
booktitle = {Proceedings of (CVPR) Computer Vision and Pattern Recognition},
year = {2013},
month = {June},
pages = {391 - 398},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.