Search

A fast multipole method (FMM)-accelerated surface integral equation (SIE) simulator, called XRL, is proposed for broadband resistance/inductance (RL) extraction under the magneto-quasi-static assumption. The proposed XRL has three key attributes that make it highly efficient and accurate for broadband RL extraction of complicated 3-D geometries: (i) The XRL leverages a novel centroid-midpoint basis transformation while discretizing surface currents, which allows converting edge-based vector potential computations to panel-based scalar potential computations. Such conversion makes the implementation of FMM straightforward and allows for drastically reducing the memory and computational time requirements of the simulator. (ii) The XRL employs a highly accurate equivalent surface impedance model that allows extracting RL parameters at low frequencies very accurately. (iii) The XRL makes use of a novel preconditioner, effectively including both diagonal entries and some near-field entries of the system matrix; such preconditioner significantly accelerates the iterative solution of SIE. The proposed XRL can accurately compute broadband RL parameters of arbitrarily shaped and large-scale structures on a desktop computer. It has been applied to RL parameter extraction of various practical structures, including two parallel square coils, a ball grid array (BGA) package and a high brand package on package. Its application to the parameter extraction of the BGA shows that the XRL requires 93.2x and 14.2x less computational time and memory resources compared to the commercial simulator Ansys Q3D for the same level of accuracy, respectively.

Tree defect detection is crucial for the structural health screening of trees. Existing nondestructive testing (NDT) techniques for tree defect detection require time-consuming and labor-intensive measurement campaigns. This discourages their application for the routine structural health screening of whole populations of managed urban trees. To address this issue, this study proposes a deep-learning augmented stand-off radar scheme for contactless scanning of tree trunks and rapid detection of tree defects. In this scheme, the antenna is moved along a straight trajectory at a distance from the tree trunk to obtain the trunk's B-scan. The obtained raw B-scan is then processed by a signal-processing framework specifically developed for revealing the scattering signatures of defects in B-scan, which achieves a 30 dB and 22 dB increase in the signal-to-clutter and noise ratio of the measurement data of tree trunk samples and living trees, respectively. Finally, the processed B-scan is input into a multilevel feature fusion neural network particularly designed for extracting the signature of the defect in the processed B-scan in real time. The developed scheme's applications to the detection of defects in real fresh-cut tree trunks show that the stand-off radar scheme can detect tree defects with 96% accuracy. This stand-off radar scheme is the first contactless NDT technique for tree defect detection while operated on a straight trajectory and potentially can be integrated into the routine tree inspection workflow which is part of urban tree management., Comment: Accepted and to be published in IEEE Transactions on Geoscience and Remote Sensing

This study presents a technique for processing Stepfrequency continuous wave (SFCW) ground penetrating radar (GPR) data to detect tree roots. SFCW GPR is portable and enables precise control of energy levels, balancing depth and resolution trade-offs. However, the high-frequency components of the transmission band suffers from poor penetrating capability and generates noise that interferes with root detection. The proposed time-frequency filtering technique uses a short-time Fourier transform (STFT) to track changes in frequency spectrum density over time. To obtain the filter window, a weighted linear regression (WLR) method is used. By adopting a conversion method that is a variant of the chirp Z-Transform (CZT), the timefrequency window filters out frequency samples that are not of interest when doing the frequency-to-time domain data conversion. The proposed depth-adaptive filter window can selfadjust to different scenarios, making it independent of soil information and effectively determines subsurface tree roots. The technique is successfully validated using SFCW GPR data from actual sites in a tropical area with different soil moisture levels, and the two-dimensional (2D) radar map of subsurface root systems is highly improved compared to existing methods., Comment: 10 pages, 12 figures, Accepted by IEEE TIM

The reconstruction of the 3D permittivity map from ground-penetrating radar (GPR) data is of great importance for mapping subsurface environments and inspecting underground structural integrity. Traditional iterative 3D reconstruction algorithms suffer from strong non-linearity, ill-posedness, and high computational cost. To tackle these issues, a 3D deep learning scheme, called 3DInvNet, is proposed to reconstruct 3D permittivity maps from GPR C-scans. The proposed scheme leverages a prior 3D convolutional neural network with a feature attention mechanism to suppress the noise in the C-scans due to subsurface heterogeneous soil environments. Then a 3D U-shaped encoder-decoder network with multi-scale feature aggregation modules is designed to establish the optimal inverse mapping from the denoised C-scans to 3D permittivity maps. Furthermore, a three-step separate learning strategy is employed to pre-train and fine-tune the networks. The proposed scheme is applied to numerical simulation as well as real measurement data. The quantitative and qualitative results show the network capability, generalizability, and robustness in denoising GPR C-scans and reconstructing 3D permittivity maps of subsurface objects.

