7

Automatic Measurement of Ground Permittivity and Automatic Detection of Object Location with GPR Images Containing a Response from a Local Object

Mikhail M. Golovko and Gennadiy P. Pochanin

CONTENTS

7.1 Introduction

7.2 Permittivity Measurement

7.3 Use of the Hough Transform for Detection of Hyperbolic Curves

7.3.1 Binary Imaging

7.3.2 Hough Transforming of GPR Signals

7.3.3 Speeding Up Hough Transform Calculations

7.4 Dependence of the Form of Hough Space on the Error in Permittivity Value

7.5 Algorithm for Accurate Calculation of Permittivity

7.6 Conclusions on Hough Transform Methods

7.7 Numerical Estimation of the Performance of the Automatic Object-Detection Method

7.8 Metrics of Object Detection Method

7.9 Object Detection in Simulated GPR Images

7.10 Object Detection in Experimental GPR Images

7.11 Conclusion

References

7.1 Introduction

The ultrawideband (UWB) ground-penetrating radar (GPR) allows nondestructive control and search of different objects buried in ground. However, it can be also used for characterization of ground. Sometimes, GPR allows detection of water or oil leakages from buried pipelines or determination of soil moisture content in a variety of fields such as hydrology, agronomics, etc. Because interpretation of radar data requires complicated processing, which usually can be made only by experienced operator, the automation of object-detection process and ground-permittivity measurement using GPR images is of great commercial interest. This chapter presents methods to automate the evaluation of ground characteristics by permittivity estimation. The relative permittivity ε is one medium characteristic indicating the physical change of the medium. If we know ε, then it is possible to find the moisture content of soil by definite relations.

Besides well-known and widely used techniques for measurement of soil moisture (gravimetric, neutron, and capacitive sounding, and the “time domain reflectometry”), the GPR can also be used for this purpose [1,2].

Lunt and Huisman showed how to apply two well-known GPR techniques for permittivity measurement. The first technique uses the speed of radio wave propagation [14], and the second one estimates the reflection factor from ground layers [5,6]. The first technique has a shortcoming in that it requires interactive (with a GPR operator) data processing, and the second method is only suitable for monostatic stepped-frequency continuous wave radars.

The speed of electromagnetic wave propagation in a medium is V=c/εμ, where c is the velocity of electromagnetic waves in vacuum and μ is the relative permeability. Thus, if μ = 1 (it is true for almost all types of soil), the problem of ε determination consists in the measurement of V.

In order to measure object coordinates, it is enough to find a location of object response on a timescale. Time multiplied by the propagation speed of an electromagnetic wave in a medium gives the distance. Taking into account the respective locations of transmitting and receiving antennas, it is possible to calculate the object coordinates.

The basis of the GPR technique is widely known [1,3,4]. Figure 7.1 schematically represents the subsurface sounding process and the GPR image (“a profile”) obtained by the GPR. The local radar-contrast objects with small dimensions form the hyperbolic curves in a GPR image, as shown in Figure 7.1. The larger is the permittivity, the faster do the hyperbola’s arms go down. An example of the GPR profile with several hyperbolas is shown in Figure 7.2.

Images

FIGURE 7.1
The process of GPR survey and forming the hyperbolic response from an object: TA—transmitting antenna, RA—receiving antenna, and P—sought object.

Images

FIGURE 7.2
An example of a GPR profile containing several local objects. The white curve is a synthetic hyperbola.

7.2 Permittivity Measurement

A well-known interactive technique for measurement of ν works as follows. The operator draws a reference hyperbola over the GPR profile (Figure 7.2) using the data-processing software and superposes it with an object curve [7]. Then, we can calculate ν using the profile parameters.

Now, consider a novel technique that is intended for automatic (without a GPR operator) determination of permittivity if the response from a local object (e.g., a pipe or a cable) takes place in the profile. Actually, the procedure consists in automatic searching for a hyperbolic curve in the GPR profile and then in automatic finding of ground permittivity corresponding to the hyperbolic curve.

A technique based on the Hough transform (HT) [8] provides an effective way for searching contour curves including hyperbola in a binary image [9]. This technique already has wide applications in pattern recognition, automatic object identification, and GPR data processing [1013]. The theory of HT for fast and precise detection of local objects and for determination of soil properties has been stated in the papers [14,15]. The distinguishing feature of the proposed approach lies not only in the technique for ground permittivity determination, using the known location of a subsurface object, but also in allowing to simultaneously solve the problems of object detection and permittivity determination by means of the method of sequential iterations. The most important feature is that the proposed approach based on the HT algorithm is suitable for both automatic determination of ground permittivity and automatic object detection.

7.3 Use of the Hough Transform for Detection of Hyperbolic Curves

7.3.1 Binary Imaging

HT calculation can be done simpler and faster when the original image is converted from a gray-scale picture into a binary one. The most appropriate way for this conversion is as follows:

  • The local maxima (or minima) of each signal composing the profile are displayed as black pixels in the profile image. The example of this conversion is shown in Figure 7.3 in which the signal maxima and minima are indicated with black dots.

  • Apply a threshold procedure to eliminate undesired maxima having small amplitude in order to reduce clutter in the binary image.

  • Then apply additional clutter removal operations to the resulting binary image.

  • After this conversion, the image of the local object in the profile looks like Figure 7.4a. This conversion keeps the information about the hyperbola contours.

In the case of absence of noise (after noise removal), the threshold procedure should not be necessary. At that condition, all local maxima (or minima) are displayed as black pixels, independent of their amplitude. It means that both strong and weak amplitude responses from objects have equally good visibility. Therefore, in the end, this procedure allows keeping the object-detection probability high.

7.3.2 Hough Transforming of GPR Signals

Hough transforming associates the original binary image of the profile (the so-called space of signals) with another image (the Hough space), where a set of hyperbolic curves that cross (are focused) at one point with coordinates x0,y0 (position of a local object in the Hough space) corresponds to one hyperbola in the space of signals. In other words, one pixel that is a component of the source hyperbola drawn in Figure 7.4b, shown as a dashed curve, then becomes the vertex of the hyperbola in the Hough space.

Images

FIGURE 7.3
The local maxima of a signal.

Images

FIGURE 7.4
The hyperbolic curve in the binary image of the source profile (a) and the Hough space (b).

Consider the profile in the coordinates xy in Figures 7.4a and b where x corresponds to the number of signals composing the original image and y corresponds to the number of signal samples [15]. This coordinate system makes calculations easier because computers operate faster with integer numbers. This is very important from the practical point of view. The transition between integer numbers and real numbers of time and distance during calculation is quite simple. The actual running horizontal coordinate is X = (Xp/xmax)x and the time coordinate is T = (Ts/ymax)y, where Xp is the profile length, Ts is the time observation interval, and ymax and xmax are the maximal values of conventional coordinates corresponding to Ts and Xp, respectively.

The equation of the hyperbola as an object image at the point x0,y0 in the original profile is

y(x)=εc(x-x0)2+y02(7.1)

and in the Hough space, this equation looks like [15]

y0(x0)=-εc(x-x0)2+y2,(7.2)

where x corresponds to the running coordinate of the antenna system, x0,y0 are the object coordinates, and εc is the so-called conventional value of permittivity referred to its actual value by the following formula [14,15]:

εc=4εymax2Xp2c2Ts2xmax2.(7.3)

We use the conventional permittivity because we make a transition from one coordinate system to another, which requires performing the appropriate conversion of variables.

Images

FIGURE 7.5
Typical Hough space showing (a) the hyperbolic curve in the halftone profile image, (b) its two-dimensional Hough space, and (c) three-dimensional Hough space.

In the “classical” case [8,16] for HT calculation, the Hough space should be divided by a rectangular mesh into collecting elements S(i, j) of fixed size. The number of black points in the original binary image that lie on the curve y0(x0) is calculated for every collecting element with the spatial accuracy depending on the size of the collecting element. That is to say, we plot the Hough space for the first collecting element, and then we take the next element and so on. Then the maximal values of S are calculated as a function of three variables—y0, x0, and ε. A collecting element with the highest value corresponds to three parameters defining the detected hyperbola in the original binary image. Accordingly, in general, the Hough space is three-dimensional. If we consider a specific value of permittivity and plot the values of S as a halftone image, we will deal with a two-dimensional case, but we can also plot the Hough space as a three-dimensional image. Figure 7.5 shows examples of the Hough space plotted as two-dimensional and three-dimensional images at particular permittivity.

