|
|
Basic fingerprint liveness detection
Horák, Tomáš ; Smital, Lukáš (referee) ; Kašpar, Jakub (advisor)
This work focuses on recognizing fingerprints liveness based purely on software-methods evaluating symptoms from just one fingerprint image. At first in this work was described the issue of biometry as such, comparing the advantages and disadvantages of such systems. Next part deal with more detailed process of fingerprint biometry including papillary lines and overall fingerprints as such. In the next phase, the problems and utilization of both software and hardware methods are discussed, including principles of individual approaches. This part is followed by a selection of used fingertip symptoms. This is followed by the practical part and the LivDet 2011 database, which was used for finger recognition. In the practical part is also described the used neural network capturing minor differences in fingerprints according to 13 symptoms.
|
|
|
Basic fingerprint liveness detection
Horák, Tomáš ; Smital, Lukáš (referee) ; Kašpar, Jakub (advisor)
Biometric data is unique, safe and often used to protect information. Even in some cases, detectors can be fooled, and therefore liveness is needed to check. This work focuses on the basic recognition of the liveliness of the fingerprint. Only one finger image is used. For perfect recognition, you need to compare the prints, so have more than one print, and that's why this detection is very demanding. Pre-processing was done with a binary segmentation mask. Methods using gray scale ratios, mean, standard deviations or histogram equalization were also used. All the methods were done on the LivDet 2011 database, in the Matlab environment and the goal was to recognize a live fingerprints from a false ones.
|
|
|
Visibility Determination in 3D Maze
Hodes, Vít ; Pečiva, Jan (referee) ; Polok, Lukáš (advisor)
This work is about solving the visibility problem in the environment of simple 3D maze by means of BSP tree and PVS computation between leaves. It contains description of key algorithms and processes for achieving this goal. In the core of this work were all of the implemented ways of drawing measured and mutually compared. At the end are outlined next possible steps in development and evaluating achieved results.
|
|
|
Error protection of data transmission using BCH Codes
Kašpar, Jaroslav ; Křivánek, Vítězslav (referee) ; Němec, Karel (advisor)
The thesis Data transmission error-protection with BCH codes deals with a large class of random-error correcting cyclic codes which are able to protect binary data and can be used for example in data storages, high speed modems. Bose, Chaudhuri and Hocquenghem (BCH) codes operate over algebraic structures called Galois fields. The BCH encoding is the same as cyclic encoding and can be done with linear feedback shift register but decoding is more complex and can be done with different algorithms - in this thesis there are two algorithms for decoding Peterson and Berlekam-Massey mentioned. The aim of this thesis is to find BCH code which is able to correct t = 6 independent errors in up to data sequence n = 150 bits, then peruse possible realizations of the codecs and set criteria for the best realization, then design and test this realization. This thesis is split into three main parts. In the first part there are encoding and decoding methods of the BCH code generally described. The second part deals with selecting of the right code and realization. There was chosen BCH (63,30) code and realization with FPGA chip. In the last part is described design of BCH encoder and decoder and compilation in the Altera design software.
|
guest ::
