A Benchmark for Sparse Coding: When Group Sparsity Meets Rank Minimization
From MaRDI portal
Recommendations
- The benefit of group sparsity
- Learning Discriminative Dictionary for Group Sparse Representation
- Group Sparse Recovery via the \ell ^0(\ell ^2) Penalty: Theory and Algorithm
- Minimum description length penalization for group and multi-task sparse learning
- Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms
- Proximal methods for hierarchical sparse coding
- Nonconvex nonsmooth low-rank minimization for generalized image compressed sensing via group sparse representation
- Low-rank and sparse dictionary learning
- Discriminative group-sparsity constrained broad learning system for visual recognition
- The Group Lasso for Stable Recovery of Block-Sparse Signal Representations
Cited in
(8)- An improved directed crossover genetic algorithm based on multilayer mutation
- Scheduling for a flow shop with waiting time constraints and missing operations in semiconductor manufacturing
- Restoration guarantee of image inpainting via low rank patch matrix completion
- The rank residual constraint model with weighted Schatten \(p\)-norm minimization for image denoising
- Group sparse representation-based color image restoration under mixed random-valued impulse and Gaussian noise
- A novel neural CSTV model joint with quaternion-based group sparse representation for color image inpainting from structured corruptions
- Robust low-rank tensor completion based on M-product with weighted correlated total variation and sparse regularization
- The benefit of group sparsity
This page was built for publication: A Benchmark for Sparse Coding: When Group Sparsity Meets Rank Minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5105438)
