Stable local-smooth principal component pursuit

DOI10.1137/23M1580164zbMATH Open1545.94015MaRDI QIDQ6587640FDOQ6587640

Authors: Jiangjun Peng, Hailin Wang, Xiangyong Cao, Xixi Jia, Hongying Zhang, Deyu Meng 

Publication date: 14 August 2024

Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)

Recommendations

• Efficient algorithms for robust and stable principal component pursuit problems
• A novel robust principal component analysis method for image and video processing.
• A novel robust principal component analysis algorithm of nonconvex rank approximation
• Random consensus robust PCA
• Robust principal component pursuit via inexact alternating minimization on matrix manifolds

zbMATH Keywords

influence of noiseconvergence guaranteeCTV-\(\sqrt{\mathrm{PCP}}\)CTV-SPCPparameter adaptive adjustmentrecoverable error bound

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Computing methodologies for image processing (68U10) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Cites Work

• A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
• Nearly unbiased variable selection under minimax concave penalty
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• Analysis of multi-stage convex relaxation for sparse regularization
• Square-root lasso: pivotal recovery of sparse signals via conic programming
• Robust principal component analysis?
• Robust functional principal components: a projection-pursuit approach
• Latent variable graphical model selection via convex optimization
• Probabilistic Principal Component Analysis
• Inference and uncertainty quantification for noisy matrix completion
• De-noising by soft-thresholding
• An algorithm for total variation minimization and applications
• Stable image reconstruction using total variation minimization
• Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions
• A New Total Variation Method for Multiplicative Noise Removal
• Compressive principal component pursuit
• Iterative Methods for Total Variation Denoising
• Guarantees of total variation minimization for signal recovery
• Sparse Signal Estimation by Maximally Sparse Convex Optimization
• Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data
• Accelerated Alternating Projections for Robust Principal Component Analysis
• Finding low-rank solutions via nonconvex matrix factorization, efficiently and provably
• Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm
• Truncated Nuclear Norm Minimization Based Group Sparse Representation for Image Restoration
• Total variation structured total least squares method for image restoration
• Near-Optimal Compressed Sensing Guarantees for Total Variation Minimization
• Compressive total variation for image reconstruction and restoration
• Total Variation Regularized Tensor RPCA for Background Subtraction From Compressive Measurements
• An Unbiased Approach to Low Rank Recovery
• Stable Principal Component Pursuit via Convex Analysis
• Lattice-based patterned fabric inspection by using total variation with sparsity and low-rank representations
• Enhanced 3DTV Regularization and Its Applications on HSI Denoising and Compressed Sensing

This page was built for publication: Stable local-smooth principal component pursuit

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587640)