Low patch-rank image decomposition using alternating minimization algorithms
From MaRDI portal
Publication:3383205
DOI10.23952/JNVA.5.2021.3.05OpenAlexW4205637814MaRDI QIDQ3383205FDOQ3383205
Authors: Lulu Zhao, Cheng Chen, Tingxia Lu, Zhiyuan Zhang, 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
Recommendations
- A partial splitting augmented Lagrangian method for low patch-rank image decomposition
- Cartoon-texture image decomposition via non-convex low-rank texture regularization
- A low patch-rank interpretation of texture
- Cartoon-texture image decomposition using orientation characteristics in patch recurrence
- Coupled dictionary learning method for image decomposition
alternating direction method of multipliersalternating minimization algorithmimage decompositionlow rank
Cites Work
- Nonlinear total variation based noise removal algorithms
- The Split Bregman Method for L1-Regularized Problems
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- Structure-texture image decomposition -- modeling, algorithms, and parameter selection
- Alternating direction method with Gaussian back substitution for separable convex programming
- On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
- Image decomposition via the combination of sparse representations and a variational approach
- A splitting method for separable convex programming
- A distributed Douglas-Rachford splitting method for multi-block convex minimization problems
- A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA
- A low patch-rank interpretation of texture
- Coupled Variational Image Decomposition and Restoration Model for Blurred Cartoon-Plus-Texture Images With Missing Pixels
- Cartoon-texture image decomposition via non-convex low-rank texture regularization
- A partial splitting augmented Lagrangian method for low patch-rank image decomposition
- A partially isochronous splitting algorithm for three-block separable convex minimization problems
- Cartoon-Texture Image Decomposition Using Blockwise Low-Rank Texture Characterization
Cited In (5)
- Cartoon-texture image decomposition via non-convex low-rank texture regularization
- Accelerating patch-based low-rank image restoration using kd-forest and Lanczos approximation
- A partial splitting augmented Lagrangian method for low patch-rank image decomposition
- Generalized intersection algorithms with fixed points for image decomposition learning
- (Φ,Φ*) Image Decomposition Models and Minimization Algorithms
This page was built for publication: Low patch-rank image decomposition using alternating minimization algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3383205)