Show simple item record

dc.contributor.authorWang, Yangen_US
dc.contributor.authorYu, Hongfengen_US
dc.contributor.authorMa, Kwan-Liuen_US
dc.contributor.editorFabio Marton and Kenneth Morelanden_US
dc.date.accessioned2014-01-26T17:10:27Z
dc.date.available2014-01-26T17:10:27Z
dc.date.issued2013en_US
dc.identifier.isbn978-3-905674-45-3en_US
dc.identifier.issn1727-348Xen_US
dc.identifier.urihttp://dx.doi.org/10.2312/EGPGV/EGPGV13/017-024en_US
dc.description.abstractLarge-scale time-varying volume data sets can take terabytes to petabytes of storage space to store and process. One promising approach is to process the data in parallel, and then extract and analyze only features of interest, reducing required memory space by several orders of magnitude for following visualization tasks. However, extracting volume features in parallel is a non-trivial task as features might span over multiple processors, and local partial features are only visible within their own processors. In this paper, we discuss how to generate and maintain connectivity information of features across different processors. Based on the connectivity information, partial features can be integrated, which makes it possible to extract and track features for large data in parallel. We demonstrate the effectiveness and scalability of our approach using two data sets with up to 16384 processors.en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectI.3.2 [Computer Graphics]en_US
dc.subjectGraphics Systemsen_US
dc.subjectDistributed/network graphicsen_US
dc.subjectI.4.6 [Image Processing And Computer Vision]en_US
dc.subjectSegmentationen_US
dc.subjectRegion growingen_US
dc.titleScalable Parallel Feature Extraction and Tracking for Large Time-varying 3D Volume Dataen_US
dc.description.seriesinformationEurographics Symposium on Parallel Graphics and Visualizationen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record