Streaming algorithm for euler characteristic curves of multidimensional images

8Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

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. 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.

Cite

CITATION STYLE

APA

Heiss, T., & Wagner, H. (2017). Streaming algorithm for euler characteristic curves of multidimensional images. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10424 LNCS, pp. 397–409). Springer Verlag. https://doi.org/10.1007/978-3-319-64689-3_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free