• Proceedings of the Korea Multimedia Society Conference
• /
• 2012.05a
• /
• pp.43-45
• /
• 2012

This paper is based on embedding the biometrics techniques on GPU for better computational efficiency and fast matching process using the parallel nature of the GPU processors to compare thousands of images for fingerprint recognition in a fraction of a second. In this paper we worked on GPU (INVIDIA GeForce GTX 260 with compute capability 1.3 and dual core-2-dou processor) for fingerprint matching and found that the efficiency is better than the results with related work already done on CMOS, CPU, ARM9, MATLAB Neural Networks etc which shows the better performance of our system in terms of computational time. The features matching process proposed for fingerprint recognition and the verification procedure is done on 5,000 images which are available online in the databases FVC2000, 2002, 2004 [1].

• Journal of Korea Multimedia Society
• /
• v.23 no.1
• /
• pp.8-14
• /
• 2020

For a reliable fingerprinting system, improving fingerprint matching accuracy is crucial. In this paper, we try to improve a binary image fingerprint matching performance by utilizing auxiliary information, power mask, which is obtained while constructing fingerprint DB. The power mask is an expected robustness of each fingerprint bit. A caveat of the power mask is the increased storage cost of the fingerprint DB. This paper mitigates the problem by reducing the size of the power mask utilizing spatial correlation of an image. Experiments on a publicly-available image dataset confirmed that the power mask is effective in improving fingerprint matching accuracy.

• Journal of Korea Multimedia Society
• /
• v.9 no.10
• /
• pp.1304-1313
• /
• 2006

Biometric-based authentication can provide strong security guarantee about the identity of users. However, security of biometric data is particularly important as the compromise of the data will be permanent. In this paper, we propose a secure and efficient protocol to transmit fingerprint images from a fingerprint sensor to a client by exploiting characteristics of fingerprint images. Because the fingerprint sensor is computationally limited, however, such encryption algorithm may not be applied to the full fingerprint images in real-time. To reduce the computational workload on the resource-constrained sensor, we apply the encryption algorithm to a specific bitplane of each pixel of the fingerprint image. We use the LSB as specific bitplane instead of MSB used to encrypt general multimedia contents because simple attacks can reveal the fingerprint ridge information even from the MSB-based encryption. Based on the experimental results, our proposed algorithm can reduce the execution time of the full encryption by a factor of six and guarantee both the integrity and the confidentiality without any leakage of the ridge information.

• Journal of Korea Multimedia Society
• /
• v.11 no.3
• /
• pp.323-330
• /
• 2008

In this paper, we propose a new fingerprint sensing method that can reduce orientation error. General fingerprint input methods need finger to be put on the surface of a sensor. It can cause of rotation problem and it affects the recognition result significantly. This improved input method can minimize the rotation of a finger by holding double-sided sensor with both thumb and index finger at the same time. Whenever fingerprint is impressed, it has nearly the same orientation because sensors are located between two fingers. As a result, we can get a better performance in fingerprint recognition system, but it may need more hardware cost.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.6
• /
• pp.794-799
• /
• 2008

This paper presents a user identification method at H.264 streaming using watermarking with fingerprints. The watermark can efficiently reduce the potential danger of forgery or alteration. Especially a biometric watermark has convenient, economical advantages. The fingerprint watermark can also improve reliability of verification using automated fingerprint identification systems. These algorithms, however, are not robust against common video compression. To overcome this problem, we analyze H.264 compression pattern and extract watermark after restoring damaged watermark using various filters. The proposed algorithm consists of enhancement of a fingerprint image, watermark insertion using discrete wavelet transform and extraction after restoring. The proposed algorithm can achieve robust watermark extraction against H.264 compressed videos.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.3
• /
• pp.50-56
• /
• 2009

Recently, according to the product variety of multimedia content some problems are occurred as like an illegal copying, an illegal distribution and a copyright infringement etc. So, for the solution of these problems, some methods were proposed as like watermarking which inserts the information of copyright to the content and the cipher for authentication to DRM which prevents an illegal copying using RSA. In this paper, the multimedia fingerprint based on BIBD code is inserted to the bit-plane of the image content for DRM with RSA, and while the decoding processing. The experiment is operated with the consideration of the image transmission and the transformation. As a result it confirmed that the multimedia fingerprint code inserted in image is detected 60% upper at AWGN 7dB and detected completely 100% at AWGN 10dB upper on PSNR 30, 40, 70 and 80 of Stirmark attacks.

• Journal of Korea Multimedia Society
• /
• v.20 no.8
• /
• pp.1330-1337
• /
• 2017

In off-line phase of the preliminary Cut-off indoor positioning scheme, which is one of the indoor positioning scheme using the fingerprint, relative ranks of peak RSSIs received from beacons at each reference point are stored in the fingerprint map. In some reference points, signals of multiple beacons may be received. In this case, the relative ranks may be different when constructing fingerprint and when receiving signals in real-time. To solve this problem, we propose a method to utilize only up to five beacons with high ranking when constructing a fingerprint and when receiving signals in real-time and comparing them with stored information of a fingerprint. Experiments were conducted on the estimation probabilities and the average error when using this method. Those are compared with the previous methods. Experimental results show that the estimation probabilities and the average error are improved by removing only the remaining five beacons at each reference point of the fingerprint.

• Journal of Korea Multimedia Society
• /
• v.10 no.12
• /
• pp.1577-1584
• /
• 2007

Fingerprint verification is being adopted widely to provide positive identification with a high degree of confidence in all practical areas. This popular usage requires reliable methods for matching of these patterns. To meet the latest expectations, the paper presents a pair wise distance histogram method for fingerprint matching. Here, we introduced a randomized algorithm which exploits pair wise distances between the pairs of minutiae, as a basic feature for match. The method undergoes two steps for completion i.e. first it performs the matching locally then global matching parameters are calculated in second step. The proposed method is robust to common problems that fingerprint matching faces, such as scaling, rotation, translational changes and missing points etc. The paper includes the test of algorithm on various randomly generated minutiae and real fingerprints as well. The results of the tests resemble qualities and utility of method in related field.

• Journal of Korea Multimedia Society
• /
• v.10 no.12
• /
• pp.1655-1662
• /
• 2007

Although the PKl-based user authentication solution has been widely used, the security of it can be deteriorated by a simple password. This is because a long and random private key may be protected by a short and easy-to-remember password. To handle this problem, many biometric-based user authentication solutions have been proposed. However, protecting biometric data is another research issue because the compromise of the biometric data will be permanent. In this paper, we present an implementation to improve the security of the typical PKI-based authentication by protecting the private key with a fingerprint. Compared to the unilateral authentication provided by the typical biometric-based authentication, the proposed solution can provide the mutual authentication. In addition to the increased security, this solution can alleviate the privacy issue of the fingerprint data by conglomerating the fingerprint data with the private key and storing the conglomerated data in a user-carry device such as a smart card. With a 32-bit ARM7-based smart card and a Pentium 4 PC, the proposed fingerprint-based PKI authentication can be executed within 1.3second.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1327-1342
• /
• 2010

With the wide deployment of biometric authentication systems, several issues pertaining security and privacy of the biometric template have gained great attention from the research community. To resolve these issues, a number of biometric template protection methods have been proposed. However, the design of a template protection method to satisfy four criteria, namely diversity, revocability and non-invertibility is still a challenging task, especially performance degradation when template protection method is employed. In this paper, we propose a novel method to generate a revocable minutiae-based fingerprint template. The proposed method consists of feature extraction from fingerprint minutiae pairs, quantization, histogram binning, binarization and eventually binary bit-string generation. The contributions of our method are two fold: alignment-free and good performance. Various experiments on FVC2004 DB1 demonstrated the effectiveness of the proposed methods.