TARGET DETECTION METHOD FOR GROUND-PENETRATING RADAR AND ASSOCIATED RADAR

Abstract

A method for detecting at least one target buried in an area of the ground, using a ground-penetrating radar, the method includes the steps of: acquiring a measurement of a signal transmitted by each transmitting antenna and reflected in the area of the ground, converting an estimate, into the frequency domain, of the propagation channel for each pair consisting of a transmitting antenna and of a receiving antenna, defining a first hypothesis H0 corresponding to an absence of target in the area of the ground, defining a second hypothesis H1 corresponding to the presence of at least one target in the area of the ground, performing a test of the likelihood ratio between the likelihood of the channel matrix under the second hypothesis H1 and the likelihood of the channel matrix under the first hypothesis H0, in order to conclude whether a target is present at a given position in the area of the ground.

Claims

1. A method for detecting at least one target buried in an area of the ground, using a ground-penetrating radar, the radar comprising at least one transmitting antenna and at least one receiving antenna, the method comprising the steps of: acquiring, on each receiving antenna, a measurement of a signal transmitted by each transmitting antenna and reflected in the area of the ground, determining, on the basis of said measurements, an estimate, in the frequency domain, of the propagation channel for each pair consisting of a transmitting antenna and of a receiving antenna, said estimates being grouped together in a channel matrix having a first dimension which is equal to the number of receiving antennas, a second dimension which is equal to the number of transmitting antennas and a third dimension which is equal to the number of frequencies, defining a first hypothesis H0 corresponding to an absence of target in the area of the ground, the channel matrix under this first hypothesis being modeled by noise, defining a second hypothesis H1 corresponding to the presence of at least one target in the area of the ground, the channel matrix under this second hypothesis being modeled by a propagation channel model depending at least on the characteristics of the transmitting antennas and of the receiving antennas and on the signal propagation losses in the ground, performing a test of the likelihood ratio between the likelihood of the channel matrix under the second hypothesis H1 and the likelihood of the channel matrix under the first hypothesis H0, in order to conclude whether a target is present at a given position in the area of the ground.

2. The detection method as claimed in claim 1, wherein the step of performing a test of the likelihood ratio between the first hypothesis H0 and the second hypothesis H1 comprises the sub-steps of: determining at least one estimator of the maximum likelihood of the position and of the radar cross section of a target, under the second hypothesis H1, determining the likelihood of the channel matrix under the second hypothesis H1 for each estimator, determining the likelihood of the channel matrix under the first hypothesis H0, comparing the ratio between the two likelihoods with a predetermined detection threshold in order to deduce therefrom the presence or the absence of a target for each estimated position.

3. The detection method as claimed in claim 2, wherein the step of determining at least one estimator of the maximum likelihood of the position and of the radar cross section of a target, under the second hypothesis H1, is performed by searching for at least one extremum of a function of three variables depending on the position of a target in the area of the ground, on the radar cross section of a target and on a coefficient of signal transmission losses in the area of the ground.

4. The detection method as claimed in claim 3, wherein the search for at least one extremum of said function of three variables is performed by: determining an estimator of the maximum likelihood of the radar cross section by calculating a normalized correlation between the channel matrix and a loss matrix including the transfer functions of the transmitting and receiving antennas, the signal propagation losses in free space and in the area of the ground, searching for at least one extremum according to the position and the loss coefficient of said function evaluated for the estimated radar cross section.

5. The detection method as claimed in claim 4, wherein the likelihood of the channel matrix under the second hypothesis H1 is determined by an extremum of said function.

6. The detection method as claimed in claim 2, wherein the likelihood of the channel matrix under the first hypothesis H0 is determined at least by calculating the energy of the channel matrix.

7. The detection method as claimed in claim 1, wherein a target position is searched for in a two- or three-dimensional grid (G1, G2) having a defined initial pitch, the method being iterated over several iterations, reducing the area and the initial pitch in each iteration.

8. The detection method as claimed in claim 1, comprising the steps of: converting the propagation channel estimates for each pair consisting of a transmitting antenna and of a receiving antenna, into the time domain, applying a filter to the estimates in the form of time windowing, converting the filtered estimates into the frequency domain, grouping together the filtered estimates in a channel matrix.

9. The detection method as claimed in claim 8, wherein the time windowing is defined so as to filter the contributions of the signals corresponding to a distance interval between the radar and the area of the ground.

10. The detection method as claimed in claim 9, the method being repeated for several different filters so as to cover the entire area of the ground.

11. The detection method as claimed in claim 1, further comprising a step of canceling the contribution of a target detected in the measurements of acquired signals, for example by means of an echo cancellation algorithm, the method being iterated over several successive iterations, canceling in each new iteration the echo of the target detected in the previous iteration.

12. A ground-penetrating radar comprising at least one transmitting antenna and at least one receiving antenna and a device for detecting at least one target buried in an area of the ground configured to execute the steps of the detection method as claimed in claim 1.

13. A computer program comprising instructions for executing the method as claimed in claim 1, when the program is executed by a processor.

14. A processor-readable storage medium, on which a program is stored comprising instructions for executing the method as claimed in claim 1, when the program is executed by a processor.

Description

[0039] Other features and advantages of the present invention will become more apparent on reading the description which follows in relation to the following appended drawings:

[0040] FIG. 1 shows an illustrative diagram of the operation of a ground-penetrating radar,

[0041] FIG. 2 shows a general flowchart describing the steps of a target detection method according to one embodiment of the invention,

[0042] FIG. 3 shows a flowchart describing one embodiment of the target detection step of the method according to the invention,

[0043] FIG. 4 shows an illustrative diagram of an example of iterative operation of the invention,

[0044] FIG. 5 shows a flowchart describing the steps of one variant embodiment of the method according to the invention,

[0045] FIG. 6 shows a diagram of a time response of a propagation channel in order to illustrate one variant embodiment of the invention,

[0046] FIG. 7 shows a flowchart describing the steps of another variant embodiment of the method according to the invention,

[0047] FIG. 8 shows a diagram of an example of a ground-penetrating radar which is able to execute the invention.

[0048] FIG. 1 shows a simplified diagram of the operating principle of a ground-penetrating radar RDR. Such a radar comprises one or more transmitting antennas and one or more receiving antennas. In the example of FIG. 1, the radar comprises five transmitting antennas and four receiving antennas. Without departing from the scope of the invention, the number of transmitting and receiving antennas may take any non-zero integer value.

[0049] An area of the ground broken down into a grid G is analyzed by the georadar RDR by carrying out a sequence of signal acquisitions and transmissions for each pair consisting of a transmitting antenna and of a receiving antenna. For example, an acquisition sequence consists in transmitting a radar signal from the first transmitting antenna Tx1, this signal is reflected on a possible target P located in the area G then back-propagated towards each receiving antenna Rx1, Rx2, Rx3, Rx4. This sequence is repeated for each transmitting antenna Tx2, Tx3, Tx4, Tx5.

[0050] The target search area may be a two- or three-dimensional area.

[0051] The radar may be mobile, for example on board a vehicle, in order to cover various areas of the ground.

[0052] The invention is implemented by a radar of the type in FIG. 1.

[0053] FIG. 2 illustrates the main steps of the target detection method according to the invention.

[0054] The first step 201 consists in acquiring the signals during a transmitting-receiving sequence as described above.

[0055] The acquisition sequence performs a frequency sweep according to a predefined set of frequencies. In other words, the transmitting-receiving sequences on all of the antennas are repeated for several frequencies defining a frequency band to be analyzed.

[0056] The acquisition sequence may follow the transmission as described above but may also be performed by simultaneously transmitting several orthogonal signals on all the transmitting antennas so as to simultaneously directly acquire the various echoes of each transmitting antenna for a given frequency.

[0057] In addition, successive frequency sweeps may be replaced by using a waveform of the OFDM (Orthogonal Frequency-Division Multiplexing) type which makes it possible to encode, in transmission, the signals by distribution on orthogonal frequency channels in the form of multiple subcarriers. The width of the channels or sub-bands and their spacing may be parameterized. These parameters may vary for each sub-band according to the signal-to-noise ratio which is specific to this sub-band.

[0058] On the basis of the signals received, a channel matrix estimation step 202 is performed. Signal acquisition is triggered at the same time as transmission. After acquisition, the signals are transposed to baseband, then demodulated via OFDM demodulation.

[0059] After OFDM demodulation, channel estimation is performed on each subcarrier, for example by correlating the symbols received with the known symbols transmitted on this subcarrier.

[0060] Channel estimation is performed over several OFDM symbols by coherently averaging the result in order to reduce the impact of thermal noise or interference.

[0061] Channel estimation is performed for each propagation channel defined by a link between a transmitting antenna Txi and a receiving antenna Rxj, but also for each frequency sub-band.

[0062] The complete frequency response is obtained by concatenating the responses of each sub-band.

[0063] Thus, at the end of the step 202, a set of channel matrices H.sub.r(f) is obtained, for several frequencies, each matrix having a dimension which is equal to the number of receiving antennas by the number of transmitting antennas.

[0064] The expression of the channel matrix estimated in reception may be written as a function of frequency by means of the following relationship:

[00001]$\begin{array}{cc}{H}_r\left(f\right)={\displaystyle \underset{k=0}{\overset{K-1}{.Math.}}H\left(f,p_k\right)+n\left(f\right)}& \text{­­­(1)}\end{array}$

[0065] H(f,p.sub.k) is the noise-free channel matrix for the frequency f and a target located at position p.sub.k = {x.sub.k, y.sub.k, z.sub.k}. K is the number of targets for which an echo is received. n(f) denotes the noise matrix for the frequency f.

[0066] The invention is notably based on a particular modeling of the channel matrix as detailed below, which takes into account the dielectric losses in the medium of which the ground consists.

[0067] The noise-free channel matrix H(f,p.sub.k) may be expressed using the following relationship, where ⊙ is the term-by-term multiplication operator between two matrices.

[00002]$\begin{array}{cc}H\left(f,p_k\right)=A\left(f,p_k,L\right)\odot U\left(f,p_k,L\right)& \text{­­­(2)}\end{array}$

[0068] U(f, p.sub.k, L) is the matrix of the propagation delays the elements (i,j) of which are expressed using the following relationship:

[00003]$\begin{array}{cc}U\left[i,j\right]\left(f,p_k,L\right)=e^{\sqrt{-1}\ast 2\pi \frac{f}{v\sqrt{2}}d\left(p_k^{i,j}\right)\sqrt{\sqrt{1+L^2}+1}}& \text{­­­(3)}\end{array}$

[00004]$\sqrt{-1}$

denotes the imaginary unit.

[0069] v is the propagation speed of the wave in the medium through which the wave which is assumed to be homogeneous passes. According to the positioning of the radar, the medium passed through consists partly of air and of the layers of the ground, or only of the layers of the ground if the transmitting antennas are positioned directly against the surface of the ground.

[00005]$d\left(p_k^{i,j}\right)$

is the sum of the respective distances between the transmitting antenna of index i and the target in position p.sub.k, on the one hand, and this target and the receiving antenna of index j, on the other hand.

[0070] L is a loss coefficient which depends on the medium through which the wave passes. According to the medium (earth, sand, rock) which the ground consists of, the transmitted wave undergoes more or less significant attenuations which should be taken into account in order to model the channel matrix correctly.

[0071] The matrix A(f, p.sub.k, L) represents the matrix of the amplitudes of the echoes reflected on the target. This matrix incorporates the losses in the medium, the antenna gains and the radar cross section of the target.

[0072] This matrix is expressed using the following relationship:

[00006]$\begin{array}{cc}A\left(f,p_k,L\right)=\gamma \left(f,p_k\right)\odot G_t\left(f,p_k\right)\odot G_r\left(f,p_k\right)\odot B_0\left(f,p_k\right)\odot B_1\left(f,p_k,L\right)& \text{­­­(4)}\end{array}$

[0073] γ(f,p.sub.k) models the radar cross section of the target at the position p.sub.k.

[0074] G.sub.t(f,p.sub.k) models the transmitting antenna pattern in the direction of the position of the target.

[0075] G.sub.r(f,p.sub.k) models the receiving antenna pattern in the direction of the position of the target.

[0076] The two matrices G.sub.t(f,p.sub.k) and G.sub.r(f,p.sub.k) are known and are determined on the basis of the characteristics of the antennas.

[0077] B.sub.0(f,p.sub.k) and B.sub.1(f,p.sub.k,L) are two matrices which together model the propagation losses of spherical waves in the ground.

[00007]$\begin{array}{cc}{B}_0\left[i,j\right]\left(f,p_k\right)=\frac{v}{4\pi \sqrt{4\pi }f{d}_{\text{Π}}\left(p_k^{i,j}\right)}& \text{­­­(5)}\end{array}$

[00008]$d_{\text{Π}}\left(p_k^{i,j}\right)$

is the product of the respective distances between the transmitting antenna of index i and the target in position p.sub.k, on the one hand, and this target and the receiving antenna of index j, on the other hand.

[00009]$\begin{array}{cc}{B}_1\left[i,j\right]\left(f,p_k,L\right)=e^{2\pi \frac{f}{v\sqrt{2}}d\left(p_k^{i,j}\right)\sqrt{\sqrt{1+L^2}-1}}& \text{­­­(6)}\end{array}$

[0078] The invention differs notably from the methods of the prior art by taking into account the loss coefficient L in the medium of the ground.

[0079] One objective of the method for detection by radar processing, according to the invention, is to determine the position of a target, having knowledge of the frequency response of the monitored zone.

[0080] Thus, the third step 203 of the method according to the invention consists in performing a target detection test on the basis of the modeling of the propagation channel introduced above, of the channel matrices determined in the step 202 and by considering a detection problem with two hypotheses H.sub.0 and H.sub.1. H.sub.0 corresponds to a target absence hypothesis and H.sub.1 corresponds to a target presence hypothesis.

[0081] The channel matrix may be expressed under the two hypotheses using the following relationships:

[00010]$\begin{array}{cc}{H}_0:H\left(f,p_k\right)=n\left(f\right)& \text{­­­(7)}\end{array}$

[00011]$\begin{array}{cc}{H}_1:H\left(f,p_k\right)=A\left(f,p_k,L\right)\odot U\left(f,p_k,L\right)+n\left(f\right)& \text{­­­(8)}\end{array}$

[0082] Under the hypothesis of uncorrelated white noise, the log likelihood ratios of the channel matrix under each of the two hypotheses may be expressed via the following relationships:

[00012]$\begin{array}{cc}logPr\left(H_r\left|H_0\right)\right)\propto -{\displaystyle {.Math.}_f{\left|H_r\left(f\right)\right|}^2}& \text{­­­(9)}\end{array}$

[00013]$\begin{array}{cc}logPr\left(H_r\left|H_1\right)\right)\propto -{\displaystyle \underset{f}{.Math.}{\left|H_r\left(f\right)-A\left(f,p_k,L\right)\odot U\left(f,p_k,L\right)\right|}^2}& \text{­­­(10)}\end{array}$

[0083] Pr(H.sub.r |H.sub.0) denotes the probability that the received channel matrix corresponds to the hypothesis H.sub.0.

[0084] Pr(H.sub.r|H.sub.1) denotes the probability that the received channel matrix corresponds to the hypothesis H.sub.1.

[0085] The sign ∝ means “proportional to”.

[0086] The Neyman-Pearson criterion is used, which was developed in order to maximize the probability of detection while ensuring a given probability of a false alarm. This criterion consists in comparing the likelihood ratio of the channel matrices, under each of the hypotheses, with a predetermined threshold λ. This is an LRT (Likelihood-Ratio Test).

[0087] A target is detected when the following relationship holds:

[00014]$\begin{array}{cc}logPr\left(H_r\left|H_0\right)\right)-logPr\left(H_r\left|H_1\right)\right)\le \lambda & \text{­­­(11)}\end{array}$

[0088] The relationship (11) is also written in the form:

[00015]$\begin{array}{cc}-{\displaystyle \underset{f}{.Math.}{\left|H_r\left(f\right)\right|}^2+{\displaystyle \underset{f}{.Math.}{\left|H_r\left(f\right)-A\left(f,p_k,L\right)\odot U\left(f,p_k,L\right)\right|}^2\le \lambda }}& \text{­­­(12)}\end{array}$

[0089] In practice, the matrices A and U are unknown and the log likelihood ratio for the hypothesis H.sub.1 cannot be calculated directly.

[0090] Thus, it is proposed to use a GLRT (Generalized Likelihood-Ratio Test) consisting in injecting, into the LRT defined by equation (12), estimation of the unknown parameters of the likelihood ratio for the hypothesis H.sub.1 in the sense of the maximum likelihood.

[0091] The test defined in equation (11) then becomes:

[00016]$\begin{array}{cc}logPr\left(H_r\left|H_0\right)\right)-\underset{A,U}{\max }logPr\left(H_r\left|H_1\right)\right)\le \lambda & \text{­­­(13)}\end{array}$

[0092] FIG. 3 details the steps required to perform the detection test 203.

[0093] The first step 301 consists in estimating the unknown parameters, that is to say the position of the target and its radar cross section, as well as the loss coefficient L, in the sense of the maximum likelihood.

[0094] In the absence of knowledge of the exact position of the target, the observation space or area is discretized in the form of a grid G with a predefined pitch (see FIG. 1). A detection is declared for any cell in the grid confirming the test under the hypothesis H.sub.1.

[0095] The estimator of the maximum likelihood of the parameters y and p is obtained by searching for the minimum of the following function:

[00017]$\begin{array}{cc}\underset{\gamma ,p}{\min }{\displaystyle \underset{f}{.Math.}{\left|H_r\left(f\right)-A\left(f,p_k,L\right)\odot U\left(f,p_k,L\right)\right|}^2}& \text{­­­(14)}\end{array}$

[0096] Indeed, minimizing the function given by relationship (14) is equivalent to maximizing the log likelihood ratio logPr(H.sub.r|H.sub.1) (as defined in equation (13)).

[0097] By developing relationship (14) on the basis of the model of the matrices A and U (relationships (3) and (4)), the step 301 consists in searching for the minimum of a function g(y, p.sub.k, L, f), the function g being defined on the basis of relationship (14).

[00018]$\begin{array}{cc}\begin{array}{c}g\left(\gamma ,p_k,L,f\right)=\\ {\displaystyle \underset{f}{.Math.}\left({\left|\gamma \left(f\right)\right|}^{2}Tr\left(M\left(f,p_k,L\right)M{\left(f,p_k,L\right)}^H\right)-\gamma \left(f\right)*Tr\left(H_r\left(f\right)M{\left(f,p_k,L\right)}^H\right)\right)}\\ +\gamma \left(f\right)Tr\left(M\left(f,p_k,L\right)H_r{\left(f\right)}^H\right)\end{array}& \text{­­­(15)}\end{array}$

