We propose a new method to obtain landmark-matching transformations between n-dimensional Euclidean spaces with large deformations. Given a set of feature correspondences, our algorithm searches for an optimal folding-free mapping that satisfies the prescribed landmark constraints. The standard conformality distortion defined for mappings between 2-dimensional spaces is first generalized to the n-dimensional conformality distortion K(f) for a mapping f between n-dimensional Euclidean spaces (n≥3). We then propose a variational model involving K(f) to tackle the landmark-matching problem in higher dimensional spaces. The generalized conformality term K(f) enforces the bijectivity of the optimized mapping and minimizes its local geometric distortions even with large deformations. Another challenge is the high computational cost of the proposed model. To tackle this, we have also proposed a numerical method to solve the optimization problem more efficiently. Alternating direction method with multiplier (ADMM) is applied to split the optimization problem into two subproblems. Preconditioned conjugate gradient method with multi-grid preconditioner is applied to solve one of the sub-problems, while a fixed-point iteration is proposed to solve another subproblem. Experiments have been carried out on both synthetic examples and lung CT images to compute the diffeomorphic landmark-matching transformation with different landmark constraints. Results show the efficacy of our proposed model to obtain a folding-free landmark-matching transformation between n-dimensional spaces with large deformations.
Alzheimer's disease (AD) is a no-cure disease that has been frustrating the scientists for many years. Analyzing the disease has become an important but challenging research topic. The shape analysis of the sub-cortical structure of AD patients has been commonly used to understand this disease. In this paper, we assess the feasibility of using shape information on the hippocampal (HP) surfaces to detect some sub-structural changes in AD patients. We propose a quasi-conformal statistical shape analysis model, which allows us to study local regional geometric changes in the HPs amongst normal control (NC) and AD groups. A shape index defined by the quasi-conformality and surface curvatures is used to characterize region-specific shape variations of the HP surfaces. Feature vectors can be extracted for each HPs, with which a classification model can be built using machine learning methods to classify HPs into NC and AD subjects. Experiments have been carried out on 99 normal controls and 41 patients with AD. Results demonstrate that the proposed quasi-conformal based model is effective for classifying HPs into NC and AD groups with high classification accuracy (with highest overall classification accuracy reaching 87.86% in a leave-one-out experiment using the whole dataset).
Point cloud is the most fundamental representation of 3D geometric objects as it provides the most exact information of them. Analyzing and processing point cloud surfaces is important in computer graphics and computer vision. However, most of the existing algorithms for surface analysis require connectivity information. Therefore, it is desirable to develop a mesh structure on point clouds. This task can be simplified with the aid of a parameterization. In particular, conformal parameterizations are advantageous in preserving the geometric information of the point cloud data. In this paper, we extend a state-of-the-art spherical conformal parameterization algorithm for genus-0 closed meshes to the case of point clouds, using an improved approximation of the Laplace-Beltrami operator on data points. Then, we propose an iterative scheme called the North-South reiteration for achieving a spherical conformal parameterization. A balancing scheme is introduced to enhance the distribution of the spherical parameterization. High quality triangulations and quadrangulations can then be built on the point clouds with the aid of the parameterizations. Also, the meshes generated are guaranteed to be genus-0 closed meshes. Moreover, using our proposed spherical conformal parameterization, multilevel representations of point clouds can be easily constructed. Experimental results demonstrate the effectiveness of our proposed framework.
In this paper we show that stability for holomorphic vector bundles are equivalent to the existence of solutions to certain system of Monge Ampere equations parametrized by a parameter k. We solve this fully nonlinear elliptic system by singular perturbation technique and show that the vanishing of obstructions for the perturbation is given precisely by the stability condition. This can be interpreted as an infinite dimensional analog of the equivalencybetween Geometric Invariant Theory and Symplectic Reduction for moduli space of vector bundles.
Aichholzer O, Aigner W, Aurenhammer F, et al. Medial axis computation for planar free-form shapes[J]. Computer-aided Design, 2009, 41(5): 339-349.
Kim D, Cho Y, Sugihara K, et al. Quasi-worlds and quasi-operators on quasi-triangulations[J]. Computer-aided Design, 2010, 42(10): 874-888.
Martin Held · Stefan Huber. Topology-oriented incremental computation of Voronoi diagrams of circular arcs and straight-line segments. 2009.
Luo C, Anjos M F, Vannelli A, et al. Large-scale fixed-outline floorplanning design using convex optimization techniques[C]. asia and south pacific design automation conference, 2008: 198-203.
Voiculescu O, Bodenstein L, Lau I, et al. Local cell interactions and self-amplifying individual cell ingression drive amniote gastrulation[J]. eLife, 2014.
Lin J L, Hung Z. UFO: Unified Convex Optimization Algorithms for Fixed-Outline Floorplanning Considering Pre-Placed Modules[J]. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2011, 30(7): 1034-1044.
Held M. Vroni and ArcVroni: Software for and Applications of Voronoi Diagrams in Science and Engineering[C]., 2011: 3-12.
Setter O, Sharir M, Halperin D, et al. Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space[C]., 2009: 43-52.
Nilforoushan Z, Mohades A, Rezaii M M, et al. 3D hyperbolic Voronoi diagrams[J]. Computer-aided Design, 2010, 42(9): 759-767.
Smogavec G, Alik B. A fast algorithm for constructing approximate medial axis of polygons, using Steiner points[J]. Advances in Engineering Software, 2012: 1-9.
Presented in this paper is a sweepline algorithm to compute the Voronoi diagram of a set of circles in a two-dimensional Euclidean space. The radii of the circles are non-negative and not necessarily equal. It is allowed that circles intersect each other, and a circle contains others. The proposed algorithm constructs the correct Voronoi diagram as a sweepline moves on the plane from top to bottom. While moving on the plane, the sweepline stops only at certain event points where the topology changes occur for the Voronoi diagram being constructed. The worst-case time complexity of the proposed algorithm is $O((n+m)log n)$, where $n$ is the number of input circles, and $m$ is the number of intersection points among circles. As $m$ can be $O(n^22)$, the presented algorithm is optimal with $O(n^2 log n) $ worst-case time complexity.