CVApr 17, 2024

Neural Shrödinger Bridge Matching for Pansharpening

arXiv:2404.11416v13 citationsh-index: 16
Originality Incremental advance
AI Analysis

This work addresses pansharpening, a domain-specific inverse problem in remote sensing, with incremental improvements over existing methods.

The paper tackles the problem of pansharpening by identifying shortcomings in applying diffusion probabilistic models, such as neglecting prior information and low sampling efficiency, and proposes a Schrödinger bridge matching method that achieves state-of-the-art performance with fewer sampling steps.

Recent diffusion probabilistic models (DPM) in the field of pansharpening have been gradually gaining attention and have achieved state-of-the-art (SOTA) performance. In this paper, we identify shortcomings in directly applying DPMs to the task of pansharpening as an inverse problem: 1) initiating sampling directly from Gaussian noise neglects the low-resolution multispectral image (LRMS) as a prior; 2) low sampling efficiency often necessitates a higher number of sampling steps. We first reformulate pansharpening into the stochastic differential equation (SDE) form of an inverse problem. Building upon this, we propose a Schrödinger bridge matching method that addresses both issues. We design an efficient deep neural network architecture tailored for the proposed SB matching. In comparison to the well-established DL-regressive-based framework and the recent DPM framework, our method demonstrates SOTA performance with fewer sampling steps. Moreover, we discuss the relationship between SB matching and other methods based on SDEs and ordinary differential equations (ODEs), as well as its connection with optimal transport. Code will be available.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes