Computational Homology by Kaczynski, Mischaikow, Mrozek
From Intelligent Perception
Computational Homology by Kaczynski, Mischaikow, Mrozek is one of the early books in the field of computational topology. There is a lot of good in this book and there some inadequacies.
Thorough presentation of all the mathematics is given, including the proofs of all theorems. That's not easy to handle for a novice. In fact, a graduate level course in modern algebra is required for the student to follow the proofs. Moreover, this is not a good place for someone to get started with homology even though all modern algebra and point-set topology background is presented in the appendix. The introduction is good as a motivation for the first time student.
Numerous exercises are provided.
Algorithms are fully written, in pseudocode. They are easy to follow if you understand the math. Some prior experience with algorithms may be necessary.
The algorithms are analyzed.
Software, called CHomP, is available. However you can't just start using it. Prior experience with C++ is required. The latest releases of CHomP are a challenge to get running. Too many moving parts!
3 What's missing
Even though the issues of topological features of images, i.e., the homology theory of n-dimensional images, are well covered, some important, applied content is missing.
First is persistent homology. This is the main tool for dealing with noise.
Second is geometry, i.e., measuring objects. You need that too for evaluating noise.
Third is Gray scale images. You can't just get away with binary images, in real life.
Website contains examples and downloads, but the projects provided are exclusively geared toward academic research. There are also just so few of them! Try Examples of image analysis.
Bottom line, this is monograph not a textbook.
4.1 Part I Homology
- 1 Preview
- 2 Cubical Homology
- 3 Computing Homology Groups
- 4 Chain Maps and Reduction Algorithms
- 5 Preview of Maps
- 5.1 Rational Functions and Interval Arithmetic
- 5.2 Maps on an Interval
- 5.3 Constructing Chain Selectors
- 5.4 Maps of $\Gamma ^1$
- 6 Homology of Maps
- 7 Computing Homology of Maps
- 7.1 Producing Multivalued Representation
- 7.2 Chain Selector Algorithm
- 7.3 Computing Homology of Maps
- 7.4 Geometric Preboundary Algorithm
4.2 Part II Extensions
- 8 Prospects in Digital Image Processing
- 8.1 Images and Cubical Sets
- 8.2 Patterns from Cahn–Hilliard
- 8.3 Complicated Time-Dependent Patterns
- 8.4 Size Function
- 9 Homological Algebra
- 10 Nonlinear Dynamics
- 11 Homology of Topological Polyhedra
4.3 Part III Tools from Topology and Algebra
- 12 Topology
- 13 Algebra
- 14 Syntax of Algorithms
- 14.1 Overview
- 14.2 Data Structures
- 14.3 Compound Statements
- 14.4 Function and Operator Overloading
- 14.5 Analysis of Algorithms