CVAug 15, 2025

Semi-supervised Image Dehazing via Expectation-Maximization and Bidirectional Brownian Bridge Diffusion Models

arXiv:2508.11165v11 citationsh-index: 26
Originality Incremental advance
AI Analysis

This addresses the challenge of dehazing in computer vision, particularly for real-world scenes with thick haze, by reducing reliance on costly paired data, though it appears incremental in its approach.

The paper tackles the problem of image dehazing, especially for thick haze, by proposing a semi-supervised method using Expectation-Maximization and Bidirectional Brownian Bridge Diffusion Models, which achieves superior or comparable performance to state-of-the-art methods on synthetic and real-world datasets.

Existing dehazing methods deal with real-world haze images with difficulty, especially scenes with thick haze. One of the main reasons is the lack of real-world paired data and robust priors. To avoid the costly collection of paired hazy and clear images, we propose an efficient semi-supervised image dehazing method via Expectation-Maximization and Bidirectional Brownian Bridge Diffusion Models (EM-B3DM) with a two-stage learning scheme. In the first stage, we employ the EM algorithm to decouple the joint distribution of paired hazy and clear images into two conditional distributions, which are then modeled using a unified Brownian Bridge diffusion model to directly capture the structural and content-related correlations between hazy and clear images. In the second stage, we leverage the pre-trained model and large-scale unpaired hazy and clear images to further improve the performance of image dehazing. Additionally, we introduce a detail-enhanced Residual Difference Convolution block (RDC) to capture gradient-level information, significantly enhancing the model's representation capability. Extensive experiments demonstrate that our EM-B3DM achieves superior or at least comparable performance to state-of-the-art methods on both synthetic and real-world datasets.

Foundations

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

Your Notes