arXiv subjects

Gary P. T. Choi

Publications and source records attributed to Gary P. T. Choi.

At least 55 records · Page 3Linked to original sources

arXiv2022

A unifying framework for $n$-dimensional quasi-conformal mappings

With the advancement of computer technology, there is a surge of interest in effective mapping methods for objects in higher-dimensional spaces. To establish a one-to-one correspondence between objects, higher-dimensional quasi-conformal theory can be utilized for ensuring the bijectivity of the mappings. In addition, it is often desirable for the mappings to satisfy certain prescribed geometric constraints and possess low distortion in conformality or volume. In this work, we develop a unifying framework for computing $n$-dimensional quasi-conformal mappings. More specifically, we propose a variational model that integrates quasi-conformal distortion, volumetric distortion, landmark correspondence, intensity mismatch and volume prior information to handle a large variety of deformation problems. We further prove the existence of a minimizer for the proposed model and devise efficient numerical methods to solve the optimization problem. We demonstrate the effectiveness of the proposed framework using various experiments in two- and three-dimensions, with applications to medical image registration, adaptive remeshing and shape modeling.

cs.CG↗

arXiv2022

Modular representation and control of floppy networks

Geometric graph models of systems as diverse as proteins, robots, and mechanical structures from DNA assemblies to architected materials point towards a unified way to represent and control them in space and time. While much work has been done in the context of characterizing the behavior of these networks close to critical points associated with bond and rigidity percolation, isostaticity, etc., much less is known about floppy, under-constrained networks that are far more common in nature and technology. Here we combine geometric rigidity and algebraic sparsity to provide a framework for identifying the zero-energy floppy modes via a representation that illuminates the underlying hierarchy and modularity of the network, and thence the control of its nestedness and locality. Our framework allows us to demonstrate a range of applications of this approach that include robotic reaching tasks with motion primitives, and predicting the linear and nonlinear response of elastic networks based solely on infinitesimal rigidity and sparsity, which we test using physical experiments. Our approach is thus likely to be of use broadly in dissecting the geometrical properties of floppy networks using algebraic sparsity to optimize their function and performance.

cs.RO↗

arXiv2021

Parallelizable global quasi-conformal parameterization of multiply-connected surfaces via partial welding

Conformal and quasi-conformal mappings have widespread applications in imaging science, computer vision and computer graphics, such as surface registration, segmentation, remeshing, and texture map compression. While various conformal and quasi-conformal parameterization methods for simply-connected surfaces have been proposed, efficient parameterization methods for multiply-connected surfaces are less explored. In this paper, we propose a novel parallelizable algorithm for computing the global conformal and quasi-conformal parameterization of multiply-connected surfaces onto a 2D circular domain using variants of the partial welding algorithm and the Koebe's iteration. The main idea is to partition a multiply-connected surface into several subdomains and compute the free-boundary conformal or quasi-conformal parameterizations of them respectively, and then apply a variant of the partial welding algorithm to reconstruct the global mapping. We apply the Koebe's iteration together with the geodesic algorithm to the boundary points and welding paths before and after the global welding to transform all the boundaries to circles conformally. After getting all the updated boundary conditions, we obtain the global parameterization of the multiply-connected surface by solving the Laplace equation for each subdomain. Using this divide-and-conquer approach, the parameterization of surfaces with very high resolution can be efficiently computed. Experimental results are presented to demonstrate the effectiveness of our proposed algorithms.

math.NA↗

arXiv2021

Learning hydrodynamic equations for active matter from particle simulations and experiments

Recent advances in high-resolution imaging techniques and particle-based simulation methods have enabled the precise microscopic characterization of collective dynamics in various biological and engineered active matter systems. In parallel, data-driven algorithms for learning interpretable continuum models have shown promising potential for the recovery of underlying partial differential equations (PDEs) from continuum simulation data. By contrast, learning macroscopic hydrodynamic equations for active matter directly from experiments or particle simulations remains a major challenge. Here, we present a framework that leverages spectral basis representations and sparse regression algorithms to discover PDE models from microscopic simulation and experimental data, while incorporating the relevant physical symmetries. We illustrate the practical potential through applications to a chiral active particle model mimicking swimming cells and to recent microroller experiments. In both cases, our scheme learns hydrodynamic equations that reproduce quantitatively the self-organized collective dynamics observed in the simulations and experiments. This inference framework makes it possible to measure a large number of hydrodynamic parameters in parallel and directly from video data.