7.3.3 Speeding Up Hough Transform Calculations

However, the standard HT requires extended computations that require constructing the Hough space for each collecting element. Because many collecting elements compose the Hough space, the analysis means considering all points in the binary image.

Some techniques were suggested for decreasing the computation time of the HT. For example, the probabilistic HT [17,18] reduces the computation time owing to the fact that a part of the points in the binary image, selected in a random manner, is used in the calculations. Actually, it leads to information loss.

The authors suggest another way to reduce the computation time using the following algorithm:

  • The Hough space should be divided into collecting elements—1 × 1 element (pixel) in size.

  • One hyperbola y0(x0) in the Hough space should be plotted for every black point of the whole original image.

  • Coordinates of each point of this hyperbola should be calculated using Equation 7.2, and the accumulator corresponding to these coordinates should be increased by 1. So, if several hyperbolas fall within one element, the accumulator grows according to the number of hyperbolas.

Thus, the Hough space is calculated and plotted only once. And at the same time, all points in the original image are taken into consideration. So, it reduces the calculation time considerably. For example, for the profile with sizes 380 × 256 pixels, the computation time of the standard HT is about 400 s. And the computation time of the HT using the above-mentioned technique takes less than 1 s on a computer with Intel Celeron 800 MHz, 256 Mb RAM. Moreover, this technique precisely determines the coordinates of hyperbola vertexes because the element size is originally 1 × 1 pixels. If necessary, the collecting elements can be increased in size later by summing their values.

7.4 Dependence of the Form of Hough Space on the Error in Permittivity Value

Consider how the Hough space of a hyperbola changes when the value of εc used in calculations, called εcalc, differs from the actual value of permittivity. The Hough space has been imaged for a test hyperbola similar to that shown in Figure 7.4a when x0 = 50, y0 = 70, and at several different values of εcalc. The actual value of εc is 12.

Figure 7.6 shows the simulation results as two-dimensional images of the Hough space. The lighter areas in the image correspond to the larger values of accumulators in collecting elements. Histograms of the accumulators in collecting elements along the axis y0, that is, vertical profiles of accumulators in collecting elements (VPACE), are also presented in Figure 7.6, on the lower line. Corresponding values of εcalc are given below images. The VPACE is a cross-section of the Hough space with the plane y0S along the straight line x0=x0, which stands perpendicular to the plane x0y0. Figure 7.7 shows how to form a VPACE.

Focusing: As shown in Figure 7.6d, focusing means the exact matching of the actual value εc and εcalc, where the VPACE contains the peak of the high amplitude at y0. When εcalc < εc, then S(y0) = 0 in the range from 0 to y0. When the depth increases, S(y0) increases rapidly at first and then decreases as shown in Figure 7.6b. The nearer εcalc is to εc, the faster S(y0) increases and decreases. When εcalc > εc, then S(y0) = 0 in the range from ymax to y0. And when the depth decreases, S(y0) increases rapidly and then decreases as shown in Figure 7.6f. The dependence of the rate of change of S(y0) on changes of εcalc is similar to the above-mentioned dependence. We can observe how when εcalc changes there are phenomena typical for the focusing.

Therefore, when a specified value of permittivity does not correspond to its actual value, then there is a defocusing in the Hough space. The defocusing pattern depends on the difference between εcalc and the actual value of εc. The most important feature is that the defocusing pattern shows a mismatch direction. If εcalc < εc, S(y0) mostly equals to zero above the point x0,y0, which corresponds to maximal S(y0) and vice versa. If εcalc > εc, S(y0) mostly equals to zero below the point x0,y0. Thus, from the defocusing pattern, it is obvious whether the εcalc is more or less than εc.

Images

FIGURE 7.6
The Hough space at different values of permittivity.

Images

FIGURE 7.7
VPACE formation.

7.5 Algorithm for Accurate Calculation of Permittivity

The algorithm for the adaptive selection of ε has been developed based on the behavior of S(εcalc). Having specified the initial value of and having constructed the VPACE also define the defocusing direction (upward or downward). Hence, it is obvious what increment of εcalc (positive or negative) must be applied. Then should be changed according to the increment and VPACE should be reanalyzed. It is necessary to repeat these steps until receiving the maximal value of S at one point and zero values of S at neighboring points. Using this approach, it is possible to find the permittivity.