[00019]$\begin{array}{cc}\begin{array}{l}M\left(f,p_k,L\right)=\\ G_t\left(f,p_k\right)\odot G_r\left(f,p_k\right)\odot B_0\left(f,p_k\right)\odot B_1\left(f,p_k,L\right)\odot U\left(f,p_k,L\right)\end{array}& \text{­­­(16)}\end{array}$

[0098] The function g may exhibit several local minima in the space defined by the three parameters (γ, p.sub.k, L).

[0099] A first variant of the invention consists in searching for several local minima (for example the N dominant minima, with N a predefined integer) which will each correspond to a potential target.

[0100] Another variant of the invention consists in being limited to searching for a single local minimum (the largest), the method described in FIGS. 2 and 3 being applied to search for a single target.

[0101] The search for one or more local minima may be performed by an optimization function at the disposal of a person skilled in the art, for example one of the numerical solution functions described in one of references [7], [8] and [9].

[0102] Another solution, which is less costly in terms of operations, consists in carrying out this search in several stages.

[0103] First, the function g is differentiated with respect to the variable y(f), searching for the value of y(f) which is the solution of the following equation:

[00020]$\begin{array}{cc}\frac{\partial g\left(\gamma ,p_k,L,f\right)}{\partial \gamma \left(f\right)}=0& \text{­­­(17)}\end{array}$

[0104] One solution of equation (17) is given by:

[00021]$\begin{array}{cc}\gamma \left(f\right)={\displaystyle \underset{f}{.Math.}\frac{Tr\left(H_r\left(f\right)M{\left(f,p_k,L\right)}^H\right)}{Tr\left(M\left(f,p_k,L\right)M{\left(f,p_k,L\right)}^H\right)}}& \text{­­­(18)}\end{array}$

[0105] Thus an estimate of the radar cross section may be calculated from relationship (18) by performing a normalized correlation between the channel matrix received and the matrix M defined by equation (16).

[0106] The estimate of y(f) is calculated using relationship (18) for a set of hypotheses about the position p.sub.k and loss coefficient L.

[0107] For example, the positions p.sub.k vary over all of the positions in the grid G which is superimposed on the area to be analyzed. These positions may be defined in two or in three dimensions.

[0108] Likewise, the values of the coefficient L may be chosen from several hypotheses, taking into account the a priori knowledge of the composition of the ground.

[0109] Then, for each estimate of

[00022]$\widehat{\gamma }\left(f\right)$

calculated, the value of

[00023]$g\left(\widehat{\gamma }\left(f\right)\right)$

is determined.

[0110] Then the minimum value of

[00024]$g\left(\widehat{\gamma }\left(f\right)\right)$

among those calculated with the corresponding estimates of p.sub.k and L is retained.

[0111] The step 301 may be refined by successive iterations by redefining, in each iteration, a new grid G2 with a finer pitch around the estimate of the position p.sub.k obtained in the previous iteration, as shown in FIG. 4.

[0112] At the end of the step 301, one (or more) estimates of

[00025]$g\left(\widehat{\gamma }\left(f\right)\right)$

are obtained which are then used to perform a detection test via equation (13).

[0113] For this purpose, in a step 302, the likelihood of the received channel matrix is calculated under the hypothesis H.sub.1. This calculation is, in fact, directly given by the value of the estimate of

[00026]$g\left(\widehat{\gamma }\left(f\right)\right)$

.

[0114] In a step 303, the likelihood of the received channel matrix is calculated under the hypothesis H.sub.0. This calculation is performed by calculating the term Σ.sub.f |H.sub.r(f)|.sup.2, which corresponds to the sum or average, over all of the frequencies, of the squared modulus of the channel matrix. It corresponds to the frequency energy of the channel matrix. The norm operator of a complex matrix is defined by the trace of the product of the matrix and the conjugate transposed matrix:

[0115] |H.sub.r(f)|.sup.2 = trace(H.sub.r(f)H.sub.r(f).sup.h), where .sup.h is the Hermitian operator and trace() denotes the trace of a matrix.

[0116] Finally, in a step 304, the likelihood test of equation (13) is performed by comparing the difference between the terms calculated in the steps 302 and 303, respectively, with a detection threshold λ.

[0117] As a variant, the propagation speed v of the wave in the media passed through may be estimated by an external method or may indeed be considered as an additional variable of the minimization problem.

[0118] FIG. 5 schematically illustrates one variant embodiment of the invention adapted to detect multiple targets.

[0119] In this variant, the target detection method described in FIGS. 2 and 3 is applied in order to search for a single target (step 501), that is to say the target having the dominant echo.

[0120] Then, in a step 502, an echo cancellation algorithm is applied to the received signals (or directly to the channel matrix H.sub.r(f)) in order to cancel the contribution of the reflections of the signal on the target which is detected in step 501. One possible algorithm is the algorithm known by the acronym CLEAN, for example described in reference [3].

[0121] The iterations are stopped via a stop criterion 503 which may consist of a fixed number of iterations or of a criterion depending on the radar cross section or on the energy of the echoes of the targets detected. The criterion may also be defined on the basis of a difference in energy or in radar cross section between two targets detected in two successive iterations.

[0122] In one variant embodiment, the image of the area analyzed is supplied as input to an optimization algorithm 504 in order to improve the precision of the image. The optimization algorithm is, for example, chosen among those described in references [7], [8] or [9]. The algorithm may be based on the stochastic gradient method.

[0123] The method described in FIG. 5 based on echo cancellation by successive iterations does, however, exhibit certain drawbacks.

[0124] First of all, the cancellation of the contribution of a target is never perfect and therefore introduces parasitic effects. This is particularly true when several echoes are received with very different dynamics, for example because the various targets are far from one another.

[0125] Then, the basic hypothesis for detecting a target via a test under two hypotheses, as described previously, is that the noise statistics correspond to Gaussian additive white noise. In the case of several targets, this hypothesis is no longer true, this leading to biases in the detection algorithm.

[0126] In order to mitigate these drawbacks, a variant embodiment of the invention, described in FIGS. 6 and 7, is proposed.

[0127] This variant consists in applying a filter in the form of time windowing to the channel matrices in order to separately process various sub-areas of the area of the ground to be analyzed and thus to overcome dynamics problems.

[0128] The additional steps implemented in this variant are illustrated in FIG. 7. If a vector consisting of the estimate of the propagation channel in terms of frequency for a pair of transmitting and receiving antennas is labeled h, this vector is converted into the time domain via an inverse Fourier transform IFFT (step 701). Next, a filter is applied in the time domain (step 702) to the time response of the channel. The filter w models a time window; it is, for example, of the form w=[0,0,0,...0,1,1,1,0,0,0], the number of consecutive 1s and their position in the filter making it possible to define a slice of the area of the ground to be analyzed in terms of depth (in the main direction of propagation of the wave). Without departing from the scope of the invention, any type of window may be used, for example a Hanning window, or indeed a Blackman-Harris window.

[0129] After filtering, the result is converted (step 703) into the frequency domain via a direct Fourier transform, then the new frequency vector obtained is used to constitute the channel matrix H.sub.r(f) as input to the detection method according to one of the variants described previously. The process described in FIG. 7 is applied for each propagation channel linking one of the transmitting antennas to one of the receiving antennas.

[0130] The detection method, in its entirety, is iterated for several different time windows, for example by varying the windows over the entire area to be analyzed by cyclically permuting the filter w by p/2 positions in each iteration, where p is equal to the number 1.

[0131] FIG. 6 schematically illustrates, in a diagram, an example of a time response 601 of a propagation channel between a transmitting antenna and a receiving antenna. In the same diagram, several time windows have been shown arranged in staggered rows and corresponding to several iterations of the method described above.

