Speckle Reduction with Adaptive Stack Filters

Speckle Reduction with Adaptive Stack Filters

Abstract

Stack filters are a special case of non-linear filters. They have a good performance for filtering images with different types of noise while preserving edges and details. A stack filter decomposes an input image into stacks of binary images according to a set of thresholds. Each binary image is then filtered by a Boolean function, which characterizes the filter. Adaptive stack filters can be computed by training using a prototype (ideal) image and its corrupted version, leading to optimized filters with respect to a loss function. In this work we propose the use of training with selected samples for the estimation of the optimal Boolean function. We study the performance of adaptive stack filters when they are applied to speckled imagery, in particular to Synthetic Aperture Radar (SAR) images. This is done by evaluating the quality of the filtered images through the use of suitable image quality indexes and by measuring the classification accuracy of the resulting images. We used SAR images as input, since they are affected by speckle noise that makes classification a difficult task.

1Introduction

SAR images are generated by a coherent illumination system and are affected by the coherent interference of the signal from the terrain [?]. This interference causes fluctuations of the detected intensity which varies from pixel to pixel, an effect called speckle noise, that also appears in ultrasound-B, laser and sonar imagery.

Speckle noise, unlike noise in optical images, is neither Gaussian nor additive; it follows other distributions and is multiplicative. Classical techniques, therefore, lead to suboptimal results when applied to this kind of imagery. Among the authors that have studied the problem of adapting classical image processing methods to SAR data, [?] provides a good starting point.

The physics of image formation leads to the following model: the observed data can be described by the random field , defined as the product of two independent random fields: , the backscatter, and , the speckle noise.

The backscatter is a physical magnitude that depends on the geometry and water content of the surface being imaged, as well as on the angle of incidence, frequency and polarization of the electromagnetic radiation emitted by the radar. It is the main source of information sought in SAR data.

Speckle has a major impact on the accuracy of classification procedures [?], since it introduces a low signal-to-noise ratio. The effectiveness of techniques for reducing speckle can be measured, among other quantities [?], through the accuracy of simple classification methods. The most widespread statistical classification technique is Gaussian maximum likelihood.

Different statistical distributions have been proposed in the literature for describing speckled data. [?] presents a comprehensive and updated survey of univariate distributions able to describe speckled data. In this work, since we are dealing with intensity format, we use the Gamma distribution, denoted by , for the speckle, and the reciprocal of Gamma distribution, denoted by , for the backscatter. These assumptions, and the independence between the fields, result in the intensity law for the return [?]. This family of distributions is indexed by three parameters: roughness , scale , and the number of looks , and it has been validated as an universal model for several types of targets. Intensity data is obtained by summing the squared real and imaginary parts of the complex return; [?] discuss properties of this type of speckled data.

Stack filters are a special case of non-linear filters. They have good performance for improving images with different types of noise while preserving edges and details. Various authors have studied these filters, and many methods have been developed for their construction and applicaton [?].

These filters decompose the input image, by thresholds, in binary slices forming a stack of data. Each binary image is then filtered using a Boolean function evaluated on a sliding window. The resulting image is obtained summing up all the filtered binary images. The application of stack filters to speckled data was studied by [?].

The main drawback of using stack filters is the need to compute the Boolean functions that satisfy a certain criterion. Direct computation on the set of all Boolean functions is unfeasible, and promising techniques rely on a learning procedure: the use of a pair of images, namely the ideal and corrupted one, and of a loss function. The Boolean functions are sought to provide the best estimator of the former using the latter as input. The stack filter design method used in this work is based on an algorithm proposed by [?]. The drawback of this line of action is the need of a pure, noiseless image.

[?] provide a comprehensive and updated review of the literature on speckle filters, with a view towards echocardiographic imagery. They propose a categorization, within which our proposal should be included in the “SAR” category.

We propose the use of user-provided information. The user selects as many regions of interest as desired, and after a descriptive and quantitative analysis of the data, he/she provides an “ideal” value for each region. The Boolean functions are then sought to provide an estimator of such values in the corresponding areas. This approach reduces the computational effort of building the Boolean functions and, at the same time, gives the option of providing a noiseless complete image or specifying “ideal” values in regions chosen by the user.

We study the application of this type of filter to SAR images, assessing its performance by evaluating the quality of the filtered images through the use of objective image quality indexes like the universal image quality index and the correlation measure index and by measuring the classification accuracy of the resulting images using maximum likelihood Gaussian classification.

The structure of this paper is as follows. Section 2 summarizes the model for speckled data. Section 3 reviews stack filters, and describes the filter design method used in this work. In Section 4 we discuss the results of filtering through image quality assessment and classification performance. Finally, in Section 5 we present the conclusions.

2The Multiplicative Model

Following [?], we will only present the univariate intensity case. Other formats (amplitude and complex) are treated in detail in [?].

The intensity distribution that describes speckled return is characterized by the following density:

where , . This situation is denoted .

The parameter describes the image roughness or texture. It adopts negative values, varying from to . If is near , then the image data are extremely rough (for example: urban areas), and if is far from the origin then the data correspond to a smooth region (for example: pasture areas). The values for forests lay in-between.