Owing to the noise and clutter in real radar data, the values of the accumulator are not equal to zero in regions where they are zero in Figure 7.6. Therefore, the automatic focusing procedure with a real profile should be carried out until VPACE becomes symmetrical to the horizontal line passing via the point with a maximal value of S.

The iterative procedure has been carried out by the interval bisection technique according to the algorithm shown in Figure 7.8:

  1. The interval of values εcalc (εcalcmax,εcalcmin) is specified.

  2. HT is calculated for the whole profile, the maximal value of S is searched through the whole Hough space in the specified interval of εcalc, and the part of the profile containing this maximum is chosen for further consideration.

  3. HT is calculated for a binary image of the profile section when εcalch12(εcalcmax+εcalcmin).

  4. The VPACE containing the maximal value of S in the specified profile section is searched.

    Images

    FIGURE 7.8
    Block diagram of the algorithm for automatic determination of soil permittivity.

  5. The VPACE symmetry is estimated, and the interval εcalc(εcalcmax,εcalch) is chosen for further consideration for the case shown in Figure 7.6b. The interval εcalc(εcalch,εcalcmin) is considered for the case shown in Figure 7.6f.

  6. Steps (3) and (4) are repeated until the VPACE curve becomes symmetrical to the straight line y0=y0 with the maximal S(y0) or until the increment module of εcalc specified for the next iteration becomes smaller than a specified accuracy value.

The final value of εcalc is the “conventional” permittivity εc, which determines the actual value of ε based on Equation 7.3.

It has been determined that it is possible to obtain more precise results of ε calculation when the horizontal position (the x0 coordinate) of the VPACE containing the Hough space maximum is not fixed after the first HT calculation and when a search of global maximum and determination of its new horizontal coordinate x0 are performed after each calculation cycle (steps 3-5). Thus, the algorithm can self-adjust by knowing the true maximum of the Hough space. When the coordinate x0 is fixed after the first search and remains invariable until the end of calculations, then the defocusing type could be determined incorrectly after the analysis of the VPACE curve if the VPACE maximum horizontal coordinate is displaced relative to the true position of the hyperbola vertex. This error in the horizontal coordinate may result in specifying an incorrect εcalc increment and make the algorithm nonconvergent. Finally, it leads to an incorrect or absurd result. This especially occurs when processing a very noisy image or an asymmetric contour of the hyperbola.

Images

FIGURE 7.9
Testing of permittivity calculation algorithm.

This algorithm has been tested using several simulated and experimental GPR profiles. The results are shown in Figure 7.9. It contains gray-scale and binary images of real profiles and the binary images of synthetic data. The first two simulated images were obtained using the geometric tracing of hyperbolas as a binary image. The second two simulated images were obtained using the finite difference time domain (FDTD) software [23] for simulating the problem of diffraction of electromagnetic field pulse by a local object. Figure 7.9 shows exact values of permittivity (for the simulated data): the values determined by superposition of a synthetic hyperbola with the experimental data from the Internet and the values determined using the HT.

A conversion of the gray-scale image to the binary one is done using the 20% threshold as described in Section 7.3 (i.e., only the local maxima with amplitudes greater than 0.2M, where M is the amplitude of the global maximum of the whole profile, are displayed as black pixels) and by thinning of hyperbola contours and clutter elimination. As it is seen from Figure 7.9, the 2% error in permittivity estimation can be achieved for the geometrically generated curves. The error increases to 10% for FDTD-simulated images and to 12% for experimental data because of the presence of clutter in the images. In the case of geometrically generated curves, such an error is conditioned by quantization errors, which typically arise if a continuous image is converted into a digital one consisting of a small amount of pixels. The additional reason for error in the case of FDTD-simulated images used in simulations of bistatic antenna systems distorts the shape of local object response and making it different from hyperbolic.

7.6 Conclusions on Hough Transform Methods

The approach based on the HT provides an automatic (without any operator) and quite precise measurement of the ground permittivity using the GPR technique. It is enough to find a region containing a local radar-contrast object and to specify the range of possible values of permittivity to calculate its exact value.

The algorithm is applicable for automatic GPR data interpretation software, which minimizes the influence of the human factor on data processing. In turn, the data-processing technique for automatic interpretation of GPR results stimulates the development of systems for computerized control and monitoring of ground conditions. After corresponding modification, the proposed algorithm allows automatic and precise search of local objects in the ground.

