Show simple item record

dc.contributor.authorDiaz, Moises
dc.contributor.authorFerrer, Miguel A.
dc.contributor.authorRamalingam, Soodamani
dc.contributor.authorGuest, Richard
dc.date.accessioned2019-06-25T00:05:52Z
dc.date.available2019-06-25T00:05:52Z
dc.date.issued2019-09-16
dc.identifier.citationDiaz , M , Ferrer , M A , Ramalingam , S & Guest , R 2019 , ' Investigating the Common Authorship of Signatures by Off-line Automatic Signature Verification without the Use of Reference Signatures ' , IEEE Transactions on Information Forensics and Security , vol. 15 , no. 1 , 8742639 , pp. 487-499 . https://doi.org/10.1109/TIFS.2019.2924195
dc.identifier.issn1556-6013
dc.identifier.otherPURE: 16206752
dc.identifier.otherPURE UUID: 84116e31-629a-4736-a5f0-6bf1c0064300
dc.identifier.otherScopus: 85077337450
dc.identifier.urihttp://hdl.handle.net/2299/21388
dc.description© 2019 IEEE
dc.description.abstractIn automatic signature verification, questioned specimens are usually compared with reference signatures. In writer-dependent schemes, a number of reference signatures are required to build up the individual signer model while a writer-independent system requires a set of reference signatures from several signers to develop the model of the system. This paper addresses the problem of automatic signature verification when no reference signatures are available. The scenario we explore consists of a set of signatures, which could be signed by the same author or by multiple signers. As such, we discuss three methods which estimate automatically the common authorship of a set of off-line signatures. The first method develops a score similarity matrix, worked out with the assistance of duplicated signatures; the second uses a feature-distance matrix for each pair of signatures; and the last method introduces pre-classification based on the complexity of each signature. Publicly available signatures were used in the experiments, which gave encouraging results. As a baseline for the performance obtained by our approaches, we carried out a visual Turing Test where forensic and non-forensic human volunteers, carrying out the same task, performed less well than the automatic schemes.en
dc.format.extent13
dc.language.isoeng
dc.relation.ispartofIEEE Transactions on Information Forensics and Security
dc.rightsOpen
dc.subjectStatic signature verification, Biometrics, Common authorship, Features-distance matrix, Signature complexity
dc.subjectbiometrics
dc.subjectno reference signatures
dc.subjectOff-line signature verification
dc.subjectfeature-distance matrix
dc.subjectsignature complexity
dc.subjectSafety, Risk, Reliability and Quality
dc.subjectComputer Networks and Communications
dc.titleInvestigating the Common Authorship of Signatures by Off-line Automatic Signature Verification without the Use of Reference Signaturesen
dc.contributor.institutionSchool of Engineering and Technology
dc.contributor.institutionCentre for Engineering Research
dc.contributor.institutionCommunications and Intelligent Systems
dc.contributor.institutionSmart Mobility Unit
dc.description.statusPeer reviewed
dc.identifier.urlhttp://www.scopus.com/inward/record.url?scp=85077337450&partnerID=8YFLogxK
dc.relation.schoolSchool of Engineering and Technology
dc.description.versiontypeFinal Accepted Version
dcterms.dateAccepted2019-09-16
rioxxterms.versionAM
rioxxterms.versionofrecordhttps://doi.org/10.1109/TIFS.2019.2924195
rioxxterms.licenseref.uriOther
rioxxterms.typeJournal Article/Review
herts.preservation.rarelyaccessedtrue
herts.rights.accesstypeOpen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record