ISSN ONLINE(2319-8753)PRINT(2347-6710)

All submissions of the EM system will be redirected to Online Manuscript Submission System. Authors are requested to submit articles directly to Online Manuscript Submission System of respective journal.

Amazing porn model Belle Delphine nudes on Watch free video collection of Belle Delphine nede leaked

Rare Muslim porn and سكس on Tons of Arab porn clips.

XNXX and Xvideos porn clips free on Best XnXX porn tube channels, categorized sex videos, homemade and amateur porn.

Exlusive russian porn Get uniqe porn clips from Russia

Find out on best collection of Arabain and Hijab سكس

Experimental Assessment on Latent Fingerprint Matching Using Affine Transformation

R.Kausalya1 and S.Pandiarajan2
  1. Dept of Computer science and Engineering, Kalaignar Karunanidhi Institute of Technology, Coimbatore, India.
  2. Kalaignar Karunanidhi Institute of Technology, Coimbatore, India.
Related article at Pubmed, Scholar Google

Visit for more related articles at International Journal of Innovative Research in Science, Engineering and Technology


In forensics latent fingerprint identification is critical importance to identifying suspects: latent fingerprints are invisible fingerprint impressions left by fingers on surfaces of objects. The proposed algorithm uses a robust alignment algorithm (mixture contour and Orientation based Descriptor) to align fingerprints and to get the similarity score between fingerprints by considering minutiae points and ridge orientation field information.The texture-based descriptors (local binary patterns and local phase quantization), address important issues related to the dissimilarity representation, such as the impact of the number of references used for verification and identification. However, the overlapped region shape similarity retrieved from minutiae spatial distribution information provides additional important criteria. After finding the overlapping region of a possible affine transform, we can measure to find the shape dissimilarity via the application of the shape context to all interior points.TheHybrid matching algorithm, is to prune outlier minutiae pairs, and secondly to provide more information to use in similarity evaluation.


Orientation and texture descriptors, latent‘s, affine transform, contour context, matching.


Recent research and development efforts on latent fingerprints can be classified into three streams according to the manual input required from fingerprint examiners: consistent with existing practice, increasing manual input, or reducing manual input. Because of large variations in latent fingerprint quality and specific requirements of practical applications (crime scenes, border crossing points, battle fields), each of the three streams has its value. Nowadays, automated fingerprint identification system (AFIS) has become an indispensable tool for law enforcement agencies. Truly latent (―hidden‖) prints are not visible to the naked eye, and substantially consist of only the natural secretions of human skin. Such prints require treatment to cause them to become visible. This treatment is called ―latent print development.‖Lifting oflatents may involve a complicated process, and it can range from simply photographing the print to more complex dusting or chemical processing [1]-[3].Rolled prints contain the largest amount of information about the ridge structure on a fingerprint since they capture the largest finger surface area; latents usually contain the least amount of information for matching or identification because of their size and inherent noise. Compared to rolled or plain fingerprints, latents are smudgy and blurred, capture only a small finger area, and have large nonlinear distortion due to pressure variations. Due to their poor quality and small area, latents have a significantly smaller number of minutiae compared to rolled or plain prints (the average number of minutiae in NIST Special Database 27 (NIST SD27) [3], [4] images is 21 for latents versus 106 for their mated rolled prints). These characteristics make the latent fingerprint matching problem very challenging.


A. Security Issues of Partial Fingerprint Matching
In general, fingerprint recognition systems are considered as being of high security strength. Since a fingerprint data is in the order of several kilobytes, it provides the security of having a long password without the overhead of remembering that information. However, unlike a password system, in which an exact match is expected for authentication of an individual, a fingerprint recognition system can only provide the individual‘s identity information with a certain confidence level. Thus, some kind of distortion tolerant mechanism is required which can reduce the security strength of the system. Moreover, with the small number of features on a partial fingerprint, the security strength of partial fingerprint recognition is further diminished. Before we replace the password and PIN authentication systems with fingerprint recognition, we must answer the question ―how secure is the fingerprint based system compared to the password or PIN based systems?‖ Besides, the relation between the acquired fingerprint size and its security strength plays a key role in the designing of a fingerprint recognition system. This relation between the two must be further studied before we can expect wider acceptance of fingerprint authentication systems.
B. Fingerprint Image Enhancement
Fingerprint image quality is an important factor in the performance of minutiae extraction and matching algorithms. A good quality fingerprint image has high contrast between ridges and valleys. A poor quality fingerprint image is low in contrast, noisy, broken, or smudgy, causing spurious and missing minutiae. Poor quality can be due to cuts, creases, or bruises on the surface of finger tip, excessively wet or dry skin condition, uncooperative attitude of subjects, damaged and unclean scanner devices, low quality fingers (elderly people, manual worker), and other factors. The goal of an enhancement algorithm is to improve the clarity (contrast) of the ridge structures in a fingerprint. General-purpose image enhancement techniques are not very useful due to the non-stationary nature of a fingerprint image. However, techniques such as gray-level smoothing, contrast stretching, histogram equalization, and Wiener filtering can be used as pre-processing steps before a sophisticated fingerprint enhancement algorithm is applied.
Techniques that use single filter convolutions on the entire image are not suitable. Usually, a fingerprint image is divided into sub regions and then a filter whose parameters are pre-tuned according to the region‘s characteristics is applied.


