Analysis of Imaging Internal Defects in Living Trees on Irregular Contours of Tree Trunks Using Ground-Penetrating Radar

The outer contours of living trees are often considered as a standard circle during non-destructive testing (NDT) of internal defects using ground-penetrating radar (GPR). However, the detection of classical cross-sections (circular) lacks consideration of irregular contours, making it difficult to accurately locate the radar image of the target. In this paper, we propose a method based on the image affine transformation and the Riemann mapping principle to analyze the effect of irregular detection routes on the geometric characteristics of target reflection hyperbola. First, for the similar output phenomenon in the “hyperbola fitting”, geometric analysis and numerical simulation were performed. Then, the conversion of irregular trunk radar images and physical domain radar images was implemented using the method of image affine transformation and the Riemann mapping principle. Finally, the influence of irregular detection routes on the geometry of the target reflection curve was investigated in detail through numerical simulations and actual experiments. The numerical simulation and measurement results demonstrated that the method in this study could better reflect the imaging characteristics of the target reflection hyperbola under the irregular detection pattern. This method provides assistance to further study the defects of irregular living trees and prevents the misjudgment of targets as a result of hyperbolic distortion, resulting in a greater prospect of application.

Linear variational principle for Riemann mappings and discrete conformality

We consider Riemann mappings from bounded Lipschitz domains in the plane to a triangle. We show that in this case the Riemann mapping has a linear variational principle: It is the minimizer of the Dirichlet energy over an appropriate affine space. By discretizing the variational principle in a natural way we obtain discrete conformal maps which can be computed by solving a sparse linear system. We show that these discrete conformal maps converge to the Riemann mapping in H1, even for non-Delaunay triangulations. Additionally, for Delaunay triangulations the discrete conformal maps converge uniformly and are known to be bijective. As a consequence we show that the Riemann mapping between two bounded Lipschitz domains can be uniformly approximated by composing the discrete Riemann mappings between each Lipschitz domain and the triangle.