Head Tracking via Robust Registration in Texture Map Images

A novel method for 3D head tracking in the presence of large head rotations and facial expression changes is described. Tracking is formulated in terms of color image registration in the texture map of a 3D surface model. Model appearance is recursively updated via image mosaicking in the texture map as the head orientation varies. The resulting dynamic texture map provides a stabilized view of the face that can be used as input to many existing 2D techniques for face recognition, facial expressions analysis, lip reading, and eye tracking. Parameters are estimated via a robust minimization procedure; this provides robustness to occlusions, wrinkles, shadows, and specular highlights. The system was tested on a variety of sequences taken with low quality, uncalibrated video cameras. Experimental results are reported

Improvements in digital image correlation and application in material mechanical test

Digital image correlation (DIC) is a non-contact full-field optical measurement method. With the advantages of high accuracy, low cost, and simple implementation, it has been widely applied in the area of experimental mechanics. In this study, DIC algorithm has been improved in the aspects of the pixel-level searching method and reference frame update strategy. The feature matching based method is proposed to provide an initial guess for all points of interest with semi-subpixel level accuracy in cases with small or large translation, deformation, or rotation. The bisection searching strategy is presented to automatically adjust the frame step for varying practical circumstances. The improved DIC algorithm is implemented and applied to the miniature tensile test. A convenient experimental method to determine the true stress-strain curve is proposed. The instantaneous cross-section area is estimated by only one camera in aid of DIC method. The derived true stress-strain curves and mechanical parameters of metal material Al6061 and CP-Ti from miniature specimens match well with the results of standard specimens, and no dimension dependence has been observed in the results --Abstract, page iv

The mitral valve computational anatomy and geometry analysis

We present a novel methodology to characterize and quantify the Mitral Valve (MV) geometry and physical attributes in a multi-resolution framework. A multi-scale decomposition was implemented to model the MV geometry by using superquadric shape primitives and spectral reconstruction of the finer-scale geometric details. Superquadrics provide a basis to normalize the size and approximate a basic model of the MV geometry. The point-wise difference between the original geometry and the superquadric model denotes the finer-scale geometric details, which can be modeled as a scalar attribute for the MV model development. The additive decomposition of the basic MV geometry from geometric details (attributes) allows recovering the actual geometry by superposition of the superquadric approximation and the finer-details model. We implemented a lasso optimization algorithm to perform spectral analysis and develop the Fourier reconstruction of the geometric details. The spectral modeling enabled us to resample the geometric details or use spectral filters in order to adjust the spatial resolution in the model reconstruction. It also provides the basis to control the level of detail in the final model reconstruction by applying low-pass filters in the frequency domain. The higher-order attributes such as internal fiber architecture can be integrated with the geometric models using the same framework. We applied our pipeline to create models of three ovine MVs based on computed-tomography 3D images with micrometer resolution. We were able to quantify the MV leaflet geometry, reconstruct models with custom level of geometric details, and develop medial representation of the MV leaflet structure. The results show that our methodology for geometry analysis provides a basis for assessing patient-specific geometries and facilitates developing population-averaged models. Ultimately, this approach allows building personalized image-based computational models for medical device design and surgical treatment simulations.Mechanical Engineerin

3D Innovations in Personalized Surgery

Current practice involves the use of 3D surgical planning and patient-specific solutions in multiple surgical areas of expertise. Patient-specific solutions have been endorsed for several years in numerous publications due to their associated benefits around accuracy, safety, and predictability of surgical outcome. The basis of 3D surgical planning is the use of high-quality medical images (e.g., CT, MRI, or PET-scans). The translation from 3D digital planning toward surgical applications was developed hand in hand with a rise in 3D printing applications of multiple biocompatible materials. These technical aspects of medical care require engineers’ or technical physicians’ expertise for optimal safe and effective implementation in daily clinical routines.The aim and scope of this Special Issue is high-tech solutions in personalized surgery, based on 3D technology and, more specifically, bone-related surgery. Full-papers or highly innovative technical notes or (systematic) reviews that relate to innovative personalized surgery are invited. This can include optimization of imaging for 3D VSP, optimization of 3D VSP workflow and its translation toward the surgical procedure, or optimization of personalized implants or devices in relation to bone surgery

A Unified Framework for Parallel Anisotropic Mesh Adaptation

Finite-element methods are a critical component of the design and analysis procedures of many (bio-)engineering applications. Mesh adaptation is one of the most crucial components since it discretizes the physics of the application at a relatively low cost to the solver. Highly scalable parallel mesh adaptation methods for High-Performance Computing (HPC) are essential to meet the ever-growing demand for higher fidelity simulations. Moreover, the continuous growth of the complexity of the HPC systems requires a systematic approach to exploit their full potential. Anisotropic mesh adaptation captures features of the solution at multiple scales while, minimizing the required number of elements. However, it also introduces new challenges on top of mesh generation. Also, the increased complexity of the targeted cases requires departing from traditional surface-constrained approaches to utilizing CAD (Computer-Aided Design) kernels. Alongside the functionality requirements, is the need of taking advantage of the ubiquitous multi-core machines. More importantly, the parallel implementation needs to handle the ever-increasing complexity of the mesh adaptation code. In this work, we develop a parallel mesh adaptation method that utilizes a metric-based approach for generating anisotropic meshes. Moreover, we enhance our method by interfacing with a CAD kernel, thus enabling its use on complex geometries. We evaluate our method both with fixed-resolution benchmarks and within a simulation pipeline, where the resolution of the discretization increases incrementally. With the Telescopic Approach for scalable mesh generation as a guide, we propose a parallel method at the node (multi-core) for mesh adaptation that is expected to scale up efficiently to the upcoming exascale machines. To facilitate an effective implementation, we introduce an abstract layer between the application and the runtime system that enables the use of task-based parallelism for concurrent mesh operations. Our evaluation indicates results comparable to state-of-the-art methods for fixed-resolution meshes both in terms of performance and quality. The integration with an adaptive pipeline offers promising results for the capability of the proposed method to function as part of an adaptive simulation. Moreover, our abstract tasking layer allows the separation of different aspects of the implementation without any impact on the functionality of the method

