• Title/Summary/Keyword: parametric signature verification

Search Result 6, Processing Time 0.022 seconds

A Technique of Calculating a Weighted Euclidean Distance with a Personalized Feature Set in Parametric Signature Verification (매개변수적 서명 검증에서 개인화된 특징 집합의 가중치 유클리드 거리 산출 기법)

  • Kim, Seong-Hoon
    • Journal of the Korea Society for Simulation
    • /
    • v.14 no.3
    • /
    • pp.137-146
    • /
    • 2005
  • In parametric approach to a signature verification, it generally uses so many redundant features unsuitable for each individual signature that it causes harm, instead. This paper proposes a method of determining personalized weights of a feature set in signature verification with parametric approach by identifying the characteristics of each feature. For an individual signature, we define a degree of how difficult it is for any other person to forge the one's (called 'DFD' as the Degree of Forgery Difficulty). According to the statistical characteristics and the intuitional characteristics of each feature, the standard features are classified into four types. Four types of DFD functions are defined and applied into the distance calculation as a personalized weight factor. Using this method, the error rate of signature verification is reduced and the variation of the performance is less sensitive to the changes of decision threshold.

  • PDF

A Structural Representation of Handwritings for Automatic On-line Signature Verification (온라인 서명 검증을 위한 필기의 구조적 표현)

  • Kim, Seong-Hoon
    • Journal of the Korea Society for Simulation
    • /
    • v.14 no.3
    • /
    • pp.147-154
    • /
    • 2005
  • In conventional approaches such as a functinal approach or a parametric approach to online signature verification, which could not deal with the local shape of signature, much various important informations inherent in the local part of signature shape have been overlooked. In this paper, we try a structural approach in which a signature is represented as a structural form of handwriting primitives and the local parts along a signature handwriting can be selectively compared according to their discrimination power in the process of signature verification, As a result, the error rate is diminished in the case that the weights of subpattern units is applied into comparing process, which is the degree of discrimination power of local part. And also, the global variation and complexity of each signature extracted from the analysis of local shape is found useful in determining the decision threshold more precisely.

  • PDF

An Automatic Signature Verification Algorithm for Smart Devices

  • Kim, Seong-Hoon;Fan, Yunhe;Heo, Gyeongyong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.10
    • /
    • pp.15-21
    • /
    • 2015
  • In this paper, we propose a stable automatic signature verification algorithm applicable to various smart devices. The proposed algorithm uses real and forgery data all together, which can improve the verification rate dramatically. As a tool for signature acquisition in a smart device, two applications, one using touch with a finger and the other using a pressure-sensing-stylus pen, are developed. The verification core is based on SVM and some modifications are made to include the characteristics of signatures. As shown in experimental results, the minimum error rate was 1.84% in the SVM based method, which can easily defeat 4.38% error rate with the previous parametric approach. Even more, 2.43% error rate was achieved with the features excluding pressure-related features, better than the previous approach including pressure-related features and only about 0.6% more error than the best result, which means that the proposed algorithm can be applied to a smart device with or without pressure-sensing-stylus pens and used for security purposes.

A Structural Approach to On-line Signature Verification (구조적 접근방식의 온라인 자동 서명 겁증 기법)

  • Kim, Seong-Hoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.4 s.36
    • /
    • pp.385-396
    • /
    • 2005
  • In this paper, a new structural approach to on-line signature verification is presented. A primitive pattern is defined as a part segmented by a local minimal position of speed. And a structural description of signature is composed of subpatterns which are defined as such forms as rotation shape, cusp shape and bell shape, acquired by composition of the primitives regarding the directional changes. As the matching method to find identical parts between two signatures, a modified DP(dynamic programming) matching algorithm is presented. And also, variation and complexity of local parts are computed from the training samples, and reference model and decision boundary are derived from these. Error rate, execution time and memory usage are compared among the functional approach, the parametric approach and the proposed structural approach. It is found that the average error rate can be reduced from 14.2% to 4.05% when the local parts of a signature are weighted and the complexity is used as a factor of decision threshold. Though the error rate is similar to that of functional approaches. time consumption and memory usage of the proposed structural approach are shown to be very effective.

  • PDF

Feature Extraction based FE-SONN for Signature Verification (서명 검증을 위한 특정 기반의 FE-SONN)

  • Koo Gun-Seo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.6 s.38
    • /
    • pp.93-102
    • /
    • 2005
  • This paper proposes an approach to verify signature using autonomous self-organized Neural Network Model , fused with fuzzy membership equation of fuzzy c-means algorithm, based on the features of the signature. To overcome limitations of the functional approach and Parametric approach among the conventional on-line signature recognition approaches, this Paper presents novel autonomous signature classification approach based on clustering features. Thirty-six globa1 features and twelve local features were defined, so that a signature verifying system with FE-SONN that learns them was implemented. It was experimented for total 713 signatures that are composed of 155 original signatures and 180 forged signatures yet 378 original signatures written by oneself. The success rate of this test is more than 97.67$\%$ But, a few forged signatures that could not be detected by human eyes could not be done by the system either.

  • PDF

A Multiple Signature Authentication System Based on BioAPI for WWW (웹상의 BioAPI에 기반한 서명 다중 인증 시스템)

  • Yun Sung Keun;Kim Seong Hoon;Jun Byung Hwan
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.9
    • /
    • pp.1226-1232
    • /
    • 2004
  • Biometric authentication is rising technology for the security market of the next generation. But most of biometric systems are developed using only one of various biological features. Recently, there is a vigorous research for the standardization of various biometric systems. In this paper, we propose a web-based authentication system using three other verifiers based on functional, parametric, and structural approaches for one biometrics of handwritten signature, which is conformable to a specification of BioAPI introduced by BioAPI Consortium for a standardization of biometric technology. This system is developed with a client-server structure, and clients and servers consist of three layers according to the BioAPI structure. The proposed neb-based multiple authentication system of one biometrics can be used to highly increase confidence degree of authentication without additional several biological measurements, although rejection rate is a little increased. That is, the false accept rate(FAR) decreases on the scale of about 1:40,000, although false reject rate(FRR) increases about 2.7 times in the case of combining above three signature verifiers. So the proposed approach can be used as an effective identification method on the internet of an open network. Also, it can be easily extended to a security system using multimodal biometrics.