• Aucun résultat trouvé

Algorithmic aspects of converting surface mesh data to volumetric images

N/A
N/A
Protected

Academic year: 2021

Partager "Algorithmic aspects of converting surface mesh data to volumetric images"

Copied!
2
0
0

Texte intégral

(1)

14th International Congress for Stereology and Image Analysis Liège, July 7-10, 2015

1 

Algorithmic aspects of converting surface mesh data to

volumetric images

Plougonven Erwan, Léonard Angélique University of Liège, Department of Applied Chemistry, Belgium

eplougonven@ulg.ac.be Keywords

3D image, surface mesh, conversion, algorithm.

Introduction

In image analysis, some processes might imply a change or conversion in the structure of the data. The structure types will depend on the processing method and applications, and can consist of pixel data, point sets, finite elements, vector fields, implicit surfaces, graphs, basic shapes (spheres, cylinders, or cubes), etc. The work presented here discusses the problem of converting a triangulated surface mesh to a 3D image, a need that arises for example when using active surface-type segmentation methods of 3D images, shape-fitting, or combining data from laser surface scanning with 3D imaging. During the course of numerous projects, two main classes of mesh-to-image conversions have appeared: those identifying voxels (pixels in a 3D image) that intersect the mesh, or voxels that are contained in the mesh, supposing it defines a closed surface.

Materials and Methods

Developing solutions to these two classes of conversion do not require complex mathematics, only basic 3D geometry is involved, but to develop accurate and efficient (i.e. with minimal computation time and memory usage) solutions, care must be taken in the definition and development of the methods. The first class, identifying the mesh-intersecting voxels, consists in testing for this intersection using distance measurements with the infinity norm, and propagating the tests in the 6-neighbourhood. The latter class, finding the voxels inside the surface, uses a ray-tracing approach followed by a connected component identification.

The methods have been implemented in C++ and integrated into the Avizo software.

Results and Discussion

One example of the application of this conversion process is shown in figure 1: micro-tomographic reconstructions of a 1 cm diameter polypropylene foam sample are made (see the reference for the context of this work). Characteristics are sought at the bead level, and after several operations to extract the bead centers an active surface algorithm generates a triangulated mesh identifying bead interiors. Converting this data back to a 3D mask and combining it with the greylevels of the original image we can extract density characteristics for each bead.

(2)

Erwan

2 

Figure 1. From left to right: orthogonal cross-sections in a tomographic reconstruction of a polypropylene foam sample; triangulated mesh resulting from the active surface algorithm that identifies the bead interiors; voxel

rendering of the outside of those beads, after converting the mesh to a 3D image.

Conclusion

Efficient data structure conversions should be a basic requirement in any scientific data processing toolbox. When handling 3D image data the passage from a surface mesh to voxels in a cubic grid may arise, and when the data to process is very large (particularly several gigabytes in the case of tomography), the usability of any data processing depends on reasoned algorithmic choices.

References

Viot P., Plougonven, E., and Bernard, D. (2008) ‘Microtomography on polypropylene foam under dynamic loading: 3D analysis of bead morphology evolution’, Composites Part A: Applied Science and Manufacturing, Full-field Measurements in Composites Testing and Analysis, V.39, pp.1266-1281.

Figure

Figure 1. From left to right: orthogonal cross-sections in a tomographic reconstruction of a polypropylene foam  sample; triangulated mesh resulting from the active surface algorithm that identifies the bead interiors; voxel

Références

Documents relatifs

Unite´ de recherche INRIA Rocquencourt, Domaine de Voluceau, Rocquencourt, BP 105, 78153 LE CHESNAY Cedex Unite´ de recherche INRIA Sophia-Antipolis, 2004 route des Lucioles, BP

Here we will investigate, at least when the inner function is a Blaschke product, the non-tangential boundary values of the functions of the backward shift invariant subspace

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

This paper presents a Modified Variational Splines Fitting (MVSF) algorithm for surface reconstruction using thin plate splines on scattered patches or points of originally

Progressive Surface Reconstruction from Images Using a Local Prior.. Gang Zeng, Sylvain Paris, Long Quan,

Abstract. We consider an algorithm of atmospheric correction of satellite images for reconstruction the reflection coefficients of the ground surface in the visible

This approach which allows to automatically detects planar regions on particle boundaries and to assign them to crystallographic facets, was applied to

M¨ uller- Hannemann: in a first stage, the input surface mesh is reduced to a single hexahedron by successively eliminating loops from the dual graph of the quad mesh; in the