7.7 Numerical Estimation of the Performance of the Automatic Object-Detection Method

The basic approach remains the same as described for the case of ground permittivity measurement. In the process of GPR-image analysis with HT technique, we obtain coordinates of the maximum of collecting elements as well. It was shown that these coordinates correspond to the objects’ coordinates. Thus, the described algorithm provides both automatic measurement of ground permittivity and automatic calculation of coordinates simultaneously.

Simulated and experimental data tested this method. Section 7.8 shows the relation between the object detection probability, the false alarm probability, and the accuracy of determination of the objects’ coordinates. These metrics allow for evaluating the performance of the automatic interpretation method of GPR images.

7.8 Metrics of Object Detection Method

Sometimes object detection in a radar image cannot be done unambiguously using only one technique. Object discrimination and recognition requires information obtained from different sensors or using various methods. For example, different equipments such as metal detectors, radars, infrared and ultrasound sensors, etc. are used for mine detection in the demining process [19]. Owing to this fact, there is an ensemble of criteria and values for estimating the performance of a method or a system for object classification (a classifier).

When we deal with a so-called binary classifier, which divides a set of detected targets into two classes that include really existing objects (the positive instances) and false alarms (the negative instances), the appointed ensemble of metrics [20] is used for performance measurement.

On the basis of the classification results and of the actual class membership of the objects, the contingency table can be constructed. For the demining problem [21], the contingency table is shown in Table 7.1 and the relative metrics are shown in Table 7.2, but not the absolute values (TP, TN, etc.) used in the data analysis.

The problem that has to be solved while searching for objects is to determine the coordinates of the object and to estimate the errors in coordinate determination. For example, in demining problems [22], if an object has been found within a distance Rhalo from the real location of the mine, then it is considered that the mine has been detected and the error estimation is not performed, otherwise a false alarm takes place. Nevertheless, one may need to estimate the accuracy of determination of the coordinates of a subsurface object in some situations.

TABLE 7.1
Contingency Table as Applied to the Demining Problem

Buried Mine
Detected? Exists Does Not Exist
Yes Correct detection (true positive) False alarm (false positive)
No Missed target (false negative) Correct nondetection (true negative)
Total P N

TABLE 7.2
Metrics for Estimation of Classifier Performance

Parameter Formula
True positive rate TPR=TPP100%
False positive rate FPR=FPN100%

Images

FIGURE 7.10
GPR images simulated with (a) FDTD software and (b) Hyperbola tracing.

Correct error estimation can be achieved only when the true object coordinates and true number of objects are known. So the first choice is to simulate the necessary profiles using the FDTD software for solving the problem of diffraction of a pulse by a local object [23]. In addition, we can simply simulate such images with hyperbolic curves using geometric tracing.

The GPR image simulated with FDTD software is shown in Figure 7.10a. It contains reflections from eight metal cylinders located in homogeneous soil. The parameters of the image are as follows: length l = 10 m, time observation interval t = 35 ns, and relative soil permittivity ε = 10. Figure 7.10b shows an example binary GPR image containing 10 hyperbolas obtained by the geometric tracing. Parameters of the profile are as follows: l = 20 m, t = 50 ns, and ε = 10.

7.9 Object Detection in Simulated GPR Images

Let us estimate the probability of accurate detection of the local objects in the binary image according to the above-mentioned criteria of estimation of classifier performance. The term “classifier” means the method of choosing the peaks from the HT space that correspond to the objects really presented in the image. Receiver operating characteristics (ROC) curves are usually used as a means for visualizing and analyzing the classifier performance [20] in machine learning, data mining, medical diagnostics, and also in humanitarian mine clearing. The ROC curve is a two-dimensional graph showing the dependence of correctly classified positive instances (true positive response [TPR]) on incorrectly classified negative instances (false positive response [FPR]).

Let us plot the ROC curves from the results of object detection in the simulated GPR profiles. As the classification result, some classifiers provide a probability or a score, that is, a value representing the membership of an instance to a definite class. As applied to the considered problem, we can use the relative amplitudes h of the peaks in the HT space, which is a ratio of height of the appropriate peak A to the height of the highest peak in the whole Hough space Amax, as such scores: h = A/Amax.