The forward full-wave modeling of ground-penetrating radar (GPR) facilitates the understanding and interpretation of GPR data. Traditional forward solvers require excessive computational resources, especially when their repetitive executions are needed in signal processing and/or machine learning algorithms for GPR data inversion. To alleviate the computational burden, a deep learning-based 2D GPR forward solver is proposed to predict the GPR B-scans of subsurface objects buried in the heterogeneous soil. The proposed solver is constructed as a bimodal encoder-decoder neural network. Two encoders followed by an adaptive feature fusion module are designed to extract informative features from the subsurface permittivity and conductivity maps. The decoder subsequently constructs the B-scans from the fused feature representations. To enhance the network's generalization capability, transfer learning is employed to fine-tune the network for new scenarios vastly different from those in training set. Numerical results show that the proposed solver achieves a mean relative error of 1.28%. For predicting the B-scan of one subsurface object, the proposed solver requires 12 milliseconds, which is 22,500x less than the time required by a classical physics-based solver.

Tree roots detection is a popular application of the Ground-penetrating radar (GPR). Normally, the ground surface above the tree roots is assumed to be flat, and standard processing methods based on hyperbolic fitting are applied to the hyperbolae reflection patterns of tree roots for detection purposes. When the surface of the land is undulating (not flat), these typical hyperbolic fitting methods becomes inaccurate. This is because, the reflection patterns change with the uneven ground surfaces. When the soil surface is not flat, it is inaccurate to use the peak point of an asymmetric reflection pattern to identify the depth and horizontal position of the underground target. The reflection patterns of the complex shapes due to extreme surface variations results in analysis difficulties. Furthermore, when multiple objects are buried under an undulating ground, it is hard to judge their relative positions based on a B-scan that assumes a flat ground. In this paper, a roots fitting method based on electromagnetic waves (EM) travel time analysis is proposed to take into consideration the realistic undulating ground surface. A wheel-based (WB) GPR and an antenna-height-fixed (AHF) GPR System are presented, and their corresponding fitting models are proposed. The effectiveness of the proposed method is demonstrated and validated through numerical examples and field experiments., Comment: 11 pages, 6 figures, accepted by IEEE TIM

Detecting a shallowly buried and elongated object and estimating its orientation using a commonly adopted co-polarized GPR system is challenging due to the presence of strong ground clutter that masks the target reflection. A cross-polarized configuration can be used to suppress ground clutter and reveal the object reflection, but it suffers from inconsistent detection capability which significantly varies with different object orientations. To address this issue, we propose a dual-cross-polarized detection (DCPD) method which utilizes two cross-polarized antennas with a special arrangement to detect the object. The signals reflected by the object and collected by the two antennas are combined in a rotationally invariant manner to ensure both effective ground clutter suppression and consistent detection irrespective of the object orientation. In addition, we present a dual-cross-polarized orientation estimation (DCPOE) algorithm to estimate the object orientation from the two cross-polarized data. The proposed DCPOE algorithm is less affected by environmental noise and performs robust and accurate azimuth angle estimation. The effectiveness of the proposed techniques in the detection and orientation estimation and their advantages over the existing method have been demonstrated using experimental data. Comparison results show that the maximum and average errors are 22.3{\deg} and 10.9{\deg} for the Alford rotation algorithm, while those are 4.9{\deg} and 1.8{\deg} for the proposed DCPOE algorithm in the demonstrated shallowly buried object cases. The proposed techniques can be unified in a framework to facilitate the investigation and mapping of shallowly buried and elongated targets.

