Abstract
A new algorithm to compute the homology of a finitely generated chain complex is proposed in this work. It is based on grouping algebraic reductions of the complex into structures that can be encoded as directed acyclic graphs. This leads to sequences of projection maps that reduce the number of generators in the complex while preserving its homology. This organization of reduction pairs allows to update the boundary information in a single step for a whole set of reductions which shows impressive gains in computational performance compared to existing methods. In addition, this method gives the homology generators for a small additional cost.
Chapter PDF
Similar content being viewed by others
References
Allili, M., Corriveau, D., Ziou, D.: Morse Homology Descriptor for Shape Characterization. Proceedings of the 17th ICPR 4, 27–30 (2004)
Allili, M., Corriveau, D.: Topological Analysis of Shapes using Morse Theory. Computer Vision and Image Understanding 105, 188–199 (2007)
Collins, A., Zomorodian, A., Carlsson, G., Guibas, L.: A Barcode Shape Descriptor for Curve Point Cloud Data. Computers and Graphics 28, 881–894 (2004)
Munkres, J.R.: Elements of Algebraic Topology. Addison-Wesley, Reading (1984)
Kaczynski, T., Mischaikow, K., Mrozek, M.: Computational Homology. Appl. Math. Sci. Series, vol. 157. Springer, New York (2004)
Storjohann, A.: Near Optimal Algorithms for Computing Smith Normal Forms of Integer Matrices. In: Proceedings of 1996 International Symposium on Symbolic and Algebraic Computation, ISSAC 1996, pp. 267–274 (1996)
Peltier, S., Alayrangues, S., Fuchs, L., Lachaud, J.: Computation of Homology Groups and Generators. Computers and Graphics 30, 62–69 (2006)
Kaczynski, T., Mrozek, M., Slusarek, M.: Homology Computation by Reduction of Chain Complexes. Computers and Mathematics with App. 35, 59–70 (1998)
Mrozek, M., Pilarczyk, P., Zelazna, N.: Homology Algorithm Based on Acyclic Subspace. Computers and Mathematics with App. 55(11), 2395–2412 (2008)
Mrozek, M., Batko, B.: Coreduction Homology Algorithm. Discrete and Computational Geometry (in press)
Allili, M., Corriveau, D., Derivière, S., Kaczynski, T., Trahan, A.: Discrete Dynamical System Framework for Construction of Connections between Critical Regions in Lattice Height Data. J. Math. Imaging Vis. 28(2), 99–111 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Corriveau, D., Allili, M. (2009). Computing Homology: A Global Reduction Approach. In: Brlek, S., Reutenauer, C., Provençal, X. (eds) Discrete Geometry for Computer Imagery. DGCI 2009. Lecture Notes in Computer Science, vol 5810. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04397-0_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-04397-0_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04396-3
Online ISBN: 978-3-642-04397-0
eBook Packages: Computer ScienceComputer Science (R0)