Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
  How to Extract the Geometry and Topology from Very Large 3D Segmentations

Andres, B., Koethe, U., Kroeger, T., & Hamprecht, F. A. (2010). How to Extract the Geometry and Topology from Very Large 3D Segmentations. Retrieved from http://arxiv.org/abs/1009.6215.

Item is

Basisdaten

einblenden: ausblenden:
Genre: Forschungspapier
Latex : How to Extract the Geometry and Topology from Very Large {3D} Segmentations

Dateien

einblenden: Dateien
ausblenden: Dateien
:
arXiv:1009.6215.pdf (Preprint), 2MB
Name:
arXiv:1009.6215.pdf
Beschreibung:
File downloaded from arXiv at 2014-04-02 11:20
OA-Status:
Sichtbarkeit:
Öffentlich
MIME-Typ / Prüfsumme:
application/pdf / [MD5]
Technische Metadaten:
Copyright Datum:
-
Copyright Info:
-

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Andres, Bjoern1, Autor           
Koethe, Ullrich1, Autor
Kroeger, Thorben1, Autor
Hamprecht, Fred A.1, Autor
Affiliations:
1External Organizations, ou_persistent22              

Inhalt

einblenden:
ausblenden:
Schlagwörter: Computer Science, Computational Geometry, cs.CG,Computer Science, Computer Vision and Pattern Recognition, cs.CV,Computer Science, Data Structures and Algorithms, cs.DS
 Zusammenfassung: Segmentation is often an essential intermediate step in image analysis. A volume segmentation characterizes the underlying volume image in terms of geometric information--segments, faces between segments, curves in which several faces meet--as well as a topology on these objects. Existing algorithms encode this information in designated data structures, but require that these data structures fit entirely in Random Access Memory (RAM). Today, 3D images with several billion voxels are acquired, e.g. in structural neurobiology. Since these large volumes can no longer be processed with existing methods, we present a new algorithm which performs geometry and topology extraction with a runtime linear in the number of voxels and log-linear in the number of faces and curves. The parallelizable algorithm proceeds in a block-wise fashion and constructs a consistent representation of the entire volume image on the hard drive, making the structure of very large volume segmentations accessible to image analysis. The parallelized C++ source code, free command line tools and MATLAB mex files are avilable from http://hci.iwr.uni-heidelberg.de/software.php

Details

einblenden:
ausblenden:
Sprache(n):
 Datum: 2010-09-302010
 Publikationsstatus: Online veröffentlicht
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: arXiv: 1009.6215
URI: http://arxiv.org/abs/1009.6215
BibTex Citekey: andres2010geometry
 Art des Abschluß: -

Veranstaltung

einblenden:

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle

einblenden: