Table 1.

Pseudo code of new pixel evaluation

Input: $F_{\nu }(c,d)$
Output: $F^g(c,d)$
Parameter: $Thr1,Thr2,Thr3$ represent threshold value computed with the proposed FAL algorithm
Procedure:
Begin
Select $3\times 3$ window by adapting noise pixel as center pixel
Match noisy pixel using input image
Determine the count of similar matched pixel count $Q_T$
If $(Q_T>Thr1)$
Discover $\mathrm{fun}(c,d)$
If $\mathrm{fun}\left(c,,,d\right)>Thr2$
Determine $\alpha (c,d)$
else
$\alpha (c,d)=\mathrm{fun}(c,d)$
If $\mathrm{fun}\left(c,,,d\right)>Thr3$
$F^g(c,d)=F(c,d)$
else
Determine new pixel values for noisy pixels $F^g(c,d)$
else
$F^g\left(c,,,d\right)=F(c,d)$
End