Hybrid Inexact BCD for Coupled Structured Matrix Factorization in Hyperspectral Super-Resolution

Abstract

This paper develops a first-order optimization method for coupled structured matrix factorization (CoSMF) problems that arise in the context of hyperspectral super-resolution (HSR) in remote sensing. To best leverage the problem structures for computational efficiency, we introduce a hybrid inexact block coordinate descent (HiBCD) scheme wherein one coordinate is updated via the fast proximal gradient (FPG) method, while another via the Frank-Wolfe (FW) method. The FPG-type methods are known to take less number of iterations to converge, by numerical experience, while the FW-type methods can offer lower per-iteration complexity in certain cases; and we wish to take the best of both. We show that the limit points of this HiBCD scheme are stationary. Our proof treats HiBCD as an optimization framework for a class of multi-block structured optimization problems, and our stationarity claim is applicable not only to CoSMF but also to many other problems. Previous optimization research showed the same stationarity result for inexact block coordinate descent with either FPG or FW updates only. Numerical results indicate that the proposed HiBCD scheme is computationally much more efficient than the state-of-the-art CoSMF schemes in HSR.

arXiv comment32 pages, 3 figures, 5 tables. Codes available at https://github.com/REIYANG/HiBCD. To appear in IEEE Transactions on Signal Processing

References in corpus (10)

• A convex formulation for hyperspectral image superresolution via subspace-based regularization
• Hyperspectral and Multispectral Image Fusion based on a Sparse Representation
• Super-resolution of Sentinel-2 images: Learning a globally applicable deep neural network
• Multispectral and Hyperspectral Image Fusion Using a 3-D-Convolutional Neural Network
• Hyperspectral Super-Resolution: A Coupled Tensor Factorization Approach
• Multi-Band Image Fusion Based on Spectral Unmixing
• A Framework for One-Bit and Constant-Envelope Precoding over Multiuser Massive MISO Channels
• Identifiability of the Simplex Volume Minimization Criterion for Blind Hyperspectral Unmixing: The No Pure-Pixel Case
• Robust Volume Minimization-Based Matrix Factorization for Remote Sensing and Document Clustering
• The proximal point method revisited

Cited by in corpus (4)

• Hyperspectral Super-Resolution via Global-Local Low-Rank Matrix Estimation
• Detecting Central Nodes from Low-rank Excited Graph Signals via Structured Factor Analysis
• Federated Block Coordinate Descent Scheme for Learning Global and Personalized Models
• Divide and Conquer: One-Bit MIMO-OFDM Detection by Inexact Expectation Maximization