Sei sulla pagina 1di 53

Digital Image Processing

Image Restoration

Digital Image Restoration

contents

Digital Image Restoration 1 2 3


Utilization Of A Simple Visual Model In Image Restoration Maximum A Posteriori Estimation For Digital Image Restoration

Digital Image Restoration

Digital Image Coding

The general image restoration Problem is made more difficult by the nonlinearities inherent in various image recording processes

Digital Image Restoration

Digital Image Restoration

Image restoration attempts to restore images that have been degraded


Identify the degradation process and attempt to reverse it Similar to image enhancement, but more objective

Digital Image Restoration

Image Restoration

In many applications (e.g., satellite imaging, medical i maging, astronomical imaging, poor-quality family port raits) the imaging system introduces a slight distortion Image Restoration attempts to reconstruct or recover an image that has been degraded by using a priori kn owledge of the degradation phenomenon. Restoration techniques try to model the degradation a nd then apply the inverse process in order to recover t he original image.
1/20/2012 5

A Model of the Image Degradation/ Restoration Process

1/20/2012

Digital Image Restoration

A. Basic Formulations of the Restoration Problem

1. The image restoration problem can be described in terms of Fig. 5 2. Take the recorded image and process it in some fashion to obtain an estimate of the object radiant energy distribution f 3. The estimate ^f of the object radiant energy distribution is referred to as the restored image.

Digital Image Restoration

1. the functional block s in Fig. 5 would be the identity mapping and the noise term n would be everywhere zero. 2. such an ideal case the image restoration problem reduces to solving an integral equation such as (l), (2), or (4) for the function f.

Digital Image Restoration

Even this ideal case is difficult for the underlying equation is ill-conditioned

Digital Image Restoration

1. The digital image restoration problem is posed in terms of a discrete approximation to either (2) or (4) 2. A discrete approximation of either (2) or (4) requires the use of quadrature rules from numerical analysis

Digital Image Restoration

The simplest quadrature rule of this class for approximating (2) or (4) is the rectangular rule

Digital Image Restoration

Digital Image Restoration

1. If images of infinite extent are dealt with, then: a1 = a2 = - infinite and bl = b2 = + infinite 2. Such images are not practical for digital restoration and we assume the images to be of finite extent. 3. We assume : al=a2=0 and bl=M, b2=N.

Digital Image Restoration

1. Equations (27) and (28) make explicit the linear nature of image restoration. 2. If we use a lexicographic order to create vectors (recall (21)) from the matrices g and f, then the sums in (27) and (28) can be represented as a matrix product.

Digital Image Restoration

Digital Image Restoration

Digital Image Restoration

1. The block Toeplitz structure of (28) and (30) can be described as a subpartition of a circular convolution structure by using a vector or block circulant matrix. 2. the circulant inversion is only an approximation to the true restoration which requires a Toeplitz inversion

Digital Image Restoration

Digital Image Restoration

1. Equations (4) and (28) describe a linear spatial filter. 2. The image restoration problem can be described, in a formal fashion at least, as the choice of the filter inverse to the point-spread-function, so as to yield the original data when the degraded image is processed by the filter. 3. the original image blur is so slight that the corresponding spatial filter remains appreciably greater than zero amplitude response throughout the image bandwidth, and if the signal to-noise ratio is very high over the image bandwidth, the inverse filter can be expected to achieve good results.

Digital Image Restoration

1. Equations (28) and (30) represent a formulation of the restoration problem under the assumption of an ideal image recording media. 2. A realistic model must include a more complex form for the function s plus the addition of noise.

Digital Image Restoration

Digital Image Restoration

This Equation is recorded Image.

1. Using the discrete representations and lexicographic-ordered vectors. 2. The notation s(x) means each component of the vector x is transformed by s.

Digital Image Restoration 1. For computational purposes, we again concentrate upon (32). Assuming exposure in the linear region of film response, the function s is the base 10 logarithm, and the distinction between density images and intensity images becomes important. Assuming a photographic image is measured and digitized in optical density units.

2. where r is the slope of the characteristic curve in the linear Region. 3. If the recorded image is measured and digitized in film transmittance units, then s is the gamma power and the intensity restoration problem becomes

Digital Image Restoration

1. where N1 is a diagonal matrix whose diagonal entries are

