Human authentication through signature recognition
This dissertation describes a signature verification algorithm based on k-nearest neighbours and Levenshtein distance. It is a simple on-line method for classifying handwritten signatures into either genuines or forgeries. Forgery consists on imitating a signature, a document, a banknote or a valued...
| Autor: | |
|---|---|
| Tipo de recurso: | tesis de maestría |
| Fecha de publicación: | 2019 |
| País: | España |
| Institución: | Universitat Oberta de Catalunya (UOC) |
| Repositorio: | O2, repositorio institucional de la UOC |
| OAI Identifier: | oai:openaccess.uoc.edu:10609/95626 |
| Acceso en línea: | http://hdl.handle.net/10609/95626 |
| Access Level: | acceso abierto |
| Palabra clave: | security signature verification biometrics handwritten seguridad verificación de firmas biometria firmas manuscritas verificació de signatures signatures manuscrites seguretat Authentication -- TFM Autenticació de documents -- TFM Autentificación de documentos -- TFM |
| Sumario: | This dissertation describes a signature verification algorithm based on k-nearest neighbours and Levenshtein distance. It is a simple on-line method for classifying handwritten signatures into either genuines or forgeries. Forgery consists on imitating a signature, a document, a banknote or a valued work. It is considered a crime in most countries and it still remains a major problem in nowadays banking. In first place, a brief introduction to the history of biometric systems and handwritten signatures is made. After explaining the state of the art of the field the used well-known methods are explained. Then the used datased is showed and our algorithm presented and implemented. |
|---|