earticle

논문검색

Offline Signature Verification Using Critical Region Matching

초록

영어

Signature can be seen as an individual characteristic of a person which, if modeled with precision can be used for his/her validation. An automated signature verification technique saves valuable time and money. The paper is primarily focused on skilled forgery detection. It emphasizes on the extraction of the critical regions which are more prone to mistakes and matches them following a modular graph matching approach. The technique is robust and takes care of the inevitable intra- personal variations. The results show significant improvement over other approaches for detecting skilled forgery.

목차

Abstract
 1. Introduction
 2. Preprocessing:
  2.1. Binarization
  2.2. Noise Removal
  2.3. Rotation of Signatures
  2.4. Thinning of Signatures
 3. Critical Region based graph matching approach:
  3.1 The Polyfit Function
  3.2 Extraction of critical points:
  3.3 Finding the corresponding critical points among the sample signatures:
  3.4 Extraction of critical regions and comparing them using graph matching:
  3.5 Signature verification:
 4. Results
 5. Discussions and Conclusions
 References

저자정보

  • Abhay Bansal Dept. of computer Science Netaji Subhas Institute of Technology, Delhi University
  • Bharat Gupta Dept. of computer Science Netaji Subhas Institute of Technology, Delhi University
  • Gaurav Khandelwal Dept. of computer Science Netaji Subhas Institute of Technology, Delhi University
  • Shampa Chakraverty Dept. of computer Science Netaji Subhas Institute of Technology, Delhi University

참고문헌

    ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

    0개의 논문이 장바구니에 담겼습니다.