Fingerprint indexing based on minutiae pairs and convex core point

2017 ◽  
Vol 67 ◽  
pp. 110-126 ◽  
Author(s):  
Javad Khodadoust ◽  
Ali Mohammad Khodadoust
Keyword(s):  
Core Point ◽  
Fingerprint Indexing ◽  
Convex Core

scholarly journals Geodesic planes in geometrically finite acylindrical -manifolds

2021 ◽  
pp. 1-40
Author(s):  
YVES BENOIST ◽  
HEE OH
Keyword(s):  
Closed Geodesic ◽  
Duke Math ◽  
Geometrically Finite ◽  
Convex Cocompact ◽  
Invent Math ◽  
Convex Core

Abstract Let M be a geometrically finite acylindrical hyperbolic $3$ -manifold and let $M^*$ denote the interior of the convex core of M. We show that any geodesic plane in $M^*$ is either closed or dense, and that there are only countably many closed geodesic planes in $M^*$ . These results were obtained by McMullen, Mohammadi and Oh [Geodesic planes in hyperbolic 3-manifolds. Invent. Math.209 (2017), 425–461; Geodesic planes in the convex core of an acylindrical 3-manifold. Duke Math. J., to appear, Preprint, 2018, arXiv:1802.03853] when M is convex cocompact. As a corollary, we obtain that when M covers an arithmetic hyperbolic $3$ -manifold $M_0$ , the topological behavior of a geodesic plane in $M^*$ is governed by that of the corresponding plane in $M_0$ . We construct a counterexample of this phenomenon when $M_0$ is non-arithmetic.

scholarly journals E-Serviços no Governo Eletrônico: Análise Bibliométrica de Artigos Internacionais

2015 ◽  
Vol 7 (2) ◽  
pp. 62
Author(s):  
Marcus Vinicius Moreira Zittei ◽  
Francisco Carlos Fernandes
Keyword(s):  
Quantitative Analysis ◽  
Literature Review ◽  
Electronic Government ◽  
Core Point ◽  
Descriptive Research ◽  
The Core ◽  
Scopus Database ◽  
Bibliometric Approach

In the present study, the objective was to analyze the production and the publications profile of the theme: e-services tools referring to eGovernment in the Scopus database, for the period as from 2001 through 2015. The electronic government includes tools for the government's relationship with society, citizens, other governments and businesses. The focus of these articles includes e-services and e-Government activities for the businesses. It was used descriptive research, conducted through literature review, with bibliometric approach and quantitative analysis, with sample collected in the Scopus database. It was found that the number of works in this period was 299, of which 45 papers published in events in 2010 and 16 articles published in journals in 2013. The core point of the articles with the highest citation is related to the deployment and the users’ awareness on tools established by countries.

scholarly journals Core point pixel-level localization by fingerprint features in spatial domain

2022 ◽  
Vol 19 (1) ◽  
pp. 707-737
Author(s):  
Xueyi Ye ◽  
◽  
Yuzhong Shen ◽  
Maosheng Zeng ◽  
Yirui Liu ◽  
...  
Keyword(s):  
Singular Point ◽  
Reference Point ◽  
False Positive ◽  
Spatial Domain ◽  
Fingerprint Recognition ◽  
Localization Accuracy ◽  
Localization Method ◽  
Core Point ◽  
Point Detection ◽  
Fingerprint Alignment

<abstract> <p>Singular point detection is a primary step in fingerprint recognition, especially for fingerprint alignment and classification. But in present there are still some problems and challenges such as more false-positive singular points or inaccurate reference point localization. This paper proposes an accurate core point localization method based on spatial domain features of fingerprint images from a completely different viewpoint to improve the fingerprint core point displacement problem of singular point detection. The method first defines new fingerprint features, called furcation and confluence, to represent specific ridge/valley distribution in a core point area, and uses them to extract the innermost Curve of ridges. The summit of this Curve is regarded as the localization result. Furthermore, an approach for removing false Furcation and Confluence based on their correlations is developed to enhance the method robustness. Experimental results show that the proposed method achieves satisfactory core localization accuracy in a large number of samples.</p> </abstract>

A Fingerprint Indexing Approach Using Multiple Similarity Measures and Spectral Clustering

2015 ◽  
Author(s):  
Ntethelelo A. Mngenge ◽  
Linda Mthembu ◽  
Fulufhelo V. Nelwamondo ◽  
Cynthia H. Ngejane
Keyword(s):  
Spectral Clustering ◽  
Similarity Measures ◽  
Fingerprint Indexing

Convex cores of measures on R d

2001 ◽  
Vol 38 (1-4) ◽  
pp. 177-190 ◽  
Author(s):  
Imre Csiszár ◽  
F. Matúš
Keyword(s):  
Borel Measure ◽  
Convex Sets ◽  
Probability Measures ◽  
Countable Number ◽  
Borel Sets ◽  
Finite Borel Measure ◽  
Number Of Faces ◽  
Convex Core

We define the convex core of a finite Borel measure Q on R d as the intersection of all convex Borel sets C with Q(C) =Q(R d). It consists exactly of means of probability measures dominated by Q. Geometric and measure-theoretic properties of convex cores are studied, including behaviour under certain operations on measures. Convex cores are characterized as those convex sets that have at most countable number of faces.

scholarly journals Convexity in complex networks

2018 ◽  
Vol 6 (2) ◽  
pp. 176-203 ◽  
Author(s):  
TILEN MARC ◽  
LOVRO ŠUBELJ
Keyword(s):  
Complex Networks ◽  
Geodesic Distance ◽  
Connected Subgraph ◽  
Geodesic Path ◽  
Connected Subset ◽  
Social Collaboration ◽  
Graph Properties ◽  
Definition Of ◽  
Locally Convex ◽  
Convex Core

AbstractMetric graph properties lie in the heart of the analysis of complex networks, while in this paper we study their convexity through mathematical definition of a convex subgraph. A subgraph is convex if every geodesic path between the nodes of the subgraph lies entirely within the subgraph. According to our perception of convexity, convex network is such in which every connected subset of nodes induces a convex subgraph. We show that convexity is an inherent property of many networks that is not present in a random graph. Most convex are spatial infrastructure networks and social collaboration graphs due to their tree-like or clique-like structure, whereas the food web is the only network studied that is truly non-convex. Core–periphery networks are regionally convex as they can be divided into a non-convex core surrounded by a convex periphery. Random graphs, however, are only locally convex meaning that any connected subgraph of size smaller than the average geodesic distance between the nodes is almost certainly convex. We present different measures of network convexity and discuss its applications in the study of networks.

Translation process and information dissemination in a multilingual world

2021 ◽  
Vol 80 (2) ◽  
pp. 301-308
Author(s):  
Zh.K. Akbalaeva ◽  
Keyword(s):  
Information Dissemination ◽  
Global Culture ◽  
Translation Process ◽  
Global Context ◽  
Core Point

Historically people who were close to translation have always been working in a multilingual world. The global culture of translation is more an exciting practice that allows considering the changes and transformations taking place in this field. This paper touches upon the current theories of globalization and it influence on translation. It makes attempts to understand the significance of translation in a global context, defining its analytical place in globalization and its core point in the global culture and information dissemination.

Sign in / Sign up

Export Citation Format

Share Document