METHOD FOR DETECTING BURIED LONGITUDINAL STRUCTURES BY MEANS OF A GROUND-PENETRATING RADAR
20230314566 · 2023-10-05
Inventors
- Alex Pereira Da Silva (Grenoble, FR)
- Luc Maret (Grenoble, FR)
- Jean-Baptiste DORE (Grenoble, FR)
- Raffaele D'ERRICO (GRENOBLE, FR)
Cpc classification
G06V10/469
PHYSICS
G06V10/762
PHYSICS
International classification
G01S7/41
PHYSICS
G01S13/88
PHYSICS
Abstract
A method for detecting buried longitudinal structures using a ground-penetrating radar, the method includes the steps of: acquiring a plurality of radar signals for a region of ground, determining, based on the radar signals, a 3D point cloud, each point corresponding to one radar detection and being geolocated in space, selecting, from the 3D point cloud, at least one set of points comprising a number of points higher than or equal to a minimum detection threshold allowing a longitudinal structure to be characterized, the points of the set being substantially aligned with one another.
Claims
1. A method for detecting buried longitudinal structures using a ground-penetrating radar, the method comprising the steps of: acquiring a plurality of radar signals for a region of ground, determining, based on said radar signals, a 3D point cloud, each point corresponding to one radar detection and being geolocated in space, selecting, from the 3D point cloud, at least one set of points comprising a number of points higher than or equal to a minimum detection threshold allowing a longitudinal structure to be characterized, the points of said set being substantially aligned with one another.
2. The detecting method according to claim 1, wherein the step of selecting at least one set of points comprises the iterative sub-steps of: ordering the points of the 3D point cloud into a list to be processed and selecting the point on the list of highest intensity, determining unit vectors the origin of which is said selected point and the direction of which is given by each of the other points of the 3D point cloud, determining the set of points having substantially collinear unit vectors, if the number of points of said set is higher than or equal to said minimum detection threshold, then identifying said set of points as corresponding to a longitudinal structure and removing the points of said set from the list to be treated, else removing from the 3D point cloud and from the list to be processed said selected point of highest intensity, iterating the sub-steps until the list to be processed is empty.
3. The detecting method according to claim 2, wherein the step of determining the set of points having substantially collinear unit vectors comprises the sub-steps of: approximating the numerical values of the components of the unit vectors in a 3D coordinate system to a predetermined number of significant figures, forming the set of points having substantially collinear unit vectors by selecting points the approximate components of which are identical and the most recurrent.
4. The detecting method according to claim 3, further comprising the sub-steps of: determining the dominant value of each numerical approximate-component value in the set of all the unit vectors, combining points having the same dominant value for the three components of the 3D coordinate system.
5. The detecting method according to claim 4, wherein the step of combining points of the same dominant value is carried out by selecting points having the same dominant values in at least two components.
6. The detecting method according to claim 2, wherein the step of determining the set of points having substantially collinear unit vectors comprises the sub-steps of: computing the angle between each pair of unit vectors, preserving points for which said angle is smaller than a predetermined threshold in absolute value.
7. The detecting method according to claim 2, wherein the step of determining the set of points having substantially collinear unit vectors comprises the sub-steps of: converting the unit vectors into polar coordinates, determining a histogram of the absolute values of the angular components of said unit vectors for each angular component, each histogram having a predetermined sampling increment, determining the most recurrent angular values for each of the components, preserving points having the most recurrent angular values in each component.
8. The detecting method according to claim 1, wherein the points of the 3D point cloud are geolocated using a geolocation device of the ground-penetrating radar.
9. The detecting method according to claim 1, wherein the radar signals are acquired for a plurality of planes in the region of ground.
10. A ground-penetrating radar comprising at least one transmit antenna and at least one receive antenna and a device for detecting buried longitudinal structures in a region of ground, which is configured to execute the steps of the detecting method according to claim 1.
11. A computer program comprising instructions for executing the method according to claim 1, when the program is executed by a processor.
12. A processor-readable storage medium, on which is stored a program comprising instructions for executing the method according to claim 1, when the program is executed by a processor.
Description
BRIEF DESCRIPTION OF THE DRAWINGS
[0042] Other features and advantages of the present invention will become more clearly apparent on reading the following description with reference to the following appended drawings.
[0043]
[0044]
[0045]
[0046]
[0047]
[0048]
[0049]
[0050]
[0051]
[0052]
[0053]
[0054]
[0055]
[0056]
[0057]
[0058]
[0059]
[0060]
DETAILED DESCRIPTION
[0061]
[0062] The scene of
[0063] One objective of the invention is to decrease the points 101 belonging to the clutter so as to better detect the presence of a longitudinal structure such as a pipe, a pipeline or piping.
[0064]
[0065] On analysis of these three cross-sectional planes, it may be seen that the clutter 210 corresponds to noise that is coherent with the target to be detected, i.e. it may be of equivalent amplitude to a target in a radar image. However, the clutter 210 is not spatially coherent as the radar is moved along the scene. This is especially due to the fact that the clutter results from reflections of radar signals from objects that are very small or from interfaces between two types of ground that may vary spatially.
[0066] In contrast, it may be seen that an object such as a pipe is spatially coherent, i.e. the same amplitudes are found in the various images corresponding to various cross-sectional planes. In other words, the radar echoes of such a target are spatially correlated in various images corresponding to various cross-sectional planes.
[0067] This property is exploited by the invention to search, in a point cloud of the kind illustrated in
[0068]
[0069] The first step 301 consists in acquiring radar images of a plurality of cross-sectional planes of a region of ground, in order to obtain radar images of the kind illustrated in
[0070] The radar images are acquired by means of a ground-penetrating radar comprising at least one transmit antenna and one receive antenna.
[0071] The radar is moved over the region to be imaged in order to perform a plurality of successive acquisitions. The raw signals measured are processed in order to generate a radar image each point of which has an intensity characteristic of the reflection of the signals from a buried target.
[0072] Step 301 of the method may for example be carried out by means of the acquisition method described in patent application FR 3111994 of the applicant. This application describes use of a so-called MIMO radar (MIMO standing for Multiple Input Multiple Output) having a plurality of transmit and receive antennas coupled to a demodulation algorithm that produces the radar image. Any other radar acquisition method allowing radar images of a plurality of cross-sectional planes of a 3D region may be used.
[0073] In step 302, a 3D point cloud is then constructed based on the various radar images of the cross-sectional planes of the scene. This step requires each image to be geolocated, in order to allow a position of the cross-sectional planes and therefore of the points to be deduced. Geolocation may be achieved by means of a device for receiving satellite radio-navigation signals, such as a GPS device, or of an odometer or more generally of any kind of locating device.
[0074]
[0075] In step 303, a method for detecting aligned points in the 3D point cloud 402 is then applied in order to detect lines, corresponding to targets to be detected, and to remove points belonging to the clutter.
[0076] Step 303 is a step of searching for similar unit vectors, or in other words unit vectors that are substantially collinear between pairs of points forming thus a line.
[0077]
[0078] The algorithm of
[0079]
[0080]
[0081] The algorithm of
[0082] An index i is initialized to 1 corresponding to the number of lines to be detected in the point cloud. In step 502, the method continues if i is lower than or equal to Nr the maximum number of lines that it is sought to detect.
[0083] In step 503, the first point of the list (that of highest amplitude) is selected. This step is illustrated in
[0084] In step 504, the set of points that are aligned or substantially aligned with the selected point 601 is sought.
[0085] To do this, first all the unit vectors having as start point the selected point 601 and the direction of which is given by one of the other points of the point cloud are determined. This step is illustrated in
[0086] The unit vectors are given by the formula:
where p.sub.k is the start point 601 and p.sub.j is the end point.
[0087] Among all the computed unit vectors, those that are substantially collinear with a predetermined margin of tolerance are retained. This step is shown in
[0088] There are a number of possible solutions that may be used to determine the set of substantially collinear vectors.
[0089] A first solution consists in executing the following steps.
[0090] Firstly, a rotation of 180° is applied to unit vectors a coordinate (for example the x-coordinate) of which is negative:
if u.sub.jkx<0.fwdarw.u.sub.jk=−u.sub.jk
[0091] This step allows all the unit vectors almost aligned in a common direction to be obtained.
[0092] Next, each component of u.sub.jk is approximated to n significant digits. For example, n is set equal to 2 or 3. Use of n>3 is recommended only in a very noisy scenario.
[0093] Next, for each component, the dominant value among all the approximated unit vectors is computed. In other words, the largest set of vectors having the same approximate component value is sought.
[0094] Next, the results obtained for the three components x,y,z are combined in order to determine points that are almost aligned, with a tolerance given by the approximation by the number n.
[0095] One possible combination consists in collating all the points present in at least two projection planes. In other words, if the sets of indices of the points of the cloud with the most recurrent value of the components x,y,z are denoted I.sub.x,I.sub.y,I.sub.z, respectively, the set of almost aligned points is given by the following formula:
[0096] I=(I.sub.x∩I.sub.y)∪(I.sub.x∩I.sub.z)∪(I.sub.y∩I.sub.z), where ∪ designates the union operator and ∩ designates the intersection operator.
[0097] Another possible approach consists in measuring the angle between each pair of unit vectors and in preserving all of the points for which the absolute value of this angle does not exceed a predetermined threshold close to 0 and dimensioned to accept a certain tolerance in the alignment of the points.
[0098] A third possible approach consists in converting the unit vectors into spherical coordinates (r, θ, φ) and in introducing a tolerance into the angular variations of the angular components (θ, φ).
[0099] To do this, a histogram of the values of each angular component (θ, φ) is computed. The histogram is defined by an increment that gives the desired tolerance in the angular variation.
[0100] Next, the most recurrent values in these two histograms are determined by taking into account phase ambiguities (modulo π).
[0101] The sought set of almost aligned points corresponds to the intersection of the points having the most recurrent values of the two angular components, respectively.
[0102] At the end of step 504, a set of points that are almost aligned with the point selected in step 503 is obtained.
[0103] Next, in step 505, the number of points of the obtained set is compared with a threshold N.sub.min that is a minimum number of points that may be considered to belong to a target. This threshold is set depending on the type of structure that it is desired to detect. In the case of pipes, pipelines or piping, this threshold allows detection of objects of small size that may rather belong to the clutter to be excluded. The threshold value N.sub.min especially depends on the resolution of the movement of the radar. If the measurements carried out by the radar are very spaced apart spatially, the value of the threshold N.sub.min may be set very low. If in contrast the measurements are not very spaced apart, this value may be set higher. The value of the threshold N.sub.min also depends on the size of the 3D region scanned by the radar and on the length of the structures to be detected. The value of the threshold N.sub.min is for example set in the interval [10;50].
[0104] If the number of points of the set is strictly higher than N.sub.min then, in step 506, all the aligned points are preserved, these being associated with a detected structure. These points are then withdrawn from the list to be processed and the index i of the list is incremented (step 508) to pass to the following point of highest amplitude among the remaining points.
[0105] If the number of points of the set is lower than or equal to N.sub.min then the point selected in step 503 is removed (step 507) from the list to be processed and is considered to belong to the clutter—it is therefore filtered from the 3D point cloud.
[0106] Steps 505 to 507 are illustrated in
[0107]
[0108]
[0109]
[0110]
[0111]
[0112] The various modules DET,SB,NP,SVU 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).
[0113] The invention may be implemented alone or in combination with other line-detecting techniques that are applicable in a complementary manner to the filtered 3D point cloud obtained by the present invention.
[0114] The invention especially allows the number of points of the point cloud to be decreased by preserving only points belonging to almost linear targets. The obtained point cloud is thus more parsimonious and may be input into another more precise detection algorithm.
[0115] Generally, the invention allows points corresponding to the clutter to be significantly decreased.
REFERENCES
[0116] [1] G. Zhan, L. Tsang, and K. Pak, “Studies of the angular correlation function of scattering by random rough surfaces with and without a buried object,” IEEE Trans. Geosci. Remote Sens., vol. 35, no. 2, pp. 444-453, March 1997. [0117] [2] T. Dogaru and L. Carin, “Time-domain sensing of targets buried under a rough air-ground interface,” IEEE Trans. Antennas Propag., vol. 46, no. 3, pp. 360-372, March 1998. [0118] [3] J. Brooks, L. van Kempen, and H. Sahli, “A primary study in adaptive clutter reduction and buried minelike target enhancement from GPR data,” in Proc. SPIE Detection and Remediation Technology for Mines and Minelike Targets V, 2000, pp. 1183-1192. [0119] [4] M. El-Shenawee and C. Rappaport, “Monte Carlo simulations for clutter statistics in minefields: AP-mine-like-target buried near a dielectric object beneath 2-D random rough surfaces,” IEEE Trans. Geosci. Remote Sens., vol. 40, no. 6, pp. 1416-1426, June 2002. [0120] [5] D. D. Carevic, M. Craig, and I. Chant, “Modelling GPR echoes from landmines using linear combination of exponentially damped sinusoids,” in Proc. SPIE Detection and Remediation Technology for Mines and Minelike Targets II, 1998, vol. 3079, pp. 1022-1032. [0121] [6] Raffaele Solimene, A. Cuccaro, A. Dell'Aversano, Ilaria Catapano and Francesco Soldovieri, “Ground Clutter Removal in GPR Surveys”. IEEE journal of selected topics in applied earth observations and remote sensing, vol. 7, no. 3, March 2014 [0122] [7] U. S. Khan and W. Al-Nuaimy, “Background removal from GPR data using Eigen values,” presented at the 13th Int. Conf. Ground Penetrating Radar (GPR), Lecce, Italy, 2010. [0123] [8] R. Solimene and A. D'Alterio, “Entropy based clutter rejection for intra-wall diagnostics,” Int. J. Geophys., vol. 2012, p. 7, 2012. [0124] [9] Capineri, Lorenzo et al. “Advanced image-processing technique for real-time interpretation of ground-penetrating radar images.” International Journal of Imaging Systems and Technology 9 (1998) [0125] [10] Carlotto, Mark, “Detecting buried mines in ground penetrating radar using a Hough transform approach”. Proceedings of SPIE—The International Society for Optical Engineering, 4741. 10.1117/12.478719, 2002.