cond-mat.soft↗

arXiv2021

Adaptive area-preserving parameterization of open and closed anatomical surfaces

The parameterization of open and closed anatomical surfaces is of fundamental importance in many biomedical applications. Spherical harmonics, a set of basis functions defined on the unit sphere, are widely used for anatomical shape description. However, establishing a one-to-one correspondence between the object surface and the entire unit sphere may induce a large geometric distortion in case the shape of the surface is too different from a perfect sphere. In this work, we propose adaptive area-preserving parameterization methods for simply-connected open and closed surfaces with the target of the parameterization being a spherical cap. Our methods optimize the shape of the parameter domain along with the mapping from the object surface to the parameter domain. The object surface will be globally mapped to an optimal spherical cap region of the unit sphere in an area-preserving manner while also exhibiting low conformal distortion. We further develop a set of spherical harmonics-like basis functions defined over the adaptive spherical cap domain, which we call the adaptive harmonics. Experimental results show that the proposed parameterization methods outperform the existing methods for both open and closed anatomical surfaces in terms of area and angle distortion. Surface description of the object surfaces can be effectively achieved using a novel combination of the adaptive parameterization and the adaptive harmonics. Our work provides a novel way of mapping anatomical surfaces with improved accuracy and greater flexibility. More broadly, the idea of using an adaptive parameter domain allows easy handling of a wide range of biomedical shapes.

cs.CG↗

arXiv2021

Spherical Cap Harmonic Analysis (SCHA) for Characterising the Morphology of Rough Surface Patches

We use spherical cap harmonic (SCH) basis functions to analyse and reconstruct the morphology of scanned genus-0 rough surface patches with open edges. We first develop a novel one-to-one conformal mapping algorithm with minimal area distortion for parameterising a surface onto a polar spherical cap with a prescribed half angle. We then show that as a generalisation of the hemispherical harmonic analysis, the SCH analysis provides the most added value for small half angles, i.e., for nominally flat surfaces where the distortion introduced by the parameterisation algorithm is smaller when the surface is projected onto a spherical cap with a small half angle than onto a hemisphere. From the power spectral analysis of the expanded SCH coefficients, we estimate a direction-independent Hurst exponent. We also estimate the wavelengths associated with the orders of the SCH basis functions from the dimensions of the first degree ellipsoidal cap. By windowing the spectral domain, we limit the bandwidth of wavelengths included in a reconstructed surface geometry. This bandlimiting can be used for modifying surfaces, such as for generating finite or discrete element meshes for contact problems. The codes and data developed in this paper are made available under the GNU LGPLv2.1 license.

cs.GR↗

arXiv2021

Wallpaper group kirigami

Kirigami, the art of paper cutting, has become a paradigm for mechanical metamaterials in recent years. The basic building blocks of any kirigami structures are repetitive deployable patterns that derive inspiration from geometric art forms and simple planar tilings. Here we complement these approaches by directly linking kirigami patterns to the symmetry associated with the set of seventeen repeating patterns that fully characterize the space of periodic tilings of the plane. We start by showing how to construct deployable kirigami patterns using any of the wallpaper groups, and then design symmetry-preserving cut patterns to achieve arbitrary size changes via deployment. We further prove that different symmetry changes can be achieved by controlling the shape and connectivity of the tiles and connect these results to the underlying kirigami-based lattice structures. All together, our work provides a systematic approach for creating a broad range of kirigami-based deployable structures with any prescribed size and symmetry properties.

cond-mat.soft↗

arXiv2021

Quasiconformal model with CNN features for large deformation image registration

Image registration has been widely studied over the past several decades, with numerous applications in science, engineering and medicine. Most of the conventional mathematical models for large deformation image registration rely on prescribed landmarks, which usually require tedious manual labeling and are prone to error. In recent years, there has been a surge of interest in the use of machine learning for image registration. In this paper, we develop a novel method for large deformation image registration by a fusion of quasiconformal theory and convolutional neural network (CNN). More specifically, we propose a quasiconformal energy model with a novel fidelity term that incorporates the features extracted using a pre-trained CNN, thereby allowing us to obtain meaningful registration results without any guidance of prescribed landmarks. Moreover, unlike many prior image registration methods, the bijectivity of our method is guaranteed by quasiconformal theory. Experimental results are presented to demonstrate the effectiveness of the proposed method. More broadly, our work sheds light on how rigorous mathematical theories and practical machine learning approaches can be integrated for developing computational methods with improved performance.

