An iterative method for tensor inpainting based on higher-order singular value decomposition
From MaRDI portal
Publication:2338316
DOI10.1007/s00034-017-0732-1zbMath1425.94026OpenAlexW2779040729MaRDI QIDQ2338316
Publication date: 21 November 2019
Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00034-017-0732-1
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Tensor Decompositions and Applications
- Tucker factorization with missing data with application to low-\(n\)-rank tensor completion
- Fixed point and Bregman iterative methods for matrix rank minimization
- Iterative methods for the canonical decomposition of multi-way arrays: application to blind underdetermined mixture identification
- Inpainting for compressed images
- Black box approximation of tensors in hierarchical Tucker format
- Low rank tensor recovery via iterative hard thresholding
- Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)
- Exact matrix completion via convex optimization
- A Singular Value Thresholding Algorithm for Matrix Completion
- Tensor completion and low-n-rank tensor recovery via convex optimization
- A Multilinear Singular Value Decomposition
- Compressive Sensing Image Restoration Using Adaptive Curvelet Thresholding and Nonlocal Sparse Regularization
- Computing Sparse Representations of Multidimensional Signals Using Kronecker Bases
- Tensor and its tucker core: The invariance relationships
- Fast Image Recovery Using Variable Splitting and Constrained Optimization
This page was built for publication: An iterative method for tensor inpainting based on higher-order singular value decomposition