The -th order moment of a -distributed random variable is given by

if and infinite if otherwise.

Many filters have been proposed in the literature for reducing speckle noise, among them the ones by [?], by [?] and by [?]. These filters will be applied to speckled data, along with the filter proposed in this work. For quality performance the comparison will be done between the results of applying the stack filter and the Lee filter, since the latter is considered one of the touchstones for speckle reduction. Classification performance will be assessed by classifying data filtered with the Lee, Frost and stack filters using Gaussian maximum likelihood. The two first filters can be considered classical choices in the area.

3Stack Filters

This section is dedicated to a brief synthesis of stack filter definitions and design. For more details on this subject, the reader is referred to the works by [?].

Consider images of the form , with the support and the set of admissible values. The threshold is the set of operators given by

We will use the notation . According to this definition, the value of a non-negative integer number can be reconstructed making the summation of its thresholded values between and .

In the following, we show an example of the threshold decomposition of an unidimensional signal. Let be a signal. Its decomposition is given by: , , .

Let and be binary vectors of length . Define an order relation given by if and only if holds true for every . This relation is reflexive, anti-symmetric and transitive, generating therefore a partial ordering on the set of binary vectors of fixed length.

A Boolean function , where is the length of the input vectors, has the stacking property if and only if

We say that is a positive Boolean function if and only if it can be written by means of an expression that contains only non-complemented input variables. That is,

where is the number of arguments of the function, is the number of terms of the expression and is a subset of the interval , ’’ and ’’ denote, respectively, the AND and OR Boolean operators. It is possible to proof that this type of functions has the stacking property.

A stack filter is defined by the function , corresponding to the Positive Boolean function expressed in the form given in equation (Equation 4). The function can be expressed by means of a summation:

In this work we applied the stack filter generated with the fast algorithm described in [?].

Stack filters are built by a training process that generates a positive Boolean function that preserves the stacking property. Originally, this training is performed providing two complete images on , one degraded and one noiseless. The algorithm seeks the operator that best estimates the later using the former as input, with respect to a loss function.

The implementation developed for this work supports the application of the stack filter many times. Our approach consists of using, instead of that pair of images, a set of regions of interest, much smaller than the whole data set, and relying on the analysis the user makes of this information. Besides not needing a noiseless image, the user is free to impose its prior knowledge and assumptions on the resulting image.

The performance of the proposed filters is assessed both by qualitative and quantitative analyses. The system has an interface which shows the user the mean value of each region, and suggests it as the default “desired” value, but he/she can choose other from a menu (including the median, the lower and upper quartiles and a free specification). This freedom of choice is particularly useful when dealing with non-Gaussian degradation as is the case of, for instance, impulsive noise.

4Results

In this section, we present the results of building stack filters by the aforementioned training. These filters are applied to both simulated and real data. The quality of the results is assessed in two different manners: one using image quality objective measures, and other evaluating the influence of filtering on maximum likelihood classification.

4.1Image quality indexes

The indexes used to evaluate the quality of the filtered images are the universal image quality index [?] and the correlation measure . The universal image quality index is given by equation (Equation 6)

where , , and . The dynamic range of index is , being the best value. To evaluate the index of the whole image, local indexes are calculated for each pixel using a suitable square window, and then these results are averaged to yield the total image quality . The correlation measure is given by equation (Equation 7)

where and are the Laplacians of images and , respectively. The correlation measure range is .

4.2Observed metrics

A Monte Carlo experiment was performed, generating 1000 independent replications of synthetic 1-look SAR images for each of four contrast ratios. The generated images consist of two regions separated by a vertical straight border. Each sample corresponds to a different contrast ratio, which ranges from : to :. This was done in order to study the effect of the contrast ratio in the quality indexes considered.

Table 1 shows the mean correlation measure and the mean quality index , as computed in the Monte Carlo experiment. The comparison is made between Lee filtered and stack filtered SAR images.

Table 1: Statistics from image quality indexes
(lr5pt)2-5
(lr5pt)2-3 (lr5pt)4-5 contrast
(lr5pt)2-5
(lr5pt)2-3 (lr5pt)4-5 contrast

It can be seen that, according to the results obtained for the index, the stack filter exhibits a better performance at high contrast ratios, namely : and :, while the Lee filter shows the opposite behavior. The results for the index show slightly better results for the stack filter all over the range of contrast ratios. It is remarkable the small variance of these estimations, compared to the mean values obtained.

Figure ? shows the boxplots of the observations summarized in Table 1. From the plots for the index, it can be seen that, the Lee filter has a lower degree of variability with contrast and that both are almost symmetric. The plots of the index show a better performance for the stack filter for all the contrast ratios considered.

The image resulting of applying the stack filter 95 times and the image produced by the application of the Lee filter. This was found the ideal number of iterations for this study: less iterations produced images with visible noise, while more iterations introduced blurring. An automatic stopping criterion is a venue for future research. The presented results are the mean values obtained from a Monte Carlo experiment involving different contrast ratios.

4.3Classification performance

