Searcharxiv⌕ Search

arXiv subjects

İsmet Karaca

Publications and source records attributed to İsmet Karaca.

9 recordsLinked to original sources

Topological Invariant-Based Iris Identification via Digital Homology and Machine Learning

Objective - This study presents a biometric identification method based on topological invariants from 2D iris images, representing iris texture via formally defined digital homology and evaluating classification performance. Methods - Each normalized iris image (48x482 pixels) is divided into grids (e.g., 6x54 or 3x27). For each subregion, we compute Betti0, Betti1, and their ratio using a recent algorithm for homology groups in 2D digital images. The resulting invariants form a feature matrix used with logistic regression, KNN, and SVM (with PCA and 100 randomized repetitions). A convolutional neural network (CNN) is trained on raw images for comparison. Results - Logistic regression achieved 97.78 +/- 0.82% accuracy, outperforming CNN (96.44 +/- 1.32%) and other feature-based models. The topological features showed high accuracy with low variance. Conclusion - This is the first use of topological invariants from formal digital homology for iris recognition. The method offers a compact, interpretable, and accurate alternative to deep learning, useful when explainability or limited data is important. Beyond iris recognition, it can apply to other biometrics, medical imaging, materials science, remote sensing, and interpretable AI. It runs efficiently on CPU-only systems and produces robust, explainable features valuable for security-critical domains.

cs.CV↗

Digital $n-$Manifolds With Or Without Boundaries

This work aims to define the concept of manifold, which has a very important place in the topology, on digital images. So, a general perspective is provided for two and three-dimensional imaging studies on digital curves and digital surfaces. Throughout the study, the features present in topological manifolds but that are not satisfied in the discrete version are specifically underlined. In addition, other concepts closely related to manifolds such as submanifold, orientation, and partition of unity are also discussed in digital images.

math.AT↗

$m-$homotopic Distances in Digital Images

We define digital $m-$homotopic distance and its higher version. We also mention related notions such as $m-$category in the sense of Lusternik-Schnirelmann and $m-$complexity in topological robotics. Later, we examine the homotopy invariance or $m-$homotopy invariance property of these concepts.

math.AT↗

Discrete Topological Complexities of Simplical Maps

In this study, we delve into the discrete TC of surjective simplicial fibrations, aiming to unravel the interplay between topological complexity, discrete geometric structures, and computational efficiency. Moreover, we examine the properties of the discrete TC number in higher dimensions and its relationship with scat. We also touch on the basic properties of the notion of higher contiguity distance, and show that it is possible to consider discrete TC computations in a simpler sense.

math.AT↗

Proximal Motion Planning Algorithms

In this paper, we transfer the problem of measuring navigational complexity in topological spaces to the nearness theory. We investigate the most important component of this problem, the topological complexity number (denoted by TC), with its different versions including relative and higher TC, on the proximal Schwarz genus as well as the proximal (higher) homotopic distance. We outline the fundamental properties of some concepts related to the proximal (or descriptive proximal) TC numbers. In addition, we provide some instances of (descriptive) proximity spaces, specifically on basic robot vacuum cleaners, to illustrate the results given on proximal and descriptive proximal TC.

math.AT↗

Different Types of Topological Complexity on Higher Homotopic Distance

We first study the higher version of the relative topological complexity by using the homotopic distance. We also introduced the generalized version of the relative topological complexity of a topological pair on both the Schwarz genus and the homotopic distance. With these concepts, we give some inequalities including the topological complexity and the Lusternik-Schnirelmann category, the most important parts of the study of robot motion planning in topology. Finally, by defining the parametrised topological complexity via the homotopic distance, we present some estimates on the higher setting of this concept.

math.AT↗

Explicit motion planning in digital projective product spaces

We introduce the digital projective product spaces based on Davis' projective product spaces. We determine an upper bound for the digital LS-category of the digital projective product spaces. In addition, we obtain an upper bound for the digital topological complexity of these spaces. We prove the relation between the digital topological complexity of the digital projective product spaces and sum of the digital topological complexity of the digital projective space by associating with the first digital sphere and the digital topological complexity of the remaining digital spheres through an explicit motion planning construction, which shows digital perspective validity of the results given by S. Fişekci and L. Vandembroucq. We apply our outcomes on specific spaces in order to be more clear.

math.AT↗

Topological Complexities of Finite Digital Images

Digital topological methods are often used on computing the topological complexity of digital images. We give new results on the relation between reducibility and digital contractibility in order to determine the topological complexity of a digitally connected finite digital image. We present all possible cases of the topological complexity TC of a finite digital image in Z and Z^2$. Finally, we determine the higher topological complexity TC_{n} of finite irreducible digital images independently of the number of points for n > 1.

math.GN↗

Counterexamples for Topological Complexity in Digital Images

Digital topology has its own working conditions and sometimes differs from the normal topology. In the area of topological robotics, we have important counterexamples in this study to emphasize this red line between a digital image and a topological space. We indicate that the results on topological complexities of certain path-connected topological spaces show alterations in digital images. We also give a result about the digital topological complexity number using the genus of a digital surface in discrete geometry.

math.CO↗