Traditional ground-penetrating radar (GPR) data inversion leverages iterative algorithms which suffer from high computation costs and low accuracy when applied to complex subsurface scenarios. Existing deep learning-based methods focus on the ideal homogeneous subsurface environments and ignore the interference due to clutters and noise in real-world heterogeneous environments. To address these issues, a two-stage deep neural network (DNN), called DMRF-UNet, is proposed to reconstruct the permittivity distributions of subsurface objects from GPR B-scans under heterogeneous soil conditions. In the first stage, a U-shape DNN with multi-receptive-field convolutions (MRF-UNet1) is built to remove the clutters due to inhomogeneity of the heterogeneous soil. Then the denoised B-scan from the MRF-UNet1 is combined with the noisy B-scan to be inputted to the DNN in the second stage (MRF-UNet2). The MRF-UNet2 learns the inverse mapping relationship and reconstructs the permittivity distribution of subsurface objects. To avoid information loss, an end-to-end training method combining the loss functions of two stages is introduced. A wide range of subsurface heterogeneous scenarios and B-scans are generated to evaluate the inversion performance. The test results in the numerical experiment and the real measurement show that the proposed network reconstructs the permittivities, shapes, sizes, and locations of subsurface objects with high accuracy. The comparison with existing methods demonstrates the superiority of the proposed methodology for the inversion under heterogeneous soil conditions.

Objective: Transcranial direct current stimulation (tDCS) is a non-invasive brain stimulation technique used to generate conduction currents in the head and disrupt brain functions. To rapidly evaluate the tDCS-induced current density in near real-time, this paper proposes a deep learning-based emulator, named DeeptDCS. Methods: The emulator leverages Attention U-net taking the volume conductor models (VCMs) of head tissues as inputs and outputting the three-dimensional current density distribution across the entire head. The electrode configurations are also incorporated into VCMs without increasing the number of input channels; this enables the straightforward incorporation of the non-parametric features of electrodes (e.g., thickness, shape, size, and position) in the training and testing of the proposed emulator. Results: Attention U-net outperforms standard U-net and its other three variants (Residual U-net, Attention Residual U-net, and Multi-scale Residual U-net) in terms of accuracy. The generalization ability of DeeptDCS to non-trained electrode configurations can be greatly enhanced through fine-tuning the model. The computational time required by one emulation via DeeptDCS is a fraction of a second. Conclusion: DeeptDCS is at least two orders of magnitudes faster than a physics-based open-source simulator, while providing satisfactorily accurate results. Significance: The high computational efficiency permits the use of DeeptDCS in applications requiring its repetitive execution, such as uncertainty quantification and optimization studies of tDCS.

Accurate monitoring of tree roots using ground penetrating radar (GPR) is very useful in assessing the trees health. In high moisture tropical areas such as Singapore, tree fall due to root rot can cause loss of lives and properties. The tropical complex soil characteristics due to the high moisture content tends to affect penetration depth of the signal. This limits the depth range of the GPR. Typically, a wide band signal is used to increase the penetration depth and to improve the resolution of the GPR. However, this broad band frequency tends to be noisy and selective frequency filtering is required for noise reduction. Therefore, in this paper, we adapt the stepped frequency continuous wave (SFCW) GPR and propose the use of a Joint time frequency analysis (JTFA) method called short time Fourier transform (STFT), to reduce noise and enhance tree root detection. The proposed methodology is illustrated and tested with controlled experiments and real tree roots testing. The results show promising prospects of the method for tree roots detection in tropical areas., Comment: 4 pages, 9 figures, accepted to be presented in 2022 IEEE International Geoscience and Remote Sensing Symposium (IGARSS 2022)

3D mapping of tree roots is a popular ground-penetrating radar (GPR) application. In real field tests, the recognition of tree roots suffers due to noisey reflection patterns from subsurface targets that are not of interest, such as rocks, cavities, soil unevenness, etc. A Slice-Connection Clustering Algorithm (SCC) is applied to separate the regions of interest from each other in a reconstructed 3D image. The proposed method can successfully recognize the radar signatures of the roots and distinguish roots from other objects. Meanwhile, most noise radar features are ignored through our method. The final 3D mapping of the radargram obtained by the method can be used to estimate the location and extension trend of the tree roots. The effectiveness of the proposed system is tested on real GPR data., Comment: submitted to AP-S URSI 2022, 2 pages with 3 figures