The functioning of the classifier is based on automatic determination of hyperbola vertices described in [15]. It consists in the following:

  • Calculating HT for the initial binary image.

  • Selecting peaks from the Hough space using the following criterion: the peak’s height must exceed the heights of the eight surrounding elements in the Hough space.

  • The selected peaks are sorted descending their amplitudes, and the ROC curve is plotted according to [20].

Figure 7.11 shows the binary profile, the three-dimensional image of HT space, and the ROC curve of Figure 7.10a. The vertical axis in Figure 7.11b represents the values of the Hough space elements.

Table 7.3 contains the list of detected vertices of hyperbolas with their coordinates and the relative amplitudes of peaks corresponding to these vertices in the HT space of the image presented in Figure 7.11a. The objects that are actually present in the image are marked with bold font (here and so on).

Processing the image in Figure 7.9a reveals 15 objects. It follows from Table 7.3 that no false object will be found if the separation threshold goes in the range of h from 0.319 to 0.863, and TPR = 100% while the false alarm probability is equal to zero. If the threshold is less than 0.318, the peaks with heights less than this value will be classified as the actually present objects; at the same time, TPR will remain equal to 100% but false alarms will take place. So, all the peaks of the Hough space corresponding to the test hyperbolas have been positively classified. This fact points at the possibility to detect all objects without false alarms, if we choose the right threshold for class separation.

Consider the results of hyperbola detection (Table 7.4) as applied to the GPR image obtained with FDTD simulation shown in Figure 7.12a. Eleven peaks have been classified as hyperbolas (being false positive instances) in addition to the eight real objects. It is obvious from the results presented in Table 7.3 that TPR = 100% cannot be achieved when FPR = 0, but it is achievable if FPR = 58.3% at the threshold value of 0.5. Thus, it is necessary to increase the threshold in order to decrease the number of false alarms in the presence of a clutter in a binary image (the clutter shows contours and lines that do not belong to hyperbolas); however, it will lead to a decreased TPR.

Images

FIGURE 7.11
The results of processing of the simulated image No. 1: (a) Binary image of hyperbolas with the marks of objects found, (b) three-dimensional image of the Hough space, and (c) ROC curve.

TABLE 7.3
Object Detection Results for Figure 7.11a

Images

TABLE 7.4
Object Detection Results for Figure 7.12a

Images

So, in the first example, the classifier has marked all true positive instances as positive ones correctly, though several false alarms appeared. In the second example, some problems with the classification occurred due to the presence of a clutter and due to nonideal shape of the hyperbolic curves.

Consider a coordinate system associated with pixels of image. Comparison between coordinates of the detected peaks and coordinates of the hyperbola vertices shows the following:

  • The x coordinates of all vertices in the first example have been determined with zero error. So, there is a theoretical possibility of determining the horizontal coordinates of the object precisely.

  • Absolute error in the determination of the y coordinate of the hyperbola vertices did not exceed three pixels (Δd = 0.28 m according to the parameters of the GPR profile).

7.10 Object Detection in Experimental GPR Images

Consider the classification of the objects in the experimental GPR images. Unfortunately, hyperbolic curves of ideal shape cannot be obtained during the GPR survey for reasons such as the inhomogeneity of the soil structure, the variability of relative permittivity, the roughness of ground surface, the bistatic antenna system of GPR that leads to distortion of the hyperbolic shape of response for objects of shallow depth [24], etc. Moreover, because of interference produced by several closely located subsurface objects, even an experienced GPR operator has difficulty interpreting such an image. So automatic processing of such GPR images is accompanied by detection of more false objects than in simulated images.

Images

FIGURE 7.12
Processing of the simulated image No. 2: (a) Initial halftone image, (b) binary image with the marks of the objects found, and (c) ROC curve.

Two examples shown in Figures 7.13 and 7.14 have been taken from Internet. They were processed with the discussed algorithm. Binary images have been obtained by mapping the maxima of each signal composing the profile after the preprocessing of the halftone image. The classifier has selected only the peaks with the relative amplitude h ≥ 0.5.

