Multi-dimensional image recovery via fully-connected tensor network decomposition under the learnable transforms
From MaRDI portal
Publication:2103418
DOI10.1007/s10915-022-02009-0zbMath1504.94015OpenAlexW4297962080MaRDI QIDQ2103418
Ting-Zhu Huang, Hao Zhang, Xi-Le Zhao, Cheng-Yao Lyu, Ben-Zheng Li
Publication date: 13 December 2022
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-022-02009-0
proximal alternating minimizationfully-connected tensor network decompositionlearnable transformmulti-dimensional image recovery
Computing methodologies for image processing (68U10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items
Cites Work
- Tensor Decompositions and Applications
- Tensor-Train Decomposition
- Parallel matrix factorization for low-rank tensor completion
- A practical introduction to tensor networks: Matrix product states and projected entangled pair states
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Factorization strategies for third-order tensors
- Tensor-tensor products with invertible linear transforms
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- An efficient randomized algorithm for computing the approximate Tucker decomposition
- The nonconvex tensor robust principal component analysis approximation model via the weighted \(\ell_p\)-norm regularization
- Tensor Q-rank: new data dependent definition of tensor rank
- Tensor completion via fully-connected tensor network decomposition with regularized factors
- Nonlinear transform induced tensor nuclear norm for tensor completion
- A Riemannian optimization approach for solving the generalized eigenvalue problem for nonsquare matrix pencils
- Nonconvex optimization for robust tensor completion from grossly sparse observations
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- New Approach to the Theory of Superexchange Interactions
- Robust tensor completion using transformed tensor singular value decomposition
- Clarke Subgradients of Stratifiable Functions
- A Multilinear Singular Value Decomposition
- Efficient Tensor Completion for Color Image and Video Recovery: Low-Rank Tensor Train
- Block-Randomized Stochastic Proximal Gradient for Low-Rank Tensor Factorization
- Framelet Representation of Tensor Nuclear Norm for Third-Order Tensor Completion
- Third-Order Tensors as Operators on Matrices: A Theoretical and Computational Framework with Applications in Imaging
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Auto-weighted robust low-rank tensor completion via tensor-train
