Papers
Topics
Authors
Recent
Search
2000 character limit reached

Weighted Dark Channel Dehazing

Published 28 Apr 2019 in cs.CV | (1904.12245v1)

Abstract: In dark channel based methods, local constant assumption is widely used to make the algorithms invertible. It inevitably introduces defects since the assumption can not perfectly avoid depth discontinuities and meanwhile cover enough pixels. Unfortunately, because of the limitation of the prior, which only confirms the existence of dark things but does not specify their locations or likelihood, no fidelity measurement is available in refinement thus the defects are either under-corrected or over-corrected. In this paper, we go deeper than the dark channel theory to overcome this problem. We split the concept of dark channel into dark pixels and local constant assumption, and then, control the problematic assumption based on a novel weight map. With such effort, our methods show significant improvement on quality and have competitive speed. In the last, we show that the method is highly robust to initial transmission estimates and can be ever-improved by providing better dark pixel locations.

Authors (3)
Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.