WARP-LCA: Efficient convolutional sparse coding with Locally Competitive Algorithm

The locally competitive algorithm (LCA) can solve sparse coding problems across a wide range of use cases. Recently, convolution-based LCA approaches have been shown to be highly effective for enhancing robustness for image recognition tasks in vision pipelines. To additionally maximize representati...

Full description

Saved in:
Bibliographic Details
Published in:Neurocomputing (Amsterdam) Vol. 640; p. 130291
Main Authors: Kasenbacher, Geoffrey, Ehret, Felix, Ecke, Gerrit, Otte, Sebastian
Format: Journal Article
Language:English
Published: Elsevier B.V 01.08.2025
Subjects:
Computer vision
Convolutional sparse coding
Locally competitive algorithms
Computer vision
Convolutional sparse coding
Locally competitive algorithms
ISSN:0925-2312
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The locally competitive algorithm (LCA) can solve sparse coding problems across a wide range of use cases. Recently, convolution-based LCA approaches have been shown to be highly effective for enhancing robustness for image recognition tasks in vision pipelines. To additionally maximize representational sparsity, LCA with hard-thresholding can be applied. While this combination often yields very good solutions satisfying an ℓ0 sparsity criterion, it comes with significant drawbacks for practical application: (i) LCA is very inefficient, typically requiring hundreds of optimization cycles for convergence; (ii) the use of a hard-thresholding results in a non-convex loss function, which might lead to suboptimal minima. To address these issues, we propose the Locally Competitive Algorithm with State Warm-up via Predictive Priming (WARP-LCA), which leverages a predictor network to provide a suitable initial guess of the LCA state based on the current input. Our approach significantly improves both convergence speed and the quality of solutions, while maintaining and even enhancing the overall strengths of LCA. We demonstrate that WARP-LCA converges faster by orders of magnitude and reaches better minima compared to conventional LCA. Moreover, the learned representations are more sparse and exhibit superior properties in terms of reconstruction and denoising quality as well as robustness when applied in deep recognition pipelines. Furthermore, we apply WARP-LCA to image denoising tasks, showcasing its robustness and practical effectiveness. Our findings confirm that the naive use of LCA with hard-thresholding results in suboptimal minima, whereas initializing LCA with a predictive guess results in much better outcomes. [Display omitted] •WARP-LCA accelerates convergence and achieves superior sparsity compared to LCA.•Achieves higher PSNR and SSIM with fewer iterations than traditional LCA.•Improves denoising in classification pipelines under varying noise levels.•Enables generalizable and efficient sparse coding with predictive initialization.
ISSN:0925-2312
DOI:10.1016/j.neucom.2025.130291