The Experts below are selected from a list of 143877 Experts worldwide ranked by ideXlab platform
Anna Vaccarelli - One of the best experts on this subject based on the ideXlab platform.
-
an asymmetric fingerprint Matching Algorithm for java card tm
Pattern Analysis and Applications, 2006Co-Authors: Stefano Bistarelli, Francesco Santini, Anna VaccarelliAbstract:We propose a light-weight fingerprint Matching Algorithm that can be executed inside the devices with a limited computational power. The Algorithm is based on the minutiae local structures (the “neighborhoods”), that are invariant with respect to global transformations like translation and rotation. The match Algorithm has been implemented inside a smartcard over the Java CardTM platform, meeting the individual’s need for information privacy and overall authentication procedure security. The main characteristic of the Algorithm is to have an asymmetric behavior, in respect to the execution time, between correct positive and negative matches. The performances in terms of authentication reliability and speed were tested on some databases from the Fingerprint Verification Competition 2002 and 2004 editions (FVC2002 and FVC2004). Moreover, our procedure showed better reliability when compared with a related Algorithm on the same database. We can achieve a false acceptance rate (FAR) of 0.1%, a false rejection rate of about 6%, and from 0.3 to 8 s to match most of the finger pairs during the FAR tests.
-
an asymmetric fingerprint Matching Algorithm for java card tm
Lecture Notes in Computer Science, 2005Co-Authors: Stefano Bistarelli, Francesco Santini, Anna VaccarelliAbstract:A novel fingerprint Matching Algorithm is proposed in this paper. The Algorithm is based on the minutiae local structures, that are invariant with respect to global transformations like translation and rotation. The match Algorithm has been implemented inside a smartcard over the Java CardTM platform, meeting the individual's need for information privacy and the overall authentication procedure security. The main characteristic of the Algorithm is to have an asymmetric behaviour, in respect to the execution time, between correct positive and negative matches. The performances in terms of authentication reliability and speed have been tested on some databases from the Fingerprint Verification Competition 2002 (FVC2002). Moreover, our procedure has shown better reliability results when compared with related Java CardTM Algorithms.
Chang Liang - One of the best experts on this subject based on the ideXlab platform.
-
Matching Algorithm of semantic web service based on similarity of ontology concepts
Informationization, 2008Co-Authors: Shi Zhongzhi, Qiu Lirong, Chang LiangAbstract:A semantic distance between ontology concepts is defined to calculate the similarity between ontology concepts.Based on the similarity,a new semantic Web service Matching Algorithm proposed.This Algorithm abides by the grade of the traditional and classic OWL-S/UDDI Algorithm and gives the precise Matching between Web services.
-
Matching Algorithm of Semantic Web Service Based on Similarity of Ontology Concepts
Computer Engineering, 2008Co-Authors: Chang LiangAbstract:A semantic distance between ontology concepts is defined to calculate the similarity between ontology concepts.Based on the similarity,a new semantic Web service Matching Algorithm is proposed.This Algorithm abides by the grade of the classic OWL-S/UDDI Algorithm and gives the precise Matching between Web services.Experimental results show that the average precision of the new Algorithm is 1.8 times than the OWL-S/UDDI Algorithm and the average recall of the new Algorithm is 1.4 times than the OWL-S/UDDI Algorithm.
Stefano Bistarelli - One of the best experts on this subject based on the ideXlab platform.
-
an asymmetric fingerprint Matching Algorithm for java card tm
Pattern Analysis and Applications, 2006Co-Authors: Stefano Bistarelli, Francesco Santini, Anna VaccarelliAbstract:We propose a light-weight fingerprint Matching Algorithm that can be executed inside the devices with a limited computational power. The Algorithm is based on the minutiae local structures (the “neighborhoods”), that are invariant with respect to global transformations like translation and rotation. The match Algorithm has been implemented inside a smartcard over the Java CardTM platform, meeting the individual’s need for information privacy and overall authentication procedure security. The main characteristic of the Algorithm is to have an asymmetric behavior, in respect to the execution time, between correct positive and negative matches. The performances in terms of authentication reliability and speed were tested on some databases from the Fingerprint Verification Competition 2002 and 2004 editions (FVC2002 and FVC2004). Moreover, our procedure showed better reliability when compared with a related Algorithm on the same database. We can achieve a false acceptance rate (FAR) of 0.1%, a false rejection rate of about 6%, and from 0.3 to 8 s to match most of the finger pairs during the FAR tests.
-
an asymmetric fingerprint Matching Algorithm for java card tm
Lecture Notes in Computer Science, 2005Co-Authors: Stefano Bistarelli, Francesco Santini, Anna VaccarelliAbstract:A novel fingerprint Matching Algorithm is proposed in this paper. The Algorithm is based on the minutiae local structures, that are invariant with respect to global transformations like translation and rotation. The match Algorithm has been implemented inside a smartcard over the Java CardTM platform, meeting the individual's need for information privacy and the overall authentication procedure security. The main characteristic of the Algorithm is to have an asymmetric behaviour, in respect to the execution time, between correct positive and negative matches. The performances in terms of authentication reliability and speed have been tested on some databases from the Fingerprint Verification Competition 2002 (FVC2002). Moreover, our procedure has shown better reliability results when compared with related Java CardTM Algorithms.
Shoab A Khan - One of the best experts on this subject based on the ideXlab platform.
-
modified chamfer Matching Algorithm
Lecture Notes in Computer Science, 2003Co-Authors: Abdul Ghafoor, Rao Naveed Iqbal, Shoab A KhanAbstract:Image Matching is an important task. There are many available methods for occluded image Matching. In this paper we propose new simple image-Matching Algorithm, modified chamfer Matching Algorithm (MCMA). Distance transform and conventional chamfer Matching Algorithm are explained. Examples to demonstrate the Algorithm and necessary results are also included. Proposed MCMA is robust, and to an extent rotation, scale and rotation invariant method.
Harvey A Cohen - One of the best experts on this subject based on the ideXlab platform.
-
hierarchical image Matching a chamfer Matching Algorithm using interesting points
Intelligent Information Systems, 1995Co-Authors: Jane You, W P Zhu, Edwige E Pissaloux, Harvey A CohenAbstract:Image Matching in conjunction with a distance transform has played an important role in computer vision and image analysis. This paper presents a new hierarchical chamfer Matching Algorithm based on the detection of interesting points. The Algorithm extends the traditional method by introducing interesting points to replace edge points in the distance transform for the Matching measurement. A series of images, with different numbers of interesting points featuring in the original image, is created in a pyramid structure through a dynamic thresholding scheme. The Matching is performed in this pyramid in a coarse-to-fine level order, by minimizing a given Matching criterion in terms of the distance between selected interesting points. This hierarchical structure aims to reduce the computational load. The Algorithm is simple to implement and quite insensitive to noise and other disturbances. In addition, such a hierarchical Matching scheme is implemented on a low-cost heterogeneous PVM (Parallel Virtual Machine) network to speed up the processing without any specific software and hardware requirements.
