國立高雄大學圖資館 |

Language: English

Back to Search results for [ subject:"Computer Science." ]

Homological illusions of persistence...

Duke University.

Homological illusions of persistence and stability.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Homological illusions of persistence and stability.
Author:	Morozov, Dmitriy.
Description:	168 p.
Notes:	Adviser: Herbert Edelsbrunner.
Notes:	Source: Dissertation Abstracts International, Volume: 69-07, Section: B, page: 4267.
Contained By:	Dissertation Abstracts International69-07B.
Subject:	Computer Science.
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3315357
ISBN:	9780549655848

Homological illusions of persistence and stability.
Morozov, Dmitriy.

Homological illusions of persistence and stability. - 168 p.

Adviser: Herbert Edelsbrunner.

Thesis (Ph.D.)--Duke University, 2008.

Finally, to refine the measurement of local homology the thesis extends the notion of persistent homology to sequences of kernels, images, and cokernels of maps induced by inclusions in a filtration of pairs of spaces. Specifically, we note that persistence in this context is well defined, we prove that the persistence diagrams are stable, and we explain how to compute them. Additionally, we use image persistence to cope with functions on noisy domains.

ISBN: 9780549655848Subjects--Topical Terms:

212513
Computer Science.

Homological illusions of persistence and stability.
LDR:03332nam _2200325 _450 001 206900
005 20090413130034.5
008 090730s2008 ||||||||||||||||| ||eng d
020 $a 9780549655848
035 $a 00372112
040 $a UMI $c UMI
100 $a Morozov, Dmitriy. $3 321837
245 1 0 $a Homological illusions of persistence and stability.
300 $a 168 p.
500 $a Adviser: Herbert Edelsbrunner.
500 $a Source: Dissertation Abstracts International, Volume: 69-07, Section: B, page: 4267.
502 $a Thesis (Ph.D.)--Duke University, 2008.
520 $a Finally, to refine the measurement of local homology the thesis extends the notion of persistent homology to sequences of kernels, images, and cokernels of maps induced by inclusions in a filtration of pairs of spaces. Specifically, we note that persistence in this context is well defined, we prove that the persistence diagrams are stable, and we explain how to compute them. Additionally, we use image persistence to cope with functions on noisy domains.
520 $a Guided by the desire to reconstruct stratified spaces from noisy samples, we use the vineyard of the distance function restricted to a 1-parameter family of neighborhoods of a point to assess the local homology of a sampled stratified space at that point. We prove the correctness of this assessment under the assumption of a sufficiently dense sample. We also give an algorithm that constructs the vineyard and makes the local assessment in time at most cubic in the size of the Delaunay triangulation of the point sample.
520 $a In this thesis we explore and extend the theory of persistent homology, which captures topological features of a function by pairing its critical values. The result is represented by a collection of points in the extended plane called persistence diagram.
520 $a We start with the question of ridding the function of topological noise as suggested by its persistence diagram. We give an algorithm for hierarchically finding such epsilon-simplifications on 2-manifolds as well as answer the question of when it is impossible to simplify a function in higher dimensions. We continue by examining time-varying functions. The original algorithm computes the persistence pairing from an ordering of the simplices in a triangulation and takes worst-case time cubic in the number of simplices. We describe how to maintain the pairing in linear time per transposition of consecutive simplices. A side effect of the update algorithm is an elementary proof of the stability of persistence diagrams. We introduce a parametrized family of persistence diagrams called persistence vineyards and illustrate the concept with a vineyard describing a folding of a small peptide. We also base a simple algorithm to compute the rank invariant of a collection of functions on the update procedure.
590 $a School code: 0066.
650 $a Computer Science. $3 212513
690 $a 0984
710 $a Duke University. $b Computer Science. $3 321835
773 0 $g 69-07B. $t Dissertation Abstracts International
790 $a 0066
790 1 0 $a Agarwal, Pankaj K. $e committee member
790 1 0 $a Cohen-Steiner, David $e committee member
790 1 0 $a Edelsbrunner, Herbert, $e advisor
790 1 0 $a Harer, John $e committee member
791 $a Ph.D.
792 $a 2008
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3315357 $z http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3315357