2. it is necessary to account for the multiplicative nature of the noise in the intensity domain. 3. The aforementioned complexities have mostly been avoided in digital image restoration. 4. For restoration of intensity images, the multiplicative nature of filmgrain noise is usually neglected and an additive model assumed:

5. if the intensity span of the original image is small, then the logarithm of a small variation is approximately linear. The corresponding density image restoration is

Digital Image Restoration

B. Image Restoration Techniques 1. The FFT makes feasible the numerical solution of the large linear systems presented in the space-invariant digital restoration problem. 2. The ill-conditioned behavior of the systems is not affected by the employment of the FFT for solutions. 3. The ill-conditioned behavior is controlled from assumptions made to develop a particular restoration technique. 4. Given the ill-conditioned behavior and the existence of noise, there is no unique solution. Instead, there is an infinite family of solutions, and one must choose a criterion that determines the solution which is optimal in some sense.

Digital Image Restoration

we use the structure as a paradigm

1. A criterion of solution is the MMSE criterion:

Digital Image Restoration 1. where f is the restored image estimate. 2. Since HT in (37) is block Toeplitz, the block circulant approximation may be employed. 3. Assuming the covariance functions of both image and noise are stationary and decay to zero in a finite interval, then the resulting covariance matrices of the lexicographicordered vectors f and n are also block Toeplitz and block circulant approximations may also be used. 4. The resulting restoration algorithm is a linear digital spatial filter which can be described in the frequency domain as

5.

The restored-image Wiener estimate is described in the frequency domain as

Digital Image Restoration

1. Wiener fiiter restorations possess the shortcoming of requiring extensive a priori information, namely, the point-spread function and detailed knowledge of image and noise autocovariance functions. 2. Constrained least squares estimation is a technique that eliminates the requirement of covariance information. The constrained least squares estimate is obtained by solving the minimization problem

3. where C is a constraint matrix, e is proportional to the noise variance, and T superscript denotes matrix transpose. 4. this problem may be solved by the discrete Fourier transform also, and the frequency domain filter is

Digital Image Restoration

1. Special interest are the homomorphic techniques of Stockham, Cole, and Cannon, in which the point-spread function is assumed to be unknown and then estimated from the degraded image by taking averages of image segments in the log-spectral domain. 2. Coled s work concentrated upon point-spread functions with no phase component and was extended to estimation of phase in specific pointspread functions by Cannon. The basis of both techniques is the concept of homomorphic systems. The homomorphic fiiter can be described in the frequency domain as

Digital Image Restoration

: inverse filter

1. The aforementioned techniques have been applied to realistic digital pictures, pictures with sufficient resolution in picture elements to convey appreciable visual structure. 2. A number of other digital image restoration methods have been proposed, but not applied to realistic images, chiefly because the computing requirements were beyond the resources of the researcher.

Digital Image Restoration C. Comparison of Image Restoration Techniques 1. how do the techniques compare, and which is best?

Parameters which affect the outcome of a restoration Signal-to-noise ratio Image and noise correlation A priori information Visual quality of restored image

Digital Image Restoration

1. It may be initially surprising that the Wiener filter performs so poorly in comparison to the other image restoration techniques. 2. The optimality of the Wiener filter is derived on the basis of linear theory, however, and the human visual system perceives images with a number of known nonlinear effects, and probably a number of others that are unknown. 3. The logarithmic structure of the homomorphic filter makes its preferability seem reasonable in view of logarithmic eye response.

Utilization Of A Simple Visual Model In Image Restoration

A. Human Visual System Response 1. Determining the response of the human visual system is made difficult by its inaccessible and distributed nature. 2. One cannot isolate a working component of this system and measure its properties. 3. One must infer the visual system behavior on the basis of indirect evidence.

difficult by its inaccessible and distributed nature

Utilization Of A Simple Visual Model In Image Restoration

1. Experiments show that the human visual system perceives the logarithm of incident light intensity entering the eye. 2. Visual perception takes place from illumination levels of moonless night to high noon on a snowfield, an intensity range of eight orders of magnitude.

Utilization Of A Simple Visual Model In Image Restoration

1. The human visual system also acts as a spatial frequency filter. 2. No person can see with infinite resolution, so there must be a limit to the maximum spatial frequency which the eye can perceive, at a given viewing distance. 3. In such terms, the eye must behave as a low-pass filter, with no resolution beyond a specific high-frequency limit. 4. The visual system weights the mid-range frequencies more heavily than either the low or high frequencies. 5. The response in Fig. 7 can be described by an equation

