Abstract
In this paper, we introduce persistent homology for graph-like digital images as a new type of computation of digital homology groups. We calculate persistent homology groups of some graph-like digital images. Moreover, we prove some theorems related to a singleton point and $$\kappa $$ -connected graph-like digital images. It has been shown that identity and composition axioms are satisfied for digital persistent homology groups. Finally, we give some applications of the new theory to image processing.
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 callDisclaimer: 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.
