Efficient Algorithms for Convolutional Sparse Representations
From MaRDI portal
Cited in
(17)- Adaptive forward-backward splitting for multilayer convolutional dictionary learning
- Discriminative sparse representations
- First- and second-order methods for online convolutional dictionary learning
- A Greedy Approach to $\ell_{0,\infty}$-Based Convolutional Sparse Coding
- A noise-robust online convolutional coding model and its applications to Poisson denoising and image fusion
- A linear algebra approach to minimal convolutional encoders
- Accelerated Bregman operator splitting with backtracking
- Learning the sparse prior: modern approaches
- Multifocus image fusion using multiscale transform and convolutional sparse representation
- Working Locally Thinking Globally: Theoretical Guarantees for Convolutional Sparse Coding
- Fast adaptive ADMM with Gaussian back substitution for multiple block linear constrained separable problems
- Optimal regularization for a data source
- Multi-Layer Convolutional Sparse Modeling: Pursuit and Dictionary Learning
- Importance-aware nonlocal tensor nuclear norm for high-dimensional image recovery
- Dictionary-based block term decomposition for third-order tensors
- Efficiently Learning a Detection Cascade With Sparse Eigenvectors
- Research of multimodal medical image fusion based on parameter-adaptive pulse-coupled neural network and convolutional sparse representation
This page was built for publication: Efficient Algorithms for Convolutional Sparse Representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4616162)
