3D surface reconstruction using HMH algorithm

Authors:
Bruno Dutailly;Hélène Coqueugniot;Pascal Desbarats;Stefka Gueorguieva;Rémi Synave
Affiliations:
Université Bordeaux 1, CNRS, UMR, PACEA, Talence Cedex, France;Université Bordeaux 1, CNRS, UMR, PACEA, Talence Cedex, France;Université Bordeaux 1, CNRS, UMR, LaBRI, Talence Cedex, France;Université Bordeaux 1, CNRS, UMR, LaBRI, Talence Cedex, France;Université Bordeaux 1, CNRS, UMR, LaBRI, Talence Cedex, France
Venue:
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Year:
2009

Citing 3
Cited 0

Marching cubes: A high resolution 3D surface construction algorithm

SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
The asymptotic decider: resolving the ambiguity in marching cubes

VIS '91 Proceedings of the 2nd conference on Visualization '91
Geometric feature estimators for noisy discrete surfaces

DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery

Quantified Score

Hi-index	0.00

Visualization

Abstract

3D surface reconstruction using the Half Maximum Height (HMH) algorithm is a method to extract a surface of interest from a voxel data set. It is based on the original HMH method applied to each voxel of the segmented surface to reconstruct. From a 3D voxel grid, an initial segmentation is computed to extract a discrete surface of interest. For each of these voxels, HMH computes a segmentation and an orientation. The result of this step is then processed using a Marching Cube-like algorithm. The two major advantages of this method are the precision of the surface extraction and its non user-dependancy.