arXiv subjects

Justin Strait

Publications and source records attributed to Justin Strait.

5 recordsLinked to original sources

arXiv2026

Bootstrap-based Hypothesis Test of 2D Contours using Elastic Shape Analysis

Shapes of objects in images are often complex, high-dimensional, and vary in ways not captured by standard Euclidean geometry and statistics. Statistical shape analysis encompasses methods for flexible and interpretable measurement of intrinsic shape and shape variability in geometric objects. Elastic Shape Analysis (ESA) is one such method that measures shape differences between objects, represented by contours, in a way that is invariant to rotation, scale, translation, and parameterization. Although ESA is useful for quantifying shape of objects in many image applications, formal methods for statistical inference in image-based ESA remain limited. This work introduces a hypothesis test procedure based on empirical confidence intervals for the elastic shape distance (ESD) between a proposed underlying true shape and an estimated shape. The confidence intervals are created using a bootstrap procedure for non-smooth functionals, which accounts for the non-differentiability of the ESD. The effectiveness of the method is illustrated through both numerical studies and real world image examples from inertial confinement fusion (ICF).

stat.ME↗

arXiv2025

Robust Wrapped Gaussian Process Inference for Noisy Angular Data

Angular data are commonly encountered in settings with a directional or orientational component. Regressing an angular response on real-valued features requires intrinsically capturing the circular or spherical manifold the data lie on, or using an appropriate extrinsic transformation. A popular example of the latter is the technique of distributional wrapping, in which functions are "wrapped" around the unit circle via a modulo-$2{\pi}$ transformation. This approach enables flexible, non-linear models like Gaussian processes (GPs) to properly account for circular structure. While straightforward in concept, the need to infer the latent unwrapped distribution along with its wrapping behavior makes inference difficult in noisy response settings, as misspecification of one can severely hinder estimation of the other. However, applications such as radiowave analysis (Shangguan et al., 2015) and biomedical engineering (Kurz and Hanebeck, 2015) encounter radial data where wrapping occurs in only one direction. We therefore propose a novel wrapped GP (WGP) model formulation that recognizes monotonic wrapping behavior for more accurate inference in these situations. This is achieved by estimating the locations where wrapping occurs and partitioning the input space accordingly. We also specify a more robust Student's t response likelihood, and take advantage of an elliptical slice sampling (ESS) algorithm for rejection-free sampling from the latent GP space. We showcase our model's preferable performance on simulated examples compared to existing WGP methodologies. We then apply our method to the problem of localizing radiofrequency identification (RFID) tags, in which we model the relationship between frequency and phase angle to infer how far away an RFID tag is from an antenna.

stat.AP↗

arXiv2023

Bayesian Learning of Gas Transport in Three-Dimensional Fracture Networks

Modeling gas flow through fractures of subsurface rock is a particularly challenging problem because of the heterogeneous nature of the material. High-fidelity simulations using discrete fracture network (DFN) models are one methodology for predicting gas particle breakthrough times at the surface, but are computationally demanding. We propose a Bayesian machine learning method that serves as an efficient surrogate model, or emulator, for these three-dimensional DFN simulations. Our model trains on a small quantity of simulation data and, using a graph/path-based decomposition of the fracture network, rapidly predicts quantiles of the breakthrough time distribution. The approach, based on Gaussian Process Regression (GPR), outputs predictions that are within 20-30% of high-fidelity DFN simulation results. Unlike previously proposed methods, it also provides uncertainty quantification, outputting confidence intervals that are essential given the uncertainty inherent in subsurface modeling. Our trained model runs within a fraction of a second, which is considerably faster than other methods with comparable accuracy and multiple orders of magnitude faster than high-fidelity simulations.

physics.geo-ph↗

arXiv2019

Combining Geometric and Topological Information for Boundary Estimation

A fundamental problem in computer vision is boundary estimation, where the goal is to delineate the boundary of objects in an image. In this paper, we propose a method which jointly incorporates geometric and topological information within an image to simultaneously estimate boundaries for objects within images with more complex topologies. We use a topological clustering-based method to assist initialization of the Bayesian active contour model. This combines pixel clustering, boundary smoothness, and potential prior shape information to produce an estimated object boundary. Active contour methods are knownto be extremely sensitive to algorithm initialization, relying on the user to provide a reasonable starting curve to the algorithm. In the presence of images featuring objects with complex topological structures, such as objects with holes or multiple objects, the user must initialize separate curves for each boundary of interest. Our proposed topologically-guided method can provide an interpretable, smart initialization in these settings, freeing up the user from potential pitfalls associated with objects of complex topological structure. We provide a detailed simulation study comparing our initialization to boundary estimates obtained from standard segmentation algorithms. The method is demonstrated on artificial image datasets from computer vision, as well as real-world applications to skin lesion and neural cellular images, for which multiple topological features can be identified.

eess.IV↗

arXiv2017

Automatic Detection and Uncertainty Quantification of Landmarks on Elastic Curves

A population quantity of interest in statistical shape analysis is the location of landmarks, which are points that aid in reconstructing and representing shapes of objects. We provide an automated, model-based approach to inferring landmarks given a sample of shape data. The model is formulated based on a linear reconstruction of the shape, passing through the specified points, and a Bayesian inferential approach is described for estimating unknown landmark locations. The question of how many landmarks to select is addressed in two different ways: (1) by defining a criterion-based approach, and (2) joint estimation of the number of landmarks along with their locations. Efficient methods for posterior sampling are also discussed. We motivate our approach using several simulated examples, as well as data obtained from applications in computer vision and biology; additionally, we explore placements and associated uncertainty in landmarks for various substructures extracted from magnetic resonance image slices.

stat.AP↗