next up previous contents
Next: Regularization of the one-step Up: Regularization from significant structures Previous: Regularization from significant structures

Regularization of Van Cittert's algorithm

Van Cittert's iteration is:
$\displaystyle O^{(n+1)} (x,y) = O^{(n)} (x,y) + \alpha{R}^{(n)}(x,y)$     (14.115)

with R(n)(x,y) = I(x,y) - P(x,y) * O(n) (x,y). The regularization by the significant structures leads to:
$\displaystyle O^{(n+1)} (x,y) = O^{(n)} (x,y) + \alpha {\bar{R}}^{(n)}(x,y)$     (14.116)

The basic idea of our method consists of detecting, at each scale, structures of a given size in the residual R(n)(x,y) and putting them in the restored image O(n)(x,y). The process finishes when no more structures are detected. Then, we have separated the image I(x,y) into two images $\tilde O(x,y)$ and R(x,y). $\tilde O$ is the restored image, which does not contain any noise, and R(x,y) is the final residual which does not contain any structure. R is our estimation of the noise N(x,y).

Petra Nass