Cartoon–Texture Image Decomposition Using Least Squares and Low-Rank Regularization

This publication has 53 references indexed in Scilit:

• Structure–texture image decomposition via non-convex total generalized variation and convolutional sparse coding
  The Visual Computer, 2022
• Image decomposition based on the adaptive direction total variation and $\mathbb {G}$-norm regularization
  Signal, Image and Video Processing, 2020
• A class of ADMM-based algorithms for three-block separable convex programming
  Computational Optimization and Applications, 2018
• Majorization–minimization generalized Krylov subspace methods for ${\ell _p}$–${\ell _q}$ optimization applied to image restoration
  BIT Numerical Mathematics, 2017
• On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function
  Computational Optimization and Applications, 2016
• The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
  Mathematical Programming, 2014
• A Partial Splitting Augmented Lagrangian Method for Low Patch-Rank Image Decomposition
  Journal of Mathematical Imaging and Vision, 2014
• TILT: Transform Invariant Low-Rank Textures
  International Journal of Computer Vision, 2012
• Repairing Sparse Low-Rank Texture
  2012
• Iteratively reweighted least squares minimization for sparse recovery
  Communications on Pure and Applied Mathematics, 2009