[0132] Applying time windows makes it possible to be free of dynamics problems and to analyze the ground in successive layers. This method makes it possible to detect targets the echo of which is weak (for example, because of a deep target) in a scene with the presence of strong echoes spaced in terms of depth.

[0133] The proposed method makes it possible, in addition to detecting the position of a target, to estimate the propagation losses in the medium of the ground and the radar cross section of the target. This information may serve to characterize the ground or the nature of the target.

[0134] FIG. 8 schematically illustrates an example of a ground-penetrating radar configured to implement the invention.

[0135] The radar consists of a transmitter EM and of a receiver REC, each provided with at least one antenna A1, A2.

[0136] The transmitter EM comprises a generator of a sequence of bits or symbols GEN, an OFDM modulator MOD, a frequency converter RF1 for transposing the signal to a carrier frequency and an amplifier AMP.

[0137] The receiver REC comprises a frequency converter RF2 for transposing the received signal into baseband, an OFDM demodulator DEMOD and a processing unit consisting of a channel estimation module EST which determines the channel matrices on the basis of the demodulated signals and of the sequence transmitted by the generator GEN, an integrator INT which carries out an (average) integration and a concatenation of the frequency sub-bands and a target detection module DET which implements the processing steps described previously in order to produce any one of the embodiments of the invention.

[0138] Without departing from the scope of the invention, the diagram in FIG. 8 is given for purely illustrative purposes and the radar may comprise other equipment not identified in FIG. 8.

[0139] The channel estimation, integration and detection modules EST, INT and DET may be produced in software and/or hardware form, notably using one or more processors and one or more memories. The processor may be a generic processor, a specific processor, an application-specific integrated circuit (ASIC) or a field-programmable gate array (FPGA).

REFERENCES

[0140] M. Ambrosanio, M. T. Bevacqua, T. Isernia, and V. Pascazio. The tomographic approach to ground-penetrating radar for underground exploration and monitoring : A more user-friendly and unconventional method for subsurface investigation. IEEE Signal Processing Magazine.

[0141] [2] Chin Yuan Chong. Signal processing for MIMO radars : detection under gaussian and non-gaussian environments and application to STAP. In PhD thesis, 2011.

[0142] [3] J. A. Hogbom. Aperture Synthesis with a Non-Regular Distribution of Interferometer Baselines. AAPS, 15:417, June 1974.

[0143] [4] D. H. N. Marpaung and Yilong Lu. A comparative study of migration algorithms for UWB GPR images in SISO-SAR and MIMO-array configurations. In 2014 15th International Radar Symposium (IRS), pages 1-4, 2014.

[0144] [5] Z. Zeng, J. Li, L. Huang, and F. Liu. Improvement of target imaging quality by multi-polarization MIMO GPR. In 2012 14th International Conference on Ground Penetrating Radar (GPR), pages 119-124, 2012.

[0145] [6] X. Zhuge and A. G. Yarovoy. Three-dimensional near-field mimo array imaging using range migration techniques. IEEE Transactions on Image Processing, 21(6): 3026-3033, 2012.

[0146] [7] Byrd, R. H., J. C. Gilbert, and J. Nocedal. “A Trust Region Method Based on Interior Point Techniques for Nonlinear Programming.” Mathematical Programming, Vol. 89, No. 1, 2000, pp. 149-185.

[0147] [8] Byrd, R. H., Mary E. Hribar, and Jorge Nocedal. “An Interior Point Algorithm for Large-Scale Nonlinear Programming.” SIAM Journal on Optimization, Vol. 9, No. 4, 1999, pp. 877-900.

[0148] [9] Coleman, T. F. and Y. Li. “An Interior, Trust Region Approach for Nonlinear Minimization Subject to Bounds.” SIAM Journal on Optimization, Vol. 6, 1996, pp. 418-445.