Hyperspectral super-resolution via low rank tensor triple decomposition
DOI10.3934/jimo.2023110arXiv2306.10489OpenAlexW4386290602MaRDI QIDQ6189815
Publication date: 5 February 2024
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2306.10489
nonconvex programmingimage fusionKurdyka-Łojasiewicz propertyhyperspectral imagemultispectral imagetensor triple decomposition
Applications of mathematical programming (90C90) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Mathematical modeling or simulation for problems pertaining to operations research and mathematical programming (90-10)
Cites Work
- On the limited memory BFGS method for large scale optimization
- A Barzilai-Borwein gradient algorithm for spatio-temporal Internet traffic data completion via tensor triple decomposition
- Computing Eigenvalues of Large Scale Sparse Tensors Arising from a Hypergraph
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Two-Point Step Size Gradient Methods
- Fast Fusion of Multi-Band Images Based on Solving a Sylvester Equation
- Fusing Hyperspectral and Multispectral Images via Coupled Sparse Tensor Factorization
- Hyperspectral Super-Resolution: A Coupled Tensor Factorization Approach
- A robust principal component analysis
- Hyperspectral Super-Resolution With Coupled Tucker Approximation: Recoverability and SVD-Based Algorithms
- Hyperspectral Image Super-Resolution via Subspace-Based Low Tensor Multi-Rank Regularization
- Triple Decomposition and Tensor Recovery of Third Order Tensors
This page was built for publication: Hyperspectral super-resolution via low rank tensor triple decomposition
