Low patch-rank image decomposition using alternating minimization algorithms
From MaRDI portal
Publication:3383205
DOI10.23952/jnva.5.2021.3.05OpenAlexW4205637814MaRDI QIDQ3383205
Zhiyuan Zhang, Lulu Zhao, Tingxia Lu, Cheng Chen, Hongjin He
Publication date: 23 September 2021
Published in: Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.23952/jnva.5.2021.3.05
image decompositionalternating direction method of multiplierslow rankalternating minimization algorithm
Cites Work
- Nonlinear total variation based noise removal algorithms
- On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
- A partially isochronous splitting algorithm for three-block separable convex minimization problems
- A partial splitting augmented Lagrangian method for low patch-rank image decomposition
- Cartoon-texture image decomposition via non-convex low-rank texture regularization
- Structure-texture image decomposition -- modeling, algorithms, and parameter selection
- A Low Patch-Rank Interpretation of Texture
- Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
- The Split Bregman Method for L1-Regularized Problems
- Image decomposition via the combination of sparse representations and a variational approach
- Cartoon-Texture Image Decomposition Using Blockwise Low-Rank Texture Characterization
- A splitting method for separable convex programming
- Coupled Variational Image Decomposition and Restoration Model for Blurred Cartoon-Plus-Texture Images With Missing Pixels
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA
- A distributed Douglas-Rachford splitting method for multi-block convex minimization problems
This page was built for publication: Low patch-rank image decomposition using alternating minimization algorithms