PARAMETRIZATION AND SHAPE RECONSTRUCTION TECHNIQUES FOR DOO-SABIN SUBDIVISION SURFACES

This thesis presents a new technique for the reconstruction of a smooth surface from a set of 3D data points. The reconstructed surface is represented by an everywhere -continuous subdivision surface which interpolates all the given data points. And the topological structure of the reconstructed surface is exactly the same as that of the data points. The new technique consists of two major steps. First, use an efficient surface reconstruction method to produce a polyhedral approximation to the given data points. Second, construct a Doo-Sabin subdivision surface that smoothly passes through all the data points in the given data set. A new technique is presented for the second step in this thesis. The new technique iteratively modifies the vertices of the polyhedral approximation 1CM until a new control meshM, whose Doo-Sabin subdivision surface interpolatesM, is reached. It is proved that, for any mesh M with any size and any topology, the iterative process is always convergent with Doo-Sabin subdivision scheme. The new technique has the advantages of both a local method and a global method, and the surface reconstruction process can reproduce special features such as edges and corners faithfully

Dynamic Multivariate Simplex Splines For Volume Representation And Modeling

Volume representation and modeling of heterogeneous objects acquired from real world are very challenging research tasks and playing fundamental roles in many potential applications, e.g., volume reconstruction, volume simulation and volume registration. In order to accurately and efficiently represent and model the real-world objects, this dissertation proposes an integrated computational framework based on dynamic multivariate simplex splines (DMSS) that can greatly improve the accuracy and efficacy of modeling and simulation of heterogenous objects. The framework can not only reconstruct with high accuracy geometric, material, and other quantities associated with heterogeneous real-world models, but also simulate the complicated dynamics precisely by tightly coupling these physical properties into simulation. The integration of geometric modeling and material modeling is the key to the success of representation and modeling of real-world objects. The proposed framework has been successfully applied to multiple research areas, such as volume reconstruction and visualization, nonrigid volume registration, and physically based modeling and simulation

Optimising Spatial and Tonal Data for PDE-based Inpainting

Some recent methods for lossy signal and image compression store only a few selected pixels and fill in the missing structures by inpainting with a partial differential equation (PDE). Suitable operators include the Laplacian, the biharmonic operator, and edge-enhancing anisotropic diffusion (EED). The quality of such approaches depends substantially on the selection of the data that is kept. Optimising this data in the domain and codomain gives rise to challenging mathematical problems that shall be addressed in our work. In the 1D case, we prove results that provide insights into the difficulty of this problem, and we give evidence that a splitting into spatial and tonal (i.e. function value) optimisation does hardly deteriorate the results. In the 2D setting, we present generic algorithms that achieve a high reconstruction quality even if the specified data is very sparse. To optimise the spatial data, we use a probabilistic sparsification, followed by a nonlocal pixel exchange that avoids getting trapped in bad local optima. After this spatial optimisation we perform a tonal optimisation that modifies the function values in order to reduce the global reconstruction error. For homogeneous diffusion inpainting, this comes down to a least squares problem for which we prove that it has a unique solution. We demonstrate that it can be found efficiently with a gradient descent approach that is accelerated with fast explicit diffusion (FED) cycles. Our framework allows to specify the desired density of the inpainting mask a priori. Moreover, is more generic than other data optimisation approaches for the sparse inpainting problem, since it can also be extended to nonlinear inpainting operators such as EED. This is exploited to achieve reconstructions with state-of-the-art quality. We also give an extensive literature survey on PDE-based image compression methods

An Optimized Spline-Based Registration of a 3D CT to a Set of C-Arm Images

We have developed an algorithm for the rigid-body registration of a CT volume to a set of C-arm images. The algorithm uses a gradient-based iterative minimization of a least-squares measure of dissimilarity between the C-arm images and projections of the CT volume. To compute projections, we use a novel method for fast integration of the volume along rays. To improve robustness and speed, we take advantage of a coarse-to-fine processing of the volume/image pyramids. To compute the projections of the volume, the gradient of the dissimilarity measure, and the multiresolution data pyramids, we use a continuous image/volume model based on cubic B-splines, which ensures a high interpolation accuracy and a gradient of the dissimilarity measure that is well defined everywhere. We show the performance of our algorithm on a human spine phantom, where the true alignment is determined using a set of fiducial markers

2D and 3D surface image processing algorithms and their applications

This doctoral dissertation work aims to develop algorithms for 2D image segmentation application of solar filament disappearance detection, 3D mesh simplification, and 3D image warping in pre-surgery simulation. Filament area detection in solar images is an image segmentation problem. A thresholding and region growing combined method is proposed and applied in this application. Based on the filament area detection results, filament disappearances are reported in real time. The solar images in 1999 are processed with this proposed system and three statistical results of filaments are presented. 3D images can be obtained by passive and active range sensing. An image registration process finds the transformation between each pair of range views. To model an object, a common reference frame in which all views can be transformed must be defined. After the registration, the range views should be integrated into a non-redundant model. Optimization is necessary to obtain a complete 3D model. One single surface representation can better fit to the data. It may be further simplified for rendering, storing and transmitting efficiently, or the representation can be converted to some other formats. This work proposes an efficient algorithm for solving the mesh simplification problem, approximating an arbitrary mesh by a simplified mesh. The algorithm uses Root Mean Square distance error metric to decide the facet curvature. Two vertices of one edge and the surrounding vertices decide the average plane. The simplification results are excellent and the computation speed is fast. The algorithm is compared with six other major simplification algorithms. Image morphing is used for all methods that gradually and continuously deform a source image into a target image, while producing the in-between models. Image warping is a continuous deformation of a: graphical object. A morphing process is usually composed of warping and interpolation. This work develops a direct-manipulation-of-free-form-deformation-based method and application for pre-surgical planning. The developed user interface provides a friendly interactive tool in the plastic surgery. Nose augmentation surgery is presented as an example. Displacement vector and lattices resulting in different resolution are used to obtain various deformation results. During the deformation, the volume change of the model is also considered based on a simplified skin-muscle model

