Tensor completion using total variation and low-rank matrix factorization

DOI10.1016/j.ins.2015.07.049zbMath1387.94038OpenAlexW1476376401MaRDI QIDQ1750415

Xianqiang Yang

Publication date: 22 May 2018

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2015.07.049

zbMATH Keywords

total variationblock coordinate descenttensor completionlow-rank matrix factorization

Mathematics Subject Classification ID

Related Items (29)

Fast multidimensional completion and principal component analysis methods via the cosine product ⋮ Nonconvex Low-Rank Tensor Completion from Noisy Data ⋮ Low tubal rank tensor completion based on singular value factors ⋮ Tensor completion via multi-directional partial tensor nuclear norm with total variation regularization ⋮ Robust low-rank tensor completion via new regularized model with approximate SVD ⋮ Riemannian conjugate gradient method for low-rank tensor completion ⋮ Matrix factorization for low-rank tensor completion using framelet prior ⋮ HTR-CTO algorithm for wireless data recovery ⋮ A Corrected Tensor Nuclear Norm Minimization Method for Noisy Low-Rank Tensor Completion ⋮ Low-tubal-rank tensor completion via local and nonlocal knowledge ⋮ Tensor factorization with total variation and Tikhonov regularization for low-rank tensor completion in imaging data ⋮ Iterative \(p\)-shrinkage thresholding algorithm for low Tucker rank tensor recovery ⋮ Adaptive total variation and second-order total variation-based model for low-rank tensor completion ⋮ Bilateral filter based total variation regularization for sparse hyperspectral image unmixing ⋮ Second order total generalized variation for Speckle reduction in ultrasound images ⋮ A convex optimization model and algorithm for retinex ⋮ Total variation with overlapping group sparsity for deblurring images under Cauchy noise ⋮ Tensor \(N\)-tubal rank and its convex relaxation for low-rank tensor recovery ⋮ Low-rank tensor train for tensor robust principal component analysis ⋮ A non-convex tensor rank approximation for tensor completion ⋮ Majorized proximal alternating imputation for regularized rank constrained matrix completion ⋮ Iterative algorithm for the symmetric and nonnegative tensor completion problem ⋮ Hyperspectral image restoration using framelet-regularized low-rank nonnegative matrix factorization ⋮ Low-rank tensor completion via smooth matrix factorization ⋮ Twist tensor total variation regularized-reweighted nuclear norm based tensor completion for video missing area recovery ⋮ Low-rank tensor completion using matrix factorization based on tensor train rank and total variation ⋮ Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization ⋮ The \(\ell_{2,p}\) regularized total variation with overlapping group sparsity prior for image restoration with impulse noise ⋮ A tensor regularized nuclear norm method for image and video completion

Cites Work

• Unnamed Item
• Unnamed Item
• Tensor Decompositions and Applications
• Nonlinear total variation based noise removal algorithms
• Parallel matrix factorization for low-rank tensor completion
• Image restoration using total variation with overlapping group sparsity
• Fixed point and Bregman iterative methods for matrix rank minimization
• An alternating direction algorithm for matrix completion with nonnegative factors
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• Exact matrix completion via convex optimization
• A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
• Dictionary Learning for Noisy and Incomplete Hyperspectral Images
• A Singular Value Thresholding Algorithm for Matrix Completion
• Tensor completion and low-n-rank tensor recovery via convex optimization
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Active contours without edges
• A Fixed Point Iterative Method for Low $n$-Rank Tensor Pursuit
• Coupled segmentation and denoising/deblurring models for hyperspectral material identification
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• An Augmented Lagrangian Method for Total Variation Video Restoration
• Most Tensor Problems Are NP-Hard
• Total Variation Structured Total Least Squares Method for Image Restoration

This page was built for publication: Tensor completion using total variation and low-rank matrix factorization