Offline writer authentication

dc.contributor.advisorCoetzer, Johannesen_ZA
dc.contributor.authorShumba, Sanduraen_ZA
dc.contributor.otherStellenbosch University. Faculty of Science. Dept. of Mathematical Sciences. Division Applied Mathematics.en_ZA
dc.date.accessioned2021-11-22T17:57:42Z
dc.date.accessioned2021-12-22T14:22:33Z
dc.date.available2021-11-22T17:57:42Z
dc.date.available2021-12-22T14:22:33Z
dc.date.issued2021-12
dc.descriptionThesis (MSc)--Stellenbosch University, 2021.en_ZA
dc.description.abstractENGLISH ABSTRACT: In this thesis a number of systems are proposed for the purpose of offline writer authentication. A text-dependent approach is adopted, since a very specific targeted handwritten word is considered for authentication purposes. Feature extraction is facilitated by calculating a number of projections of the targeted word from different angles. Two distinct categories of systems are proposed. The first category employs template matching and is based on the computation of the Euclidean distance and a dynamic time warping (DTW) distance between corresponding feature vectors, while the second category relies on machine learning techniques, that is support vector machines (SVMs) and quadratic discriminant analysis (QDA). Within the context of the proposed machine learning-based systems, a writer-independent protocol is followed. This is achieved by employing a DTW-based dichotomy transformation which converts a feature set in feature space into a dissimilarity vector-based representation in dissimilarity space. This dichotomy transformation is followed by writer-specific dissimilarity vector normalisation which significantly improves interclass separability. The DTW-based dichotomy transformation and writer-specific dissimilarity vector normalisation are novel within the context of offline writer authentication. The systems developed in this study are evaluated on a subset of the CEDAR-LETTER data set. It is demonstrated that the proficiency of the systems developed in this study are at least on par when compared to existing systems. The most proficient SVM-based system developed in this study achieves an AUC of 93% and an equal error rate (EER) of 14.93%.en_ZA
dc.description.abstractAFRIKAANSE OPSOMMING: In hierdie tesis word ’n aantal stelsels vir die doel van vanlyn skrywerverifikasie voorgestel. ’n Teksafhanklike benadering word gevolg, aangesien ’n baie spesifieke handgeskrewe teikenwoord vir verifikasiedoeleindes beskou word. Kenmerkonttrekking word moontlik gemaak deur ’n aantal projeksies van die teikenwoord vanuit verskillende hoeke te bereken. Twee aparte kategorieë van stelsels word voorgestel. Die eerste kategorie gebruik templaatpassing en is gebaseer of die berekening van die Euklidiese afstand en ’n dinamiese tydsverbuiging (DTW) afstand tussen die ooreenstemmende kenmerkvektore, terwyl die tweede kategorie op masjienleertegnieke staatmaak, m.a.w. ondersteuningsvektormasjiene (SVMs) en kwadratiese diskriminant-analise (QDA). Binne die konteks van die voorgestelde masjienleergebaseerde stelsels word ’n skrywer-onafhanklike protokol gevolg. Dit word moontlik gemaak deur ’n DTW-gebaseerde tweeledigheidstransformasie te ontplooi wat ’n kenmerkstel in die kenmerkruimte na ’n verskilvektor-gebaseerde voorstelling in die verskilruimte omskakel. Hierdie tweeledigheidstransformasie word deur skrywerspesifieke verskilvektor-normalisasie gevolg, wat interklas-skeibaarheid aansienlik verhoog. Die DTW-gebaseerde tweeledigheidstransformasie en skrywerspesifieke verskilvektor-normalisasie is nuut binne die konteks van vanlyn skrywerverifikasie. Die stelsels wat in hierdie tesis ontwikkel is, word op ’n substel van die CEDAR-LETTER datastel geëvalueer. Dit word aangetoon dat die vaardigheid van die stelsels wat in hierdie studie ontwikkel is ten minste soortgelyk is aan dié van bestaande stelsels. Die mees vaardige SVM-gebaseerde stelsel wat in hierdie studie ontwikkel is behaal ’n AUC van 93% en ’n gelyke foutkoers (EER) van 14.93%.af_ZA
dc.description.versionMasters
dc.format.extentxiii, 75 pages : illustrationsen_ZA
dc.identifier.urihttp://hdl.handle.net/10019.1/123807
dc.language.isoen_ZAen_ZA
dc.publisherStellenbosch : Stellenbosch Universityen_ZA
dc.rights.holderStellenbosch Universityen_ZA
dc.subjectBiometric identificationen_ZA
dc.subjectHandwriting -- Authentificationen_ZA
dc.subjectTemplate matching (Digital image processing)en_ZA
dc.subjectPattern recognition systemsen_ZA
dc.subjectSupport vector machinesen_ZA
dc.subjectUCTD
dc.titleOffline writer authenticationen_ZA
dc.typeThesisen_ZA
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
shumba_offline_2021.pdf
Size:
3.52 MB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Plain Text
Description: