Cargando…
3D Buried Utility Location Using A Marching-Cross-Section Algorithm for Multi-Sensor Data Fusion
We address the problem of accurately locating buried utility segments by fusing data from multiple sensors using a novel Marching-Cross-Section (MCS) algorithm. Five types of sensors are used in this work: Ground Penetrating Radar (GPR), Passive Magnetic Fields (PMF), Magnetic Gradiometer (MG), Low...
Autores principales: | , , , , , , , , , , , , , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2016
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5134486/ https://www.ncbi.nlm.nih.gov/pubmed/27827836 http://dx.doi.org/10.3390/s16111827 |
_version_ | 1782471463399325696 |
---|---|
author | Dou, Qingxu Wei, Lijun Magee, Derek R. Atkins, Phil R. Chapman, David N. Curioni, Giulio Goddard, Kevin F. Hayati, Farzad Jenks, Hugo Metje, Nicole Muggleton, Jennifer Pennock, Steve R. Rustighi, Emiliano Swingler, Steven G. Rogers, Christopher D. F. Cohn, Anthony G. |
author_facet | Dou, Qingxu Wei, Lijun Magee, Derek R. Atkins, Phil R. Chapman, David N. Curioni, Giulio Goddard, Kevin F. Hayati, Farzad Jenks, Hugo Metje, Nicole Muggleton, Jennifer Pennock, Steve R. Rustighi, Emiliano Swingler, Steven G. Rogers, Christopher D. F. Cohn, Anthony G. |
author_sort | Dou, Qingxu |
collection | PubMed |
description | We address the problem of accurately locating buried utility segments by fusing data from multiple sensors using a novel Marching-Cross-Section (MCS) algorithm. Five types of sensors are used in this work: Ground Penetrating Radar (GPR), Passive Magnetic Fields (PMF), Magnetic Gradiometer (MG), Low Frequency Electromagnetic Fields (LFEM) and Vibro-Acoustics (VA). As part of the MCS algorithm, a novel formulation of the extended Kalman Filter (EKF) is proposed for marching existing utility tracks from a scan cross-section (scs) to the next one; novel rules for initializing utilities based on hypothesized detections on the first scs and for associating predicted utility tracks with hypothesized detections in the following scss are introduced. Algorithms are proposed for generating virtual scan lines based on given hypothesized detections when different sensors do not share common scan lines, or when only the coordinates of the hypothesized detections are provided without any information of the actual survey scan lines. The performance of the proposed system is evaluated with both synthetic data and real data. The experimental results in this work demonstrate that the proposed MCS algorithm can locate multiple buried utility segments simultaneously, including both straight and curved utilities, and can separate intersecting segments. By using the probabilities of a hypothesized detection being a pipe or a cable together with its 3D coordinates, the MCS algorithm is able to discriminate a pipe and a cable close to each other. The MCS algorithm can be used for both post- and on-site processing. When it is used on site, the detected tracks on the current scs can help to determine the location and direction of the next scan line. The proposed “multi-utility multi-sensor” system has no limit to the number of buried utilities or the number of sensors, and the more sensor data used, the more buried utility segments can be detected with more accurate location and orientation. |
format | Online Article Text |
id | pubmed-5134486 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2016 |
publisher | MDPI |
record_format | MEDLINE/PubMed |
spelling | pubmed-51344862017-01-03 3D Buried Utility Location Using A Marching-Cross-Section Algorithm for Multi-Sensor Data Fusion Dou, Qingxu Wei, Lijun Magee, Derek R. Atkins, Phil R. Chapman, David N. Curioni, Giulio Goddard, Kevin F. Hayati, Farzad Jenks, Hugo Metje, Nicole Muggleton, Jennifer Pennock, Steve R. Rustighi, Emiliano Swingler, Steven G. Rogers, Christopher D. F. Cohn, Anthony G. Sensors (Basel) Article We address the problem of accurately locating buried utility segments by fusing data from multiple sensors using a novel Marching-Cross-Section (MCS) algorithm. Five types of sensors are used in this work: Ground Penetrating Radar (GPR), Passive Magnetic Fields (PMF), Magnetic Gradiometer (MG), Low Frequency Electromagnetic Fields (LFEM) and Vibro-Acoustics (VA). As part of the MCS algorithm, a novel formulation of the extended Kalman Filter (EKF) is proposed for marching existing utility tracks from a scan cross-section (scs) to the next one; novel rules for initializing utilities based on hypothesized detections on the first scs and for associating predicted utility tracks with hypothesized detections in the following scss are introduced. Algorithms are proposed for generating virtual scan lines based on given hypothesized detections when different sensors do not share common scan lines, or when only the coordinates of the hypothesized detections are provided without any information of the actual survey scan lines. The performance of the proposed system is evaluated with both synthetic data and real data. The experimental results in this work demonstrate that the proposed MCS algorithm can locate multiple buried utility segments simultaneously, including both straight and curved utilities, and can separate intersecting segments. By using the probabilities of a hypothesized detection being a pipe or a cable together with its 3D coordinates, the MCS algorithm is able to discriminate a pipe and a cable close to each other. The MCS algorithm can be used for both post- and on-site processing. When it is used on site, the detected tracks on the current scs can help to determine the location and direction of the next scan line. The proposed “multi-utility multi-sensor” system has no limit to the number of buried utilities or the number of sensors, and the more sensor data used, the more buried utility segments can be detected with more accurate location and orientation. MDPI 2016-11-02 /pmc/articles/PMC5134486/ /pubmed/27827836 http://dx.doi.org/10.3390/s16111827 Text en © 2016 by the authors; licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC-BY) license (http://creativecommons.org/licenses/by/4.0/). |
spellingShingle | Article Dou, Qingxu Wei, Lijun Magee, Derek R. Atkins, Phil R. Chapman, David N. Curioni, Giulio Goddard, Kevin F. Hayati, Farzad Jenks, Hugo Metje, Nicole Muggleton, Jennifer Pennock, Steve R. Rustighi, Emiliano Swingler, Steven G. Rogers, Christopher D. F. Cohn, Anthony G. 3D Buried Utility Location Using A Marching-Cross-Section Algorithm for Multi-Sensor Data Fusion |
title | 3D Buried Utility Location Using A Marching-Cross-Section Algorithm for Multi-Sensor Data Fusion |
title_full | 3D Buried Utility Location Using A Marching-Cross-Section Algorithm for Multi-Sensor Data Fusion |
title_fullStr | 3D Buried Utility Location Using A Marching-Cross-Section Algorithm for Multi-Sensor Data Fusion |
title_full_unstemmed | 3D Buried Utility Location Using A Marching-Cross-Section Algorithm for Multi-Sensor Data Fusion |
title_short | 3D Buried Utility Location Using A Marching-Cross-Section Algorithm for Multi-Sensor Data Fusion |
title_sort | 3d buried utility location using a marching-cross-section algorithm for multi-sensor data fusion |
topic | Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5134486/ https://www.ncbi.nlm.nih.gov/pubmed/27827836 http://dx.doi.org/10.3390/s16111827 |
work_keys_str_mv | AT douqingxu 3dburiedutilitylocationusingamarchingcrosssectionalgorithmformultisensordatafusion AT weilijun 3dburiedutilitylocationusingamarchingcrosssectionalgorithmformultisensordatafusion AT mageederekr 3dburiedutilitylocationusingamarchingcrosssectionalgorithmformultisensordatafusion AT atkinsphilr 3dburiedutilitylocationusingamarchingcrosssectionalgorithmformultisensordatafusion AT chapmandavidn 3dburiedutilitylocationusingamarchingcrosssectionalgorithmformultisensordatafusion AT curionigiulio 3dburiedutilitylocationusingamarchingcrosssectionalgorithmformultisensordatafusion AT goddardkevinf 3dburiedutilitylocationusingamarchingcrosssectionalgorithmformultisensordatafusion AT hayatifarzad 3dburiedutilitylocationusingamarchingcrosssectionalgorithmformultisensordatafusion AT jenkshugo 3dburiedutilitylocationusingamarchingcrosssectionalgorithmformultisensordatafusion AT metjenicole 3dburiedutilitylocationusingamarchingcrosssectionalgorithmformultisensordatafusion AT muggletonjennifer 3dburiedutilitylocationusingamarchingcrosssectionalgorithmformultisensordatafusion AT pennockstever 3dburiedutilitylocationusingamarchingcrosssectionalgorithmformultisensordatafusion AT rustighiemiliano 3dburiedutilitylocationusingamarchingcrosssectionalgorithmformultisensordatafusion AT swinglersteveng 3dburiedutilitylocationusingamarchingcrosssectionalgorithmformultisensordatafusion AT rogerschristopherdf 3dburiedutilitylocationusingamarchingcrosssectionalgorithmformultisensordatafusion AT cohnanthonyg 3dburiedutilitylocationusingamarchingcrosssectionalgorithmformultisensordatafusion |