Tensor completion via fully-connected tensor network decomposition with regularized factors
From MaRDI portal
Publication:2149028
Recommendations
- Adaptive total variation and second-order total variation-based model for low-rank tensor completion
- Matrix factorization for low-rank tensor completion using framelet prior
- Tensor factorization with total variation and Tikhonov regularization for low-rank tensor completion in imaging data
- A new tensor multi-rank approximation with total variation regularization for tensor completion
- Tensor train rank minimization with hybrid smoothness regularization for visual data recovery
Cites work
- A Barzilai-Borwein gradient algorithm for spatio-temporal Internet traffic data completion via tensor triple decomposition
- A fast algorithm for deconvolution and Poisson noise removal
- A non-convex tensor rank approximation for tensor completion
- Clarke Subgradients of Stratifiable Functions
- Color Image Restoration by Saturation-Value Total Variation Regularization on Vector Bundles
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Efficient Tensor Completion for Color Image and Video Recovery: Low-Rank Tensor Train
- Exact Tensor Completion Using t-SVD
- Factorization strategies for third-order tensors
- Kronecker products and matrix calculus in system theory
- Low-rank tensor completion based on log-det rank approximation and matrix factorization
- Low-rank tensor completion using matrix factorization based on tensor train rank and total variation
- Low-rank tensor train for tensor robust principal component analysis
- Most tensor problems are NP-hard
- Nonconvex optimization for robust tensor completion from grossly sparse observations
- On the computation of a truncated SVD of a large linear discrete ill-posed problem
- Parallel matrix factorization for low-rank tensor completion
- Projected Tikhonov regularization of large-scale discrete ill-posed problems
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Robust low transformed multi-rank tensor methods for image alignment
- Robust Schatten-p norm based approach for tensor completion
- Robust tensor completion using transformed tensor singular value decomposition
- Smooth PARAFAC Decomposition for Tensor Completion
- Tensor \(N\)-tubal rank and its convex relaxation for low-rank tensor recovery
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- Tensor Decompositions and Applications
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Tensor-Based Formulation and Nuclear Norm Regularization for Multienergy Computed Tomography
- Tensor-train decomposition
- Third-order tensors as operators on matrices: a theoretical and computational framework with applications in imaging
Cited in
(21)- T-product factorization method for internet traffic data completion with spatio-temporal regularization
- Multi-dimensional image recovery via fully-connected tensor network decomposition under the learnable transforms
- Nonlinear transform induced tensor nuclear norm for tensor completion
- Fully-connected tensor network decomposition for robust tensor completion problem
- Randomized tensor wheel decomposition
- A random sampling algorithm for fully-connected tensor network decomposition with applications
- SVD-based algorithms for fully-connected tensor network decomposition
- SVD-based algorithms for tensor wheel decomposition
- Fully-connected tensor network decomposition and group sparsity for multitemporal images cloud removal
- Non-local and fully connected tensor network decomposition for remote sensing image denoising
- Riemannian preconditioning algorithms for the low-rank tensor completion via the triple decomposition
- Tensor completion via total curvature variation and low-rank matrix factorization
- A novel two-stage robust tensor completion method via enhanced global recovery and local patch-level refinement
- Slice-wise irregular tensor decomposition and its application
- A robust tensor wheel decomposition-based regularization method for tensor completion problem
- Tensor robust principal component analysis with total generalized variation for high-dimensional data recovery
- A modified spectral projected gradient method for tensor approximations over closed convex sets
- Poisson tensor completion via nonconvex regularization and nonlocal self-similarity for multi-dimensional image recovery
- Accelerated FCTN with perturbed periodic second-order discrete difference regularization for tensor completion
- Robust tensor completion via tensor wheel decomposition with difference factors regularization for hyperspectral image restoration
- Dynamic mode decomposition via difference-of-convex principal component analysis
This page was built for publication: Tensor completion via fully-connected tensor network decomposition with regularized factors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2149028)
