From 3D Point Clouds to Pose-Normalised Depth Maps

We consider the problem of generating either pairwise-aligned or pose-normalised depth maps from noisy 3D point clouds in a relatively unrestricted poses. Our system is deployed in a 3D face alignment application and consists of the following four stages: (i) data filtering, (ii) nose tip identification and sub-vertex localisation, (iii) computation of the (relative) face orientation, (iv) generation of either a pose aligned or a pose normalised depth map. We generate an implicit radial basis function (RBF) model of the facial surface and this is employed within all four stages of the process. For example, in stage (ii), construction of novel invariant features is based on sampling this RBF over a set of concentric spheres to give a spherically-sampled RBF (SSR) shape histogram. In stage (iii), a second novel descriptor, called an isoradius contour curvature signal, is defined, which allows rotational alignment to be determined using a simple process of 1D correlation. We test our system on both the University of York (UoY) 3D face dataset and the Face Recognition Grand Challenge (FRGC) 3D data. For the more challenging UoY data, our SSR descriptors significantly outperform three variants of spin images, successfully identifying nose vertices at a rate of 99.6%. Nose localisation performance on the higher quality FRGC data, which has only small pose variations, is 99.9%. Our best system successfully normalises the pose of 3D faces at rates of 99.1% (UoY data) and 99.6% (FRGC data)

Three-dimensional quantitative evaluation method of nonrigid registration algorithms for adaptive radiotherapy

Purpose: Current radiotherapy is progressing to the concept of adaptive radiotherapy, which implies the adaptation of planning along the treatment course. Nonrigid registration is an essential image processing tool for adaptive radiotherapy and image guided radiotherapy, and the three-dimensional (3D) nature of the current radiotherapy techniques requires a 3D quantification of the registration error that existing evaluation methods do not cover appropriately. The authors present a method for 3D evaluation of nonrigid registration algorithms’ performance, based on organ delineations, capable of working with near-spherical volumes even in the presence of concavities. Methods: The evaluation method is composed by a volume shape description stage, developed using a new ad hoc volume reconstruction algorithm proposed by the authors, and an error quantification stage. The evaluation method is applied to the organ delineations of prostate and seminal vesicles, obtained by an automatic segmentation method over images of prostate cancer patients treated with intensity modulated radiation therapy. Results: The volume reconstruction algorithm proposed has been shown to accurately model complex 3D surfaces by the definition of clusters of control points. The quantification method, inspired by the Haussdorf–Chebysev distance, provides a measure of the largest registration error per control direction, defining a valid metric for concave-convex volumes. Summarizing, the proposed evaluation methodology presents accurate results with a high spatial resolution in a negligible computation time in comparison with the nonrigid registration time. Conclusions: Experimental results show that the metric selected for quantifying the registration error is of utmost importance in a quantitative evaluation based on measuring distances between volumes. The accuracy of the volume reconstruction algorithm is not so relevant as long as the reconstruction is tight enough on the actual volume of the organ. The new evaluation method provides a smooth and accurate volume reconstruction for both the reference and the registered organ, and a complete 3D description of nonrigid registration algorithms’ performance, resulting in a useful tool for study and comparison of registration algorithms for adaptive radiotherapy

Minkowski Tensors of Anisotropic Spatial Structure

This article describes the theoretical foundation of and explicit algorithms for a novel approach to morphology and anisotropy analysis of complex spatial structure using tensor-valued Minkowski functionals, the so-called Minkowski tensors. Minkowski tensors are generalisations of the well-known scalar Minkowski functionals and are explicitly sensitive to anisotropic aspects of morphology, relevant for example for elastic moduli or permeability of microstructured materials. Here we derive explicit linear-time algorithms to compute these tensorial measures for three-dimensional shapes. These apply to representations of any object that can be represented by a triangulation of its bounding surface; their application is illustrated for the polyhedral Voronoi cellular complexes of jammed sphere configurations, and for triangulations of a biopolymer fibre network obtained by confocal microscopy. The article further bridges the substantial notational and conceptual gap between the different but equivalent approaches to scalar or tensorial Minkowski functionals in mathematics and in physics, hence making the mathematical measure theoretic method more readily accessible for future application in the physical sciences

Simulation of pore-scale flow using finite element-methods

