4.7 Article

A General Destriping Framework for Remote Sensing Images Using Flatness Constraint

Journal

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TGRS.2022.3153995

Keywords

Videos; Data models; Tensors; TV; Hyperspectral imaging; Convex functions; Visualization; Destriping; flatness constraint (FC); hyperspectral images (HSIs); infrared (IR) data; primal-dual splitting

Funding

  1. JST CREST [JPMJCR1662, JPMJCR1666]
  2. JST PRESTO [JPMJPR21C4]
  3. JSPS KAKENHI [20H02145, 19H04135, 18H05413]
  4. Grants-in-Aid for Scientific Research [19H04135, 20H02145] Funding Source: KAKEN

Ask authors/readers for more resources

This article proposes a general destriping framework using a newly introduced stripe noise characterization named flatness constraint (FC) to handle various image regularizations. The framework formulates the destriping problem as a nonsmooth convex optimization problem involving a general form of image regularization and the FC, effectively removing stripe noise from images by mathematically modeling the constraint.
Removing stripe noise, i.e., destriping, from remote sensing images is an essential task in terms of visual quality and subsequent processing. Most existing destriping methods are designed by combining a particular image regularization with a stripe noise characterization that cooperates with the regularization, which precludes us to examine and activate different regularizations to adapt to various target images. To resolve this, two requirements need to be considered: a general framework that can handle a variety of image regularizations in destriping, and a strong stripe noise characterization that can consistently capture the nature of stripe noise, regardless of the choice of image regularization. To this end, this article proposes a general destriping framework using a newly introduced stripe noise characterization, named flatness constraint (FC), where we can handle various regularization functions in a unified manner. Specifically, we formulate the destriping problem as a nonsmooth convex optimization problem involving a general form of image regularization and the FC. The constraint mathematically models that the intensity of each stripe is constant along one direction, resulting in a strong characterization of stripe noise. For solving the optimization problem, we also develop an efficient algorithm based on a diagonally preconditioned primal-dual splitting algorithm (DP-PDS), which can automatically adjust the step sizes. The effectiveness of our framework is demonstrated through destriping experiments, where we comprehensively compare combinations of a variety of image regularizations and stripe noise characterizations using hyperspectral images (HSIs) and infrared (IR) videos.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available