cs.CV↗

arXiv2021

Free-boundary conformal parameterization of point clouds

With the advancement in 3D scanning technology, there has been a surge of interest in the use of point clouds in science and engineering. To facilitate the computations and analyses of point clouds, prior works have considered parameterizing them onto some simple planar domains with a fixed boundary shape such as a unit circle or a rectangle. However, the geometry of the fixed shape may lead to some undesirable distortion in the parameterization. It is therefore more natural to consider free-boundary conformal parameterizations of point clouds, which minimize the local geometric distortion of the mapping without constraining the overall shape. In this work, we develop a free-boundary conformal parameterization method for disk-type point clouds, which involves a novel approximation scheme of the point cloud Laplacian with accumulated cotangent weights together with a special treatment at the boundary points. With the aid of the free-boundary conformal parameterization, high-quality point cloud meshing can be easily achieved. Furthermore, we show that using the idea of conformal welding in complex analysis, the point cloud conformal parameterization can be computed in a divide-and-conquer manner. Experimental results are presented to demonstrate the effectiveness of the proposed method.

cs.CG↗

arXiv2021

Efficient conformal parameterization of multiply-connected surfaces using quasi-conformal theory

Conformal mapping, a classical topic in complex analysis and differential geometry, has become a subject of great interest in the area of surface parameterization in recent decades with various applications in science and engineering. However, most of the existing conformal parameterization algorithms only focus on simply-connected surfaces and cannot be directly applied to surfaces with holes. In this work, we propose two novel algorithms for computing the conformal parameterization of multiply-connected surfaces. We first develop an efficient method for conformally parameterizing an open surface with one hole to an annulus on the plane. Based on this method, we then develop an efficient method for conformally parameterizing an open surface with $k$ holes onto a unit disk with $k$ circular holes. The conformality and bijectivity of the mappings are ensured by quasi-conformal theory. Numerical experiments and applications are presented to demonstrate the effectiveness of the proposed methods.

cs.GR↗

arXiv2021

An additive algorithm for origami design

Inspired by the allure of additive fabrication, we pose the problem of origami design from a new perspective: how can we grow a folded surface in three dimensions from a seed so that it is guaranteed to be isometric to the plane? We solve this problem in two steps: by first identifying the geometric conditions for the compatible completion of two separate folds into a single developable four-fold vertex, and then showing how this foundation allows us to grow a geometrically compatible front at the boundary of a given folded seed. This yields a complete marching, or additive, algorithm for the inverse design of the complete space of developable quad origami patterns that can be folded from flat sheets. We illustrate the flexibility of our approach by growing ordered, disordered, straight and curved folded origami and fitting surfaces of given curvature with folded approximants. Overall, our simple shift in perspective from a global search to a local rule has the potential to transform origami-based meta-structure design.

cond-mat.soft↗

arXiv2020

Compact reconfigurable kirigami

Kirigami involves cutting a flat, thin sheet that allows it to morph from a closed, compact configuration into an open deployed structure via coordinated rotations of the internal tiles. By recognizing and generalizing the geometric constraints that enable this art form, we propose a design framework for compact reconfigurable kirigami patterns, which can morph from a closed and compact configuration into a deployed state conforming to any prescribed target shape, and subsequently be contracted into a different closed and compact configuration. We further establish a condition for producing kirigami patterns which are reconfigurable and rigid deployable allowing us to connect the compact states via a zero-energy family of deployed states. All together, our inverse design framework lays out a new path for the creation of shape-morphing material structures.

cond-mat.soft↗

arXiv2020

Self-excited motions of volatile drops on swellable sheets

When a volatile droplet is deposited on a floating swellable sheet, it becomes asymmetric, lobed and mobile. We describe and quantify this phenomena that involves nonequilibrium swelling, evaporation and motion, working together to realize a self-excitable spatially extended oscillator. Solvent penetration causes the film to swell locally and eventually buckle, changing its shape and the drop responds by moving. Simultaneously, solvent evaporation from the swollen film causes it to regain its shape once the droplet has moved away. The process repeats and leads to complex pulsatile spinning and/or sliding movements. We use a one-dimensional experiment to highlight the slow swelling of and evaporation from the film and the fast motion of the drop, a characteristic of excitable systems. Finally, we provide a phase diagram for droplet excitability as a function of drop size and film thickness and scaling laws for the motion of the droplet.