I present a new finite element (FE) simulation method to simulate pore-scale flow. Within the pore-space, I solve a simplified form of the incompressible Navier-Stoke’s equation, yielding the velocity field in a two-step solution approach. First, Poisson’s equation is solved with homogeneous boundary conditions, and then the pore pressure is computed and the velocity field obtained for no slip conditions at the grain boundaries. From the computed velocity field I estimate the effective permeability of porous media samples characterized by thin section micrographs, micro-CT scans and synthetically generated grain packings. This two-step process is much simpler than solving the full Navier Stokes equation and therefore provides the opportunity to study pore geometries with hundreds of thousands of pores in a computationally more cost effective manner than solving the full Navier-Stoke’s equation. My numerical model is verified with an analytical solution and validated on samples whose permeabilities and porosities had been measured in laboratory experiments (Akanji and Matthai, 2010). Comparisons were also made with Stokes solver, published experimental, approximate and exact permeability data. Starting with a numerically constructed synthetic grain packings, I also investigated the extent to which the details of pore micro-structure affect the hydraulic permeability (Garcia et al., 2009). I then estimate the hydraulic anisotropy of unconsolidated granular packings. With the future aim to simulate multiphase flow within the pore-space, I also compute the radii and derive capillary pressure from the Young-Laplace equation (Akanji and Matthai,2010

Software Extensions to UCSF Chimera for Interactive Visualization of Large Molecular Assemblies

SummaryMany structures of large molecular assemblies such as virus capsids and ribosomes have been experimentally determined to atomic resolution. We consider four software problems that arise in interactive visualization and analysis of large assemblies: how to represent multimers efficiently, how to make cartoon representations, how to calculate contacts efficiently, and how to select subassemblies. We describe techniques and algorithms we have developed and give examples of their use. Existing molecular visualization programs work well for single protein and nucleic acid molecules and for small complexes. The methods presented here are proposed as features to add to existing programs or include in next-generation visualization software to allow easy exploration of assemblies containing tens to thousands of macromolecules. Our approach is pragmatic, emphasizing simplicity of code, reliability, and speed. The methods described have been distributed as the Multiscale extension of the UCSF Chimera (www.cgl.ucsf.edu/chimera) molecular graphics program

3D Reconstruction Using High Resolution Implicit Surface Representations and Memory Management Strategies

La disponibilité de capteurs de numérisation 3D rapides et précis a permis de capturer de très grands ensembles de points à la surface de différents objets qui véhiculent la géométrie des objets. La métrologie appliquée consiste en l'application de mesures dans différents domaines tels que le contrôle qualité, l'inspection, la conception de produits et la rétroingénierie. Une fois que le nuage de points 3D non organisés couvrant toute la surface de l'objet a été capturé, un modèle de la surface doit être construit si des mesures métrologiques doivent être effectuées sur l'objet. Dans la reconstruction 3D en temps réel, à l'aide de scanners 3D portables, une représentation de surface implicite très efficace est le cadre de champ vectoriel, qui suppose que la surface est approchée par un plan dans chaque voxel. Le champ vectoriel contient la normale à la surface et la matrice de covariance des points tombant à l'intérieur d'un voxel. L'approche globale proposée dans ce projet est basée sur le cadre Vector Field. Le principal problème abordé dans ce projet est la résolution de l'incrément de consommation de mémoire et la précision du modèle reconstruit dans le champ vectoriel. Ce tte approche effectue une sélection objective de la taille optimale des voxels dans le cadre de champ vectoriel pour maintenir la consommation de mémoire aussi faible que possible et toujours obtenir un modèle précis de la surface. De plus, un ajustement d e surface d'ordre élevé est utilisé pour augmenter la précision du modèle. Étant donné que notre approche ne nécessite aucune paramétrisation ni calcul complexe, et qu'au lieu de travailler avec chaque point, nous travaillons avec des voxels dans le champ vectoriel, cela réduit la complexité du calcul.The availability of fast and accurate 3D scanning sensors has made it possible to capture very large sets of points at the surface of different objects that convey the geometry of the objects. A pplied metrology consists in the application of measurements in different fields such as quality control, inspection, product design and reverse engineering. Once the cloud of unorganized 3D points covering the entire surface of the object has been capture d, a model of the surface must be built if metrologic measurements are to be performed on the object. In realtime 3D reconstruction, using handheld 3D scanners a very efficient implicit surface representation is the Vector Field framework, which assumes that the surface is approximated by a plane in each voxel. The vector field contains the normal to the surface and the covariance matrix of the points falling inside a voxel. The proposed global approach in this project is based on the Vector Field framew ork. The main problem addressed in this project is solving the memory consumption increment and the accuracy of the reconstructed model in the vector field. This approach performs an objective selection of the optimal voxels size in the vector field frame work to keep the memory consumption as low as possible and still achieve an accurate model of the surface. Moreover, a highorder surface fitting is used to increase the accuracy of the model. Since our approach do not require any parametrization and compl ex calculation, and instead of working with each point we are working with voxels in the vector field, then it reduces the computational complexity

The spherical primitive and perlin noise method to recreate realistic aggregate shapes

An algorithm to recreate virtual aggregates with realistic shapes is presented in this paper. The algorithm has been implemented in the Unity 3D platform. The idea is to recreate realistically the virtual coarse and crushed aggregates that are normally used as a material for the construction of roads. This method consists of two major procedures: (i) to combine a spherical density function with a noise matrix based on the Perlin noise to obtain shapes of appropriate angularity and, (ii) deform the shapes until their minor ferret, aspect ratio and, thickness are equivalent to those wanted. The efficiency of the algorithm has been tested by reproducing nine types of aggregates from different sources. The results obtained indicate that the method proposed can be used to realistically recreate in 3D coarse aggregates