mlsanityData to 14 Oct 2026

CoA: Towards Real Image Dehazing via Compression-and-Adaptation

arXiv 2504.05590 ↗First posted 8 Apr 2025cs.CVcited by 6

Not on the map. Why?

Abstract (arXiv)

Learning-based image dehazing algorithms have shown remarkable success in synthetic domains. However, real image dehazing is still in suspense due to computational resource constraints and the diversity of real-world scenes. Therefore, there is an urgent need for an algorithm that excels in both efficiency and adaptability to address real image dehazing effectively. This work proposes a Compression-and-Adaptation (CoA) computational flow to tackle these challenges from a divide-and-conquer perspective. First, model compression is performed in the synthetic domain to develop a compact dehazing parameter space, satisfying efficiency demands. Then, a bilevel adaptation in the real domain is introduced to be fearless in unknown real environments by aggregating the synthetic dehazing capabilities during the learning process. Leveraging a succinct design free from additional constraints, our CoA exhibits domain-irrelevant stability and model-agnostic flexibility, effectively bridging the model chasm between synthetic and real domains to further improve its practical utility. Extensive evaluations and analyses underscore the approach's superiority and effectiveness. The code is publicly available at https://github.com/fyxnl/COA.

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 24 of its 48 references that are in the map. First posted on arXiv 8 Apr 2025.

Builds on

24 of 48 references.

References · 24

  1. 2017Benchmarking Single Image Dehazing and Beyondcited by 447
  2. 2018Bilevel Programming for Hyperparameter Optimization and Meta-Learningcited by 405
  3. 2022Vision Transformers for Single Image Dehazingcited by 260
  4. 2020Multi-Scale Boosted Dehazing Network with Dense Feature Fusioncited by 230
  5. 2022Restoring Vision in Adverse Weather Conditions with Patch-Based Denoising Diffusion Modelscited by 215
  6. 2021Investigating Bi-Level Optimization for Learning and Vision from a Unified Perspective: A Survey and Beyondcited by 153
  7. 2018Densely Connected Pyramid Dehazing Networkcited by 145
  8. 2023DEA-Net: Single image dehazing based on detail-enhanced convolution and content-guided attentioncited by 91
  9. 2023Curricular Contrastive Regularization for Physics-aware Single Image Dehazingcited by 83
  10. 2021Exponential Moving Average Normalization for Self-supervised and Semi-supervised Learningcited by 78
  11. 2023RIDCP: Revitalizing Real Image Dehazing via High-Quality Codebook Priorscited by 73
  12. 2024Selective Hourglass Mapping for Universal Image Restoration Based on Diffusion Modelcited by 73
12 more
  1. 2023Contrastive Semi-supervised Learning for Underwater Image Restoration via Reliable Bankcited by 71
  2. 2021From Synthetic to Real: Image Dehazing Collaborating with Unlabeled Real Datacited by 68
  3. 2020Nighttime Dehazing with a Synthetic Benchmarkcited by 41
  4. 2023Enhancing Visibility in Nighttime Haze Images Using Guided APSF and Gradient Adaptive Convolutioncited by 39
  5. 2021DW-GAN: A Discrete Wavelet Transform GAN for NonHomogeneous Dehazingcited by 38
  6. 2023Underwater Image Enhancement by Transformer-based Diffusion Model with Non-uniform Sampling for Skip Strategycited by 33
  7. 2024Depth Information Assisted Collaborative Mutual Promotion Network for Single Image Dehazingcited by 32
  8. 2018Unsupervised Single Image Dehazing Using Dark Channel Prior Losscited by 30
  9. 2019Learning a No-Reference Quality Assessment Model of Enhanced Images With Big Datacited by 21
  10. 2024ODCR: Orthogonal Decoupling Contrastive Regularization for Unpaired Image Dehazingcited by 16
  11. 2023Synergistic Multiscale Detail Refinement via Intrinsic Supervision for Underwater Image Enhancementcited by 10
  12. 2023Illumination Controllable Dehazing Network based on Unsupervised Retinex Embeddingcited by 7

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 2; 2026: 4.

6 papers.