.png){kind=icon}
.png){kind=icon}
Return
Adaptive ADMM for Dictionary Learning in Convolutional Sparse Representation
.png){kind=icon}
PRE
AI
DOI：10.1109/TIP.2019.2896541.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we propose a novel approach to convolutional sparse representation with the aim of resolving the dictionary learning problem. The proposed method, referred to as the adaptive alternating direction method of multipliers (AADMM), employs constraints comprising non-convex, non-smooth terms, such as the l(0)-norm imposed on the coefficients and the unit-norm sphere imposed on the length of each dictionary element. The proposed scheme incorporates a novel parameter adaption scheme that enables ADMM to achieve convergence more quickly, as evidenced by numerical and theoretical analysis. In experiments involving image signal applications, the dictionaries learned using AADMM outperformed those learned using comparable dictionary learning methods.
Keywords:
Convolutional dictionary learning
convolutional sparse coding
non-convex and non-smooth optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
13.7
Papers:
1.0W
Citations:
8.4W