Explore the vast range of titles available.

This paper introduces a set of numerical methods for Riemannian shape analysis of 3D surfaces within the setting of invariant (elastic) second-order Sobolev metrics. More specifically, we address the computation of geodesics and geodesic distances between parametrized or unparametrized immersed surfaces represented as 3D meshes. Building on this, we develop tools for the statistical shape analysis of sets of surfaces, including methods for estimating Karcher means and performing tangent PCA on shape populations, and for computing parallel transport along paths of surfaces. Our proposed approach fundamentally relies on a relaxed variational formulation for the geodesic matching problem via the use of varifold fidelity terms, which enable us to enforce reparametrization independence when computing geodesics between unparametrized surfaces, while also yielding versatile algorithms that allow us to compare surfaces with varying sampling or mesh structures. Importantly, we demonstrate how our relaxed variational framework can be extended to tackle partially observed data. The different benefits of our numerical pipeline are illustrated over various examples, synthetic and real.

Recovering high-fidelity images of the night sky from blurred observations is a fundamental problem in astronomy, where traditional methods typically fall short. In ground-based astronomy, combining multiple exposures to enhance signal-to-noise ratios is further complicated by variations in the point-spread function caused by atmospheric turbulence. In this work, we present a self-supervised multi-frame method, based on deep image priors, for denoising, deblurring, and coadding ground-based exposures. Central to our approach is a carefully designed convolutional neural network that integrates information across multiple observations and enforces physically motivated constraints. We demonstrate the method's potential by processing Hyper Suprime-Cam exposures, yielding promising preliminary results with sharper restored images.

A key processing step in ground-based astronomy involves combining multiple noisy and blurry exposures to produce an image of the night sky with an improved signal-to-noise ratio. Typically, this is achieved via image coaddition, and can be undertaken such that the resulting night sky image has enhanced spatial resolution. Yet, this task remains a formidable challenge despite decades of advancements. In this paper, we introduce ImageMM: a new framework based on the majorization-minimization (MM) algorithm for joint multi-frame astronomical image restoration and super-resolution. ImageMM uses multiple registered astronomical exposures to produce a nonparametric latent image of the night sky, prior to the atmosphere's impact on the observed exposures. Our framework also features a novel variational approach to compute refined point-spread functions of arbitrary resolution for the restoration and super-resolution procedure. Our algorithms, implemented in TensorFlow, leverage graphics processing unit acceleration to produce latent images in near real time, even when processing high-resolution exposures. We tested ImageMM on Hyper Suprime-Cam (HSC) exposures, which are a precursor of the upcoming imaging data from the Rubin Observatory. The results are encouraging: ImageMM produces sharp latent images, in which spatial features of bright sources are revealed in unprecedented detail (e.g., showing the structure of spiral galaxies), and where faint sources that are usually indistinguishable from the noisy sky background also become discernible, thus pushing the detection limits. Moreover, aperture photometry performed on the HSC pipeline coadd and ImageMM's latent images yielded consistent source detection and flux measurements, thereby demonstrating ImageMM's suitability for cutting-edge photometric studies with state-of-the-art astronomical imaging data.

We present a computationally efficient expectation-maximization framework for multi-frame image deconvolution and super-resolution. Our method is well adapted for processing large scale imaging data from modern astronomical surveys. Our Tensorflow implementation is flexible, benefits from advanced algorithmic solutions, and allows users to seamlessly leverage Graphical Processing Unit (GPU) acceleration, thus making it viable for use in modern astronomical software pipelines. The testbed for our method is a set of \\(4\\)K by \\(4\\)K Hyper Suprime-Cam exposures, which are closest in terms of quality to imaging data from the upcoming Rubin Observatory. The preliminary results are extremely promising: our method produces a high-fidelity non-parametric reconstruction of the night sky, from which we recover unprecedented details such as the shape of the spiral arms of galaxies, while also managing to deconvolve stars perfectly into essentially single pixels.

This paper introduces a new extension of Riemannian elastic curve matching to a general class of geometric structures, which we call (weighted) shape graphs, that allows for shape registration with partial matching constraints and topological inconsistencies. Weighted shape graphs are the union of an arbitrary number of component curves in Euclidean space with potential connectivity constraints between some of their boundary points, together with a weight function defined on each component curve. The framework of higher order invariant Sobolev metrics is particularly well suited for constructing notions of distances and geodesics between unparametrized curves. The main difficulty in adapting this framework to the setting of shape graphs is the absence of topological consistency, which typically results in an inadequate search for an exact matching between two shape graphs. We overcome this hurdle by defining an inexact variational formulation of the matching problem between (weighted) shape graphs of any underlying topology, relying on the convenient measure representation given by varifolds to relax the exact matching constraint. We then prove the existence of minimizers to this variational problem when we choose Sobolev metrics of sufficient regularity and a total variation (TV) regularization on the weight function. We propose a numerical optimization approach which adapts the smoothed fast iterative shrinkage-thresholding (SFISTA) algorithm to deal with TV norm minimization and allows us to reduce the matching problem to solving a sequence of smooth unconstrained minimization problems. We finally illustrate the capabilities of our new model through several examples showcasing its ability to tackle partially observed and topologically varying data.

