4.6 Article

A Fast Operator-splitting Method for Beltrami Color Image Denoising

Journal

JOURNAL OF SCIENTIFIC COMPUTING
Volume 92, Issue 3, Pages -

Publisher

SPRINGER/PLENUM PUBLISHERS
DOI: 10.1007/s10915-022-01910-y

Keywords

Color image denosing; Beltrami minimization; Diffusion; Operator-splitting method

Funding

  1. National Natural Science Foundation of China [NSFC 12071345, 11701418]
  2. Major Science and Technology Project of Tianjin [18ZXRHSY00160]
  3. Recruitment Program of Global Young Expert
  4. NSF/RGC Grant [N-HKBU214-19]
  5. ANR/RGC Joint Research Scheme [A-HKBU203-19]
  6. [HKBU 12300819]
  7. [RC-FNRA-IG/19-20/SCI/01]

Ask authors/readers for more resources

The Beltrami framework is a successful technique for color image denosing that accurately models the coupling between color channels. This paper proposes an operator-splitting method to solve the optimization problems of the Beltrami regularization model, and demonstrates the efficiency and robustness of the algorithm through experiments.
The Beltrami framework is a successful technique for color image denosing by regarding color images as manifolds embedded in a five dimensional spatial-chromatic space. It can ideally model the coupling between the color channels rather than treating them as if they were independent. However, the resulting model with high nonlinearity makes the related optimization problems difficult to solve numerically. In this paper, we propose an operator-splitting method for a variant of the Beltrami regularization model. From the optimality conditions associated with the minimization of the Beltrami regularized functional, we derive an initial value problem (gradient flow). We solve the gradient flow problem by an operator-splitting scheme involving three fractional steps. All three subproblem solutions can be obtained in closed form or computed by one-step Newton's method. We demonstrate the efficiency and robustness of the proposed algorithm by conducting a series of experiments on real image denoising problems, where more than half of the computational time is saved compared to the existing augmented Lagrangian method (ALM) based algorithm for solving the Beltrami minimization model.

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.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available