Smooth representation of thin shells and volume structures for isogeometric analysis

The purpose of this study is to develop self-contained methods for obtaining smooth meshes which are compatible with isogeometric analysis (IGA). The study contains three main parts. We start by developing a better understanding of shapes and splines through the study of an image-related problem. Then we proceed towards obtaining smooth volumetric meshes of the given voxel-based images. Finally, we treat the smoothness issue on the multi-patch domains with C1 coupling. Following are the highlights of each part. First, we present a B-spline convolution method for boundary representation of voxel-based images. We adopt the filtering technique to compute the B-spline coefficients and gradients of the images effectively. We then implement the B-spline convolution for developing a non-rigid images registration method. The proposed method is in some sense of “isoparametric”, for which all the computation is done within the B-splines framework. Particularly, updating the images by using B-spline composition promote smooth transformation map between the images. We show the possible medical applications of our method by applying it for registration of brain images. Secondly, we develop a self-contained volumetric parametrization method based on the B-splines boundary representation. We aim to convert a given voxel-based data to a matching C1 representation with hierarchical cubic splines. The concept of the osculating circle is employed to enhance the geometric approximation, where it is done by a single template and linear transformations (scaling, translations, and rotations) without the need for solving an optimization problem. Moreover, we use the Laplacian smoothing and refinement techniques to avoid irregular meshes and to improve mesh quality. We show with several examples that the method is capable of handling complex 2D and 3D configurations. In particular, we parametrize the 3D Stanford bunny which contains irregular shapes and voids. Finally, we propose the B´ezier ordinates approach and splines approach for C1 coupling. In the first approach, the new basis functions are defined in terms of the B´ezier Bernstein polynomials. For the second approach, the new basis is defined as a linear combination of C0 basis functions. The methods are not limited to planar or bilinear mappings. They allow the modeling of solutions to fourth order partial differential equations (PDEs) on complex geometric domains, provided that the given patches are G1 continuous. Both methods have their advantages. In particular, the B´ezier approach offer more degree of freedoms, while the spline approach is more computationally efficient. In addition, we proposed partial degree elevation to overcome the C1-locking issue caused by the over constraining of the solution space. We demonstrate the potential of the resulting C1 basis functions for application in IGA which involve fourth order PDEs such as those appearing in Kirchhoff-Love shell models, Cahn-Hilliard phase field application, and biharmonic problems

Fast Adaptive Augmented Lagrangian Digital Image Correlation

Digital image correlation (DIC) is a powerful experimental technique for measuring full-field displacement and strain. The basic idea of the method is to compare images of an object decorated with a speckle pattern before and after deformation in order to compute the displacement and strain fields. Local Subset DIC and finite element-based Global DIC are two widely used image matching methods; however there are some drawbacks to these methods. In Local Subset DIC, the computed displacement field may not satisfy compatibility, and the deformation gradient may be noisy, especially when the subset size is small. Global DIC incorporates displacement compatibility, but can be computationally expensive. In this thesis, we propose a new method, the augmented-Lagrangian digital image correlation (ALDIC), that combines the advantages of both the local (fast and in parallel) and global (compatible) methods. We demonstrate that ALDIC has higher accuracy and behaves more robustly compared to both Local Subset DIC and Global DIC. DIC requires a large number of high resolution images, which imposes significant needs on data storage and transmission. We combined DIC algorithms with image compression techniques and show that it is possible to obtain accurate displace- ment and strain fields with only 5 % of the original image size. We studied two compression techniques – discrete cosine transform (DCT) and wavelet transform, and three DIC algorithms – Local Subset DIC, Global DIC and our newly proposed augmented Lagrangian DIC (ALDIC). We found the Local Subset DIC leads to the largest errors and ALDIC to the smallest when compressed images are used. We also found wavelet-based image compression introduces less error compared to DCT image compression. To further speed up and improve the accuracy of DIC algorithms, especially in the study of complex heterogeneous strain fields at various length scales, we apply an adaptive finite element mesh to DIC methods. We develop a new h-adaptive technique and apply it to ALDIC. We show that this adaptive mesh ALDIC algorithm significantly decreases computation time with no loss (and some gain) in accuracy.</p

GPU-based proximity query processing on unstructured triangular mesh model

This paper presents a novel proximity query (PQ) approach capable to detect the collision and calculate the minimal Euclidean distance between two non-convex objects in 3D, namely the robot and the environment. Such approaches are often considered as computationally demanding problems, but are of importance to many applications such as online simulation of haptic feedback and robot collision-free trajectory. Our approach enables to preserve the representation of unstructured environment in the form of triangular meshes. The proposed PQ algorithm is computationally parallel so that it can be effectively implemented on graphics processing units (GPUs). A GPU-based computation scheme is also developed and customized, which shows >200 times faster than an optimized CPU with single core. Comprehensive validation is also conducted on two simulated scenarios in order to demonstrate the practical values of its potential application in image-guided surgical robotics and humanoid robotic control.published_or_final_versio