Generating cubical complexes from image data and computation of the Euler number
From MaRDI portal
Recommendations
- A complete characterization of the \((m, n)\)-cubes and combinatorial applications in imaging, vision and discrete geometry
- \(\ell_1\)-based construction of polycube maps from complex shapes
- Polyhedral Representation and Adjacency Graph in n-dimensional Digital Images
- The construction of simplicial groups in digital images
- scientific article; zbMATH DE number 2096925
- Encoding specific 3D polyhedral complexes using 3D binary images
- Discrete geometry and numerical images
- Cup products on polyhedral approximations of 3D digital images
- scientific article; zbMATH DE number 1880949
- Combinatorial and discrete geometric problems in image analysis
Cites work
- scientific article; zbMATH DE number 3900666 (Why is no real title available?)
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- scientific article; zbMATH DE number 3579615 (Why is no real title available?)
- Generating cubical complexes from image data and computation of the Euler number
- Homology computation by reduction of chain complexes
- Local Properties of Binary Images in Two Dimensions
Cited in
(6)- An approach to the computation of the Euler number by means of the vertex chain code
- A certified reduction strategy for homological image processing
- Parallel computation of the Euler number via Connectivity Graph
- Computation of the Euler number using the contact perimeter
- A proof of image Euler number formula
- Generating cubical complexes from image data and computation of the Euler number
This page was built for publication: Generating cubical complexes from image data and computation of the Euler number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1856707)