cond-mat.soft↗

arXiv2020

Control of connectivity and rigidity in prismatic assemblies

How can we manipulate the topological connectivity of a three-dimensional prismatic assembly to control the number of internal degrees of freedom and the number of connected components in it? To answer this question in a deterministic setting, we use ideas from elementary number theory to provide a hierarchical deterministic protocol for the control of rigidity and connectivity. We then show that is possible to also use a stochastic protocol to achieve the same results via a percolation transition. Together, these approaches provide scale-independent algorithms for the cutting or gluing of three-dimensional prismatic assemblies to control their overall connectivity and rigidity.

cond-mat.soft↗

arXiv2020

Efficient Feature-based Image Registration by Mapping Sparsified Surfaces

With the advancement in the digital camera technology, the use of high resolution images and videos has been widespread in the modern society. In particular, image and video frame registration is frequently applied in computer graphics and film production. However, conventional registration approaches usually require long computational time for high resolution images and video frames. This hinders the application of the registration approaches in the modern industries. In this work, we first propose a new image representation method to accelerate the registration process by triangulating the images effectively. For each high resolution image or video frame, we compute an optimal coarse triangulation which captures the important features of the image. Then, we apply a surface registration algorithm to obtain a registration map which is used to compute the registration of the high resolution image. Experimental results suggest that our overall algorithm is efficient and capable to achieve a high compression rate while the accuracy of the registration is well retained when compared with the conventional grid-based approach. Also, the computational time of the registration is significantly reduced using our triangulation-based approach.

cs.GR↗

arXiv2020

Volumetric density-equalizing reference map with applications

The density-equalizing map, a technique developed for cartogram creation, has been widely applied to data visualization but only for 2D applications. In this work, we propose a novel method called the volumetric density-equalizing reference map (VDERM) for computing density-equalizing map for volumetric domains. Given a prescribed density distribution in a volumetric domain in $\mathbb{R}^3$, the proposed method continuously deforms the domain, with different volume elements enlarged or shrunk according to the density distribution. With the aid of the proposed method, medical and sociological data can be visualized via deformations of 3D objects. The method can also be applied to adaptive remeshing and shape modeling. Furthermore, by exploiting the time-dependent nature of the proposed method, applications to shape morphing can be easily achieved. Experimental results are presented to demonstrate the effectiveness of the proposed method.

math.NA↗

arXiv2020

Shape analysis via inconsistent surface registration

In this work, we develop a framework for shape analysis using inconsistent surface mapping. Traditional landmark-based geometric morphometrics methods suffer from the limited degrees of freedom, while most of the more advanced non-rigid surface mapping methods rely on a strong assumption of the global consistency of two surfaces. From a practical point of view, given two anatomical surfaces with prominent feature landmarks, it is more desirable to have a method that automatically detects the most relevant parts of the two surfaces and finds the optimal landmark-matching alignment between those parts, without assuming any global 1-1 correspondence between the two surfaces. Our method is capable of solving this problem using inconsistent surface registration based on quasi-conformal theory. It further enables us to quantify the dissimilarity of two shapes using quasi-conformal distortion and differences in mean and Gaussian curvatures, thereby providing a natural way for shape classification. Experiments on Platyrrhine molars demonstrate the effectiveness of our method and shed light on the interplay between function and shape in nature.

cs.CG↗

arXiv2020

Deterministic and stochastic control of kirigami topology

Kirigami, the creative art of paper cutting, is a promising paradigm for mechanical metamaterials. However, to make kirigami-inspired structures a reality requires controlling the topology of kirigami to achieve connectivity and rigidity. We address this question by deriving the maximum number of cuts (minimum number of links) that still allow us to preserve global rigidity and connectivity of the kirigami. A deterministic hierarchical construction method yields an efficient topological way to control both the number of connected pieces and the total degrees of freedom. A statistical approach to the control of rigidity and connectivity in kirigami with random cuts complements the deterministic pathway, and shows that both the number of connected pieces and the degrees of freedom show percolation transitions as a function of the density of cuts (links). Together this provides a general framework for the control of rigidity and connectivity in planar kirigami.

cond-mat.soft↗