Streaming Algorithm for Euler Characteristic Curves of Multidimensional Images
Preprint
Abstract
We present an efficient algorithm to compute Euler characteristic curves of gray scale images of arbitrary dimension. In various applications the Euler characteristic curve is used as a descriptor of an image. Our algorithm is the first streaming algorithm for Euler characteristic curves. The usage of streaming removes the necessity to store the entire image in RAM. Experiments show that our implementation handles terabyte scale images on commodity hardware. Due to lock-free parallelism, it scales well with the number of processor cores. Our software---CHUNKYEuler---is available as open source on Bitbucket. Additionally, we put the concept of the Euler characteristic curve in the wider context of computational topology. In particular, we explain the connection with persistence diagrams.Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Efficient classification using the Euler characteristicPattern Recognition Letters, 2014
- Efficient computation of 3D Morse–Smale complexes and persistent homology using discrete Morse theoryThe Visual Computer, 2012
- Real-time thresholding with Euler numbersPattern Recognition Letters, 2003
- Generating cubical complexes from image data and computation of the Euler numberPattern Recognition, 2002
- An Efficient Topological Characterization of Gray-Levels Textures, Using a Multiresolution RepresentationGraphical Models and Image Processing, 1997
- On the computation of the Euler number of a binary objectPattern Recognition, 1996
- A new approach to computing the Euler characteristicPattern Recognition, 1995
- On the use of size functions for shape analysisBiological Cybernetics, 1993
- Quantification of connectivity in cancellous bone, with special emphasis on 3-D reconstructionsBone, 1993
- Computing the Euler number of an image from its quadtreeComputer Graphics and Image Processing, 1980