Weighted Schatten <inline-formula> <tex-math notation="LaTeX">p </tex-math> </inline-formula>-Norm Minimization for Image Denoising and Background Subtraction

DOI10.1109/TIP.2016.2599290zbMATH Open1408.94731DBLPjournals/tip/XieGLZZZ16arXiv1512.01003OpenAlexW3100203369WikidataQ59533673 ScholiaQ59533673MaRDI QIDQ4616754FDOQ4616754

Authors: Yuan Xie, Shuhang Gu, Yan Liu, Wangmeng Zuo, Wensheng Zhang, Lei Zhang 

Publication date: 4 February 2019

Published in: IEEE Transactions on Image Processing (Search for Journal in Brave)

Abstract: Low rank matrix approximation (LRMA), which aims to recover the underlying low rank matrix from its degraded observation, has a wide range of applications in computer vision. The latest LRMA methods resort to using the nuclear norm minimization (NNM) as a convex relaxation of the nonconvex rank minimization. However, NNM tends to over-shrink the rank components and treats the different rank components equally, limiting its flexibility in practical applications. We propose a more flexible model, namely the Weighted Schatten $p$-Norm Minimization (WSNM), to generalize the NNM to the Schatten $p$-norm minimization with weights assigned to different singular values. The proposed WSNM not only gives better approximation to the original low-rank assumption, but also considers the importance of different rank components. We analyze the solution of WSNM and prove that, under certain weights permutation, WSNM can be equivalently transformed into independent non-convex $l_p$-norm subproblems, whose global optimum can be efficiently solved by generalized iterated shrinkage algorithm. We apply WSNM to typical low-level vision problems, e.g., image denoising and background subtraction. Extensive experimental results show, both qualitatively and quantitatively, that the proposed WSNM can more effectively remove noise, and model complex and dynamic scenes compared with state-of-the-art methods.

Full work available at URL: https://arxiv.org/abs/1512.01003

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Cited In (35)

• 3D Poissonian image deblurring via patch-based tensor logarithmic Schatten-\(p\) minimization
• An FPGA-based design for a real-time image denoising using approximated fractional integrator
• Linear eigenvalue statistics of XX′ matrices
• Image cartoon-texture decomposition by a generalized non-convex low-rank minimization method
• Quaternion-based color image completion via logarithmic approximation
• Multiple kernel low-rank representation-based robust multi-view subspace clustering
• Stochastic variance reduced gradient for affine rank minimization problem
• Block matching local SVD operator based sparsity and TV regularization for image denoising
• Tensor nonconvex unified prior for tensor recovery
• Sparsity reconstruction using nonconvex TGpV-shearlet regularization and constrained projection
• PnP-ReG: Learned Regularizing Gradient for Plug-and-Play Gradient Descent
• Weighted nuclear norm minimization-based regularization method for image restoration
• Poissonian image restoration via the \(L_1/L_2\)-based minimization
• Field of experts regularized nonlocal low rank matrix approximation for image denoising
• Low-rank matrix recovery problem minimizing a new ratio of two norms approximating the rank function then using an ADMM-type solver with applications
• Weighted \(l_p\) norm sparse error constraint based ADMM for image denoising
• A nonlocal low-rank regularization method for fractal image coding
• Multi-band weighted \(l_p\) norm minimization for image denoising
• A nonlocal low rank model for Poisson noise removal
• Generalized two-dimensional linear discriminant analysis with regularization
• Online Schatten quasi-norm minimization for robust principal component analysis
• Patch-based weighted SCAD prior for Rician noise removal
• Duality Mapping for Schatten Matrix Norms
• The rank residual constraint model with weighted Schatten \(p\)-norm minimization for image denoising
• Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness
• Rank minimization with applications to image noise removal
• T-product factorization based method for matrix and tensor completion problems
• Blind image deblurring via the weighted Schatten \(p\)-norm minimization prior
• A fast proximal iteratively reweighted nuclear norm algorithm for nonconvex low-rank matrix minimization problems
• Robust subspace clustering based on non-convex low-rank approximation and adaptive kernel
• Low-rank with sparsity constraints for image denoising
• Robust image compressive sensing based on half-quadratic function and weighted Schatten-\(p\) norm
• A unified framework for nonconvex nonsmooth sparse and low-rank decomposition by majorization-minimization algorithm
• Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset
• Weighted nuclear norm minimization and its applications to low level vision

This page was built for publication: Weighted Schatten <inline-formula> <tex-math notation="LaTeX">$p$ </tex-math> </inline-formula>-Norm Minimization for Image Denoising and Background Subtraction

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