VECTOR SEGMENTATION OF VOLUMETRIC IMAGE DATA - Tetrahedral Meshing Constrained by Image Edges
Michal Spanel, Premysl Krsek, Miroslav Svub, Vit Stancl
2010
Abstract
In this paper, a vector segmentation algorithm of volumetric data based on the 3D Delaunay triangulation is presented. A modified variational meshing method is used to adapt tetrahedral mesh to the underlying CT/MRI volumetric data. Moreover, to classify tetrahedra in the mesh into regions whose characteristics are similar, a clustering scheme viewing the mesh as undirected graph with edges weighted according to similarity of tetrahedra is discussed.
DownloadPaper Citation
in Harvard Style
Spanel M., Krsek P., Svub M. and Stancl V. (2010). VECTOR SEGMENTATION OF VOLUMETRIC IMAGE DATA - Tetrahedral Meshing Constrained by Image Edges . In Proceedings of the International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2010) ISBN 978-989-674-026-9, pages 134-138. DOI: 10.5220/0002833201340138
in Bibtex Style
@conference{grapp10,
author={Michal Spanel and Premysl Krsek and Miroslav Svub and Vit Stancl},
title={VECTOR SEGMENTATION OF VOLUMETRIC IMAGE DATA - Tetrahedral Meshing Constrained by Image Edges},
booktitle={Proceedings of the International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2010)},
year={2010},
pages={134-138},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002833201340138},
isbn={978-989-674-026-9},
}
in EndNote Style
TY - CONF
JO - Proceedings of the International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2010)
TI - VECTOR SEGMENTATION OF VOLUMETRIC IMAGE DATA - Tetrahedral Meshing Constrained by Image Edges
SN - 978-989-674-026-9
AU - Spanel M.
AU - Krsek P.
AU - Svub M.
AU - Stancl V.
PY - 2010
SP - 134
EP - 138
DO - 10.5220/0002833201340138