Application of an advanced algorithm for automated hyperbola detection, including Canny edge detector, to GPR data from IFSTTAR test field

Author(s):  
Željko Bugarinović ◽  
Lara Pajewski ◽  
Aleksandar Ristić ◽  
Milan Vrtunski ◽  
Miro Govedarica

<p>Automated processing and extraction of useful information from GPR data is a complicated task, for which various approaches have been developed during the last years. This work examines the introduction of Canny edge detector as a new preliminary step of an advanced algorithm for automated hyperbola detection [1, 2]. The overall algorithm aims to identify radargram portions wherein hyperbolic reflections apices are present and extract the coordinates of such apices.</p><p>The newly introduced step utilizing Canny edge detector consists of two main procedures: (1) identification of edge pixels in a radargram and (2) elimination of edge pixels that do not meet specific criteria. The latter procedure aims to accelerate the algorithm by reducing the number of pixels, without compromising the correct detection and localization of hyperbola apices. For the elimination of unnecessary edge pixels, different criteria have been designed and tested; a practical solution has been found, which yields the elimination of the highest number of unnecessary edge pixels without eliminating useful edge pixels. No pixels are eliminated from the close vicinity of hyperbola apices since it is better to keep a higher number of edge pixels than to eliminate useful ones. In the implementation of the algorithm, special attention has been paid to its execution time, thinking of real-time applications.</p><p>The upgraded algorithm was tested on experimental radargrams from IFSTTAR (The French Institute of Science and Technology for Transport, Development, and Networks) test field in Nantes, France [3]. That test field consists of vertical sections filled with different materials and hosting many buried objects, such as cables and pipes, or walls and stones, imitating common scenarios in urban areas. Radargram acquisition was done using antennas with different central frequencies. Radargrams containing hyperbolic reflections were selected and used for testing the upgraded algorithm, with promising results.</p><p>References</p><p>[1] A. Ristić, Ž. Bugarinović, M. Govedarica, L. Pajewski, and X. Derobert, “Verification of algorithm for point extraction from hyperbolic reflections in GPR data,” Proc. 9th International Workshop on Advanced Ground Penetrating Radar (IWAGPR 2017), Edinburgh, UK, pp. 1-5, 2017.</p><p>[2] A. Ristić, M. Vrtunski, M. Govedarica, L. Pajewski, and X. Derobert, “Automated data extraction from synthetic and real radargrams of district heating pipelines,” Proc. 9th International Workshop on Advanced Ground Penetrating Radar (IWAGPR 2017), Edinburgh, UK, pp. 1-5, 2017.</p><p>[3] X. Dérobert and L. Pajewski, “TU1208 Open Database of Radargrams: The Dataset of the IFSTTAR Geophysical Test Site,” Remote Sensing, Vol. 10(4), 530, pp. 1-50, 2018.</p>

2020 ◽  
Author(s):  
Milan Vrtunski ◽  
Željko Bugarinović ◽  
Lara Pajewski ◽  
Aleksandar Ristić ◽  
Miro Govedarica

<p>This paper presents a method for the automated detection and elimination of horizontal reflections from ground penetrating radar (GPR) profiles after Canny edge filtering. Horizontal reflections are generated by interfaces between different media parallel to the air-soil interface. The recognition of horizontal layers is a crucial task when the number of layers and their thicknesses need to be estimated (e.g., in GPR road surveys). Identifying and deleting horizontal reflections from a radargram is also useful to facilitate the subsequent automated extraction of hyperbolic reflections [1-3]. It has to be noted that the removal of horizontal layers can increase the level of radargram segmentation.</p><p>In the proposed method, the first segmentation step is the application of Canny edge detector to the entire radargram. Then, horizontal layer recognition is done by carefully choosing boundary values. These values are varied many times until optimal values, depending on data acquisition parameters, are adopted. Special attention is paid to time efficiency of both segmentation steps, to investigate the possibility of employing the proposed solution in near real-time applications. The final result is an image where edge pixels arranged horizontally are removed.</p><p>Testing of this algorithm is done in MATLAB software environment, on a set of data with different levels of complexity, by varying the acquisition parameters.</p><p> </p><p>References</p><p>[1]  A. Ristić, Ž. Bugarinović, M. Govedarica, L. Pajewski, and X. Derobert, “Verification of algorithm for point extraction from hyperbolic reflections in GPR data,” Proc. 9th International Workshop on Advanced Ground Penetrating Radar (IWAGPR 2017), Edinburgh, UK, pp. 1-5, 2017.</p><p>[2]  A. Ristić, M. Vrtunski, M. Govedarica, L. Pajewski, and X. Derobert, “Automated data extraction from synthetic and real radargrams of district heating pipelines,” Proc. 9th International Workshop on Advanced Ground Penetrating Radar (IWAGPR 2017), Edinburgh, UK, pp. 1-5, 2017.</p><p>[3]  Ž. Bugarinović, S.  Meschino, M. Vrtunski, L. Pajewski, A. Ristić, X. Derobert, and M. Govedarica, “Automated Data Extraction from Synthetic and Real Radargrams of Complex Structures,” Journal of Environmental and Engineering Geophysics, Vol. 23(4), pp. 407-421, 2018.</p>


Electronics ◽  
2020 ◽  
Vol 9 (3) ◽  
pp. 541 ◽  
Author(s):  
Željko Bugarinović ◽  
Lara Pajewski ◽  
Aleksandar Ristić ◽  
Milan Vrtunski ◽  
Miro Govedarica ◽  
...  

This paper focuses on the use of the Canny edge detector as the first step of an advanced imaging algorithm for automated detection of hyperbolic reflections in ground-penetrating radar (GPR) data. Since the imaging algorithm aims to work in real time; particular attention is paid to its computational efficiency. Various alternative criteria are designed and examined, to fasten the procedure by eliminating unnecessary edge pixels from Canny-processed data, before such data go through the subsequent steps of the detection algorithm. The effectiveness and reliability of the proposed methodology are tested on a wide set of synthetic and experimental radargrams with promising results. The finite-difference time-domain simulator gprMax is used to generate synthetic radargrams for the tests, while the real radargrams come from GPR surveys carried out by the authors in urban areas. The imaging algorithm is implemented in MATLAB.


Author(s):  
Pramod Kumar S ◽  
◽  
Narendra T.V ◽  
Vinay N.A ◽  
◽  
...  

2014 ◽  
Vol 23 (7) ◽  
pp. 2944-2960 ◽  
Author(s):  
Qian Xu ◽  
Srenivas Varadarajan ◽  
Chaitali Chakrabarti ◽  
Lina J. Karam

2003 ◽  
Author(s):  
Yoshihiro Midoh ◽  
Katsuyoshi Miura ◽  
Koji Nakamae ◽  
Hiromu Fujioka

Author(s):  
Poonam S. Deokar ◽  
Anagha P. Khedkar

The Edge can be defined as discontinuities in image intensity from one pixel to another. Modem image processing applications demonstrate an increasing demand for computational power and memories space. Typically, edge detection algorithms are implemented using software. With advances in Very Large Scale Integration (VLSI) technology, their hardware implementation has become an attractive alternative, especially for real-time applications. The Canny algorithm computes the higher and lower thresholds for edge detection based on the entire image statistics, which prevents the processing of blocks independent of each other. Direct implementation of the canny algorithm has high latency and cannot be employed in real-time applications. To overcome these, an adaptive threshold selection algorithm may be used, which computes the high and low threshold for each block based on the type of block and the local distribution of pixel gradients in the block. Distributed Canny Edge Detection using FPGA reduces the latency significantly; also this allows the canny edge detector to be pipelined very easily. The canny edge detection technique is discussed in this paper.


Sign in / Sign up

Export Citation Format

Share Document