Efficient computation of persistent homology

thesis
dc.abstract.enThe main problem tackled in my thesis was the efficiency of computational topology algorithms. I focused on persistent homology, which is currently the most widely applicable topological tool. However, efficiency is still a major challenge. I assumed an algorithm engineering perspective, namely focused on the efficiency of practical implementations. This was an effective strategy, which resulted in significant improvements, compared to the existing algorithms and their implementations. In Chapter 6, I presented specialized methods for cubical data, which reduce memory and time requirements by several orders of magnitude, compared to the pre-existing state of the art. This makes analysis of large images, counted in billions (109 ) of voxels feasible even on commodity hardware. Previous, unspecialized methods could only handle millions of voxels. This is especially useful in the context of medical imaging, which starts adopting topological methods. In Chapter 5, I introduced a new technique for matrix reduction, which is applicable for any type of data. Used in conjunction with other recent developments, such as the twist technique, it yields considerable practical speedup, up to a factor of a thousand. Additionally, for an important class of inputs, the observed time complexity is reduced from quadratic to linear. As an additional benefit, modern implementations of computational topology software reduce the number of control parameters. For example, the default configuration of the PHAT library efficiently handles a vast majority of inputs, without the need of manual tuning. This is important, if computational topology software is to be used by non-experts in the field. Summarizing, in the light of the new developments, including the techniques described in this thesis, computational topology is becoming more and more useful. In particular, it starts to supply tools applicable for large amount of data present in current applications.pl
dc.affiliationWydział Matematyki i Informatyki : Instytut Informatyki i Matematyki Komputerowejpl
dc.contributor.advisorMrozek, Marian - 130783 pl
dc.contributor.authorWagner, Hubert - 103160 pl
dc.contributor.institutionJagiellonian University. Faculty of Mathematics and Computer Sciencepl
dc.contributor.reviewerGrytczuk, Jarosław - 128201 pl
dc.contributor.reviewerMarzantowicz, Wacławpl
dc.date.accessioned2018-11-22T12:35:59Z
dc.date.available2018-11-22T12:35:59Z
dc.date.submitted2014-11-20pl
dc.description.additionalDostęp do publikacji jest możliwy w Archiwum UJpl
dc.description.physical[1], 69pl
dc.identifier.callnumberDokt. 2014/217pl
dc.identifier.projectROD UJ / Opl
dc.identifier.urihttps://ruj.uj.edu.pl/xmlui/handle/item/61277
dc.languageengpl
dc.placeKrakówpl
dc.rightsCopyright*
dc.rights.licencebez licencji
dc.rights.urihttp://ruj.uj.edu.pl/4dspace/License/copyright/licencja_copyright.pdf*
dc.subject.enpersistent homologypl
dc.subject.endiscrete Morse theorypl
dc.subject.encubical homologypl
dc.subject.plhomologie persystentnepl
dc.subject.pldyskretna teoria Morse'apl
dc.subject.plhomologie kostkowepl
dc.titleEfficient computation of persistent homologypl
dc.title.alternativeEfektywne metody obliczeń homologii persystentnychpl
dc.typeThesispl
dspace.entity.typePublication
dc.abstract.enpl
The main problem tackled in my thesis was the efficiency of computational topology algorithms. I focused on persistent homology, which is currently the most widely applicable topological tool. However, efficiency is still a major challenge. I assumed an algorithm engineering perspective, namely focused on the efficiency of practical implementations. This was an effective strategy, which resulted in significant improvements, compared to the existing algorithms and their implementations. In Chapter 6, I presented specialized methods for cubical data, which reduce memory and time requirements by several orders of magnitude, compared to the pre-existing state of the art. This makes analysis of large images, counted in billions (109 ) of voxels feasible even on commodity hardware. Previous, unspecialized methods could only handle millions of voxels. This is especially useful in the context of medical imaging, which starts adopting topological methods. In Chapter 5, I introduced a new technique for matrix reduction, which is applicable for any type of data. Used in conjunction with other recent developments, such as the twist technique, it yields considerable practical speedup, up to a factor of a thousand. Additionally, for an important class of inputs, the observed time complexity is reduced from quadratic to linear. As an additional benefit, modern implementations of computational topology software reduce the number of control parameters. For example, the default configuration of the PHAT library efficiently handles a vast majority of inputs, without the need of manual tuning. This is important, if computational topology software is to be used by non-experts in the field. Summarizing, in the light of the new developments, including the techniques described in this thesis, computational topology is becoming more and more useful. In particular, it starts to supply tools applicable for large amount of data present in current applications.
dc.affiliationpl
Wydział Matematyki i Informatyki : Instytut Informatyki i Matematyki Komputerowej
dc.contributor.advisorpl
Mrozek, Marian - 130783
dc.contributor.authorpl
Wagner, Hubert - 103160
dc.contributor.institutionpl
Jagiellonian University. Faculty of Mathematics and Computer Science
dc.contributor.reviewerpl
Grytczuk, Jarosław - 128201
dc.contributor.reviewerpl
Marzantowicz, Wacław
dc.date.accessioned
2018-11-22T12:35:59Z
dc.date.available
2018-11-22T12:35:59Z
dc.date.submittedpl
2014-11-20
dc.description.additionalpl
Dostęp do publikacji jest możliwy w Archiwum UJ
dc.description.physicalpl
[1], 69
dc.identifier.callnumberpl
Dokt. 2014/217
dc.identifier.projectpl
ROD UJ / O
dc.identifier.uri
https://ruj.uj.edu.pl/xmlui/handle/item/61277
dc.languagepl
eng
dc.placepl
Kraków
dc.rights*
Copyright
dc.rights.licence
bez licencji
dc.rights.uri*
http://ruj.uj.edu.pl/4dspace/License/copyright/licencja_copyright.pdf
dc.subject.enpl
persistent homology
dc.subject.enpl
discrete Morse theory
dc.subject.enpl
cubical homology
dc.subject.plpl
homologie persystentne
dc.subject.plpl
dyskretna teoria Morse'a
dc.subject.plpl
homologie kostkowe
dc.titlepl
Efficient computation of persistent homology
dc.title.alternativepl
Efektywne metody obliczeń homologii persystentnych
dc.typepl
Thesis
dspace.entity.type
Publication
Affiliations

* The migration of download and view statistics prior to the date of April 8, 2024 is in progress.

Views
4
Views per month
Views per city
Ashburn
2
Bengaluru
1
South Bend
1