Show simple item record

dc.contributor.advisorEllis, Graham
dc.contributor.authorHegarty, Fintan
dc.description.abstractHomology is the study of connectivity and "holes" in spaces. The aim of this thesis is to introduce and develop a theory of permutahedral complexes for computations of homology of large data sets and to compare, using efficient implementations, the performance of this theory with that of cubical complexes. We develop practical tools, to be submitted as a GAP package, for computing the homology of n-dimensional Euclidean data sets, where n=1,2,3,4, and certain higher-dimensional data sets. Certain computational advantages of using a permutahedral structure are identified; the notion of a pure B-complex is introduced as a data type for implementing a general class of regular CW-spaces; zig-zag homotopy retractions are introduced as an initial procedure for reducing the number of cells of low-dimensional pure B-complexes with discrete vector field techniques being applied for further reduction; a persistent homology approach to feature recognition in low-dimensional images is illustrated; implementing these algorithms in the GAP system for computational algebra allows for their output to benefit from the system's library of efficient algebraic procedures.en_US
dc.subjectComputational homologyen_US
dc.subjectHomotopy retractionsen_US
dc.subjectTessellated spacesen_US
dc.subjectMathematics, Statistics, and Applied Mathematicsen_US
dc.titleComputational Homology of Cubical and Permutahedral Complexesen_US
dc.contributor.funderScience Foundation Irelanden_US
dc.local.noteThis thesis develops some theory behind, and implements, efficient algorithms for counting the number of "holes" and distinct objects in images and higher-dimensional data sets. Certain algorithms based on a permutahedron are shown to have some advantages over those based on a cube.en_US

Files in this item

Attribution-NonCommercial-NoDerivs 3.0 Ireland
This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. Please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.

The following license files are associated with this item:


This item appears in the following Collection(s)

Show simple item record