Interval Extensions of Signed Distance Functions: iSDF-reps and Reliable Membership Classification
| Autor: | Duane W. Storti, Chris Finley, Mark A. Ganter |
|---|---|
| Rok vydání: | 2010 |
| Předmět: |
Signed distance function
Function (mathematics) Interval (mathematics) Computational geometry Computer Graphics and Computer-Aided Design Industrial and Manufacturing Engineering Computer Science Applications Ambient space Interval arithmetic Range (statistics) Function representation Algorithm Software Mathematics |
| Zdroj: | Journal of Computing and Information Science in Engineering. 10 |
| ISSN: | 1944-7078 1530-9827 |
| Popis: | This paper considers the problem of inferring the geometry of an object from values of the signed distance sampled on a uniform grid. The problem is motivated by the desire to effectively and efficiently model objects obtained by 3D imaging technology such as magnetic resonance, computed tomography, and positron emission tomography. Techniques recently developed for automated segmentation convert intensity to signed distance, and the voxel structure imposes the uniform sampling grid. The specification of the signed distance function (SDF) throughout the ambient space would provide an implicit and function-based representation (f-rep) model that uniquely specifies the object, and we refer to this particular f-rep as the signed distance function representation (SDF-rep). However, a set of uniformly sampled signed distance values may uniquely determine neither the distance function nor the shape of the object. Here, we employ essential properties of the signed distance to construct the upper and lower bounds on the allowed variation in signed distance, which combine to produce interval-valued extensions of the signed distance function. We employ an interval extension of the signed distance function as an interval SDF-rep that defines the range of object geometries that are consistent with the sampled SDF data. The particular interval extensions considered include a tight global extension and more computationally efficient local extensions that provide useful criteria for root exclusion/isolation. To illustrate a useful application of the interval bounds, we present a reliable approach to top-down octree membership classification for uniform samplings of signed distance functions. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|