A. Feature Extraction
The most common features in latent fingerprint are minutiae points essentially terminations and bifurcations of the ridge lines that constitute a fingerprint pattern. The overall feature extraction algorithm is divided into, (i)Preprocessing and segmentation, (ii)Thinning and feature extraction and (iii)Minutiae Extraction. The preprocessing is used to obtain the ridge segmented binary fingerprint image from the original gray scale fingerprint image. The following steps are involved in preprocessing, (a)Foreground and background segmentation, (b)Ridge segmentation and (c) Directional Smoothing of ridges. The Thinning and Feature Extraction technique, the binary image is thinned to have one pixel fingerprint image using skeletonization, which results in to spurious minutiae. The skeleton needs to be smoothed before minutiae point to be located.The two main methods of minutiae feature extraction either require the gray-scale image to be converted to a binary image, or work directly on a raw or enhanced gray-scale image. The binary image based method; the binarization of the gray-scale image is the initial step. This requires each gray-scale pixel intensity value to be transformed to a binary intensity of black (0) or white (1). The simplest approach is to apply a global threshold where each pixel is mapped according to
B.Affine Transform
An affine transformation or affine map or an affinity is a function between affine spaces which preserves points, straight lines and planes. Also, sets of parallel lines remain parallel after an affine transformation. An affine transformation does not necessarily preserve angles between lines or distances between points, though it does preserve ratios of distances between points lying on a straight line.The normal image minutiae set cannot proceed to find minutiae pairs from triplets without some pre-processing for the following critical reasons:
• Fingerprint impressions can differ in orientation, considering the direction field in the triplet useless,
• Fingerprint impressions can differ in offset, considering the x-y fields in the triplet useless, and
• Skin elasticity creates non-linear distortion or ‗warping‘ to occur when different directional pressure is applied causing triplet x-y variations to occur.
To address the issues concerning the lack of invariance of the triplet structure, registration is required. The registration concerns the alignment and overlay of the template and test fingerprints so that corresponding regions of the fingerprints have minimal geometric distance to each other. Registration can be achieved geometrically by applying (to either the test or template fingerprint minutiae set) a heuristically guided affine transform, where minutiae triplet field values are updated with,
overlap and uniform direction.The global registration process notably reduces the search space. This reduces algorithm complexity for finding minutiae pairs, since matching pairs are formed in smaller local neighbourhoods (i.e. constraints added for minutiae mappings).
C. Mixture Contour and Orientation Based Descriptor
The mixture based matching algorithms that use contour based descriptors based on point samples (or point pattern matching algorithms) are analogous to minutiae-based fingerprint matching algorithms, as they usually combine the use of descriptors with dynamic programming, greedy, simulated annealing, and energy minimization based algorithms, in order to register shapes and compute a similarity measure. The texture based descriptor is a robust contour based shape descriptor used for calculating shape similarity and the recovering of point correspondences.The mixture contour representationthat flexibly encodes junction information and curvature. The representation discretizes contour orientation at an interest point and records contour intensity at each angle as feature elements.Contour shape techniques only exploit shape boundary information. There are generally two types of very different approaches for contour shape modelling: continuous approach (global) and discrete approach (structural). Continuous approaches do not divide shape into subparts; usually a feature vector derived from the integral boundary is usedto describe the shape.The orientation based descriptor context are distributed as histograms, we can use a modification of the X2 statistic:
wherehxi and hyj denote the K-bin histograms of points xi and yj, respectively. This cost canbe modified to include application specific weighting and additional costs, in order to addextra relevant information, and hence, improve accuracy.
D.Hybrid Matching Process
The proposed hybrid matching algorithm based on a modified version of the enhanced shape context method along with the integration of the orientation-based descriptor illustrating asignificant performance improvement over the enhanced shape context method. The main objective of the integration is two-fold, firstly to prune outlier minutiae pairs, and secondly to provide more information to use in similarity assessment.The minutiae pairs have been established, pruning is performed to remove unnatural pairings. However, if we closely analyze the orientation-based descriptor used for pruning, we can see that a fundamental flaw arises with partial fingerprint coverage, specifically for minutiae pairs near fingerprint image edges.A proposed modification to the contour context and orientation-based descriptor is applied so that the amount of common region coverage that each descriptor has is reflected in the similarity score. This is achieved by a simple Gaussian weighting of equation,
The cut-off point where all good sample totals below this value are weighed count is the total number of good samples (i.e. where a good sample is defined to be in a coherent partial fingerprint region), and is a tunable parameter. However, for a more exhaustive approach, one could empirically review the estimated distribution of orientation-based similarity scores for true and false cases, with specific attention towards the effect of coverage completeness on the accuracy of the similarity measure.


