Point-based multiscale surface representation

In this article we present a new multiscale surface representation based on point samples. Given an unstructured point cloud as input, our method first computes a series of point-based surface approximations at successively higher levels of smoothness, that is, coarser scales of detail, using geometric low-pass filtering. These point clouds are then encoded relative to each other by expressing each level as a scalar displacement of its predecessor. Low-pass filtering and encoding are combined in an efficient multilevel projection operator using local weighted least squares fitting. Our representation is motivated by the need for higher-level editing semantics which allow surface modifications at different scales. The user would be able to edit the surface at different approximation levels to perform coarse-scale edits on the whole model as well as very localized modifications on the surface detail. Additionally, the multiscale representation provides a separation in geometric scale which can be understood as a spectral decomposition of the surface geometry. Based on this observation, advanced geometric filtering methods can be implemented that mimic the effects of Fourier filters to achieve effects such as smoothing, enhancement, or band-bass filtering. © 2006 ACM

Multiscale roughness analysis by microprofilometry based on conoscopic holography: a new tool for treatment monitoring in highly reflective metal artworks

The analysis of surface roughness in highly reflective metal artworks is challenging and requires contactless devices capable to measure regions with high micrometer accuracy in both depth and lateral directions. We demonstrate optical profilometry based on scanning conoscopic holography for micrometer measurement of silver samples treated with different hand-made cleaning processes. The technique is shown effective in acquiring shiny and smooth metal samples providing high-resolution and highaccurate dataset (0.1µm depth and 5µm lateral resolution) that is a reliable representation of the microsurface structure. From a statistical point of view, the cleaning treatments have the same nature of the low-abrasion, but the underlying mechanical processes are different. This fact suggested a more in-depth study of both the amplitude and the hybrid areal roughness parameters. It is proposed a workflow for a dual integrated multiscale roughness analysis for surface characterization: a scale inspection to detect possible texture non-homogeneity, and a signals separation to outline the most significant texture components. The scale-limited components allowed to discriminate the different surface processes. The results on silver samples demonstrate the potential of multiscale roughness analysis by conoscopic holography as a new tool for treatment monitoring in metal artworks

Information Surfaces in Systems Biology and Applications to Engineering Sustainable Agriculture

Systems biology of plants offers myriad opportunities and many challenges in modeling. A number of technical challenges stem from paucity of computational methods for discovery of the most fundamental properties of complex dynamical systems. In systems engineering, eigen-mode analysis have proved to be a powerful approach. Following this philosophy, we introduce a new theory that has the benefits of eigen-mode analysis, while it allows investigation of complex dynamics prior to estimation of optimal scales and resolutions. Information Surfaces organizes the many intricate relationships among "eigen-modes" of gene networks at multiple scales and via an adaptable multi-resolution analytic approach that permits discovery of the appropriate scale and resolution for discovery of functions of genes in the model plant Arabidopsis. Applications are many, and some pertain developments of crops that sustainable agriculture requires.Comment: 24 Pages, DoCEIS 1

Multiscale virtual particle based elastic network model (MVP-ENM) for biomolecular normal mode analysis

In this paper, a multiscale virtual particle based elastic network model (MVP-ENM) is proposed for biomolecular normal mode analysis. The multiscale virtual particle model is proposed for the discretization of biomolecular density data in different scales. Essentially, the model works as the coarse-graining of the biomolecular structure, so that a delicate balance between biomolecular geometric representation and computational cost can be achieved. To form "connections" between these multiscale virtual particles, a new harmonic potential function, which considers the influence from both mass distributions and distance relations, is adopted between any two virtual particles. Unlike the previous ENMs that use a constant spring constant, a particle-dependent spring parameter is used in MVP-ENM. Two independent models, i.e., multiscale virtual particle based Gaussian network model (MVP-GNM) and multiscale virtual particle based anisotropic network model (MVP-ANM), are proposed. Even with a rather coarse grid and a low resolution, the MVP-GNM is able to predict the Debye-Waller factors (B-factors) with considerable good accuracy. Similar properties have also been observed in MVP-ANM. More importantly, in B-factor predictions, the mismatch between the predicted results and experimental ones is predominantly from higher fluctuation regions. Further, it is found that MVP-ANM can deliver a very consistent low-frequency eigenmodes in various scales. This demonstrates the great potential of MVP-ANM in the deformation analysis of low resolution data. With the multiscale rigidity function, the MVP-ENM can be applied to biomolecular data represented in density distribution and atomic coordinates. Further, the great advantage of my MVP-ENM model in computational cost has been demonstrated by using two poliovirus virus structures. Finally, the paper ends with a conclusion.Comment: 15 figures; 25 page

Multiscale and multimodel simulation of Bloch point dynamics

We present simulation results on the structure and dynamics of micromagnetic point singularities with atomistic resolution. This is achieved by embedding an atomistic computational region into a standard micromagnetic algorithm. Several length scales are bridged by means of an adaptive mesh refinement and a seamless coupling between the continuum theory and a Heisenberg formulation for the atomistic region. The code operates on graphical processing units and is able to detect and track the position of strongly inhomogeneous magnetic regions. This enables us to reliably simulate the dynamics of Bloch points, which means that a fundamental class of micromagnetic switching processes can be analyzed with unprecedented accuracy. We test the code by comparing it with established results and present its functionality with the example of a simulated field-driven Bloch point motion in a soft-magnetic cylinder

Gaussian Process Morphable Models

Statistical shape models (SSMs) represent a class of shapes as a normal distribution of point variations, whose parameters are estimated from example shapes. Principal component analysis (PCA) is applied to obtain a low-dimensional representation of the shape variation in terms of the leading principal components. In this paper, we propose a generalization of SSMs, called Gaussian Process Morphable Models (GPMMs). We model the shape variations with a Gaussian process, which we represent using the leading components of its Karhunen-Loeve expansion. To compute the expansion, we make use of an approximation scheme based on the Nystrom method. The resulting model can be seen as a continuous analogon of an SSM. However, while for SSMs the shape variation is restricted to the span of the example data, with GPMMs we can define the shape variation using any Gaussian process. For example, we can build shape models that correspond to classical spline models, and thus do not require any example data. Furthermore, Gaussian processes make it possible to combine different models. For example, an SSM can be extended with a spline model, to obtain a model that incorporates learned shape characteristics, but is flexible enough to explain shapes that cannot be represented by the SSM. We introduce a simple algorithm for fitting a GPMM to a surface or image. This results in a non-rigid registration approach, whose regularization properties are defined by a GPMM. We show how we can obtain different registration schemes,including methods for multi-scale, spatially-varying or hybrid registration, by constructing an appropriate GPMM. As our approach strictly separates modelling from the fitting process, this is all achieved without changes to the fitting algorithm. We show the applicability and versatility of GPMMs on a clinical use case, where the goal is the model-based segmentation of 3D forearm images