Efficient quaternion tensor completion via L₂,1-norm and QR decomposition
From MaRDI portal
Publication:7319732
Cites work
- A new complex structure-preserving method for QSVD
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Convex Analysis
- Efficient low-rank quaternion matrix completion under the learnable transforms for color image recovery
- Exact Tensor Completion Using t-SVD
- Factorization strategies for third-order tensors
- Low-rank tensor completion using matrix factorization based on tensor train rank and total variation
- Nonlinear Low-Rank Matrix Completion for Human Motion Recovery
- Quaternion tensor completion via QR decomposition and nuclear norm minimization.
- Remote sensing images destriping using unidirectional hybrid total variation and nonconvex low-rank regularization
- Robust low-rank tensor completion via new regularized model with approximate SVD
- Robust quaternion matrix completion with applications to image inpainting.
- Robust tensor completion using transformed tensor singular value decomposition
- Singular value decomposition of third order quaternion tensors
- Smooth PARAFAC Decomposition for Tensor Completion
- Statistical comparisons of classifiers over multiple data sets
- Tensor Decompositions and Applications
- Tensor denoising via dual Schatten norms
- The nonconvex tensor robust principal component analysis approximation model via the weighted _p-norm regularization
This page was built for publication: Efficient quaternion tensor completion via \(L_{2,1}\)-norm and QR decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7319732)
