CVIVJan 31, 2023

Hierarchical Disentangled Representation for Invertible Image Denoising and Beyond

arXiv:2301.13358v11 citationsh-index: 42
Originality Incremental advance
AI Analysis

This addresses the problem of efficient and effective image denoising for applications such as medical imaging, though it is incremental by building on existing invertible neural network approaches.

The authors tackled image denoising by proposing a fully invertible method that disentangles noise from high-frequency image parts, achieving competitive performance on tasks like real image denoising and medical CT restoration with significantly lower computational cost.

Image denoising is a typical ill-posed problem due to complex degradation. Leading methods based on normalizing flows have tried to solve this problem with an invertible transformation instead of a deterministic mapping. However, the implicit bijective mapping is not explored well. Inspired by a latent observation that noise tends to appear in the high-frequency part of the image, we propose a fully invertible denoising method that injects the idea of disentangled learning into a general invertible neural network to split noise from the high-frequency part. More specifically, we decompose the noisy image into clean low-frequency and hybrid high-frequency parts with an invertible transformation and then disentangle case-specific noise and high-frequency components in the latent space. In this way, denoising is made tractable by inversely merging noiseless low and high-frequency parts. Furthermore, we construct a flexible hierarchical disentangling framework, which aims to decompose most of the low-frequency image information while disentangling noise from the high-frequency part in a coarse-to-fine manner. Extensive experiments on real image denoising, JPEG compressed artifact removal, and medical low-dose CT image restoration have demonstrated that the proposed method achieves competing performance on both quantitative metrics and visual quality, with significantly less computational cost.

Foundations

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

Your Notes