Example 1 (Figure 7.13): Five objects at different depths, that is, two pipes situated side by side (1, 2), the cable (3), the plastic pipe (4), and the metal pipe (5) are considered [25]. Table 7.5 shows the object detection results for Figure 7.13. The peaks corresponding to the hyperbolas sometimes have less height than the peaks that are formed by other points of the image owing to clutter in the binary image. Moreover, since the amplitude of reflected pulses from the buried objects has a specific form (e.g., Figure 7.3), one object is represented by several peaks in the reflected pulse and therefore by several hyperbolas in a binary image. However, only the upper hyperbola corresponds to the first maximum (or minimum) of the pulse reflected by the object and to the true location of the object.

Images

FIGURE 7.13
Processing of the first experimental GPR image: (a) Initial halftone image, (b) binary image with the marks of the objects found, and (c) ROC curve. (Based on data from GSSI, Inc. by Golovko, M., “The evaluation of performances of automatic method for the object detection in GPR images,” Proceedings of the 5th International Symposium on Image and Signal Processing and Analysis, © 2007, IEEE.)

So, if there are several hyperbolas located one under another, it has been assumed that the upper hyperbola will be the true positive case. At the object No. 6 is the false alarm. The object No. 10 that is situated higher than the object No. 6 is the correct detection despite the fact that it has less relative amplitude than No. 6.

The ROC curve and Table 7.5 show that if the separation threshold is equal to 0.54, then all objects will be detected (TPR =100 %) and that the false alarm probability will be equal to 91.6%, whereas if the threshold is equal to 0.668, only 60% of all objects (three from five) will be detected with FPR = 0.

Example 2 (Figure 7.14): Five underground fuel storage tanks located at the same depth (the objects 1-5). Unlike the previous example, some objects correspond only to one clearly visible hyperbola in the binary image. There is no ambiguity regarding which peak conforms to each of the objects in the Hough space. One can see that only two peaks do not conform to the real objects among the first six peaks listed in Table 7.6. If the threshold equals 0.59, the detection probability will be 100% and the false alarm probability will be equal to 33.3%, which is less than that in the previous example.

Images

FIGURE 7.14
Processing of the second experimental GPR image: (a) Initial halftone image, (b) binary image with the marks of the objects found, and (c) ROC curve. (Golovko, M., “The evaluation of performances of automatic method for the object detection in GPR images,” Proceedings of the 5th International Symposium on Image and Signal Processing and Analysis, © 2007, IEEE.)

TABLE 7.5
Object Detection Results for Figure 7.13a

Images

TABLE 7.6
Object Detection Results for Figure 7.14a

Images

7.11 Conclusion

The examples of simulated and experimental GPR images show the possibility of automatically detecting subsurface objects in a GPR image and finding their coordinates accurately. The method developed based on the HT allows this. It has been demonstrated that 100% object detection probability is achievable, and at the same time, the false alarm probability is minimal. It means that optimal classification with relation to the balance between TPR and FPR is possible. Further, it is necessary to optimize the criteria for choosing the optimal threshold for separating the peaks in the Hough space. It requires more complete statistical data and enough experimental GPR images.

References

1. Lunt, I.A., Hubbard, S.S. and Rubin, Y. Soil moisture content estimation using ground-penetrating radar reflection data. J. Hydrol, Vol 307, pp 254-2269, 2005.

2. Huisman, J.A., Hubbard, S.S., Redman, J.D. and Annan, A.P. Measuring soil water content with ground penetrating radar: A review. Vadose Zone J., Vol 2, pp 476-4491, 2003.

3. Finkelshtein, M.I., Karpukhin, V.I., Kutiev, V.A. and Metelkin, V.N. Subsurface Radiolocation. Radio and Sviaz, Moscow, Russia, 1994.

4. Daniels, D.J. Ground Penetrating Radar. 2nd ed., Inspec/IEE, London, UK, 2004.

5. Gentili, G.G. and Spagnolini, U. Electromagnetic inversion in monostatic ground penetrating radar: TEM horn calibration and application. IEEE Trans. Geosci. Rem. Sens., Vol 38, No 4, pp 1936-11946, 2000.

6. Lambot, S.S., van den Bosch, E.C.I., Stockbroeckx, B. and Vanclooster, M. Modeling of ground-penetrating radar for accurate characterization of subsurface electric properties. IEEE Trans. Geosci. Rem. Sens., Vol 42, No 11, pp 2555-22568, 2004.

