Automated Fragmentary Bone Matching

Identification, reconstruction and matching of fragmentary bones are basic tasks required to accomplish quantification and analysis of fragmentary human remains derived from forensic contexts. Appropriate techniques for three-dimensional surface matching have received great attention in computer vision literature, and various methods have been proposed for matching fragmentary meshes; however, many of these methods lack automation, speed and/or suffer from high sensitivity to noise. In addition, reconstruction of fragementary bones along with identification in the presence of reference model to compare with in an automatic scheme have not been addressed. In order to address these issues, we used a multi-stage technique for fragment identification, matching and registration. The study introduces an automated technique for matching of fragmentary human skeletal remains for improving forensic anthropology practice and policy. The proposed technique involves creation of surfaces models for the fragmentary elements which can be done using computerized tomographic scans followed by segmentation. Upon creation of the fragmentary elements models, the models go through feature extraction technique where the surface roughness map of each model is measured using local shape analysis measures. Adaptive thesholding is then used to extract model features. A multi-stage technique is then used to identify, match and register bone fragments to their corresponding template bone model. First, extracted features are used for matching with different template bone models using iterative closest point algorithm with different positions and orientations. The best match score, in terms of minimum root-mean-square error, is used along with the position and orientation and the resulting transformation to register the fragment bone model with the corresponding template bone model using iterative closest point algorithm

Multi-scale and multi-spectral shape analysis: from 2d to 3d

Shape analysis is a fundamental aspect of many problems in computer graphics and computer vision, including shape matching, shape registration, object recognition and classification. Since the SIFT achieves excellent matching results in 2D image domain, it inspires us to convert the 3D shape analysis to 2D image analysis using geometric maps. However, the major disadvantage of geometric maps is that it introduces inevitable, large distortions when mapping large, complex and topologically complicated surfaces to a canonical domain. It is demanded for the researchers to construct the scale space directly on the 3D shape. To address these research issues, in this dissertation, in order to find the multiscale processing for the 3D shape, we start with shape vector image diffusion framework using the geometric mapping. Subsequently, we investigate the shape spectrum field by introducing the implementation and application of Laplacian shape spectrum. In order to construct the scale space on 3D shape directly, we present a novel idea to solve the diffusion equation using the manifold harmonics in the spectral point of view. Not only confined on the mesh, by using the point-based manifold harmonics, we rigorously derive our solution from the diffusion equation which is the essential of the scale space processing on the manifold. Built upon the point-based manifold harmonics transform, we generalize the diffusion function directly on the point clouds to create the scale space. In virtue of the multiscale structure from the scale space, we can detect the feature points and construct the descriptor based on the local neighborhood. As a result, multiscale shape analysis directly on the 3D shape can be achieved