It is known that interpolation with radial basis functions of the same shape can guarantee a non-singular interpolation matrix, whereas little is known when one uses various shapes. In this paper, we prove that a class of compactly supported radial basis functions are convex on a certain region; based on this local convexity and ready local geometrical property of the interpolation points, we c...

The present study introduces an advancement and rotation flap that can be used for the reconstruction of surgical defects located in the malar region. The design is essentially a triangle containing the defect, where one line runs parallel to the lateral part of the nose along the nasolabial fold, while another starts at the same point and follows the dynamic lines of the malar region. In order...

MOTIVATION A major issue in computational biology is the reconstruction of pathways from several genomic datasets, such as expression data, protein interaction data and phylogenetic profiles. As a first step toward this goal, it is important to investigate the amount of correlation which exists between these data. RESULTS These methods are successfully tested on their ability to recognize ope...

In this project, we show that an image can be reconstructed using local descriptors, with or without complete geometrical metadata. We use greedy algorithms to progressively learn the missing information before reconstruction and colorization is performed. Our experiments show that most of the vital information about a query image can be recovered even if scale metadata is missing. Compared to ...

Objects in nature as well as man made are bound by planar as well as curvilinear surfaces. Hence the reconstruction process of three dimensional objects involves obtaining the geometrical attributes of these planar and curvilinear surfaces, lines, points etc. If a line in 3-D space is viewed from two arbitrary positions, two different images of the same line are obtained. The correspondence bet...

This paper describes a new and fast method for reconstructing a 3D computerized model from a cloud of points sampled from the object’s surface. The proposed method aggregates very large scale 3D scanning data into a Hierarchical Space Decomposition Model (HSDM), realized by the Octree data structure. This model can represent both the boundary surface and the interior volume of an object. Based ...

During the last years ATLAS has successfully deployed a new integrated simulation framework (ISF) which allows a flexible mixture of full and fast detector simulation techniques within the processing of one event. The thereby achieved possible speed-up in detector simulation of up to a factor 100 makes subsequent digitization and reconstruction the dominant contributions to the Monte Carlo (MC)...

In this article, we expose a reconstruction method of complex objects, characterized either by a digital volume, or by a sample of points from the boundary surface of the object. In order to do so, we use a deformable model of implicit surfaces defined using a potential function and a skeleton. The latter, describing the structural information, can be given beforehand under two features: discre...

The usefulness of a probabilistic technique to describe 3D foliage geometrical traits depends on the possibility of quickly and cheaply collecting a leaf data sample. The present simulation study was designed to provide the statistical information necessary to drive and control a foliage random sampling process on a real tree canopy (considered as a population of leaves) and to evaluate two cor...

We review and present new results on the transient elastography problem, where the goal is to reconstruct shear stiffness properties using interior time and space dependent displacement measurements. We present unique identifiability of two parameters for this inverse problem, establish that a Lipschitz continuous arrival time satisfies the eikonal equation, and present two numerical algorithms...