The genus of a digital image boundary is determined by its foreground, background, and Reeb graphs

DOI10.1007/S00454-007-1315-XMaRDI QIDQ2369932zbMATH OpenOpenAlexFDO

Authors Lowell Abrams, Donniell E. Fishkind

Publication date 21 June 2007

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00454-007-1315-x

zbMATH Keywords

boundary genusdigital imageReeb graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Review text

The paper presents the proof of the theorem saying that the genus of the boundary of a digital image is precisely half of the sum of the cycle ranks of three particular graphs. These are: the ``foreground graph and ``background graph, which capture topological information about the digital image and its complement, respectively, and the Reeb graph, relative to the natural height function, associated with the digital image's boundary. Several additional results are proved as well.

Recommendations

• A Genus Bound for Digital Image Boundaries
• GENUS AND DIMENSION OF DIGITAL IMAGES AND THEIR TIME- AND SPACE-EFFICIENT COMPUTATION
• Loops in Reeb graphs of 2-manifolds
• Loops in Reeb graphs of 2-manifolds
• Robust computations of Reeb graphs in 2-D binary images

Cited in

(3)

• A Genus Bound for Digital Image Boundaries
• Parallel homological calculus for 3D binary digital images
• Digital topological method for computing genus and the Betti numbers

This page was built for publication: The genus of a digital image boundary is determined by its foreground, background, and Reeb graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369932)