Partial fingerprint matching based on SIFT Features
Journal Title: International Journal on Computer Science and Engineering - Year 2010, Vol 2, Issue 4
Abstract
Fingerprints are being extensively used for person identification in a number of commercial, civil, and forensic applications. The current Fingerprint matching technology is quite mature for matching full prints, matching partial fingerprints still needs lots of improvement. Most of the current fingerprint identification systems utilize features that are based on minutiae points and ridge patterns. The major challenges faced in partial fingerprint matching are the absence of ufficient minutiae features and other structures such as core and delta. However, this technology suffers from the problem of handling incomplete prints and often discards any partial ingerprints obtained. Recent research has begun to delve into the roblems of latent or partial fingerprints. In this paper we resent a novel approach for partial fingerprint matching cheme ased on IFT (Scale Invariant Feature Transform) eatures and tching is achieved using a modified point matching rocess. Using Neurotechnology database, we demonstrate that the proposed method exhibits an improved performance when matching full print against partial print
Authors and Affiliations
Ms. S. Malathi , Dr. C. Meena
Keywords
Related Articles
- EP ID EP108058
- DOI -
- Views 113
- Downloads 0
Facial Expression Recognition
Facial expression analysis is rapidly becoming an area of ntense interest in computer science and human-computer interaction design communities. The most expressive way humans display emotions is through facial expressi...
Enhanced Component Retrieval Scheme Using Suffix Tree in Object Oriented Paradigm
In today’s world software are used everywhere i.e. every electronic devices use software. So there is a large demand of software but in the same proportion the development is not growing. It is similar to the supply dema...
DESIGN OF PARAMETER EXTRACTOR IN LOW POWER PRECOMPUTATION BASED CONTENT ADDRESSABLE MEMORY
Content-addressable memory (CAM) is frequently used in applications, such as lookup tables, databases, associative computing, and networking, that require high-speed searches due to its ability to improve application per...
A new approach for improvement of fractal image encoding
In this paper, we propose, in a first part, an approach to reduce the computational complexity of fractal image ncoding by using the Shannon entropy (APENT). A speedup factor of 8 is obtained while image quality is stil...
Co-Recursively Enumerable Triods with Computable Endpoints
Recursive sets in the Euclidean space are those sets which an be effectively approximated by finitely many points for an arbitrary given precision. On the other hand, co-recursively enumerable sets are those sets whose...