The equality of the classification results are obtained by calculating the confusion matrix, after Gaussian Maximum Likelihood Classification (GMLC).

Figure ?, left, presents an image pixels, simulated with two regions: samples from the and from the laws form the left and right halves, respectively, where denotes the scale parameter that, for a given roughness and number of looks yields an unitary mean law. In this manner, Figure ? presents data that are hard to classify: extremely heterogeneous and homogeneous areas with the lowest possible signal-to-noise ratio (). The mean value of the dashed area was used as the “ideal” image. Figures ? and ?, left, show the result of applying the resulting filter once and times, respectively. The right side of Figures ?, ? and ? present the GMLC of each image. Not only the pointwise improvement is notorious, but the edge presevation is also noteworthy, specially in Figure ?, right, where the straight border has been completely retrieved.



Figure ? compares the performance of the proposed stack filter with respect to two widely used SAR filters: Lee and Frost. Figure ? presents the original data, and the regions of interest used for estimating the Boolean function; the data are from the ESAR sensor and show two distinct agricultural areas with possibly a raw of trees (the high return strip). The data are from the HV polarization, L-band with about pixel size and of spatial resolution. In this case, again, the mean on each region was used as the ‘ideal’ image. Figures ?, ?, ? and ? present the result of applying the Frost, Lee and Stack filters (one and iterations; this last choice, again, obtained by visual inspection) to the original SAR data. The right side of previous figures present the corresponding GMLC. The stack filter produces better results than classical despeckling techniques.

Table 2 presents the main results from the confusion matrices of all the GMLC, including the results presented in [?] which used the classical stack filter estimation with whole images. It shows the percentage of pixels that was labeled by the user as from region that was correctly classified as belonging to region , for . “None” denotes the results on the original, unfiltered, data, “Sample Stack ” denotes our proposal of building stack filters with samples, applied times, “Stack ” the classical construction applied times, and “Frost” and “Lee” the classical speckle reduction filters. It is clear the superior performance of stack filters (both classical and by training) over speckle filters, though the stack filter by training requires more than a single iteration to outperform the last ones. Stack filters by training require about two orders of time less than classical stack filters to be built, and they produce comparable results. Using regions of interest is, therefore, a competitive approach for the definition of this kind of filters.

Table 2: Statistics from the confusion matrices
Filter / / /
None
Sample Stack 1
Sample Stack 22
Stack 1
Stack 40
Stack 95
Frost
Lee

4.4Contrast preservation

We use a second phantom of strips and points to assess contrast and edge preservation. It consists of an image of size pixels with two regions: one formed by strips of several widths on a background. The data in the former are distributed according to a law, and the latter obey a distribution, where is the scale, is the roughness parameter and the number of looks is held constant in the noisiest case, namely .

The factor used in this experiment was the contrast between light areas (strips and points) and background, measured as

which considers the mean and the standard deviation of each region. These values, which depend on the three parameters of the distribution can be computed using the expression of moments given in equation . [?] present other contrast measures based on stochastic divergences between distributions.

An ideal filter reduces the noise without affecting the contrast. A blurry filter will smudge the edges, mixing classes and reducing the contrast. Since the phantom presented in Figure ? consists of thin light strips and isolated points on a dark background, the strips and points will tend to disappear if the filter introduces blur.

Table ? presents the relative contrast error between the theoretical and observed values; the latter is the mean over one hundred replications.

Relative contrast error introduced by the filters
Contrast Stack Lee Frost

The Frost filter presents the best performance, but it also alters the contrast between regions as can be seen in Figure ?. The stack filter outperforms by a small margin the Lee filter in two out of three cases, but both are much better than the Frost filter regarding contrast preservation. Visual inspection confirms previous results: the stack filter is more effective at reducing speckle than the other two techniques, as can be seen in Figure ?.

5Conclusions

In this work, the effect of adaptive stack filtering on SAR images was assessed. Two viewpoints were considered: a classification performance viewpoint and a quality perception viewpoint. For the first approach, the Frost and Lee filters were compared with the iterated stack filter using a metric extracted from the confusion matrix. A real SAR image was used in this case. For the second approach, a Monte Carlo experience was carried out in which 1-look synthetic SAR, i.e., the noisiest images, were generated. In this case, the Lee filter and a one pass stack filter were compared for various degrees of contrast. The and the indexes were used as measures of perceptual quality. The results of the index shows that the stack filter performs better in cases of high contrast. The results of the index show slightly better performance of the stack filter over the Lee filter. This quality assessment is not conclusive but indicates the potential of stack filters in SAR image processing for visual analysis. The classification results and the quality perception results suggest that stack filters are promising tools in SAR image processing and analysis.

The results obtained using the contrast measure given by formula Equation 8 show a comparatively good performance of the stack Filter. The system was developed in Matlab, and the code is available from the first author upon request.

10030
This is a comment super asjknd jkasnjk adsnkj
""
The feedback cannot be empty
Submit
Cancel
Comments 0
""
The feedback cannot be empty
   
Add comment
Cancel

You’re adding your first comment!
How to quickly get a good reply:
  • Offer a constructive comment on the author work.
  • Add helpful links to code implementation or project page.