Analysis of Fast DCP Algorithm

The main drawback in DCP algorithm is it’s computational time. Practical applications
require less time to calculate the dehazed image from hazy image. In order to overcome this
drawback we use an improved version of DCP algorithm which is a Fast DCP algorithm.

In the above section 4 we mentioned complete analysis of DCP algorithm [1] in which the
' '
transmission medium is t ( x) is calculated by using local patch. So, the edge region of t ( x)
is rigid. In order to smoothen these edges we used Transmission Map Refinement, which is a
time consuming process and can’t applicable for practical applications. We reduce this effect by
using Fast DCP algorithm.

This Fast DCP algorithm mainly contains three steps as follows:

1.Down-Sampling
2.Estimation of Pixel-wise estimation Dark Channel Image
3.Estimation of Robust ambient light

5.1.1 Down-sampling

From He’s method [1] we observe that dark channel of haze image I has low spatial
frequency. So, we calculated dark channel value with a down-sampled image inspired by [5].

5.1.2 Estimation of pixel-wise Dark Channel Image

We calculated the dark channel value using one pixel (1×1 patch) instead of 15×15 patch
[1] to reduce the computation time without losing the spatial information. Hence, our proposed
method do not need soft-matting process.

5.1.3 Estimation of Robust ambient light

In order to reduce the computational time and to improve