IEEE Trans Cybern. 2021 Oct;51(10):5116-5129. doi: 10.1109/TCYB.2019.2931914. Epub 2021 Oct 12.
Convolutional dictionary learning (CDL) aims to learn a structured and shift-invariant dictionary to decompose signals into sparse representations. While yielding superior results compared to traditional sparse coding methods on various signal and image processing tasks, most CDL methods have difficulties handling large data, because they have to process all images in the dataset in a single pass. Therefore, recent research has focused on online CDL (OCDL) which updates the dictionary with sequentially incoming signals. In this article, a novel OCDL algorithm is proposed based on a local, slice-based representation of sparse codes. Such representation has been found useful in batch CDL problems, where the convolutional sparse coding and dictionary learning problem could be handled in a local way similar to traditional sparse coding problems, but it has never been explored under online scenarios before. We show, in this article, that the proposed algorithm is a natural extension of the traditional patch-based online dictionary learning algorithm, and the dictionary is updated in a similar memory efficient way too. On the other hand, it can be viewed as an improvement of existing second-order OCDL algorithms. Theoretical analysis shows that our algorithm converges and has lower time complexity than existing counterpart that yields exactly the same output. Extensive experiments are performed on various benchmarking datasets, which show that our algorithm outperforms state-of-the-art batch and OCDL algorithms in terms of reconstruction objectives.
卷积字典学习(CDL)旨在学习一种结构化且平移不变的字典,以将信号分解为稀疏表示。与各种信号和图像处理任务中的传统稀疏编码方法相比,大多数 CDL 方法在处理大数据时存在困难,因为它们必须在单个传递中处理数据集中的所有图像。因此,最近的研究集中在在线卷积字典学习(OCDL)上,该方法使用顺序传入的信号来更新字典。本文提出了一种基于稀疏码局部切片表示的新颖 OCDL 算法。这种表示在批量 CDL 问题中很有用,其中卷积稀疏编码和字典学习问题可以以类似于传统稀疏编码问题的局部方式处理,但以前从未在在线场景下探索过。我们在本文中表明,所提出的算法是传统基于补丁的在线字典学习算法的自然扩展,并且字典也以类似的节省内存的方式进行更新。另一方面,它可以被视为对现有二阶 OCDL 算法的改进。理论分析表明,我们的算法收敛,并且时间复杂度低于产生完全相同输出的现有算法。在各种基准数据集上进行了广泛的实验,结果表明,我们的算法在重建目标方面优于最先进的批量和 OCDL 算法。