Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "signature verification" wg kryterium: Temat


Wyświetlanie 1-11 z 11
Tytuł:
Optimized jk-nearest neighbor based online signature verification and evaluation of main parameters
Autorzy:
Saleem, Muhammad
Kovari, Bence
Powiązania:
https://bibliotekanauki.pl/articles/2097967.pdf
Data publikacji:
2021
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
k-nearest neighbor
online signature verification
classification
Opis:
In this paper, we propose an enhanced jk-nearest neighbor (jk-NN) algorithm for online signature verification. The effect of its main parameters is evaluated and used to build an optimized system. The results show that the jk-NN classifier improves the verification accuracy by 0.73–10% as compared to a traditional one-class k-NN classifier. The algorithm achieved reasonable accuracy for different databases: a 3.93% average error rate when using the SVC2004, 2.6% for the MCYT-100, 1.75% for the SigComp’11, and 6% for the SigComp’15 databases. These results followed a state-of-the-art accuracy evaluation where both forged and genuine signatures were used in the training phase. Another scenario is also presented in this paper by using an optimized jk-NN algorithm that uses specifically chosen parameters and a procedure to pick the optimal value for k using only the signer’s reference signatures to build a practical verification system for real-life scenarios where only these signatures are available. By applying the proposed algorithm, the average error rates that were achieved were 8% for SVC2004, 3.26% for MCYT-100, 13% for SigComp’15, and 2.22% for SigComp’11.
Źródło:
Computer Science; 2021, 22 (4); 539--551
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Hidden Signature for DTW Signature Verification in Authorizing Payment Transactions
Autorzy:
Putz-Leszczyńska, J.
Kudelski, M.
Powiązania:
https://bibliotekanauki.pl/articles/308543.pdf
Data publikacji:
2010
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
dynamic time warping
hidden signature
payment transactions
signature verification
Opis:
Traditional use of dynamic time warping for signature verification consists of forming some dissimilarity measure between the signature in question and a set of "template signatures". In this paper, we propose to replace this set with the hidden signature and use it to calculate the normalized errors of signature under verification. The approach was tested on the MCYT database, using both genuine signatures and skilled forgeries. Moreover, we present the real-world application of the proposed algorithm, namely the complete biometric system for authorizing payment transactions. The authorization is performed directly at a point of sale by the automatic signature verification system based on the hidden signature.
Źródło:
Journal of Telecommunications and Information Technology; 2010, 4; 59-67
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Offline signature identification and verification using noniterative shape context algorithm
Autorzy:
Adamski, M.
Saeed, K.
Powiązania:
https://bibliotekanauki.pl/articles/333019.pdf
Data publikacji:
2009
Wydawca:
Uniwersytet Śląski. Wydział Informatyki i Nauki o Materiałach. Instytut Informatyki. Zakład Systemów Komputerowych
Tematy:
weryfikacja podpisu
offline signature verification (SV)
signature identification
shape context method
Opis:
The paper presents experimental results on offline signature identification and verification. At the first stage of the presented system, the binary image of the signature undergoes skeletonization process using KMM algorithm to have a thinned, one pixel-wide line, to which a further reduction is applied. For each thinned signature image a fixed number of points comprising the skeleton line are selected. The recognition process is based on comparing the reference signatures with the questioned samples using distance measure computed by means of Shape Context algorithm. The experiments were carried out using a database containing signatures of 20 individuals. For the verification process random forgeries were used to asses the system error. The main advantage of the presented approach lies in utilizing only one reference signature for both identification and verification tasks, whereas the achieved results are comparable with respect to the systems that use several training samples per subject.
Źródło:
Journal of Medical Informatics & Technologies; 2009, 13; 47-52
1642-6037
Pojawia się w:
Journal of Medical Informatics & Technologies
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Identyfikacja błędnych podpisów w kolekcjach
Batch identification of bad signatures
Autorzy:
Pieprzyk, J.
Pastuszak, J.
Powiązania:
https://bibliotekanauki.pl/articles/317682.pdf
Data publikacji:
2001
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
weryfikacja podpisów cyfrowych
weryfikacja podpisów cyfrowych w kolekcjach
identyfikacja błędnych podpisów
kody identyfikujące błędne podpisy
digital signature verification
batch signature verification
bad signature identification
identification codes
Opis:
Weryfikacja poprawności podpisów cyfrowych jest obliczeniowo kosztowna. Aby ją zwiększyć, zamiast pojedynczych podpisów weryfikacji poddaje się kolekcje. Jeżeli wszystkie podpisy w kolekcji są poprawne, to cała kolekcja jest akceptowana. Pojawienie się błędnych podpisów w kolekcji powoduje, że weryfikacja jest błędna. Nie można odrzucić całej kolekcji, zachodzi więc konieczność identyfikacji błędnych podpisów w kolekcji. W artykule zdefiniowano metody identyfikacji błędnych podpisów. W szczególności określono weryfikacje typu "dziel i rządź", w których wejściowe kolekcje są dzielone na podkolekcje tak długo, aż końcowe błędne kolekcje zawierają pojedyncze podpisy. Opisano również weryfikator Hamminga identyfikujący jeden błędny podpis w kolekcji oraz uogólniono ten weryfikator do postaci dwupoziomowego weryfikatora, umożliwiającego identyfikacje dwóch błędnych podpisów. Podano też definicję ogólnego weryfikatora zdolnego do identyfikacji dowolnej liczby błędnych podpisów w kolekcjach.
Verification of digital signatures is expensive in terms of computing resources required to perform the task. Batch verification is a technique that uses homomorphic property to increase efficiency. If all signatures are correct in a batch, the whole batch is accepted otherwise bad signature must be identified and rejected. For obvious reasons, rejection of bad batches is not possible as they typically include also valid signatures that must be accepted. In the paper, methods of bad signature identification are defined. In particular, the identification using the "divide and conquer" method is described. In this method the input batch is repeatedly divided into sub-batches until the final sub-batches contain single bad signatures. The Hamming verifier is defined as the one being able to identify a single bad signature. Its generalisation allowing identification of two bad signatures resulting in the so-called two level Hamming verifier, is given. The work concludes with remarks about verifiers that identify arbitrary number of bad signatures.
Źródło:
Telekomunikacja i Techniki Informacyjne; 2001, 2; 46-60
1640-1549
1899-8933
Pojawia się w:
Telekomunikacja i Techniki Informacyjne
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Offline signature verification based on shape contexts using shared and user-specific thresholds
Autorzy:
Adamski, M.
Saeed, K.
Powiązania:
https://bibliotekanauki.pl/articles/333777.pdf
Data publikacji:
2013
Wydawca:
Uniwersytet Śląski. Wydział Informatyki i Nauki o Materiałach. Instytut Informatyki. Zakład Systemów Komputerowych
Tematy:
offline signature verification (SV)
shape contexts
weryfikacja podpisu w trybie offline
Opis:
In this paper we present a system for offline signature verification based on Shape Context Descriptors. The system input are binarized images of handwritten signatures from GPDS database available for non-commercial research. During preprocessing each signature image is thinned using KMM algorithm in order to obtain 1-pixel wide skeleton. The feature vector is built from Shape Context Descriptors computed for selected points on skeletonized signature line. The verification process is based on the distance measure that uses Shape Context Descriptors. The presented system is evaluated using random and skilled forgeries with shared and user-specific thresholds.
Źródło:
Journal of Medical Informatics & Technologies; 2013, 22; 195-201
1642-6037
Pojawia się w:
Journal of Medical Informatics & Technologies
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Signature verification: A comprehensive study of the hidden signature method
Autorzy:
Putz-Leszczyńska, J.
Powiązania:
https://bibliotekanauki.pl/articles/331346.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
signature verification
online recognition
time warping
hidden signature
weryfikacja podpisu
rozpoznawanie online
podpis ukryty
Opis:
Many handwritten signature verification algorithms have been developed in order to distinguish between genuine signatures and forgeries. An important group of these methods is based on dynamic time warping (DTW). Traditional use of DTW for signature verification consists in forming a misalignment score between the verified signature and a set of template signatures. The right selection of template signatures has a big impact on that verification. In this article, we describe our proposition for replacing the template signatures with the hidden signature—an artificial signature which is created by minimizing the mean misalignment between itself and the signatures from the enrollment set. We present a few hidden signature estimation methods together with their comprehensive comparison. The hidden signature opens a number of new possibilities for signature analysis. We apply statistical properties of the hidden signature to normalize the error signal of the verified signature and to use the misalignment on the normalized errors as a verification basis. A result, we achieve satisfying error rates that allow creating an on-line system, ready for operating in a real-world environment.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2015, 25, 3; 659-674
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An algorithm for the evolutionary-fuzzy generation of on-line signature hybrid descriptors
Autorzy:
Zalasiński, Marcin
Cpałka, Krzysztof
Laskowski, Łukasz
Wunsch II, Donald C.
Przybyszewski, Krzysztof
Powiązania:
https://bibliotekanauki.pl/articles/1837539.pdf
Data publikacji:
2020
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
biometrics
on-line signature
dynamic signature
dynamic signature verification
evolutionary-fuzzy signature partitioning
horizontal partitioning
vertical partitioning
Opis:
In biometrics, methods which are able to precisely adapt to the biometric features of users are much sought after. They use various methods of artificial intelligence, in particular methods from the group of soft computing. In this paper, we focus on on-line signature verification. Such signatures are complex objects described not only by the shape but also by the dynamics of the signing process. In standard devices used for signature acquisition (with an LCD touch screen) this dynamics may include pen velocity, but sometimes other types of signals are also available, e.g. pen pressure on the screen surface (e.g. in graphic tablets), the angle between the pen and the screen surface, etc. The precision of the on-line signature dynamics processing has been a motivational springboard for developing methods that use signature partitioning. Partitioning uses a well-known principle of decomposing the problem into smaller ones. In this paper, we propose a new partitioning algorithm that uses capabilities of the algorithms based on populations and fuzzy systems. Evolutionary-fuzzy partitioning eliminates the need to average dynamic waveforms in created partitions because it replaces them. Evolutionary separation of partitions results in a better matching of partitions with reference signatures, eliminates disproportions between the number of points describing dynamics in partitions, eliminates the impact of random values, separates partitions related to the signing stage and its dynamics (e.g. high and low velocity of signing, where high and low are imprecise-fuzzy concepts). The operation of the presented algorithm has been tested using the well-known BioSecure DS2 database of real dynamic signatures.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2020, 10, 3; 173-187
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Signature verification using contextual information enhancement and dynamic programming
Autorzy:
Adamski, M.
Saeed, K.
Powiązania:
https://bibliotekanauki.pl/articles/332874.pdf
Data publikacji:
2008
Wydawca:
Uniwersytet Śląski. Wydział Informatyki i Nauki o Materiałach. Instytut Informatyki. Zakład Systemów Komputerowych
Tematy:
weryfikacja podpisu online
programowanie dynamiczne
online signature verification
feature context
dynamic programming
Opis:
This paper presents the results of experiments on online signature verification. Information gathered during the signing process like pen trajectory, pressure, elevation and altitude is utilized to prove the authenticity of a signature or to detect a forgery attempt. Signature verification task is carried out by means of the Template Matching approach. The presented method is based on the signature description in terms of its local features and their relations. The comparison of features in the reference and tested signatures is conducted using Dynamic Time Warping technique.
Źródło:
Journal of Medical Informatics & Technologies; 2008, 12; 35-40
1642-6037
Pojawia się w:
Journal of Medical Informatics & Technologies
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The prediction of the low fetal birth weight based on quantitative description of cardiotocographic signals
Autorzy:
Czabański, R.
Jeżewski, M.
Wróbel, J.
Kupka, T.
Łęski, J.
Jeżewski, J.
Powiązania:
https://bibliotekanauki.pl/articles/333495.pdf
Data publikacji:
2008
Wydawca:
Uniwersytet Śląski. Wydział Informatyki i Nauki o Materiałach. Instytut Informatyki. Zakład Systemów Komputerowych
Tematy:
weryfikacja podpisu online
programowanie dynamiczne
online signature verification
feature context
dynamic programming
Opis:
Cardiotocography (CTG) is a routine method of fetal condition assessment used in modern obstetrics. It is a biophysical method based on simultaneous recording and analysis of activity of fetal heart, fetal movements and maternal uterine contractions. The fetal condition is diagnosed on the basis of printed CTG trace evaluation. The correct interpretation of CTG traces from a bedside monitor is very difficult even for experienced clinicians. Therefore, computerized fetal monitoring systems are used to yield the quantitative description of the signal. However, the effective methods, aiming to support the conclusion generation, are still being searched. One of the most important features defining the state of fetal outcome is the weight of the newborn. The presented work describes an application of the Artificial Neural Network Based on Logical Interpretation of fuzzy if-then Rules (ANBLIR) to evaluate the risk of the low birth weight using a set of parameters quantitatively describing the CTG traces. The obtained results confirm that the neuro-fuzzy based CTG classification methods are very efficient for the prediction of the fetal outcome.
Źródło:
Journal of Medical Informatics & Technologies; 2008, 12; 97-102
1642-6037
Pojawia się w:
Journal of Medical Informatics & Technologies
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A statistical approach for off-line signature verification (SV)
Autorzy:
Das, M.T.
Dulger, L.C.
Dulger, H.E.
Powiązania:
https://bibliotekanauki.pl/articles/332991.pdf
Data publikacji:
2009
Wydawca:
Uniwersytet Śląski. Wydział Informatyki i Nauki o Materiałach. Instytut Informatyki. Zakład Systemów Komputerowych
Tematy:
weryfikacja podpisu
sieci neuronowe
offline signature verification (SV)
particle swarm optimization (PSO)
neural networks (NN)
chi-square test
PSO-NN
Opis:
This paper includes off line Signature Verification (SV) process with test results using the proposed algorithm Particle Swarm Optimization-Neural Network (PSO-NN) together with statistical analysis, Chi-square test. The verification process is performed in four steps. Signature images are scanned (data acquisition) and image processing is applied to make images suitable for extracting features (pre-processing). Each pre-processed image is then used to extract relevant geometric parameters (feature extraction) that can distinguish signatures of different volunteers. Finally, the proposed verification algorithm is tested on the database that includes 1350 skilled and genuine signatures taken from 25 volunteers. The Chi-square test is applied to see how the signature data fits with probability test function.
Źródło:
Journal of Medical Informatics & Technologies; 2009, 13; 33-39
1642-6037
Pojawia się w:
Journal of Medical Informatics & Technologies
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Evolutionary algorithm for selecting dynamic signatures partitioning approach
Autorzy:
Zalasiński, Marcin
Laskowski, Łukasz
Niksa-Rynkiewicz, Tacjana
Cpałka, Krzysztof
Byrski, Aleksander
Przybyszewski, Krzysztof
Trippner, Paweł
Dong, Shi
Powiązania:
https://bibliotekanauki.pl/articles/2147146.pdf
Data publikacji:
2022
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
identity verification
dynamic signature
hybrid partitions
partitions’ selection
evolutionary algorithm
Opis:
In the verification of identity, the aim is to increase effectiveness and reduce involvement of verified users. A good compromise between these issues is ensured by dynamic signature verification. The dynamic signature is represented by signals describing the position of the stylus in time. They can be used to determine the velocity or acceleration signal. Values of these signals can be analyzed, interpreted, selected, and compared. In this paper, we propose an approach that: (a) uses an evolutionary algorithm to create signature partitions in the time and velocity domains; (b) selects the most characteristic partitions in terms of matching with reference signatures; and (c) works individually for each user, eliminating the need of using skilled forgeries. The proposed approach was tested using Biosecure DS2 database which is a part of the DeepSignDB, a database with genuine dynamic signatures. Our simulations confirmed the correctness of the adopted assumptions.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2022, 12, 4; 267--279
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-11 z 11

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies