Persistent homology of graph-like digital images (Q2210722)

This is a paper in the area of graph-like digital images, a model of digital topology that views a digital image as a finite set of points having some adjacency relation. Simplicial homology groups have been defined in this setting by \textit{L. Boxer} et al. [J. Math. Sci. Adv. Appl. 11, No. 2, 109--140 (2011; Zbl 1276.55011)]. The authors go to lengths to situate their work in the setting of a ``digital simplicial complex'', but this is unnecessary since a digital image carries an intrinsic canonical simplicial structure. The authors define persistent homology groups for digital images using adaptations of standard definitions, and prove some basic properties. They give specific computations in simple examples, and present ``Some applications to image processing'', which involve some less simple examples, leveraging computations in the existing literature.