The latent fingerprint images from the FVC2002 DB1 to DB4 (388 x 374 pixel) database, were used for our simulation.The experimental results presented in this paper suggested that our proposed framework consistently performs well for different security environments, while ensuring the security of biometric system. Fig.2 shows implementation result of Hybrid matching process which gives better matching performance.
The number of imposter points is very low; the False Acceptance rate (FAR) ishigh with the high degree of polynomial. According to this, higher the FAR, Genuine Acceptance rate (GAR) is also high but False Rejection rate is low. If this is not happened, FRR is high, and then system will not be valid one.


In this paper, the idea of latent fingerprint matching method using a texture based shape and orientation descriptor outperforms many well-known methods on the FVC2002 database competition, considering that the feature set was not in pristine condition due to the chosen extraction and filtering methods, highlighting theoverall robustness of the proposed algorithm. A fingerprint Hybrid matching algorithm designed for matching latents to rolled/plain fingerprints which is based on a descriptorbased Affine Transform alignment. A comparison between the alignment performance of the proposed algorithm and the well-known Generalized Affine Transform shows the superior performance of the proposed method.


[1] Alessandra A. Paulino, JianjiangFeng, and Anil K. Jain, “Latent Fingerprint Matching Using Descriptor-Based Hough Transform” IEEE Trans. ON Information Forensics And Security, Vol. 8, no. 1, Jan. 2013

[2] Maltoni, D., Maio, D., Jain, A.K., Prabhakar, S.: Handbook of Fingerprint Recognition (Second Edition). Springer-Verlag (2009)

[3] C. Champod, C. Lennard, P. Margot, and M. Stoilovic, Fingerprints and Other Ridge Skin Impressions. Boca Raton, FL: CRC Press, 2004.

[4] NIST Special Database 27, Fingerprint Minutiae From Latent and Matching Tenprint Images [Online]. Available:

[5] M. Tico and P. Kuosmanen, “Fingerprint matching using and orientation-based minutia descriptor,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 25, no. 8, pp. 1009–1014, Aug. 2003.

[6] J. Qi, S. Yang, and Y. Wang, ―Fingerprint matching combining the global orientation field with minutia,‖ Pattern Recognit. Lett., vol. 26, pp. 2424–2430, 2005.

[7] J. Gu, J. Zhou, and C. Yang, “Fingerprint recognition by combining global structure and local cues,” IEEE Trans. Image Process., vol. 15, no. 7, pp. 1952–1964, Jul. 2006.

[8] R. Cappelli, M. Ferrara, and D. Maltoni, “Minutia cylinder-code: A new representation and matching technique for fingerprint recognition,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 32, no. 12, pp. 2128–2141, Dec. 2010.

[9] X. Jiang and W.-Y. Yau, “Fingerprint minutiae matching based on the local and global structures,” in Proc. 15th Int. Conf. Pattern Recognit., 2000, pp. 1038–1041.

[10] X. Chen, J. Tian, and X. Yang, “A new algorithm for distorted fingerprints matching based on normalized fuzzy similarity measure,” IEEE Trans. Image Process., vol. 15, no. 3, pp. 767– 776, Mar. 2006.

[11] W.Xu, X. Chen, and J. Feng, “Arobust fingerprint matching approach: Growing and fusing of local structures,” in Proc. Int. Conf. Biometrics, Seoul, Korea, Aug. 2007, pp. 134–143.

[12] J. Feng, “Combining minutiae descriptors for fingerprint matching,” Pattern Recognit., vol. 41, pp. 342–352, 2008.

[13] A.K. Jain and J. Feng, “Latent fingerprint matching,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 33, no. 1, pp. 88–100, Jan. 2011.

[14] J. Feng, S. Yoon, and A. K. Jain, “Latent fingerprint matching: Fusion of rolled and plain fingerprints,” in Proc. Int. Conf. Biometrics (ICB), Alghero, Italy, Jun. 2009, pp. 695–704.

[15] A.K. Jain, J. Feng, A. Nagar, and K. Nandakumar, “Onmatching latent fingerprints,” in Proc. CVPR Workshops on Biometrics, Jun. 2008, pp. 1–8.

[16] J. Feng and A. K. Jain, “Filtering large fingerprint database for latent matching,” in Proc. ICPR, Dec. 2008, pp. 1–4.

[17] S. Yoon, J. Feng, and A. K. Jain, “On latent fingerprint enhancement,” in Proc. SPIE, Apr. 2010, vol. 7667, no. 766707.

[18] S. Yoon, J. Feng, and A. K. Jain, “Latent fingerprint enhancement via robust orientation field estimation,” in Proc. Int. Joint Conf. Biometrics, New Delhi, India, Oct. 2011, pp. 1–8.

[19] A.Sankaran, T. I. Dhamecha,M. Vatsa, and R. Singh, “On matching latent to latent fingerprints,” in Proc. Int. Joint Conf. Biometrics, Oct. 2011, pp. 1–6.

[20] M. Vatsa, R. Singh, A. Noore, and K. Morris, “Simultaneous latent fingerprint recognition,” Appl. Soft Comput., vol. 11, no. 7, pp. 4260–4266, Oct. 2011.