Efficient approximate online convolutional dictionary learning

Loading...
Thumbnail Image

Access rights

openAccess
publishedVersion

URL

Journal Title

Journal ISSN

Volume Title

A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä

Date

2023-12-15

Major/Subject

Mcode

Degree programme

Language

en

Pages

11

Series

IEEE Transactions on Computational Imaging, Volume 9, pp. 1165-1175

Abstract

Most existing convolutional dictionary learning (CDL) algorithms are based on batch learning, where the dictionary filters and the convolutional sparse representations are optimized in an alternating manner using a training dataset. When large training datasets are used, batch CDL algorithms become prohibitively memory-intensive. An online-learning technique is used to reduce the memory requirements of CDL by optimizing the dictionary incrementally after finding the sparse representations of each training sample. Nevertheless, learning large dictionaries using the existing online CDL (OCDL) algorithms remains highly computationally expensive. In this paper, we present a novel approximate OCDL method that incorporates sparse decomposition of the training samples. The resulting optimization problems are addressed using the alternating direction method of multipliers. Extensive experimental evaluations using several image datasets and based on an image fusion task show that the proposed method substantially reduces computational costs while preserving the effectiveness of the state-of-the-art OCDL algorithms.

Description

Keywords

Other note

Citation

Ghorbani Veshki, F & Vorobyov, S 2023, ' Efficient approximate online convolutional dictionary learning ', IEEE Transactions on Computational Imaging, vol. 9, pp. 1165-1175 . https://doi.org/10.1109/TCI.2023.3340612