The genus of a digital image boundary is determined by its foreground, background, and Reeb graphs (Q2369932)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5166262
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The genus of a digital image boundary is determined by its foreground, background, and Reeb graphs |
scientific article; zbMATH DE number 5166262 |
Statements
The genus of a digital image boundary is determined by its foreground, background, and Reeb graphs (English)
0 references
21 June 2007
0 references
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.
0 references
digital image
0 references
boundary genus
0 references
Reeb graph
0 references
0.8684164881706238
0 references
0.767147958278656
0 references
0.7260037660598755
0 references
0.7177029252052307
0 references
0.7152788043022156
0 references
