期刊
DIGITAL SIGNAL PROCESSING
卷 55, 期 -, 页码 44-51出版社
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.dsp.2016.04.012
关键词
Convolutional sparse coding; Feature learning; Deconvolution networks; Shift-invariant sparse coding
资金
- Grant Agency of the Czech Republic [GA13-29225S]
Convolutional sparse coding is an interesting alternative to standard sparse coding in modeling shift invariant signals, giving impressive results for example in unsupervised learning of visual features. In state-of-the-art methods, the most time-consuming parts include inversion of a linear operator related to convolution. In this article we show how these inversions can be computed non-iteratively in the Fourier domain using the matrix inversion lemma. This greatly speeds up computation and makes convolutional sparse coding computationally feasible even for large problems. The algorithm is derived in three variants, one of them especially suitable for parallel implementation. We demonstrate algorithms on two-dimensional image data but all results hold for signals of arbitrary dimension. (C) 2016 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据