Efficient computation of homology groups, betti numbers, and euler characteristics for 2D digital images

dc.contributor.authorÖztel, Ahmet
dc.contributor.authorAkgül, Bayram
dc.contributor.authorKaraca, Ismet
dc.contributor.authorEge, Ozgur
dc.contributor.authorAkgül, Bayram
dc.contributor.authorÖztel, Ahmet
dc.date.accessioned2025-10-18T13:24:38Z
dc.date.created2025
dc.date.issued2025
dc.departmentFakülteler, İktisadi ve İdari Bilimler Fakültesi, İşletme Bölümü
dc.departmentFakülteler, Mühendislik Mimarlık ve Tasarım Fakültesi, Bilgisayar Mühendisliği Bölümü
dc.description.abstractDigital topology, crucial for image analysis, tackles identifying connected components and holes in digital images using homology groups (Betti numbers). These invariants are essential in machine learning and biomedical image analysis, requiring accurate and efficient computation. This study introduces a novel algorithm for computing homology groups and Euler characteristics of 2D digital images. Using digital simplicial complexes and 8-adjacency, the method achieves computational efficiency, with a time complexity of O(k2.1)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(k<^>{2.1})$$\end{document}, surpassing traditional persistent homology methods (O(n3)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(n<^>3)$$\end{document}). A significant contribution is the proof that higher-dimensional homology groups (Hn8(X)=0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$H_n<^>8(X) = 0$$\end{document} for n >= 2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n \ge 2$$\end{document}) vanish in 2D digital images, ensuring consistency with classical topology. Extensive evaluations confirmed the algorithm's scalability with pixel density, accurately computing Betti numbers (beta 0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta _0$$\end{document}, beta 1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta _1$$\end{document}) and Euler characteristics, validated independently. The open-source tool (DHGComp) supports applications in machine learning, biomedical image analysis, and computer vision, advancing digital topology methodologies.
dc.identifier.doi10.1007/s00200-025-00682-w
dc.identifier.issn0938-1279
dc.identifier.issn1432-0622
dc.identifier.scopus2-s2.0-105002218874
dc.identifier.scopusqualityQ1
dc.identifier.urihttps://doi.org/10.1007/s00200-025-00682-w
dc.identifier.urihttps://hdl.handle.net/11772/23035
dc.identifier.wosWOS:001463303200001
dc.identifier.wosqualityN/A
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherSpringer
dc.relation.ispartofApplicable Algebra in Engineering Communication and Computing
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzWoS_20251016
dc.subjectDigital Topology
dc.subjectHomology Groups
dc.subjectBetti Numbers
dc.subjectEuler Characteristics
dc.subjectSimplicial Complexes
dc.subjectDigital Image Analysis
dc.subjectComputational Topology
dc.subject2d Images
dc.subjectTopological Data Analysis
dc.subjectAlgorithm Efficiency
dc.titleEfficient computation of homology groups, betti numbers, and euler characteristics for 2D digital images
dc.typeArticle
dspace.entity.typePublication
relation.isAuthorOfPublication4c687c5d-e2fd-41d3-8446-da7cdb65d50c
relation.isAuthorOfPublicationfc1000ab-1376-4448-a3fd-7aff30cf7d6f
relation.isAuthorOfPublication.latestForDiscovery4c687c5d-e2fd-41d3-8446-da7cdb65d50c

Dosyalar