7. Ruthenberg, I.A. Curve Fitting and Migration of GPR Data for the Detection of Pipes and Cables. B. Sc. Thesis, Department of Computer Science and Electrical Engineering. The University Of Queensland, Australia, 1998.

8. Ballard, D.H. Generalizing the Hough transform to detect arbitrary shapes. Patt. Recog., Vol 13, No 2, pp 111-1122, 1981.

9. Labunets, V.G. and Chernina, S.D. Theory and application of the Hough transform. Foreign Radioelectronics, Vol 10, pp 48-456, 1987 (in Russian).

10. Kaneko, T. Radar image processing for locating underground linear objects. IEICE Trans., Vol E74, No 10, pp 3452-33458, 1991.

11. Al-Nuaimy, W., Huang, Y., Nakhkash, M., Fang, M.T.C., Nguyen, V.T. and Eriksen, A. Automatic detection of buried utilities and solid objects with GPR using neural networks and pattern recognition. J. Appl. Geophys., Vol 43, pp 157-1165, 2000.

12. Okada, M., Kaneko, T. and Miura, K.T.. Underground pipe signal extraction using LoG filter from pulse radar images. IEICE Trans., Vol E83-D, No 1, pp 112-1115, 2000.

13. Capineri, L., Grande, P. and Temple, J.A.G.. Advanced image-processing technique for real-time interpretation of ground-penetrating radar images. Int. J. Imag. Syst. Tech., Vol 9, pp 51-559, 1998.

14. Golovko, M.M. The automatic determination of soil permittivity using the response from a subsurface local object. In Ultrawideband and Ultrashort Impulse Signals, Proc. 2nd Intern. Conf., UWBUSIS-2004, Sevastopol, Ukraine, September 19-22, 2004, pp 248-2250.

15. Golovko, M.M. and Pochanin, G.P.. Application of the Hough transform for automatic detection of objects in georadar profiles. Electromag. Waves Electron. Syst., Vol 9, No 9-10, pp 22-230, 2004.

16. Fu, K.S., Gonzalez, R.C. and Lee, C.S.G. Robotics: Control, Sensing, Vision and Intelligence. New York, McGraw-Hill, Inc., 1987.

17. Kiryati, N., Eldar, Y. and Bruckstein, A.M.. A probabilistic Hough transform, Patt. Recog., Vol 24, No 4, pp 303-3316, 1991.

18. Matas, J., Galambos, C. and Kittler, J. Progressive probabilistic Hough transform. In Proc. British Mach. Vision Conf. 1998 (BMVC 1998), Southampton, UK, 1998, pp 256-2265.

19. Gooneratne, C.P. Mukhopahyay, S.C. and Sen Gupta, G. A Review of sensing technologies for landmine detection: Unmanned vehicle based approach. Proc. 2nd Int. Conf. Autonom. Robots Agents, Palmerston North, New Zealand, December 13-15, 2004, pp 401-4407.

20. Fawcett, T. An introduction to ROC analysis. Patt. Recog. Lett. Vol 27, pp 861-8874, 2006.

21. Gelenbe, E. and Kocak, T. Area-based results for mine detection. IEEE Trans. Geosci. Rem. Sens., Vol 38, No 1, pp 12-124, January 2000.

22. Ayers, E., Rosen, E., Rotondo, F.S. and Reichman, J. Results of the Humanitarian Demining Sensors Field Test, November 2002. Institute for Defense Analyses, Science and Technology Division, Alexandria, VA, May 2005.

23. Varyanitza-Roshchupkina, L.A. Software for image simulation in ground penetrating radar problems. In Ultrawideband and Ultrashort Impulse Signals, Proc. 3rd Intern. Conf., UWBUSIS-2006, Sevastopol, Ukraine, September 18-22, 2006, pp 112-1115.

24. Kopylov, Y.A. and Orlenko, A.A.. Peculiarity of the subsurface local object coordinates determination with bistatic radar. Vestnik KhNU, Vol 544, No 1, Radiophys. Electronics, pp 206-2211, 2002.

25. Golovko, M. The evaluation of performances of automatic method for the object detection in GPR images. Proc. 5th Int. Symp. Image Signal Proc. Anal., Istanbul, Turkey, September 27-229, 2007, pp 476-4481.

..................Content has been hidden....................

You can't read the all page of ebook, please click here login for view all page.
Reset