Close
Metadata

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Holder Codeibi 8JMKD3MGPEW34M/46T9EHH
Identifier8JMKD3MGPBW34M/3A369CB
Repositorysid.inpe.br/sibgrapi/2011/07.07.18.15
Last Update2011:07.07.18.15.06 (UTC) administrator
Metadata Repositorysid.inpe.br/sibgrapi/2011/07.07.18.15.05
Metadata Last Update2022:06.14.00.07.09 (UTC) administrator
DOI10.1109/SIBGRAPI.2011.24
Citation KeyGüntherReinWagnHotz:2011:MeCoPe
TitleMemory-Efficient Computation of Persistent Homology for 3D Images using Discrete Morse Theory
FormatDVD, On-line.
Year2011
Access Date2024, Apr. 25
Number of Files1
Size3387 KiB
2. Context
Author1 Günther, David
2 Reininghaus, Jan
3 Wagner, Hubert
4 Hotz, Ingrid
Affiliation1 Zuse Institute Berlin
2 Zuse Institute Berlin
3 Institute of Computer Science, Jagiellonian University
4 Zuse Institute Berlin
EditorLewiner, Thomas
Torres, Ricardo
e-Mail Addressdavid.guenther@zib.de
Conference NameConference on Graphics, Patterns and Images, 24 (SIBGRAPI)
Conference LocationMaceió, AL, Brazil
Date28-31 Aug. 2011
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Book TitleProceedings
Tertiary TypeFull Paper
History (UTC)2011-07-23 15:36:12 :: david.guenther@zib.de -> administrator :: 2011
2022-06-14 00:07:09 :: administrator -> :: 2011
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Version Typefinaldraft
Keywordspersistent homology
Morse-Smale complex
discrete Morse theory
large data
AbstractWe propose a memory-efficient method that com- putes persistent homology for 3D gray-scale images. The basic idea is to compute the persistence of the induced Morse-Smale complex. Since in practice this complex is much smaller than the input data, significantly less memory is required for the subsequent computations. We propose a novel algorithm that efficiently extracts the Morse-Smale complex based on algorithms from discrete Morse theory. The proposed algorithm is thereby optimal with a computational complexity of O(n2). The per- sistence is then computed using the Morse-Smale complex by applying an existing algorithm with a good practical running time. We demonstrate that our method allows for the computation of persistent homology for large data on commodity hardware.
Arrangement 1urlib.net > SDLA > Fonds > SIBGRAPI 2011 > Memory-Efficient Computation of...
Arrangement 2urlib.net > SDLA > Fonds > Full Index > Memory-Efficient Computation of...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Content
agreement.html 07/07/2011 15:15 0.5 KiB 
4. Conditions of access and use
data URLhttp://urlib.net/ibi/8JMKD3MGPBW34M/3A369CB
zipped data URLhttp://urlib.net/zip/8JMKD3MGPBW34M/3A369CB
Languageen
Target FilepersistenceLargeData.pdf
User Groupdavid.guenther@zib.de
Visibilityshown
5. Allied materials
Mirror Repositorysid.inpe.br/banon/2001/03.30.15.38.24
Next Higher Units8JMKD3MGPEW34M/46SKNPE
8JMKD3MGPEW34M/4742MCS
Citing Item Listsid.inpe.br/sibgrapi/2022/05.15.00.56 6
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
6. Notes
Empty Fieldsarchivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage edition electronicmailaddress group isbn issn label lineage mark nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume


Close