Reciprocal pointer chains for identifying layer boundaries in ground-penetrating radar data

Smock, Brandon; Wilson, Joseph N.

doi:10.1109/igarss.2012.6351522

Cited by 6 publications

(4 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…3,4 The elements of the depth vector within a frame or sweep are thought of as individual nodes in a graph. Edges connect each node to its neighbors at the same depth level and also to the neighboring nodes in the preceding and following depth levels.…”

Section: Layer Finding In Two-dimensional Datamentioning

confidence: 99%

“…Vehicular mounted systems collect data in a frame by frame format, while handheld systems collect a series of sweeps. Section 2.2 provides an overview of how reciprocal pointer chains (RPCs) 3,4 are used to identify potential one-dimensional layers within frames and sweeps. Section 3.1 discusses how a one-dimensional layer in vehicular mounted system data is matched to a layer in the following frame.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A layer tracking approach to buried surface detection

2015

Self Cite

View full text Add to dashboard Cite

Ground penetrating radar (GPR) devices use sensors to capture one-dimensional representations, or A-scans, of the soil and buried properties at each sampling point. Previous work uses reciprocal pointer chains (RPCs) to find onedimensional layers in two-dimensional data (B-scans). We extend this work to find two-dimensional layers in threedimensional data. We explore the application and differences of our technique when applied to vehicular mounted systems versus handheld systems and their distinct detection sequences. Not only can this work be used to display subsurface structure to a system operator, but we can also use changes in the subsurface structure of a local region to help identify buried objects within the data. We propose distinguishing buried objects from layers can reduce false alarm rates and may help increase probability of detection.

show abstract

Section: Layer Finding In Two-dimensional Datamentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A layer tracking approach to buried surface detection

2015

Self Cite

View full text Add to dashboard Cite

show abstract

“…A via-path is the shortest path in a graph G = (V, E) from a source node, s, to a target node, t, that passes through an intermediate node, v. From the perspective of graph theory, the k-best via-paths form a convenient path set, comparable to the k shortest loopless paths [24] or k shortest disjoint paths [21], but with its own unique collection of properties. From an applied perspective, via-paths have proved to be useful in a growing number of applications, such as finding alternate routes in road networks [1], power line path planning [10], animal dispersal route analysis in landscape ecology [15], autonomous robot navigation [17], and layer-boundary identification in ground-penetrating radar (GPR) data [20].…”

Section: Introductionmentioning

confidence: 99%

“…This work led to more patents [8,9] on the two-tree method being filed in 2007. Smock and Wilson [20,19] proposed the two-tree method in 2012 in the context of trellis graphs and the Viterbi algorithm, although instead of using it to compute CVPs, they introduced the idea of computing just the RPCs as the end product.…”

Section: Introductionmentioning

confidence: 99%

A comprehensive theory of cascading via-paths and the reciprocal pointer chain method

Smock¹,

Wilson²

2016

Preprint

Self Cite

View full text Add to dashboard Cite

In this paper, we consolidate and expand upon the current theory and potential applications of the set of k best cascading via-paths (CVPs) and the reciprocal pointer chain (RPC) method for identifying them. CVPs are a collection of up to |V | paths between a source and a target node in a graph G = (V, E), computed using two shortest path trees, that have distinctive properties relative to other path sets. They have been shown to be particularly useful in geospatial applications, where they are an intuitive and efficient means for identifying a set of spatially diverse alternatives to the single shortest path between the source and target. However, spatial diversity is not intrinsic to paths in a graph, and little theory has been developed outside of application to describe the nature of these paths and the RPC method in general. Here we divorce the RPC method from its typical geospatial applications and develop a comprehensive theory of CVPs from an abstract graph-theoretic perspective. Restricting ourselves to properties of the CVPs and of the entire set of k-best CVPs that can be computed in O(|E| + |V | log |V |), we are able to then propose, among other things, new and efficient approaches to problems such as generating a diverse set of paths and to computing the k shortest loopless paths between two nodes in a graph. We conclude by demonstrating the new theory in practice, first for a typical application of finding alternative routes in road networks and then for a novel application of identifying layer-boundaries in ground-penetrating radar (GPR) data. It is our hope that by generalizing the RPC method, providing a sound theoretical foundation, and demonstrating novel uses, we are able to broaden its perceived applicability and stimulate new research in this area, both applied and theoretical.

show abstract

Automated Ice-Bottom Tracking of 2D and 3D Ice Radar Imagery Using Viterbi and TRW-S

Berger

Al-Ibadi

et al. 2019

IEEE J. Sel. Top. Appl. Earth Observations Remote Sensing

View full text Add to dashboard Cite

Reciprocal pointer chains for identifying layer boundaries in ground-penetrating radar data

Cited by 6 publications

References 8 publications

A layer tracking approach to buried surface detection

A layer tracking approach to buried surface detection

A comprehensive theory of cascading via-paths and the reciprocal pointer chain method

Automated Ice-Bottom Tracking of 2D and 3D Ice Radar Imagery Using Viterbi and TRW-S

Contact Info

Product

Resources

About