Functional representation and manipulation of shapes with applications in surface and solid modeling

Real-valued functions have wide applications in various areas within computer graphics. In this work, we examine three representation of shapes using functions. In particular, we study the classical B-spline representation of piece-wise polynomials in the univariate domain. We provide a generalization of B-spline to the bivariate domain using intuition gained from the univariate construction. We also study the popular scheme of representing 3D density distribution using a uniform, rectilinear grid, where we provide a novel contouring scheme that culls occluded inner geometries. Lastly, we examine a ray-based representation for 3D indicator functions called ray-rep, for which we present a novel meshing scheme with multi-material extensions

3D RECONSTRUCTION USING MULTI-VIEW IMAGING SYSTEM

This thesis presents a new system that reconstructs the 3D representation of dental casts. To maintain the integrity of the 3D representation, a standard model is built to cover the blind spots that the camera cannot reach. The standard model is obtained by scanning a real human mouth model with a laser scanner. Then the model is simplified by an algorithm which is based on iterative contraction of vertex pairs. The simplified standard model uses a local parametrization method to obtain the curvature information. The system uses a digital camera and a square tube mirror in front of the camera to capture multi-view images. The mirror is made of stainless steel in order to avoid double reflections. The reflected areas of the image are considered as images taken by the virtual cameras. Only one camera calibration is needed since the virtual cameras have the same intrinsic parameters as the real camera. Depth is computed by a simple and accurate geometry based method once the corresponding points are identified. Correspondences are selected using a feature point based stereo matching process, including fast normalized cross-correlation and simulated annealing

Adaptive image vectorisation and brushing using mesh colours

We propose the use of curved triangles and mesh colours as a vector primitive for image vectorisation. We show that our representation has clear benefits for rendering performance, texture detail, as well as further editing of the resulting vector images. The proposed method focuses on efficiency, but it still leads to results that compare favourably with those from previous work. We show results over a variety of input images ranging from photos, drawings, paintings, all the way to designs and cartoons. We implemented several editing workflows facilitated by our representation: interactive user-guided vectorisation, and novel raster-style feature-aware brushing capabilities

Compression domain volume rendering for distributed environments

This paper describes a method for volume data compression and rendering which bases on wavelet splats. The underlying concept is especially designed for distributed and networked applications, where we assume a remote server to maintain large scale volume data sets, being inspected, browsed through and rendered interactively by a local client. Therefore, we encode the server‘s volume data using a newly designed wavelet based volume compression method. A local client can render the volumes immediately from the compression domain by using wavelet footprints, a method proposed earlier. In addition, our setup features full progression, where the rendered image is refined progressively as data comes in. Furthermore, framerate constraints are considered by controlling the quality of the image both locally and globally depending on the current network bandwidth or computational capabilities of the client. As a very important aspect of our setup, the client does not need to provide storage for the volume data and can be implemented in terms of a network application. The underlying framework enables to exploit all advantageous properties of the wavelet transform and forms a basis for both sophisticated lossy compression and rendering. Although coming along with simple illumination and constant exponential decay, the rendering method is especially suited for fast interactive inspection of large data sets and can be supported easily by graphics hardware

Analyzing Heterogeneity In Neuroimaging With Probabilistic Multivariate Clustering Approaches

Automated quantitative neuroimaging analysis methods have been crucial in elucidating normal and pathological brain structure and function, and in building in vivo markers of disease and its progression. Commonly used methods can identify and precisely quantify subtle and spatially complex imaging patterns of brain change associated with brain diseases. However, the overarching premise of these methods is that the disease group is a homogeneous entity resulting from a single, unifying pathophysiological process that has a single imaging signature. This assumption ignores ample evidence for the heterogeneous nature of neurodegenerative diseases and neuropsychiatric disorders, resulting in incomplete or misleading descriptions. Accurate characterization of heterogeneity is important for deepening our understanding of neurobiological processes, thus leading to improved disease diagnosis and prognosis. In this thesis, we leveraged machine learning techniques to develop novel tools that can analyze the heterogeneity in both cross-sectional and longitudinal neuroimaging studies. Specifically, we developed a semi-supervised clustering method for characterizing heterogeneity in cross-sectional group comparison studies, where normal and patient populations are modeled as high-dimensional point distributions, and heterogeneous disease effects are captured by estimating multiple transformations that align the two distributions, while accounting for the effect of nuisance covariates. Moreover, toward dissecting the heterogeneity in longitudinal cohorts, we proposed a method which simultaneously fits multiple population longitudinal multivariate trajectories and clusters subjects into subgroups. Longitudinal trajectories are modeled using spatiotemporally regularized cubic splines, while clustering is performed by assigning subjects to the subgroup whose population trajectory best fits their data. The proposed tools were extensively validated using synthetic data. Importantly, they were applied to study the heterogeneity in large clinical neuroimaging cohorts. We identified four disease subtypes with distinct imaging signatures using data from Alzheimer’s Disease Neuroimaging Initiative, and revealed two subgroups with different longitudinal patterns using data from Baltimore Longitudinal Study on Aging. Critically, we were able to further characterize the subgroups in each of the studies by performing statistical analyses evaluating subgroup differences with additional information such as neurocognitive data. Our results demonstrate the strength of the developed methods, and may pave the road for a broader understanding of the complexity of brain aging and Alzheimer’s disease