Abstract

AbstractCohomology groups and the cohomology ring of three‐dimensional (3D) objects are topological invariants that characterize holes and their relations. Cohomology ring has been traditionally computed on simplicial complexes. Nevertheless, cubical complexes deal directly with the voxels in 3D images, no additional triangulation is necessary. This could facilitate efficient algorithms for the computation of topological invariants in the image context. In this article, we present a constructive process, made up by several algorithms, to compute the cohomology ring of 3D binary‐valued digital photographs represented by cubical complexes. Starting from a cubical complex Q that represents such a 3D picture whose foreground has one connected component, we first compute the homological information on the boundary of the object, ∂Q, by an incremental technique; using a face reduction algorithm, we then compute it on the whole object; finally, applying explicit formulas for cubical complexes (without making use of any additional triangulation), the cohomology ring is computed from such information. © 2011 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 21, 76–85, 2011.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.