Morphological variations in the left atrial appendage (LAA) are associated with different levels of ischemic stroke risk for patients with atrial fibrillation (AF). Studying LAA morphology can elucidate mechanisms behind this association and lead to the development of advanced stroke risk stratification tools. However, current categorical descriptions of LAA morphologies are qualitative in nature, and inconsistent across studies, which impedes advancements in our understanding of stroke pathogenesis in AF. To mitigate these issues, we introduce a quantitative pipeline that combines elastic shape analysis with unsupervised learning for the categorization of LAA morphology in AF patients. We demonstrate that our method reliably clusters LAAs based on their geometric features, and thus provides an avenue to overcome the limitations of current qualitative LAA categorization systems.Morphological variations in the left atrial appendage (LAA) are associated with different levels of ischemic stroke risk for patients with atrial fibrillation (AF). Studying LAA morphology can elucidate mechanisms behind this association and lead to the development of advanced stroke risk stratification tools. However, current categorical descriptions of LAA morphologies are qualitative in nature, and inconsistent across studies, which impedes advancements in our understanding of stroke pathogenesis in AF. To mitigate these issues, we introduce a quantitative pipeline that combines elastic shape analysis with unsupervised learning for the categorization of LAA morphology in AF patients. We demonstrate that our method reliably clusters LAAs based on their geometric features, and thus provides an avenue to overcome the limitations of current qualitative LAA categorization systems.

Recovering sharper images from blurred observations, referred to as deconvolution, is an ill-posed problem where classical approaches often produce unsatisfactory results. In ground-based astronomy, combining multiple exposures to achieve images with higher signal-to-noise ratios is complicated by the variation of point-spread functions across exposures due to atmospheric effects. We develop an unsupervised multi-frame method for denoising, deblurring, and coadding images inspired by deep generative priors. We use a carefully chosen convolutional neural network architecture that combines information from multiple observations, regularizes the joint likelihood over these observations, and allows us to impose desired constraints, such as non-negativity of pixel values in the sharp, restored image. With an eye towards the Rubin Observatory, we analyze 4K by 4K Hyper Suprime-Cam exposures and obtain preliminary results which yield promising restored images and extracted source lists.

This paper introduces a set of numerical methods for Riemannian shape analysis of 3D surfaces within the setting of invariant (elastic) second-order Sobolev metrics. More specifically, we address the computation of geodesics and geodesic distances between parametrized or unparametrized immersed surfaces represented as 3D meshes. Building on this, we develop tools for the statistical shape analysis of sets of surfaces, including methods for estimating Karcher means and performing tangent PCA on shape populations, and for computing parallel transport along paths of surfaces. Our proposed approach fundamentally relies on a relaxed variational formulation for the geodesic matching problem via the use of varifold fidelity terms, which enable us to enforce reparametrization independence when computing geodesics between unparametrized surfaces, while also yielding versatile algorithms that allow us to compare surfaces with varying sampling or mesh structures. Importantly, we demonstrate how our relaxed variational framework can be extended to tackle partially observed data. The different benefits of our numerical pipeline are illustrated over various examples, synthetic and real.

This paper introduces a new mathematical formulation and numerical approach for the computation of distances and geodesics between immersed planar curves. Our approach combines the general simplifying transform for first-order elastic metrics that was recently introduced by Kurtek and Needham, together with a relaxation of the matching constraint using parametrization-invariant fidelity metrics. The main advantages of this formulation are that it leads to a simple optimization problem for discretized curves, and that it provides a flexible approach to deal with noisy, inconsistent or corrupted data. These benefits are illustrated via a few preliminary numerical results.

Motivated by applications from computer vision to bioinformatics, the field of shape analysis deals with problems where one wants to analyze geometric objects, such as curves, while ignoring actions that preserve their shape, such as translations, rotations, or reparametrizations. Mathematical tools have been developed to define notions of distances, averages, and optimal deformations for geometric objects. One such framework, which has proven to be successful in many applications, is based on the square root velocity (SRV) transform, which allows one to define a computable distance between spatial curves regardless of how they are parametrized. This paper introduces a supervised deep learning framework for the direct computation of SRV distances between curves, which usually requires an optimization over the group of reparametrizations that act on the curves. The benefits of our approach in terms of computational speed and accuracy are illustrated via several numerical experiments.