Convolutional Sparse Coding (CSC) represents a signal through the convolution of dictionary filters and sparse coefficients. While the Alternating Direction Method of Multipliers (ADMM) has conventionally been used to solve CSC problems, recent studies have demonstrated that Douglas-Rachford (DR) splitting can achieve faster convergence. In this study, we propose an accelerated CSC algorithm by applying Anderson Acceleration to the DR splitting method. Experimental results demonstrate that the proposed method significantly improves convergence speed compared to standard DR splitting.
