Locally Adaptive Frames in the Roto-Translation Group and their Applications in Medical Imaging

Locally adaptive differential frames (gauge frames) are a well-known effective tool in image analysis, used in differential invariants and PDE-flows. However, at complex structures such as crossings or junctions, these frames are not well-defined. Therefore, we generalize the notion of gauge frames on images to gauge frames on data representations $U:\mathbb{R}^{d} \rtimes S^{d-1} \to \mathbb{R}$ defined on the extended space of positions and orientations, which we relate to data on the roto-translation group $SE(d)$, $d=2,3$. This allows to define multiple frames per position, one per orientation. We compute these frames via exponential curve fits in the extended data representations in $SE(d)$. These curve fits minimize first or second order variational problems which are solved by spectral decomposition of, respectively, a structure tensor or Hessian of data on $SE(d)$. We include these gauge frames in differential invariants and crossing preserving PDE-flows acting on extended data representation $U$ and we show their advantage compared to the standard left-invariant frame on $SE(d)$. Applications include crossing-preserving filtering and improved segmentations of the vascular tree in retinal images, and new 3D extensions of coherence-enhancing diffusion via invertible orientation scores

Time-frequency analysis of the restricted three-body problem: transport and resonance transitions

A method of time-frequency analysis based on wavelets is applied to the problem of transport between different regions of the solar system, using the model of the circular restricted three-body problem in both the planar and the spatial versions of the problem.. The method is based on the extraction of instantaneous frequencies from the wavelet transform of numerical solutions. Time-varying frequencies provide a good diagnostic tool to discern chaotic trajectories from regular ones, and we can identify resonance islands that greatly affect the dynamics. Good accuracy in the calculation of time-varying frequencies allows us to determine resonance trappings of chaotic trajectories and resonance transitions. We show the relation between resonance transitions and transport in different regions of the phase space

Principal Component Analysis of the Time- and Position-Dependent Point Spread Function of the Advanced Camera for Surveys

We describe the time- and position-dependent point spread function (PSF) variation of the Wide Field Channel (WFC) of the Advanced Camera for Surveys (ACS) with the principal component analysis (PCA) technique. The time-dependent change is caused by the temporal variation of the $HST$ focus whereas the position-dependent PSF variation in ACS/WFC at a given focus is mainly the result of changes in aberrations and charge diffusion across the detector, which appear as position-dependent changes in elongation of the astigmatic core and blurring of the PSF, respectively. Using >400 archival images of star cluster fields, we construct a ACS PSF library covering diverse environments of the $HST$ observations (e.g., focus values). We find that interpolation of a small number ($\sim20$) of principal components or ``eigen-PSFs'' per exposure can robustly reproduce the observed variation of the ellipticity and size of the PSF. Our primary interest in this investigation is the application of this PSF library to precision weak-lensing analyses, where accurate knowledge of the instrument's PSF is crucial. However, the high-fidelity of the model judged from the nice agreement with observed PSFs suggests that the model is potentially also useful in other applications such as crowded field stellar photometry, galaxy profile fitting, AGN studies, etc., which similarly demand a fair knowledge of the PSFs at objects' locations. Our PSF models, applicable to any WFC image rectified with the Lanczos3 kernel, are publicly available.Comment: Accepted to PASP. To appear in December issue. Figures are degraded to meet the size limit. High-resolution version can be downloaded at http://acs.pha.jhu.edu/~mkjee/acs_psf/acspsf.pd

Extraction of coherent structures in a rotating turbulent flow experiment

The discrete wavelet packet transform (DWPT) and discrete wavelet transform (DWT) are used to extract and study the dynamics of coherent structures in a turbulent rotating fluid. Three-dimensional (3D) turbulence is generated by strong pumping through tubes at the bottom of a rotating tank (48.4 cm high, 39.4 cm diameter). This flow evolves toward two-dimensional (2D) turbulence with increasing height in the tank. Particle Image Velocimetry (PIV) measurements on the quasi-2D flow reveal many long-lived coherent vortices with a wide range of sizes. The vorticity fields exhibit vortex birth, merger, scattering, and destruction. We separate the flow into a low-entropy ``coherent'' and a high-entropy ``incoherent'' component by thresholding the coefficients of the DWPT and DWT of the vorticity fields. Similar thresholdings using the Fourier transform and JPEG compression together with the Okubo-Weiss criterion are also tested for comparison. We find that the DWPT and DWT yield similar results and are much more efficient at representing the total flow than a Fourier-based method. Only about 3% of the large-amplitude coefficients of the DWPT and DWT are necessary to represent the coherent component and preserve the vorticity probability density function, transport properties, and spatial and temporal correlations. The remaining small amplitude coefficients represent the incoherent component, which has near Gaussian vorticity PDF, contains no coherent structures, rapidly loses correlation in time, and does not contribute significantly to the transport properties of the flow. This suggests that one can describe and simulate such turbulent flow using a relatively small number of wavelet or wavelet packet modes.Comment: experimental work aprox 17 pages, 11 figures, accepted to appear in PRE, last few figures appear at the end. clarifications, added references, fixed typo

An Emergent Space for Distributed Data with Hidden Internal Order through Manifold Learning

Manifold-learning techniques are routinely used in mining complex spatiotemporal data to extract useful, parsimonious data representations/parametrizations; these are, in turn, useful in nonlinear model identification tasks. We focus here on the case of time series data that can ultimately be modelled as a spatially distributed system (e.g. a partial differential equation, PDE), but where we do not know the space in which this PDE should be formulated. Hence, even the spatial coordinates for the distributed system themselves need to be identified - to emerge from - the data mining process. We will first validate this emergent space reconstruction for time series sampled without space labels in known PDEs; this brings up the issue of observability of physical space from temporal observation data, and the transition from spatially resolved to lumped (order-parameter-based) representations by tuning the scale of the data mining kernels. We will then present actual emergent space discovery illustrations. Our illustrative examples include chimera states (states of coexisting coherent and incoherent dynamics), and chaotic as well as quasiperiodic spatiotemporal dynamics, arising in partial differential equations and/or in heterogeneous networks. We also discuss how data-driven spatial coordinates can be extracted in ways invariant to the nature of the measuring instrument. Such gauge-invariant data mining can go beyond the fusion of heterogeneous observations of the same system, to the possible matching of apparently different systems

Geometric deep learning: going beyond Euclidean data

Many scientific fields study data with an underlying structure that is a non-Euclidean space. Some examples include social networks in computational social sciences, sensor networks in communications, functional networks in brain imaging, regulatory networks in genetics, and meshed surfaces in computer graphics. In many applications, such geometric data are large and complex (in the case of social networks, on the scale of billions), and are natural targets for machine learning techniques. In particular, we would like to use deep neural networks, which have recently proven to be powerful tools for a broad range of problems from computer vision, natural language processing, and audio analysis. However, these tools have been most successful on data with an underlying Euclidean or grid-like structure, and in cases where the invariances of these structures are built into networks used to model them. Geometric deep learning is an umbrella term for emerging techniques attempting to generalize (structured) deep neural models to non-Euclidean domains such as graphs and manifolds. The purpose of this paper is to overview different examples of geometric deep learning problems and present available solutions, key difficulties, applications, and future research directions in this nascent field