Please use this identifier to cite or link to this item: https://repository.unej.ac.id/xmlui/handle/123456789/56599
Title: PENGENALAN SIDIK JARI MENGGUNAKAN GRAF TERHUBUNG 24 (Fingerprint Recognation Using Connected Graph
Authors: Kiswara Agung Santoso
Keywords: Arches, loops, whorls, minutiae, isomorphic
Issue Date: 1-Apr-2014
Series/Report no.: Majalah Ilmiah Matematika dan Statistika;Volume 13, Juni 2013
Abstract: Someone could be known from his fingerprints because finger print is unique or not the same for everyone. Seen as a characteristic finger print pattern off low lines and the orientation of the flow lines on the skin. The pattern is divided into three arches, loops, whorls. At the finger prints are the angles caused by the intersection of the line/groove orientation commonly called minutiae. This paper will discuss the application of graph theory to analyze the finger print minutiae by using this. A graph is said to be equalif mutually isomorphic, so that if two finger print shave a pattern like the two graphs are isomorphic each other, it can be said that both the finger print belonged to a person.
URI: http://repository.unej.ac.id/handle/123456789/56599
ISSN: 1411-6669
Appears in Collections:Fakultas Matematika & Ilmu Pengetahuan Alam

Files in This Item:
File Description SizeFormat 
Kiswara Agung Santoso_1.pdf96.98 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.