Ground-penetrating radar (GPR) has been used as a non-destructive tool for tree root inspection. Estimating root-related parameters from GPR radargrams greatly facilitates root health monitoring and imaging. However, the task of estimating root-related parameters is challenging as the root reflection is a complex function of multiple root parameters and root orientations. Existing methods can only estimate a single root parameter at a time without considering the influence of other parameters and root orientations, resulting in limited estimation accuracy under different root conditions. In addition, soil heterogeneity introduces clutter in GPR radargrams, making the data processing and interpretation even harder. To address these issues, a novel neural network architecture, called mask-guided multi-polarimetric integration neural network (MMI-Net), is proposed to automatically and simultaneously estimate multiple root-related parameters in heterogeneous soil environments. The MMI-Net includes two sub-networks: a MaskNet that predicts a mask to highlight the root reflection area to eliminate interfering environmental clutter, and a ParaNet that uses the predicted mask as guidance to integrate, extract, and emphasize informative features in multi-polarimetric radargrams for accurate estimation of five key root-related parameters. The parameters include the root depth, diameter, relative permittivity, horizontal and vertical orientation angles. Experimental results demonstrate that the proposed MMI-Net achieves high estimation accuracy in these root-related parameters. This is the first work that takes the combined contributions of root parameters and spatial orientations into account and simultaneously estimates multiple root-related parameters. The data and code implemented in the paper can be found at https://haihan-sun.github.io/GPR.html., Comment: 14 pages, 12 figures

A butterfly-accelerated volume integral equation (VIE) solver is proposed for fast and accurate electromagnetic (EM) analysis of scattering from heterogeneous objects. The proposed solver leverages the hierarchical off-diagonal butterfly (HOD-BF) scheme to construct the system matrix and obtain its approximate inverse, used as a preconditioner. Complexity analysis and numerical experiments validate the $O(N\log^2N)$ construction cost of the HOD-BF-compressed system matrix and $O(N^{1.5}\log N)$ inversion cost for the preconditioner, where $N$ is the number of unknowns in the high-frequency EM scattering problem. For many practical scenarios, the proposed VIE solver requires less memory and computational time to construct the system matrix and obtain its approximate inverse compared to a $\mathcal{H}$ matrix-accelerated VIE solver. The accuracy and efficiency of the proposed solver have been demonstrated via its application to the EM analysis of large-scale canonical and real-world structures comprising of broad permittivity values and involving millions of unknowns.

This paper introduces SuperVoxHenry, an inductance extraction simulator for analyzing voxelized superconducting structures. SuperVoxHenry extends the capabilities of the inductance extractor VoxHenry for analyzing the superconducting structures by incorporating the following enhancements. 1. SuperVoxHenry utilizes a two-fluid model to account for normal currents and supercurrents. 2. SuperVoxHenry introduces the Tucker decompositions to reduce the memory requirement of circulant tensors as well as the setup time of the simulator. 3. SuperVoxHenry incorporates an aggregation-based algebraic multigrid technique to obtain the sparse preconditioner.

Tucker decomposition is proposed to reduce the memory requirement of the far-fields in the fast multipole method (FMM)-accelerated surface integral equation simulators. It is particularly used to compress the far-fields of FMM groups, which are stored in three-dimensional (3-D) arrays (or tensors). The compressed tensors are then used to perform fast tensor-vector multiplications during the aggregation and disaggregation stages of the FMM. For many practical scenarios, the proposed Tucker decomposition yields a significant reduction in the far-fields' memory requirement while dramatically accelerating the aggregation and disaggregation stages. For the electromagnetic scattering analysis of a 30{\lambda}-diameter sphere, it reduces the memory requirement of the far-fields more than 87% while it expedites the aggregation and disaggregation stages by a factor of 15.8 and 15.2, respectively, where {\lambda} is the wavelength in free space.

The horizontal orientation angle and vertical inclination angle of an elongated subsurface object are key parameters for object identification and imaging in ground penetrating radar (GPR) applications. Conventional methods can only extract the horizontal orientation angle or estimate both angles in narrow ranges due to limited polarimetric information and detection capability. To address these issues, this letter, for the first time, explores the possibility of leveraging neural networks with multi-polarimetric GPR data to estimate both angles of an elongated subsurface object in the entire spatial range. Based on the polarization-sensitive characteristic of an elongated object, we propose a multi-polarization aggregation and selection neural network (MASNet), which takes the multi-polarimetric radargrams as inputs, integrates their characteristics in the feature space, and selects discriminative features of reflected signal patterns for accurate orientation estimation. Numerical results show that our proposed MASNet achieves high estimation accuracy with an angle estimation error of less than 5{\deg}. The promising results obtained by the proposed method encourages one to think of new solutions for GPR-related tasks by integrating multi-polarization information with deep learning techniques.

A stepped frequency ground penetrating radar (GPR) system is used for detecting objects buried under high permittivity soil. Different intermediate frequency bandwidth (IFBW) of the mixing receiver is used and measurement results are compared. It is shown that the IFBW can affect the system's signal-to-noise ratio (SNR). Experimental results show that objects of different materials can clearly be detected when the appropriate IFBW is used.

In this paper, a compact dual-polarized Vivaldi antenna is presented. Four Vivaldi elements are used as radiators, and are positioned obliquely and connected in a horn shape. By exciting two sets of elements, two orthogonally polarized radiations can be achieved. The dual-polarized antenna features a low operating frequency band with a wide bandwidth, high port isolation, good directional radiation performance, and a very compact size, making it highly suitable for the ground penetrating radar (GPR) application.

Tensor decomposition methodologies are proposed to reduce the memory requirement of translation operator tensors arising in the fast multipole method-fast Fourier transform (FMM-FFT)-accelerated surface integral equation (SIE) simulators. These methodologies leverage Tucker, hierarchical Tucker (H-Tucker), and tensor train (TT) decompositions to compress the FFT'ed translation operator tensors stored in three-dimensional (3D) and four-dimensional (4D) array formats. Extensive numerical tests are performed to demonstrate the memory saving achieved by and computational overhead introduced by these methodologies for different simulation parameters. Numerical results show that the H-Tucker-based methodology for 4D array format yields the maximum memory saving while Tucker-based methodology for 3D array format introduces the minimum computational overhead. For many practical scenarios, all methodologies yield a significant reduction in the memory requirement of translation operator tensors while imposing negligible/acceptable computational overhead.

VoxCap, a fast Fourier transform (FFT)-accelerated and Tucker-enhanced integral equation simulator for capacitance extraction of voxelized structures, is proposed. The VoxCap solves the surface integral equations (SIEs) for conductor and dielectric surfaces with three key attributes that make the VoxCap highly CPU and memory efficient for the capacitance extraction of the voxelized structures: (i) VoxCap exploits the FFTs for accelerating the matrix-vector multiplications during the iterative solution of linear system of equations arising due to the discretization of SIEs. (ii) During the iterative solution, VoxCap uses a highly effective and memory-efficient preconditioner that reduces the number of iterations significantly. (iii) VoxCap employs Tucker decompositions to compress the block Toeplitz and circulant tensors, requiring the largest memory in the simulator. By doing so, it reduces the memory requirement of these tensors from hundreds of gigabytes to a few megabytes and the CPU time required to obtain Toeplitz tensors from tens of minutes (even hours) to a few seconds for very large scale problems. VoxCap is capable of accurately computing capacitance of arbitrarily shaped and large-scale voxelized structures on a desktop computer.

Computational tools for characterizing electromagnetic scattering from objects with uncertain shapes are needed in various applications ranging from remote sensing at microwave frequencies to Raman spectroscopy at optical frequencies. Often, such computational tools use the Monte Carlo (MC) method to sample a parametric space describing geometric uncertainties. For each sample, which corresponds to a realization of the geometry, a deterministic electromagnetic solver computes the scattered fields. However, for an accurate statistical characterization the number of MC samples has to be large. In this work, to address this challenge, the continuation multilevel Monte Carlo (CMLMC) method is used together with a surface integral equation solver. The CMLMC method optimally balances statistical errors due to sampling of the parametric space, and numerical errors due to the discretization of the geometry using a hierarchy of discretizations, from coarse to fine. The number of realizations of finer discretizations can be kept low, with most samples computed on coarser discretizations to minimize computational cost. Consequently, the total execution time is significantly reduced, in comparison to the standard MC scheme., Comment: 25 pages, 10 Figures