Utilization Of A Simple Visual Model In Image Restoration

B. Constrained Least Squares and Visual System Effects 1. Assume that the incident intensities entering the eye originated from an image which was correlated, the covariance function of the image was not a Dirac function. 2. The image perceived by the brain would not have the same correlation. 3. The linear filter in eye response would induce new correlation on the image, and the power spectrum of the image perceived by the brain would have been multiplied by Fig. 7

Utilization Of A Simple Visual Model In Image Restoration

1. We recall (40), which defines the constrained-least-squares estimate.

2. If we next assume a choice of C in (40) such that

3. where Rf is the covariance matrix of the original object to be Restored. 4. The choice of matrix C such that (45) is satisfied is required for prewhitening in the statistical theory of least squares estimation.

Utilization Of A Simple Visual Model In Image Restoration

1. The use of the covariance matrix of f is undesirable, since the covariance matrix is usually unobtainable as a priori information. 2. Instead we make the following assumption: that the covariance of f is a Dirac function, the original object intensities f are samples from a e whitef random process. 3. This can be characterized as the maximum ignorance assumption. 4. The correlation of the image perceived by the brain is the correlation induced by the visual system. 5. the restoration filter in the discrete frequency domain is the point-spread function

two-dimensional formulation of the radially symmetric visual system response

Utilization Of A Simple Visual Model In Image Restoration

C. Experimental Results

Utilization Of A Simple Visual Model In Image Restoration

C. Experimental Results

Utilization Of A Simple Visual Model In Image Restoration

The noise has been greatly suppressed, but no gain in resolution is discernible. In fact, the overall impression is that the suppression of noise has resulted in an overall loss of fine structure and resolution of detail from the degraded image of Fig. 8.

Maximum A Posteriori Estimation For Digital Image Restoration

Maximum A Posteriori Estimation For Digital Image Restoration

1. The vector f, representing the object intensities to be restored, is also assumed to be a sample from an underlying two-dimensional random process. 2. We choose as the model for the intensities a Gaussian process fluctuating about a positive mean. 3. This is partially unrealistic; the Gaussian process generates negative values, no matter how large the positive mean. 4. However, if the variance about the mean is small compared to the mean, a very large fraction of the process values are positive and the model is a reasonable approximation.

Maximum A Posteriori Estimation For Digital Image Restoration

Maximum A Posteriori Estimation For Digital Image Restoration

Maximum A Posteriori Estimation For Digital Image Restoration

Maximum A Posteriori Estimation For Digital Image Restoration

Maximum A Posteriori Estimation For Digital Image Restoration

3. The estimate of (53) can be described in a feedback structure.

Maximum A Posteriori Estimation For Digital Image Restoration

C. Solution of MAP Equations 1. Equation (53) is a nonlinear matrix equation. 2. The solution of the equation for the MAP estimate is not known in general, just as the corresponding nonlinear integral equation from Van Trees has not been solved in general.

Solution of MAP equations Fast transform iteration Gradient methods

Maximum A Posteriori Estimation For Digital Image Restoration

C. Solution of MAP Equations 1.Fast Transform Iteration: Equation (53) can be written in the functional form

Maximum A Posteriori Estimation For Digital Image Restoration

Maximum A Posteriori Estimation For Digital Image Restoration

2. Gradient Method 1.Equation (53) is, in fact, the gradient of the quadratic forms evaluated at the maximum. 2.Under the assumptions of Toeplitz forms for the point-spread function and covariance matrices, the gradient can be calculated by FFT techniques. 3. From the viewpoint of special purpose. hardware, the MAP estimate is particularly intriguing 4. Structures such as Fig. 12 cannot be implemented directly in MAP estimates of time functions because of the nonrealizable nature of the filters. anticipatory response and noncausal filters are required

Maximum A Posteriori Estimation For Digital Image Restoration

2. Gradient Method 1.However, causality is not a restriction in image processing, and the indicated filters can be implemented optically since causality does not arise as an issue. 2.Finally, there now exist digitally programmable light modulators which can be used to create the nonlinear operations associated with the function s and its derivatives. 3. Thus the possibility exists that a hybrid digital/optical processor can be built to serve as a special-purpose hardware device for image restoration by MAP estimation.

Potrebbero piacerti anche