UINTA models images as derived from stationary MRFs. Thus,
| (106) |
The choice of entropy as the optimization measure is also consistent with several other observations. If we assume i.i.d. additive zero-mean noise, the addition of two independent random variables, i.e., the signal and additive noise, increases the entropy [154,34]. Entropy reduction reduces the randomness in corrupted PDFs and tries to counteract noise. Of course, continued entropy reduction might also eliminate some of the normal variability in the signal (original image). However, we have found that nondegraded images tend to have very low entropy relative to their degraded counterparts. Therefore, entropy reduction first affects random degradations substantially more than the signal. Furthermore, the entropy reduction is limited by the entropy-based stopping criterion, as described in Section 4.5.
The UINTA strategy is to reduce the entropy
of the Markov PDF by manipulating
the pixel values
. This requires the entropy of the Markov
PDFs
to be expressed as a function of each pixel value
. This
follows naturally from the Parzen-window density-estimation technique, based on the proposed
adaptive-MRF image model. Thus, all pixel-neighborhood values
in the image are observations that participate in defining the PDFs.
To update every pixel value in order to reduce the entropy, UINTA employs a gradient-descent
strategy. Note that a gradient descent on
has
components corresponding to both the center-pixel value
, and the neighborhood values
. Thus, at each pixel
, a gradient-descent scheme can potentially update the
entire region
. In practice, however, we update only the
center-pixel value
, i.e., we project the gradient onto the direction associated with the
center pixel.