We present a novel method for the morphometric analysis of series of 3D shapes, and demonstrate its relevance for the detection and quantification of two craniofacial anomalies: trigonocephaly and metopic ridges, using CT-scans of young children. Our approach is fully automatic, and does not rely on manual landmark placement and annotations. Our approach furthermore allows to differentiate shape classes, enabling successful differential diagnosis between trigonocephaly and metopic ridges, two related conditions characterized by triangular foreheads.
View Article and Find Full Text PDFComput Graph Forum
September 2022
We propose a principled approach for non-isometric landmark-preserving non-rigid shape matching. Our method is based on the functional map framework, but rather than promoting isometries we focus on near-conformal maps that preserve landmarks exactly. We achieve this, first, by introducing a novel landmark-adapted basis using an intrinsic Dirichlet-Steklov eigenproblem.
View Article and Find Full Text PDFIEEE Trans Vis Comput Graph
July 2023
In this work, we present a novel method called WSDesc to learn 3D local descriptors in a weakly supervised manner for robust point cloud registration. Our work builds upon recent 3D CNN-based descriptor extractors, which leverage a voxel-based representation to parameterize local geometry of 3D points. Instead of using a predefined fixed-size local support in voxelization, we propose to learn the optimal support in a data-driven manner.
View Article and Find Full Text PDFUnlabelled: We introduce a novel learning-based method to recover shapes from their Laplacian spectra, based on establishing and exploring connections in a learned latent space. The core of our approach consists in a cycle-consistent module that maps between a learned latent space and sequences of eigenvalues. This module provides an efficient and effective link between the shape geometry, encoded in a latent vector, and its Laplacian spectrum.
View Article and Find Full Text PDFIEEE Trans Vis Comput Graph
September 2018
We present a novel and efficient approach for computing joint graph layouts and then use it to visualize collections of segmented meshes. Our joint graph layout algorithm takes as input the adjacency matrices for a set of graphs along with partial, possibly soft, correspondences between nodes of different graphs. We then use a two stage procedure, where in the first step, we extend spectral graph drawing to include a consistency term so that a collection of graphs can be handled jointly.
View Article and Find Full Text PDFIEEE Trans Vis Comput Graph
June 2011
We present an efficient and robust method for extracting curvature information, sharp features, and normal directions of a piecewise smooth surface from its point cloud sampling in a unified framework. Our method is integral in nature and uses convolved covariance matrices of Voronoi cells of the point cloud which makes it provably robust in the presence of noise. We show that these matrices contain information related to curvature in the smooth parts of the surface, and information about the directions and angles of sharp edges around the features of a piecewise-smooth surface.
View Article and Find Full Text PDFWe present a new framework for interactive shape deformation modeling and key frame interpolation based on a meshless finite element formulation. Starting from a coarse nodal sampling of an object's volume, we formulate rigidity and volume preservation constraints that are enforced to yield realistic shape deformations at interactive frame rates. Additionally, by specifying key frame poses of the deforming shape and optimizing the nodal displacements while targeting smooth interpolated motion, our algorithm extends to a motion planning framework for deformable objects.
View Article and Find Full Text PDF