WorldWideScience

Sample records for hiding fingerprint minutiae

  1. Minutiae Extraction from Fingerprint Images - a Review

    CERN Document Server

    Bansal, Roli; Bedi, Punam

    2012-01-01

    Fingerprints are the oldest and most widely used form of biometric identification. Everyone is known to have unique, immutable fingerprints. As most Automatic Fingerprint Recognition Systems are based on local ridge features known as minutiae, marking minutiae accurately and rejecting false ones is very important. However, fingerprint images get degraded and corrupted due to variations in skin and impression conditions. Thus, image enhancement techniques are employed prior to minutiae extraction. A critical step in automatic fingerprint matching is to reliably extract minutiae from the input fingerprint images. This paper presents a review of a large number of techniques present in the literature for extracting fingerprint minutiae. The techniques are broadly classified as those working on binarized images and those that work on gray scale images directly.

  2. Fingerprint Recognition Using Minutia Score Matching

    CERN Document Server

    J, Ravi; R, Venugopal K

    2010-01-01

    The popular Biometric used to authenticate a person is Fingerprint which is unique and permanent throughout a person's life. A minutia matching is widely used for fingerprint recognition and can be classified as ridge ending and ridge bifurcation. In this paper we projected Fingerprint Recognition using Minutia Score Matching method (FRMSM). For Fingerprint thinning, the Block Filter is used, which scans the image at the boundary to preserves the quality of the image and extract the minutiae from the thinned image. The false matching ratio is better compared to the existing algorithm.

  3. Improving Fingerprint Verification Using Minutiae Triplets

    Directory of Open Access Journals (Sweden)

    Leopoldo Altamirano-Robles

    2012-03-01

    Full Text Available Improving fingerprint matching algorithms is an active and important research area in fingerprint recognition. Algorithms based on minutia triplets, an important matcher family, present some drawbacks that impact their accuracy, such as dependency to the order of minutiae in the feature, insensitivity to the reflection of minutiae triplets, and insensitivity to the directions of the minutiae relative to the sides of the triangle. To alleviate these drawbacks, we introduce in this paper a novel fingerprint matching algorithm, named M3gl. This algorithm contains three components: a new feature representation containing clockwise-arranged minutiae without a central minutia, a new similarity measure that shifts the triplets to find the best minutiae correspondence, and a global matching procedure that selects the alignment by maximizing the amount of global matching minutiae. To make M3gl faster, it includes some optimizations to discard non-matching minutia triplets without comparing the whole representation. In comparison with six verification algorithms, M3gl achieves the highest accuracy in the lowest matching time, using FVC2002 and FVC2004 databases.

  4. Binary Representations of Fingerprint Spectral Minutiae Features

    NARCIS (Netherlands)

    Xu, Haiyun; Veldhuis, Raymond N.J.

    2010-01-01

    A fixed-length binary representation of a fingerprint has the advantages of a fast operation and a small template storage. For many biometric template protection schemes, a binary string is also required as input. The spectral minutiae representation is a method to represent a minutiae set as a fixe

  5. Complex Spectral Minutiae Representation For Fingerprint Recognition

    NARCIS (Netherlands)

    Xu, Haiyun; Veldhuis, Raymond N.J.

    2010-01-01

    The spectral minutiae representation is designed for combining fingerprint recognition with template protection. This puts several constraints to the fingerprint recognition system: first, no relative alignment of two fingerprints is allowed due to the encrypted storage; second, a fixed-length featu

  6. A quality integrated spectral minutiae fingerprint recognition system

    NARCIS (Netherlands)

    Xu, Haiyun; Veldhuis, Raymond N.J.; Kevenaar, Tom A.M.; Akkermans, Anton H.M.

    2009-01-01

    Many fingerprint recognition systems are based on minutiae matching. However, the recognition accuracy of minutiae-based matching algorithms is highly dependent on the fingerprint minutiae quality. Therefore, in this paper, we introduce a quality integrated spectral minutiae algorithm, in which the

  7. Reconstructing orientation field from fingerprint minutiae to improve minutiae-matching accuracy.

    Science.gov (United States)

    Chen, Fanglin; Zhou, Jie; Yang, Chunyu

    2009-07-01

    Minutiae are very important features for fingerprint representation, and most practical fingerprint recognition systems only store the minutiae template in the database for further usage. The conventional methods to utilize minutiae information are treating it as a point set and finding the matched points from different minutiae sets. In this paper, we propose a novel algorithm to use minutiae for fingerprint recognition, in which the fingerprint's orientation field is reconstructed from minutiae and further utilized in the matching stage to enhance the system's performance. First, we produce "virtual" minutiae by using interpolation in the sparse area, and then use an orientation model to reconstruct the orientation field from all "real" and "virtual" minutiae. A decision fusion scheme is used to combine the reconstructed orientation field matching with conventional minutiae-based matching. Since orientation field is an important global feature of fingerprints, the proposed method can obtain better results than conventional methods. Experimental results illustrate its effectiveness.

  8. A NOVEL FINGERPRINT RECOGNTION USING MINUTIAE FEATURES

    Directory of Open Access Journals (Sweden)

    S.UMA MAHESWARI

    2013-02-01

    Full Text Available Fingerprint Recognition has been widely used for personal authentication for several centuries. Most of these systems are based on minutiae features like ridge bifurcation and ridge ending. In this paper we present fingerprint recognition by using only ridge ending as the feature vector. A new model is proposed for both denoising and segmentation and the minutiae points are extracted directly from grayscale images without binarization ad thinning. Recognition is performed using classification ensembling with BPNN, SVM and KNN as classifiers. Experimental results obtained using FVC2004 database show that the proposed method works efficiently in a faster and improved manner.

  9. A Reinforcement Learning Agent for Minutiae Extraction from Fingerprints

    NARCIS (Netherlands)

    Bazen, Asker M.; Otterlo, van Martijn; Gerez, Sabih H.; Poel, Mannes; Kröse, B.; De Rijke, M.; Schreiber, G.; Someren, van M.

    2001-01-01

    In this paper we show that reinforcement learning can be used for minutiae detection in fingerprint matching. Minutiae are characteristic features of fingerprints that determine their uniqueness. Classical approaches use a series of image processing steps for this task, but lack robustness because t

  10. Incorporating Ridges with Minutiae for Improved Fingerprint verification

    Directory of Open Access Journals (Sweden)

    Ms.M.Indra

    2012-10-01

    Full Text Available Next to DNA, fingerprint is the unique feature which identifies the individual. Distortions and skin deformations makes the fingerprint unreliable and it is difficult to match using minutiae alone. But when ridge features are incorporated with minutiae features (minutiae type, orientation and position more topological information can be obtained. And also ridges are invariant to transformations such as rotation and translation[1]. Ridge based coordinate system is used to extract the ridge features such as ridge length, ridge count, ridge type and curvature direction in the skeletonized image. Breadth First Search is used to traverse the graph formed using the minutiae as the node and the ridge vector formed using the ridge features as the edge. The proposed ridge feature gives additional information for fingerprint matching with little increment in template size and can be used along with the existing minutiae features to increase the accuracy and robustness of fingerprint recognition systems.

  11. A Fingerprint Minutiae Matching Method Based on Line Segment Vector

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    Minutiae-based fingerprint matching is the most commonly used in an automatic fingerprint identification system. In this paper, we propose a minutia matching method based on line segment vector. This method uses all the detected minutiae (the ridge ending and the ridge bifurcation) in a fingerprint image to create a set of new vectors (line segment vector). Using these vectors, we can determine a truer reference point more efficiently. In addition, this new minutiae vector can also increase the accuracy of the minutiae matching. By experiment on the public domain collections of fingerprint images fvc2004 DB3 set A and DB4 set A, the result shows that our algorithm can obtain an improved verification performance.

  12. Fingerprint Minutiae from Latent and Matching Tenprint Images

    Science.gov (United States)

    NIST Fingerprint Minutiae from Latent and Matching Tenprint Images (PC database for purchase)   NIST Special Database 27 contains latent fingerprints from crime scenes and their matching rolled fingerprint mates. This database can be used to develop and test new fingerprint algorithms, test commercial and research AFIS systems, train latent examiners, and promote the ANSI/NIST file format standard.

  13. Minutia Tensor Matrix: A New Strategy for Fingerprint Matching

    Science.gov (United States)

    Fu, Xiang; Feng, Jufu

    2015-01-01

    Establishing correspondences between two minutia sets is a fundamental issue in fingerprint recognition. This paper proposes a new tensor matching strategy. First, the concept of minutia tensor matrix (simplified as MTM) is proposed. It describes the first-order features and second-order features of a matching pair. In the MTM, the diagonal elements indicate similarities of minutia pairs and non-diagonal elements indicate pairwise compatibilities between minutia pairs. Correct minutia pairs are likely to establish both large similarities and large compatibilities, so they form a dense sub-block. Minutia matching is then formulated as recovering the dense sub-block in the MTM. This is a new tensor matching strategy for fingerprint recognition. Second, as fingerprint images show both local rigidity and global nonlinearity, we design two different kinds of MTMs: local MTM and global MTM. Meanwhile, a two-level matching algorithm is proposed. For local matching level, the local MTM is constructed and a novel local similarity calculation strategy is proposed. It makes full use of local rigidity in fingerprints. For global matching level, the global MTM is constructed to calculate similarities of entire minutia sets. It makes full use of global compatibility in fingerprints. Proposed method has stronger description ability and better robustness to noise and nonlinearity. Experiments conducted on Fingerprint Verification Competition databases (FVC2002 and FVC2004) demonstrate the effectiveness and the efficiency. PMID:25822489

  14. Minutia tensor matrix: a new strategy for fingerprint matching.

    Science.gov (United States)

    Fu, Xiang; Feng, Jufu

    2015-01-01

    Establishing correspondences between two minutia sets is a fundamental issue in fingerprint recognition. This paper proposes a new tensor matching strategy. First, the concept of minutia tensor matrix (simplified as MTM) is proposed. It describes the first-order features and second-order features of a matching pair. In the MTM, the diagonal elements indicate similarities of minutia pairs and non-diagonal elements indicate pairwise compatibilities between minutia pairs. Correct minutia pairs are likely to establish both large similarities and large compatibilities, so they form a dense sub-block. Minutia matching is then formulated as recovering the dense sub-block in the MTM. This is a new tensor matching strategy for fingerprint recognition. Second, as fingerprint images show both local rigidity and global nonlinearity, we design two different kinds of MTMs: local MTM and global MTM. Meanwhile, a two-level matching algorithm is proposed. For local matching level, the local MTM is constructed and a novel local similarity calculation strategy is proposed. It makes full use of local rigidity in fingerprints. For global matching level, the global MTM is constructed to calculate similarities of entire minutia sets. It makes full use of global compatibility in fingerprints. Proposed method has stronger description ability and better robustness to noise and nonlinearity. Experiments conducted on Fingerprint Verification Competition databases (FVC2002 and FVC2004) demonstrate the effectiveness and the efficiency.

  15. Fingerprint Minutiae Extraction using Deep Learning

    CSIR Research Space (South Africa)

    Darlow, Luke Nicholas

    2017-10-01

    Full Text Available components, such as image enhancement. We pose minutiae extraction as a machine learning problem and propose a deep neural network – MENet, for Minutiae Extraction Network – to learn a data-driven representation of minutiae points. By using the existing...

  16. A geometric transformation to protect minutiae-based fingerprint templates

    Science.gov (United States)

    Sutcu, Yagiz; Sencar, Husrev T.; Memon, Nasir

    2007-04-01

    The increasing use of biometrics in different environments presents new challenges. Most importantly, biometric data are irreplaceable. Therefore, storing biometric templates, which is unique to individual user, entails significant security risks. In this paper, we propose a geometric transformation for securing the minutiae based fingerprint templates. The proposed scheme employs a robust one-way transformation that maps geometrical configuration of the minutiae points into a fixed-length code vector. This representation enables efficient alignment and reliable matching. Experiments are conducted by applying the proposed method on a synthetically generated minutiae point sets. Preliminary results show that the proposed scheme provides a simple and effective solution to the template security problem of the minutiae based fingerprint.

  17. Spectral Representations of Fingerprint Minutiae Subsets

    NARCIS (Netherlands)

    Xu, Haiyun; Veldhuis, Raymond N.J.

    2009-01-01

    The investigation of the privacy protection of biometric templates gains more and more attention. The spectral minutiae representation is a novel method to represent a minutiae set as a fixed-length feature vector, which is invariant to translation, and in which rotation and scaling become translati

  18. A Karnaugh-Map based fingerprint minutiae extraction method

    Directory of Open Access Journals (Sweden)

    Sunil Kumar Singla

    2010-07-01

    Full Text Available Fingerprint is one of the most promising method among all the biometric techniques and has been used for thepersonal authentication for a long time because of its wide acceptance and reliability. Features (Minutiae are extracted fromthe fingerprint in question and are compared with the features already stored in the database for authentication. Crossingnumber (CN is the most commonly used minutiae extraction method for fingerprints. In this paper, a new Karnaugh-Mapbased fingerprint minutiae extraction method has been proposed and discussed. In the proposed algorithm the 8 neighborsof a pixel in a 33 window are arranged as 8 bits of a byte and corresponding hexadecimal (hex value is calculated. Thesehex values are simplified using standard Karnaugh-Map (K-map technique to obtain the minimized logical expression.Experiments conducted on the FVC2002/Db1_a database reveals that the developed method is better than the crossingnumber (CN method.

  19. Local features for enhancement and minutiae extraction in fingerprints.

    Science.gov (United States)

    Fronthaler, Hartwig; Kollreider, Klaus; Bigun, Josef

    2008-03-01

    Accurate fingerprint recognition presupposes robust feature extraction which is often hampered by noisy input data. We suggest common techniques for both enhancement and minutiae extraction, employing symmetry features. For enhancement, a Laplacian-like image pyramid is used to decompose the original fingerprint into sub-bands corresponding to different spatial scales. In a further step, contextual smoothing is performed on these pyramid levels, where the corresponding filtering directions stem from the frequency-adapted structure tensor (linear symmetry features). For minutiae extraction, parabolic symmetry is added to the local fingerprint model which allows to accurately detect the position and direction of a minutia simultaneously. Our experiments support the view that using the suggested parabolic symmetry features, the extraction of which does not require explicit thinning or other morphological operations, constitute a robust alternative to conventional minutiae extraction. All necessary image processing is done in the spatial domain using 1-D filters only, avoiding block artifacts that reduce the biometric information. We present comparisons to other studies on enhancement in matching tasks employing the open source matcher from NIST, FIS2. Furthermore, we compare the proposed minutiae extraction method with the corresponding method from the NIST package, mindtct. A top five commercial matcher from FVC2006 is used in enhancement quantification as well. The matching error is lowered significantly when plugging in the suggested methods. The FVC2004 fingerprint database, notable for its exceptionally low-quality fingerprints, is used for all experiments.

  20. Fingerprint indexing based on Minutia Cylinder-Code.

    Science.gov (United States)

    Cappelli, Raffaele; Ferrara, Matteo; Maltoni, Davide

    2011-05-01

    This paper proposes a new hash-based indexing method to speed up fingerprint identification in large databases. A Locality-Sensitive Hashing (LSH) scheme has been designed relying on Minutiae Cylinder-Code (MCC), which proved to be very effective in mapping a minutiae-based representation (position/ angle only) into a set of fixed-length transformation-invariant binary vectors. A novel search algorithm has been designed thanks to the derivation of a numerical approximation for the similarity between MCC vectors. Extensive experimentations have been carried out to compare the proposed approach against 15 existing methods over all the benchmarks typically used for fingerprint indexing. In spite of the smaller set of features used (top performing methods usually combine more features), the new approach outperforms existing ones in almost all of the cases.

  1. DWT Based Fingerprint Recognition using Non Minutiae Features

    CERN Document Server

    R., Shashi Kumar D; Chhootaray, R K; Pattanaik, Sabyasachi

    2011-01-01

    Forensic applications like criminal investigations, terrorist identification and National security issues require a strong fingerprint data base and efficient identification system. In this paper we propose DWT based Fingerprint Recognition using Non Minutiae (DWTFR) algorithm. Fingerprint image is decomposed into multi resolution sub bands of LL, LH, HL and HH by applying 3 level DWT. The Dominant local orientation angle {\\theta} and Coherence are computed on LL band only. The Centre Area Features and Edge Parameters are determined on each DWT level by considering all four sub bands. The comparison of test fingerprint with database fingerprint is decided based on the Euclidean Distance of all the features. It is observed that the values of FAR, FRR and TSR are improved compared to the existing algorithm.

  2. DWT Based Fingerprint Recognition using Non Minutiae Features

    Directory of Open Access Journals (Sweden)

    Shashi Kumar D R

    2011-03-01

    Full Text Available Forensic applications like criminal investigations, terrorist identification and National security issues require a strong fingerprint data base and efficient identification system. In this paper we propose DWT based Fingerprint Recognition using Non Minutiae (DWTFR algorithm. Fingerprint image is decomposed into multi resolution sub bands of LL, LH, HL and HH by applying 3 level DWT. The Dominant local orientation angle and#952; and Coherence are computed on LL band only. The Centre Area Features and Edge Parameters are determined on each DWT level by considering all four sub bands. The comparison of test fingerprint with database fingerprint is decided based on the Euclidean Distance of all the features. It is observed that the values of FAR, FRR and TSR are improved compared to the existing algorithm.

  3. Hierarchical minutiae matching for fingerprint and palmprint identification.

    Science.gov (United States)

    Chen, Fanglin; Huang, Xiaolin; Zhou, Jie

    2013-12-01

    Fingerprints and palmprints are the most common authentic biometrics for personal identification, especially for forensic security. Previous research have been proposed to speed up the searching process in fingerprint and palmprint identification systems, such as those based on classification or indexing, in which the deterioration of identification accuracy is hard to avert. In this paper, a novel hierarchical minutiae matching algorithm for fingerprint and palmprint identification systems is proposed. This method decomposes the matching step into several stages and rejects many false fingerprints or palmprints on different stages, thus it can save much time while preserving a high identification rate. Experimental results show that the proposed algorithm can save almost 50% searching time compared with traditional methods and illustrate its effectiveness.

  4. A Secondary Fingerprint Enhancement and Minutiae Extraction

    Directory of Open Access Journals (Sweden)

    Raju Rajkumar

    2012-05-01

    Full Text Available In this paper, we introduce a new fingerprint enhancement algorithm which used FFT and Gaussian filter.FFT is applied on a block, of size 32x32 pixel and Gaussian filter is applied in each interconnection ofeach block. This make ridge smoothness and also reduce the “hairy” structure in the ridge when it isthinning. The experimental result shows that the implementation of FFT and Gaussian filter in thepreprocessing stage make less effort in the postprocessing stage and hence the total error rate of theproposed algorithm is very low.

  5. MINUTIAE EXTRACTION BASED ON ARTIFICIAL NEURAL NETWORKS FOR AUTOMATIC FINGERPRINT RECOGNITION SYSTEMS

    Directory of Open Access Journals (Sweden)

    Necla ÖZKAYA

    2007-01-01

    Full Text Available Automatic fingerprint recognition systems are utilised for personal identification with the use of comparisons of local ridge characteristics and their relationships. Critical stages in personal identification are to extract features automatically, fast and reliably from the input fingerprint images. In this study, a new approach based on artificial neural networks to extract minutiae from fingerprint images is developed and introduced. The results have shown that artificial neural networks achieve the minutiae extraction from fingerprint images with high accuracy.

  6. Impact of Algorithms for the Extraction of Minutiae Points in Fingerprint Biometrics

    Directory of Open Access Journals (Sweden)

    Sudha S. Ponnarasi

    2012-01-01

    Full Text Available Problem statement: As the importance of automatic personal identification applications increases, biometrics particularly fingerprint identification is the most consistent and greatly acknowledged technique. A very important step in automatic fingerprint recognition system is to extract the minutiae points from the input fingerprint images automatically and quickly. Approach: Fingerprints from the database FVC2002 (DB1-a is used for experimental purpose. The minutiae points from 100 fingerprints were detected. It is proposed to use Minutiae Detection using Crossing Numbers (MDCN and Minutiae Detection using Midpoint Ridge Contour Method (MDMRCM. Finally the performance of minutiae extraction algorithms using the number of minutiae detected in both the cases were analysed. Results: The result shows that the avearge performance of MDCN method for minutiae points detection is 88% and for MDMRCM method is 92%. Conclusion: The performance of MDMRCM is better than MDCN method. MDMRCM method extract more minutiae points than MDCN method. It consumes lesser time to get the output and the false minutiae points were not detected. And hence MDMRCM method is considered to be a superior than MDCN method.

  7. Secure Minutiae-Based Fingerprint Templates Using Random Triangle Hashing

    Science.gov (United States)

    Jin, Zhe; Jin Teoh, Andrew Beng; Ong, Thian Song; Tee, Connie

    Due to privacy concern on the widespread use of biometric authentication systems, biometric template protection has gained great attention in the biometric research recently. It is a challenging task to design a biometric template protection scheme which is anonymous, revocable and noninvertible while maintaining acceptable performance. Many methods have been proposed to resolve this problem, and cancelable biometrics is one of them. In this paper, we propose a scheme coined as Random Triangle Hashing which follows the concept of cancelable biometrics in the fingerprint domain. In this method, re-alignment of fingerprints is not required as all the minutiae are translated into a pre-defined 2 dimensional space based on a reference minutia. After that, the proposed Random Triangle hashing method is used to enforce the one-way property (non-invertibility) of the biometric template. The proposed method is resistant to minor translation error and rotation distortion. Finally, the hash vectors are converted into bit-strings to be stored in the database. The proposed method is evaluated using the public database FVC2004 DB1. An EER of less than 1% is achieved by using the proposed method.

  8. Modeling and analysis of local comprehensive minutia relation for fingerprint matching.

    Science.gov (United States)

    He, Xiaoguang; Tian, Jie; Li, Liang; He, Yuliang; Yang, Xin

    2007-10-01

    This paper introduces a robust fingerprint matching scheme based on the comprehensive minutia and the binary relation between minutiae. In the method, a fingerprint is represented as a graph, of which the comprehensive minutiae act as the vertex set and the local binary minutia relations provide the edge set. Then, the transformation-invariant and transformation-variant features are extracted from the binary relation. The transformation-invariant features are suitable to estimate the local matching probability, whereas the transformation-variant features are used to model the fingerprint rotation transformation with the adaptive Parzen window. Finally, the fingerprint matching is conducted with the variable bounded box method and iterative strategy. The experiments demonstrate that the proposed scheme is effective and robust in fingerprint alignment and matching.

  9. An integrated approach to fingerprint indexing using spectral clustering based on minutiae points

    CSIR Research Space (South Africa)

    Mngenge, NA

    2015-07-01

    Full Text Available this problem by constructing a rotational, scale and translation (RST) invariant fingerprint descriptor based on minutiae points. The proposed RST invariant descriptor dimensions are then reduced and passed to a spectral clustering algorithm which automatically...

  10. Implementation of Minutiae Based Fingerprint Identification System Using Crossing Number Concept

    Directory of Open Access Journals (Sweden)

    Atul S. CHAUDHARI

    2014-01-01

    Full Text Available Biometric system is essentially a pattern recognition system which recognizes a person by determining the authenticity of a specific physiological (e.g., fingerprints, face, retina, iris or behavioral (e.g., gait, signature characteristic possessed by that person. Among all the presently employed biometric techniques, fingerprint identification systems have received the most attention due to the long history of fingerprints and its extensive use in forensics. Fingerprint is reliable biometric characteristic as it is unique and persistence. Fingerprint is the pattern of ridges and valleys on the surface of fingertip. However, recognizing fingerprints in poor quality images is still a very complex job, so the fingerprint image must be preprocessed before matching. It is very difficult to extract fingerprint features directly from gray scale fingerprint image. In this paper we have proposed the system which uses minutiae based matching algorithm for fingerprint identification. There are three main phases in proposed algorithm. First phase enhance the input fingerprint image by preprocessing it. The enhanced fingerprint image is converted into thinned binary image and then minutiae are extracted by using Crossing Number Concept in second phase. Third stage compares input fingerprint image (after preprocessing and minutiae extraction with fingerprint images enrolled in database and makes decision whether the input fingerprint is matched with the fingerprint stored in database or not.

  11. Interexaminer variation of minutia markup on latent fingerprints.

    Science.gov (United States)

    Ulery, Bradford T; Hicklin, R Austin; Roberts, Maria Antonia; Buscaglia, JoAnn

    2016-07-01

    Latent print examiners often differ in the number of minutiae they mark during analysis of a latent, and also during comparison of a latent with an exemplar. Differences in minutia counts understate interexaminer variability: examiners' markups may have similar minutia counts but differ greatly in which specific minutiae were marked. We assessed variability in minutia markup among 170 volunteer latent print examiners. Each provided detailed markup documenting their examinations of 22 latent-exemplar pairs of prints randomly assigned from a pool of 320 pairs. An average of 12 examiners marked each latent. The primary factors associated with minutia reproducibility were clarity, which regions of the prints examiners chose to mark, and agreement on value or comparison determinations. In clear areas (where the examiner was "certain of the location, presence, and absence of all minutiae"), median reproducibility was 82%; in unclear areas, median reproducibility was 46%. Differing interpretations regarding which regions should be marked (e.g., when there is ambiguity in the continuity of a print) contributed to variability in minutia markup: especially in unclear areas, marked minutiae were often far from the nearest minutia marked by a majority of examiners. Low reproducibility was also associated with differences in value or comparison determinations. Lack of standardization in minutia markup and unfamiliarity with test procedures presumably contribute to the variability we observed. We have identified factors accounting for interexaminer variability; implementing standards for detailed markup as part of documentation and focusing future training efforts on these factors may help to facilitate transparency and reduce subjectivity in the examination process. Published by Elsevier Ireland Ltd.

  12. A Fast Minutiae-Based Fingerprint Recognition System

    NARCIS (Netherlands)

    Xu, Haiyun; Veldhuis, Raymond N.J.; Kevenaar, Tom A.M.; Akkermans, Ton A.H.M.

    2009-01-01

    The spectral minutiae representation is a method to represent a minutiae set as a fixed-length feature vector, which is invariant to translation, and in which rotation and scaling become translations, so that they can be easily compensated for. These characteristics enable the combination of fingerp

  13. Fingerprint identification using SIFT-based minutia descriptors and improved all descriptor-pair matching.

    Science.gov (United States)

    Zhou, Ru; Zhong, Dexing; Han, Jiuqiang

    2013-03-06

    The performance of conventional minutiae-based fingerprint authentication algorithms degrades significantly when dealing with low quality fingerprints with lots of cuts or scratches. A similar degradation of the minutiae-based algorithms is observed when small overlapping areas appear because of the quite narrow width of the sensors. Based on the detection of minutiae, Scale Invariant Feature Transformation (SIFT) descriptors are employed to fulfill verification tasks in the above difficult scenarios. However, the original SIFT algorithm is not suitable for fingerprint because of: (1) the similar patterns of parallel ridges; and (2) high computational resource consumption. To enhance the efficiency and effectiveness of the algorithm for fingerprint verification, we propose a SIFT-based Minutia Descriptor (SMD) to improve the SIFT algorithm through image processing, descriptor extraction and matcher. A two-step fast matcher, named improved All Descriptor-Pair Matching (iADM), is also proposed to implement the 1:N verifications in real-time. Fingerprint Identification using SMD and iADM (FISiA) achieved a significant improvement with respect to accuracy in representative databases compared with the conventional minutiae-based method. The speed of FISiA also can meet real-time requirements.

  14. Fingerprint Identification Using SIFT-Based Minutia Descriptors and Improved All Descriptor-Pair Matching

    Directory of Open Access Journals (Sweden)

    Jiuqiang Han

    2013-03-01

    Full Text Available The performance of conventional minutiae-based fingerprint authentication algorithms degrades significantly when dealing with low quality fingerprints with lots of cuts or scratches. A similar degradation of the minutiae-based algorithms is observed when small overlapping areas appear because of the quite narrow width of the sensors. Based on the detection of minutiae, Scale Invariant Feature Transformation (SIFT descriptors are employed to fulfill verification tasks in the above difficult scenarios. However, the original SIFT algorithm is not suitable for fingerprint because of: (1 the similar patterns of parallel ridges; and (2 high computational resource consumption. To enhance the efficiency and effectiveness of the algorithm for fingerprint verification, we propose a SIFT-based Minutia Descriptor (SMD to improve the SIFT algorithm through image processing, descriptor extraction and matcher. A two-step fast matcher, named improved All Descriptor-Pair Matching (iADM, is also proposed to implement the 1:N verifications in real-time. Fingerprint Identification using SMD and iADM (FISiA achieved a significant improvement with respect to accuracy in representative databases compared with the conventional minutiae-based method. The speed of FISiA also can meet real-time requirements.

  15. Alignment-free cancelable fingerprint templates based on local minutiae information.

    Science.gov (United States)

    Lee, Chulhan; Choi, Jeung-Yoon; Toh, Kar-Ann; Lee, Sangyoun; Kim, Jaihie

    2007-08-01

    To replace compromised biometric templates, cancelable biometrics has recently been introduced. The concept is to transform a biometric signal or feature into a new one for enrollment and matching. For making cancelable fingerprint templates, previous approaches used either the relative position of a minutia to a core point or the absolute position of a minutia in a given fingerprint image. Thus, a query fingerprint is required to be accurately aligned to the enrolled fingerprint in order to obtain identically transformed minutiae. In this paper, we propose a new method for making cancelable fingerprint templates that do not require alignment. For each minutia, a rotation and translation invariant value is computed from the orientation information of neighboring local regions around the minutia. The invariant value is used as the input to two changing functions that output two values for the translational and rotational movements of the original minutia, respectively, in the cancelable template. When a template is compromised, it is replaced by a new one generated by different changing functions. Our approach preserves the original geometric relationships (translation and rotation) between the enrolled and query templates after they are transformed. Therefore, the transformed templates can be used to verify a person without requiring alignment of the input fingerprint images. In our experiments, we evaluated the proposed method in terms of two criteria: performance and changeability. When evaluating the performance, we examined how verification accuracy varied as the transformed templates were used for matching. When evaluating the changeability, we measured the dissimilarities between the original and transformed templates, and between two differently transformed templates, which were obtained from the same original fingerprint. The experimental results show that the two criteria mutually affect each other and can be controlled by varying the control parameters of

  16. Data on the interexaminer variation of minutia markup on latent fingerprints.

    Science.gov (United States)

    Ulery, Bradford T; Hicklin, R Austin; Roberts, Maria Antonia; Buscaglia, JoAnn

    2016-09-01

    The data in this article supports the research paper entitled "Interexaminer variation of minutia markup on latent fingerprints" [1]. The data in this article describes the variability in minutia markup during both analysis of the latents and comparison between latents and exemplars. The data was collected in the "White Box Latent Print Examiner Study," in which each of 170 volunteer latent print examiners provided detailed markup documenting their examinations of latent-exemplar pairs of prints randomly assigned from a pool of 320 pairs. Each examiner examined 22 latent-exemplar pairs; an average of 12 examiners marked each latent.

  17. Minutia Cylinder-Code: a new representation and matching technique for fingerprint recognition.

    Science.gov (United States)

    Cappelli, Raffaele; Ferrara, Matteo; Maltoni, Davide

    2010-12-01

    In this paper, we introduce the Minutia Cylinder-Code (MCC): a novel representation based on 3D data structures (called cylinders), built from minutiae distances and angles. The cylinders can be created starting from a subset of the mandatory features (minutiae position and direction) defined by standards like ISO/IEC 19794-2 (2005). Thanks to the cylinder invariance, fixed-length, and bit-oriented coding, some simple but very effective metrics can be defined to compute local similarities and to consolidate them into a global score. Extensive experiments over FVC2006 databases prove the superiority of MCC with respect to three well-known techniques and demonstrate the feasibility of obtaining a very effective (and interoperable) fingerprint recognition implementation for light architectures.

  18. A New Fingerprint Minutiae Matching Algorithm%一种新的指纹特征点匹配算法

    Institute of Scientific and Technical Information of China (English)

    应捷; 袁一方; 许陇云; 宋启发

    2004-01-01

    Many fingerprint matching algorithms have been reported in recent years, which have different features. It is proposed a new fingerprint minutiae matching algorithm and done fingerprint images matching through minutiae matching. This algorithm optimized Anil Jain et al. 's and Xiping Luo et al. 's algorithms by simplifying the calculating process and using a round bounding box. Experiments done on a set of fingerprint images captured with a scanner showed that our algorithm is faster, more accurate and more suitable for the real time fingerprint identification system.%近年来,文献中报道了许多指纹匹配算法,它们各有不同的特点.提出一种新的指纹特征点匹配算法,通过指纹特征点匹配来实现指纹图像的匹配.这种算法通过采用圆形匹配限制框和简化计算步骤等方法,优化了Anil Jain和Xiping Luo等人的算法.对一组由扫描仪获取的指纹图像做实验,结果表明,该算法速度更快,精度更高,更适用于实时指纹识别系统.

  19. Data on the interexaminer variation of minutia markup on latent fingerprints

    Directory of Open Access Journals (Sweden)

    Bradford T. Ulery

    2016-09-01

    Full Text Available The data in this article supports the research paper entitled “Interexaminer variation of minutia markup on latent fingerprints” [1]. The data in this article describes the variability in minutia markup during both analysis of the latents and comparison between latents and exemplars. The data was collected in the “White Box Latent Print Examiner Study,” in which each of 170 volunteer latent print examiners provided detailed markup documenting their examinations of latent-exemplar pairs of prints randomly assigned from a pool of 320 pairs. Each examiner examined 22 latent-exemplar pairs; an average of 12 examiners marked each latent.

  20. Distortion analysis on binary representation of minutiae based fingerprint matching for match-on-card

    CSIR Research Space (South Africa)

    Mlambo, CS

    2016-12-01

    Full Text Available , time efficient implementations, security and efficient space of the match on card. In this paper presented is the survey on the methods used to improve the accuracy in matching and memory usage by representing minutiae points in binary. In addition...

  1. Person Identification Using Fingerprint by Hybridizing Core Point and Minutiae Features

    Directory of Open Access Journals (Sweden)

    M. Ezhilarasan

    2010-12-01

    Full Text Available Fingerprint recognition refers to the automated method of verifying a match between two human fingerprints. Fingerprints are one of many forms of biometrics used to identify an individual and verify their identity. The nonchangeability of Fingerprints during the human life span and the uniqueness of each individual’s fingerprints are the basis for using fingerprints for identification purposes. The main objective is to provide a high secure unibiometric system using thefingerprint of individuals. The fingerprint trait is chosen becauseof its availability, reliability and high accuracy. Moreover the fingerprint based biometric system can be implemented easily.

  2. Implementation of Minutiae Based Fingerprint Identification System Using Crossing Number Concept

    OpenAIRE

    Atul S. CHAUDHARI; Girish K. PATNAIK; Sandip S. PATIL

    2014-01-01

    Biometric system is essentially a pattern recognition system which recognizes a person by determining the authenticity of a specific physiological (e.g., fingerprints, face, retina, iris) or behavioral (e.g., gait, signature) characteristic possessed by that person. Among all the presently employed biometric techniques, fingerprint identification systems have received the most attention due to the long history of fingerprints and its extensive use in forensics. Fingerprint is reliable biometr...

  3. Minutiae matching using local pattern features

    Science.gov (United States)

    Jędryka, Marcin; Wawrzyniak, Zbigniew

    2008-01-01

    This paper concerns algorithms related to analysis of fingerprint images in area of minutiae matching. Proposed solutions make use of information about minutiae detected from a fingerprint as well as information about main first order singularities. The use of first order singularities as a reference point makes algorithm of minutiae matching more efficient and faster in execution. Proposed algorithms concern efficient detection of main singularity in a fingerprint as well as optimization of minutiae matching in polar coordinates using main singularity as a reference point. Minutiae matching algorithm is based on string matching using Levenstein distance. Detection of first order singularities is optimized using Poincare's index and analysis of directional image of a fingerprint. Proposed solutions showed to be efficient and fast in practical use. Implemented algorithms were tested on previously prepared fingerprint datasets.

  4. MERIT: Minutiae Extraction using Rotation Invariant Algorithm

    Directory of Open Access Journals (Sweden)

    Avinash Pokhriyal,

    2010-07-01

    Full Text Available Thinning a fingerprint makes its ridges as thin as one pixel and still retaining its basic structure. So many algorithms are devised by researchers to extract skeleton of a fingerprint image, but the problem is that they produce different results with different rotations of the same fingerprint image. This results in inefficient minutiae extraction. In this paper, a new way of thinning a fingerprint image is proposed. This method is called MERIT (Minutiae Extraction using Rotation Invariant Thinning, as it thins a fingerprint image irrespective of the fingerprint's position and then extracts minutiae points from a fingerprint image. First of all, we binarize the fingerprint image and convert it into a 0-1 pattern. Then, we apply some morphological operations like dilation and erosion, and also some if-then rules governing a 3x3 mask that is to be convoluted throughout the image to skeletonize it. In the end,some postprocessing is done on the thinned fingerprint image to remove false minutiae structures from it. Finally genuine minutiae points are extracted from the thinned fingerprint image along with their directions. Results show that the proposed method extracts genuine minutiae points even from low-quality fingerprint images.

  5. Performance evaluation of fusing protected fingerprint minutiae templates on the decision level.

    Science.gov (United States)

    Yang, Bian; Busch, Christoph; de Groot, Koen; Xu, Haiyun; Veldhuis, Raymond N J

    2012-01-01

    In a biometric authentication system using protected templates, a pseudonymous identifier is the part of a protected template that can be directly compared. Each compared pair of pseudonymous identifiers results in a decision testing whether both identifiers are derived from the same biometric characteristic. Compared to an unprotected system, most existing biometric template protection methods cause to a certain extent degradation in biometric performance. Fusion is therefore a promising way to enhance the biometric performance in template-protected biometric systems. Compared to feature level fusion and score level fusion, decision level fusion has not only the least fusion complexity, but also the maximum interoperability across different biometric features, template protection and recognition algorithms, templates formats, and comparison score rules. However, performance improvement via decision level fusion is not obvious. It is influenced by both the dependency and the performance gap among the conducted tests for fusion. We investigate in this paper several fusion scenarios (multi-sample, multi-instance, multi-sensor, multi-algorithm, and their combinations) on the binary decision level, and evaluate their biometric performance and fusion efficiency on a multi-sensor fingerprint database with 71,994 samples.

  6. 一种基于细节点的脊线追踪算法%A Fingerprint Ridge Tracing Algorithm Based on Minutias

    Institute of Scientific and Technical Information of China (English)

    彭玲; 李敏敏

    2012-01-01

    Fingerprint attributes are important features of the fingerprint. Ridge tracing is the premise of the fingerprint attribute extraction. A ridge tracing algorithm is proposed which based on fingerprint minutias like end and fork points. The implementation of this algorithm is based on the thinned fingerprint. The ridge tracing started from the forks or the ends, searching the next pixel in the ridge until completing tracing all the ridges. The experimental results show that this algorithm had a better ridge tracing effect.%指纹属性是指纹的重要特征,脊线追踪是提取指纹属性的前提.提出了一种基于指纹细节端点和叉点的脊线追踪算法.该算法在细化后的指纹图像上分别以端点和叉点为起始点,依次寻找脊线上的下一个像素点,从而遍历整幅指纹图像的脊线.实验结果表明,该算法对指纹细化图具有较好的脊线追踪效果.

  7. Elastic Minutiae Matching by Means of Thin-Plate Spline Models

    NARCIS (Netherlands)

    Bazen, Asker M.; Gerez, Sabih H.

    2002-01-01

    This paper presents a novel minutiae matching method that deals with elastic distortions by normalizing the shape of the test fingerprint with respect to the template. The method first determines possible matching minutiae pairs by means of comparing local neighborhoods of the minutiae. Next a thin-

  8. Regional fusion for high-resolution palmprint recognition using spectral minutiae representation

    NARCIS (Netherlands)

    Wang, R.; Ramos, D.; Veldhuis, R.N.J.; Fierrez, J.; Spreeuwers, L.J.; Xu, Haiyun

    2014-01-01

    The spectral minutiae representation (SMC) has been recently proposed as a novel method to minutiae-based fingerprint recognition, which is invariant to minutiae translation and rotation and presents low computational complexity. As high-resolution palmprint recognition is also mainly based on minut

  9. Fingerprint recognition

    OpenAIRE

    Diefenderfer, Graig T.

    2006-01-01

    The use of biometrics is an evolving component in today's society. Fingerprint recognition continues to be one of the most widely used biometric systems. This thesis explores the various steps present in a fingerprint recognition system. The study develops a working algorithm to extract fingerprint minutiae from an input fingerprint image. This stage incorporates a variety of image pre-processing steps necessary for accurate minutiae extraction and includes two different methods of ridge thin...

  10. Fingerprint Matching Based on Local Relative Orientation Field

    Institute of Scientific and Technical Information of China (English)

    ZHU En; YIN Jian-ping; ZHANG Guo-min

    2004-01-01

    A fingerprint matching method based on local relative orientation field is proposed. It extracts local relative orientation field around each minutia for minutiae matching. Local orientation features are also used to sorting minutiae in order to speed up searching a minutia when pairing minutiae. The experimental result reveals that this method achieves improved recognition accuracy.

  11. Spectral representation of fingerprints

    NARCIS (Netherlands)

    Xu, Haiyun; Bazen, Asker M.; Veldhuis, Raymond N.J.; Kevenaar, Tom A.M.; Akkermans, Anton H.M.

    2007-01-01

    Most fingerprint recognition systems are based on the use of a minutiae set, which is an unordered collection of minutiae locations and directions suffering from various deformations such as translation, rotation and scaling. The spectral minutiae representation introduced in this paper is a novel m

  12. Genetic Programming Framework for Fingerprint Matching

    CERN Document Server

    Ismail, Ismail A; Abd-ElWahid, Mohammed A; ElKafrawy, Passent M; Nasef, Mohammed M

    2009-01-01

    A fingerprint matching is a very difficult problem. Minutiae based matching is the most popular and widely used technique for fingerprint matching. The minutiae points considered in automatic identification systems are based normally on termination and bifurcation points. In this paper we propose a new technique for fingerprint matching using minutiae points and genetic programming. The goal of this paper is extracting the mathematical formula that defines the minutiae points.

  13. A 3-layer coding scheme for biometry template protection based on spectral minutiae

    NARCIS (Netherlands)

    Shao, X.; Xu, H.; Veldhuis, Raymond N.J.; Slump, Cornelis H.

    2011-01-01

    Spectral Minutiae (SM) representation enables the combination of minutiae-based fingerprint recognition systems with template protection schemes based on fuzzy commitment, but it requires error-correcting codes that can handle high bit error rates (i.e. above 40%). In this paper, we propose a

  14. IMPROVED FINGER PRINT MATCHING USING MINUTIAE SINGULAR POINTS NETWORK

    OpenAIRE

    Prof. Vikas Goyal*, Himanshu Jindal

    2017-01-01

    Fingerprints are considered as a unique identification of a person and due to easy access its the best and one of the fastest method used in biometric identification systems. They are unique, so secure and reliable to use and doesnt change for one in a lifetime. And beside these things fingerprint recognition specially using minutiae matching technique is cheap, reliable and accurate up to a satisfactory limits.   In this thesis work, we propose a method for fingerprint matching based...

  15. An Effective Fingerprint Verification Technique

    CERN Document Server

    Gogoi, Minakshi

    2010-01-01

    This paper presents an effective method for fingerprint verification based on a data mining technique called minutiae clustering and a graph-theoretic approach to analyze the process of fingerprint comparison to give a feature space representation of minutiae and to produce a lower bound on the number of detectably distinct fingerprints. The method also proving the invariance of each individual fingerprint by using both the topological behavior of the minutiae graph and also using a distance measure called Hausdorff distance.The method provides a graph based index generation mechanism of fingerprint biometric data. The self-organizing map neural network is also used for classifying the fingerprints.

  16. A New Autom ated Fingerprint Identification System

    Institute of Scientific and Technical Information of China (English)

    沈学宁; 程民德; 等

    1989-01-01

    A new automated fingerpring identification system is proposed.In this system,based on some local properties of digital image,the shape and minutiae features of fingerprint can be extracted from the grey level image without binarizing and thinning.In query,a latent fingerprint can be matched with the filed fingerprints by shape and/or minutiae features.Matching by shape features is much faster than by minutiae.

  17. Use of ridge points in partial fingerprint matching

    Science.gov (United States)

    Fang, Gang; Srihari, Sargur N.; Srinivasan, Harish; Phatak, Prasad

    2007-04-01

    Matching of partial fingerprints has important applications in both biometrics and forensics. It is well-known that the accuracy of minutiae-based matching algorithms dramatically decrease as the number of available minutiae decreases. When singular structures such as core and delta are unavailable, general ridges can be utilized. Some existing highly accurate minutiae matchers do use local ridge similarity for fingerprint alignment. However, ridges cover relatively larger regions, and therefore ridge similarity models are sensitive to non-linear deformation. An algorithm is proposed here to utilize ridges more effectively- by utilizing representative ridge points. These points are represented similar to minutiae and used together with minutiae in existing minutiae matchers with simple modification. Algorithm effectiveness is demonstrated using both full and partial fingerprints. The performance is compared against two minutiae-only matchers (Bozorth and k-minutiae). Effectiveness with full fingerprint matching is demonstrated using the four databases of FVC2002- where the error rate decreases by 0.2-0.7% using the best matching algorithm. The effectiveness is more significant in the case of partial fingerprint matching- which is demonstrated with sixty partial fingerprint databases generated from FVC2002 (with five levels of numbers of minutiae available). When only 15 minutiae are available the error rate decreases 5-7.5%. Thus the method, which involves selecting representative ridge points, minutiae matcher modification, and a group of minutiae matchers, demonstrates improved performance on full and especially partial fingerprint matching.

  18. Multi-biometric templates using fingerprint and voice

    Science.gov (United States)

    Camlikaya, Eren; Kholmatov, Alisher; Yanikoglu, Berrin

    2008-03-01

    As biometrics gains popularity, there is an increasing concern about privacy and misuse of biometric data held in central repositories. Furthermore, biometric verification systems face challenges arising from noise and intra-class variations. To tackle both problems, a multimodal biometric verification system combining fingerprint and voice modalities is proposed. The system combines the two modalities at the template level, using multibiometric templates. The fusion of fingerprint and voice data successfully diminishes privacy concerns by hiding the minutiae points from the fingerprint, among the artificial points generated by the features obtained from the spoken utterance of the speaker. Equal error rates are observed to be under 2% for the system where 600 utterances from 30 people have been processed and fused with a database of 400 fingerprints from 200 individuals. Accuracy is increased compared to the previous results for voice verification over the same speaker database.

  19. Fingerprint Feature Extraction Algorithm

    Directory of Open Access Journals (Sweden)

    Mehala. G

    2014-03-01

    Full Text Available The goal of this paper is to design an efficient Fingerprint Feature Extraction (FFE algorithm to extract the fingerprint features for Automatic Fingerprint Identification Systems (AFIS. FFE algorithm, consists of two major subdivisions, Fingerprint image preprocessing, Fingerprint image postprocessing. A few of the challenges presented in an earlier are, consequently addressed, in this paper. The proposed algorithm is able to enhance the fingerprint image and also extracting true minutiae.

  20. A fingerprint minutiae matching algorithm based on chaotic bee colony optimization%基于混沌蜂群优化的指纹匹配算法

    Institute of Scientific and Technical Information of China (English)

    史骏鹏; 吴一全

    2016-01-01

    In order to further improve the operational speed and the recognition efficiency of fingerprint matching al⁃gorithms, a fingerprint matching algorithm based on chaotic bee colony activity and a variable boundary box was proposed. Firstly, by combining the advantages of artificial bee colony optimization including fast convergence times, fewer control parameters, and the lack of local optima, with the features of a chaos strategy including its random⁃like property and ergodicity, the chaotic bee colony activity was introduced into point pattern matching for fingerprint images. A corresponding fitness function incorporating both matching accuracy and operational time was then designed. The corresponding fitness function was then used to estimate the geometric transformation parameters for fingerprint rough matching. Finally, a variable boundary box can be used for fine matching, because it avoids any influences relating to local deformation of the fingerprint images. A large number of experimental results show that, compared with two alternative fingerprint matching algorithms ( based on local features and genetic algorithm optimization, respectively) the proposed algorithm has a shorter operational time and has higher matching accuracy.%为了进一步加快指纹匹配算法的运算速度、提高识别效率,提出了一种基于混沌蜂群优化和可变界限盒的指纹匹配算法。首先,结合人工蜂群优化算法收敛速度快、控制参数少、能够避免局部最优等优点以及混沌策略的类随机性、高遍历性等特点,在指纹点匹配中引入混沌蜂群优化算法,并设计兼顾了匹配精度和运算时间的适应度函数;然后利用适应度函数估计出指纹特征匹配的几何变换参数并进行指纹点特征的粗匹配;最后,利用可变界限盒进行精匹配,避免指纹图像局部形变带来的影响。大量实验结果表明,与基于局部特征的指纹匹配算法

  1. 基于ARM的不同场合指纹细节点提取%Different occasions of fingerprint minutiae extraction based on ARM

    Institute of Scientific and Technical Information of China (English)

    刘辉

    2012-01-01

    According to the different quality images, we put forward both the improved 8-neighborhood feature extraction algorithm and SUSAN fingerprint feature extraction algorithm based on ARM. The two algorithm is compared in MATLAB, and the application features are summarizes. Finally the two algorithms are verified in the Arm platform.%基于ARM处理平台,针对不同质量的图像提出改进的8邻域特征提取算法和SUSAN的指纹特征提取算法,在MATLAB下对比了这两种算法的优缺点,总结了其应用的场合,并且在ARM主建平台上验证了这两种算法的快速性和准确性。

  2. Spectral minutiae representations for fingerprint recognition

    NARCIS (Netherlands)

    Xu, Haiyun

    2010-01-01

    The term biometrics refers to the technologies that measure and analyze human intrinsic physical or behavioral characteristics for authenticating individuals. Nowadays, biometric technology is increasingly deployed in civil and commercial applications. The growing use of biometrics is raising securi

  3. Online fingerprint verification.

    Science.gov (United States)

    Upendra, K; Singh, S; Kumar, V; Verma, H K

    2007-01-01

    As organizations search for more secure authentication methods for user access, e-commerce, and other security applications, biometrics is gaining increasing attention. With an increasing emphasis on the emerging automatic personal identification applications, fingerprint based identification is becoming more popular. The most widely used fingerprint representation is the minutiae based representation. The main drawback with this representation is that it does not utilize a significant component of the rich discriminatory information available in the fingerprints. Local ridge structures cannot be completely characterized by minutiae. Also, it is difficult quickly to match two fingerprint images containing different number of unregistered minutiae points. In this study filter bank based representation, which eliminates these weakness, is implemented and the overall performance of the developed system is tested. The results have shown that this system can be used effectively for secure online verification applications.

  4. Comparative Study on Various Fingerprint

    Directory of Open Access Journals (Sweden)

    Rajin. R

    2015-10-01

    Full Text Available Fingerprints are the oldest and most widely used form of biometric identification. The performance of any fingerprint recognizer highly depends on the fingerprint image quality. Different types of noises in the fingerprint images pose greater difficulty for recognizers. However, fingerprint images are rarely of perfect quality. They may be degraded and corrupted due to variations in skin and impression conditions. Thus, image enhancement techniques are employed prior to minutiae extraction to obtain a more reliable estimation of minutiae locations. Image enhancement can be done using both spatial and frequency domain techniques. Most Automatic Fingerprint. Identification Systems (AFIS use some form of image enhancement. Therefore, this paper describes various techniques for fingerprint image enhancement.Fingerprints are the oldest and most widely used form of biometric identification. The performance of anyfingerprint recognizer highly depends on the fingerprint image quality. Different types of noises in the fingerprintimages pose greater difficulty for recognizers. However, fingerprint images are rarely of perfect quality. They maybe degraded and corrupted due to variations in skin and impression conditions. Thus, image enhancement techniquesare employed prior to minutiae extraction to obtain a more reliable estimation of minutiae locations. Imageenhancement can be done using both spatial and frequency domain techniques. Most Automatic FingerprintIdentification Systems (AFIS use some form of image enhancement. Therefore, this paper describes varioustechniques for fingerprint image enhancement.

  5. Biometrics In Fingerprint Recognition Using Distance Vector Method

    OpenAIRE

    Sumeet Dhawan; Amit Makkar

    2011-01-01

    A lot of fingerprint features have been defined for the representation of the fingerprint. Among the features, ridge ending and ridge bifurcation are the most widely used ones. These features are known as minutiae points. Utilizing more information other than minutiae is much helpful for large scale fingerprint recognition application. By considering some predefined features one can derive new features for the verification of the fingerprint. In this thesis, we proposed a new feature for fing...

  6. Nonminutiae-Based Decision-Level Fusion for Fingerprint Verification

    OpenAIRE

    Helfroush Sadegh; Ghassemian Hassan

    2007-01-01

    Most of the proposed methods used for fingerprint verification are based on local visible features called minutiae. However, due to problems for extracting minutiae from low-quality fingerprint images, other discriminatory information has been considered. In this paper, the idea of decision-level fusion of orientation, texture, and spectral features of fingerprint image is proposed. At first, a value is assigned to the similarity of block orientation field of two-fingerprint images. This is ...

  7. A lossless data coding and hiding scheme for fingerprint templates%针对指纹模板的可逆信息隐藏编码方法

    Institute of Scientific and Technical Information of China (English)

    胡校成; 张卫明; 俞能海

    2011-01-01

    通过融合指纹、人脸、口令等用户身份信息来进行多模态认证可以提高身份认证系统的安全性.而利用信息隐藏技术,可以将几种身份信息嵌入到某一种生物模板中实现安全存储.本文介绍了一种以指纹模板为隐藏栽体的多模态认证技术,该技术的关键问题是要保证嵌入信息后的指纹图片的质量,以确保匹配的精度.为此,提出了一种将二元信息稀疏化的数据嵌入编码方法,利用这种编码可以有效降低数据嵌入过程中对指纹图片的修改,从而改善载密图片的质量,以达到提高匹配精度的目的.该方法嵌入脆弱水印,用于指纹模板的完整性认证.%By merging several kinds of user authentication information such as fingerprints, faces, passwords etc. , multi-modal authentication can improve the security of traditional identify authentication systems. Furthermore, via data hiding technology, specific user identities can be imbedded into their biologic templates to ensure safe storage A multi-modal authentication scheme was introduced, which uses fingerprint templates as the cover. The key problem of this technology is to ensure the quality of the template picture after embedding, which is important for the matching precision afterwards. Both theoretical analysis and experimental results demonstrate that by adopting a coding method which increases the sparseness of the original binary data before embedding, modification of the fingerprint template is lowers effectively, thus ensuring the image quality and matching precision. The method embeds fragile watermarks for the integrity authentication of the fingerprint template.

  8. A Correlation-Based Fingerprint Verification System

    NARCIS (Netherlands)

    Bazen, Asker M.; Verwaaijen, Gerben T.B.; Gerez, Sabih H.; Veelenturf, Leo P.J.; Zwaag, van der Berend Jan

    2000-01-01

    In this paper, a correlation-based fingerprint verification system is presented. Unlike the traditional minutiae-based systems, this system directly uses the richer gray-scale information of the fingerprints. The correlation-based fingerprint verification system first selects appropriate templates i

  9. Analysis of the bacterial diversity existing on animal hide and wool: development of a preliminary PCR-restriction fragment length polymorphism fingerprint database for identifying isolates.

    Science.gov (United States)

    Chen, Yu; Gao, Hongwei; Zhang, Yanming; Deng, Mingjun; Wu, Zhenxing; Zhu, Laihua; Duan, Qing; Xu, Biao; Liang, Chengzhu; Yue, Zhiqin; Xiao, Xizhi

    2012-01-01

    Twenty-one bacterial strains were isolated from imported cattle hide and rabbit wool using two types of media, nutrient broth, and nutrient broth with serum. The bacteria identified were Brevibacillus laterosporus, Leclercia adecarboxylata, Peptococcus niger, Bacillus circulans, Raoultella ornithinolytica, Bacillus subtilis, Bacillus cereus, Bacillus thermobacillus, Bacillus choshinensis, Bacillus sphaericus, Acinetobacter haemolyticus, Sphingomonas paucimobilis, Bacillus thuringiensis, Staphylococcus intermedius, Mycobacteria, Moraxella, Klebsiella pneumoniae, Ralstonia pickettii, Staphylococcus chromogenes, Comamonas testosteroni, and Cupriavidus pauculus. The 16s rDNA gene of each bacterium was amplified using the universal primers 27f and 1492r. The amplicons were digested with AvaI, BamHI, BgII, DraI, EcoRI, EcoRV, HindIII, HinfI, HpaI, PstI, SmaI, TaqII, XbaI, XmaI, AluI, XhoI, and PvuI individually. A specific fingerprint from the PCR-restriction fragment length polymorphism method based on 16s rDNA was obtained for each bacterium. The results showed that the method developed was useful not only for bacterial identification but also for the etiological investigation of pathogens in imported animal hair and wool.

  10. Fingerprint Verification based on Gabor Filter Enhancement

    CERN Document Server

    Lavanya, B N; Venugopal, K R

    2009-01-01

    Human fingerprints are reliable characteristics for personnel identification as it is unique and persistence. A fingerprint pattern consists of ridges, valleys and minutiae. In this paper we propose Fingerprint Verification based on Gabor Filter Enhancement (FVGFE) algorithm for minutiae feature extraction and post processing based on 9 pixel neighborhood. A global feature extraction and fingerprints enhancement are based on Hong enhancement method which is simultaneously able to extract local ridge orientation and ridge frequency. It is observed that the Sensitivity and Specificity values are better compared to the existing algorithms.

  11. Distorted Fingerprint Verification System

    Directory of Open Access Journals (Sweden)

    Divya KARTHIKAESHWARAN

    2011-01-01

    Full Text Available Fingerprint verification is one of the most reliable personal identification methods. Fingerprint matching is affected by non-linear distortion introduced in fingerprint impression during the image acquisition process. This non-linear deformation changes both the position and orientation of minutiae. The proposed system operates in three stages: alignment based fingerprint matching, fuzzy clustering and classifier framework. First, an enhanced input fingerprint image has been aligned with the template fingerprint image and matching score is computed. To improve the performance of the system, a fuzzy clustering based on distance and density has been used to cluster the feature set obtained from the fingerprint matcher. Finally a classifier framework has been developed and found that cost sensitive classifier produces better results. The system has been evaluated on fingerprint database and the experimental result shows that system produces a verification rate of 96%. This system plays an important role in forensic and civilian applications.

  12. Latent fingerprint matching.

    Science.gov (United States)

    Jain, Anil K; Feng, Jianjiang

    2011-01-01

    Latent fingerprint identification is of critical importance to law enforcement agencies in identifying suspects: Latent fingerprints are inadvertent impressions left by fingers on surfaces of objects. While tremendous progress has been made in plain and rolled fingerprint matching, latent fingerprint matching continues to be a difficult problem. Poor quality of ridge impressions, small finger area, and large nonlinear distortion are the main difficulties in latent fingerprint matching compared to plain or rolled fingerprint matching. We propose a system for matching latent fingerprints found at crime scenes to rolled fingerprints enrolled in law enforcement databases. In addition to minutiae, we also use extended features, including singularity, ridge quality map, ridge flow map, ridge wavelength map, and skeleton. We tested our system by matching 258 latents in the NIST SD27 database against a background database of 29,257 rolled fingerprints obtained by combining the NIST SD4, SD14, and SD27 databases. The minutiae-based baseline rank-1 identification rate of 34.9 percent was improved to 74 percent when extended features were used. In order to evaluate the relative importance of each extended feature, these features were incrementally used in the order of their cost in marking by latent experts. The experimental results indicate that singularity, ridge quality map, and ridge flow map are the most effective features in improving the matching accuracy.

  13. Enhanced Secure Algorithm for Fingerprint Recognition

    OpenAIRE

    Saleh, Amira Mohammad Abdel-Mawgoud

    2014-01-01

    Fingerprint recognition requires a minimal effort from the user, does not capture other information than strictly necessary for the recognition process, and provides relatively good performance. A critical step in fingerprint identification system is thinning of the input fingerprint image. The performance of a minutiae extraction algorithm relies heavily on the quality of the thinning algorithm. So, a fast fingerprint thinning algorithm is proposed. The algorithm works directly on the gray-s...

  14. Fingerprint verification based on wavelet subbands

    Science.gov (United States)

    Huang, Ke; Aviyente, Selin

    2004-08-01

    Fingerprint verification has been deployed in a variety of security applications. Traditional minutiae detection based verification algorithms do not utilize the rich discriminatory texture structure of fingerprint images. Furthermore, minutiae detection requires substantial improvement of image quality and is thus error-prone. In this paper, we propose an algorithm for fingerprint verification using the statistics of subbands from wavelet analysis. One important feature for each frequency subband is the distribution of the wavelet coefficients, which can be modeled with a Generalized Gaussian Density (GGD) function. A fingerprint verification algorithm that combines the GGD parameters from different subbands is proposed to match two fingerprints. The verification algorithm in this paper is tested on a set of 1,200 fingerprint images. Experimental results indicate that wavelet analysis provides useful features for the task of fingerprint verification.

  15. Secure Fingerprint Alignment and Matching Protocols

    OpenAIRE

    Bayatbabolghani, Fattaneh; Blanton, Marina; Aliasgari, Mehrdad; Goodrich, Michael

    2017-01-01

    We present three secure privacy-preserving protocols for fingerprint alignment and matching, based on what are considered to be the most precise and efficient fingerprint recognition algorithms-those based on the geometric matching of "landmarks" known as minutia points. Our protocols allow two or more honest-but-curious parties to compare their respective privately-held fingerprints in a secure way such that they each learn nothing more than a highly-accurate score of how well the fingerprin...

  16. Introducing a semi-automatic method to simulate large numbers of forensic fingermarks for research on fingerprint identification.

    Science.gov (United States)

    Rodriguez, Crystal M; de Jongh, Arent; Meuwly, Didier

    2012-03-01

    Statistical research on fingerprint identification and the testing of automated fingerprint identification system (AFIS) performances require large numbers of forensic fingermarks. These fingermarks are rarely available. This study presents a semi-automatic method to create simulated fingermarks in large quantities that model minutiae features or images of forensic fingermarks. This method takes into account several aspects contributing to the variability of forensic fingermarks such as the number of minutiae, the finger region, and the elastic deformation of the skin. To investigate the applicability of the simulated fingermarks, fingermarks have been simulated with 5-12 minutiae originating from different finger regions for six fingers. An AFIS matching algorithm was used to obtain similarity scores for comparisons between the minutiae configurations of fingerprints and the minutiae configurations of simulated and forensic fingermarks. The results showed similar scores for both types of fingermarks suggesting that the simulated fingermarks are good substitutes for forensic fingermarks.

  17. A Fingerprint Encryption Scheme Based on Irreversible Function and Secure Authentication

    Directory of Open Access Journals (Sweden)

    Yijun Yang

    2015-01-01

    Full Text Available A fingerprint encryption scheme based on irreversible function has been designed in this paper. Since the fingerprint template includes almost the entire information of users’ fingerprints, the personal authentication can be determined only by the fingerprint features. This paper proposes an irreversible transforming function (using the improved SHA1 algorithm to transform the original minutiae which are extracted from the thinned fingerprint image. Then, Chinese remainder theorem is used to obtain the biokey from the integration of the transformed minutiae and the private key. The result shows that the scheme has better performance on security and efficiency comparing with other irreversible function schemes.

  18. A Fingerprint Encryption Scheme Based on Irreversible Function and Secure Authentication

    Science.gov (United States)

    Yu, Jianping; Zhang, Peng; Wang, Shulan

    2015-01-01

    A fingerprint encryption scheme based on irreversible function has been designed in this paper. Since the fingerprint template includes almost the entire information of users' fingerprints, the personal authentication can be determined only by the fingerprint features. This paper proposes an irreversible transforming function (using the improved SHA1 algorithm) to transform the original minutiae which are extracted from the thinned fingerprint image. Then, Chinese remainder theorem is used to obtain the biokey from the integration of the transformed minutiae and the private key. The result shows that the scheme has better performance on security and efficiency comparing with other irreversible function schemes. PMID:25873989

  19. A fingerprint encryption scheme based on irreversible function and secure authentication.

    Science.gov (United States)

    Yang, Yijun; Yu, Jianping; Zhang, Peng; Wang, Shulan

    2015-01-01

    A fingerprint encryption scheme based on irreversible function has been designed in this paper. Since the fingerprint template includes almost the entire information of users' fingerprints, the personal authentication can be determined only by the fingerprint features. This paper proposes an irreversible transforming function (using the improved SHA1 algorithm) to transform the original minutiae which are extracted from the thinned fingerprint image. Then, Chinese remainder theorem is used to obtain the biokey from the integration of the transformed minutiae and the private key. The result shows that the scheme has better performance on security and efficiency comparing with other irreversible function schemes.

  20. A Study on the Translation Invariant Matching Algorithm for Fingerprint Recognition

    Energy Technology Data Exchange (ETDEWEB)

    Kim, E.H.; Cho, S.W.; Kim, J.M. [Hongik University, Seoul (Korea)

    2002-02-01

    This paper presents a new matching algorithm for fingerprint recognition, which is robust to image translation. The basic idea of this paper is to estimate the translation vector of an input fingerprint image using N minutiae at which the gradient of the ridge direction field is large. Using the estimated translation vector we select minutiae irrelevant to the translation. We experimentally prove that the presented algorithm results in good performance even if there are large translation and pseudo-minutiae. (author). 10 refs., 12 figs., 2 tabs.

  1. Frequency-Based Fingerprint Recognition

    Science.gov (United States)

    Aguilar, Gualberto; Sánchez, Gabriel; Toscano, Karina; Pérez, Héctor

    abstract Fingerprint recognition is one of the most popular methods used for identification with greater success degree. Fingerprint has unique characteristics called minutiae, which are points where a curve track ends, intersects, or branches off. In this chapter a fingerprint recognition method is proposed in which a combination of Fast Fourier Transform (FFT) and Gabor filters is used for image enhancement. A novel recognition stage using local features for recognition is also proposed. Also a verification stage is introduced to be used when the system output has more than one person.

  2. Decision Level Fusion of Fingerprint Minutiae Based Pseudonymous Identifiers

    NARCIS (Netherlands)

    Yang, Bian; Busch, Christoph; Groot, de Koen; Xu, Haiyun; Veldhuis, Raymond N.J.

    2011-01-01

    In a biometric template protected authentication system, a pseudonymous identifier is the part of a protected biometric template that can be compared directly against other pseudonymous identifiers. Each compared pair of pseudonymous identifiers results in a verification decision testing whether bot

  3. Biometrics In Fingerprint Recognition Using Distance Vector Method

    Directory of Open Access Journals (Sweden)

    Sumeet Dhawan

    2011-08-01

    Full Text Available A lot of fingerprint features have been defined for the representation of the fingerprint. Among the features, ridge ending and ridge bifurcation are the most widely used ones. These features are known as minutiae points. Utilizing more information other than minutiae is much helpful for large scale fingerprint recognition application. By considering some predefined features one can derive new features for the verification of the fingerprint. In this thesis, we proposed a new feature for fingerprint images. This new feature is named as Distance Vector. A Distance Vector counts the minutiae points in each row of a particular fingerprint image. A Distance Vector is associated with every fingerprint in the database. At the time of enrollment this feature is stored with the concerned fingerprint and at the time of matching this feature is matched with the Distance Vector of each fingerprint in the template database. This process increases the reliability of the fingerprint recognition task. In the first stages, image normalization and orientation of the ridges are estimated.

  4. Fingerprint Recognition using Fuzzy Logic with Triangular Pattern Template

    DEFF Research Database (Denmark)

    Hussain, Dil Muhammad Akbar

    2006-01-01

    A fingerprint is a pattern of ridges and valleys that exist on the surface of the finger. The uniqueness of a fingerprint is typically determined by the overall pattern of ridges and valleys as well as the local ridge structures e.g., a ridge bifurcation or a ridge ending, which are called minutiae...... points. Designing a reliable automatic fingerprint matching algorithm is quite challenging. However, the popularity of fingerprint sensors as they are becoming smaller and cheaper, automatic identification based on fingerprints is becoming not only attractive but an alternative complement...... to the traditional methods of identification. The critical factor in the widespread use of fingerprints identification is, satisfying the performance e.g., speed of matching and accuracy requirements of the application.  The widely used minutiae-based representation utilizes this discriminatory information available...

  5. Fingerprint Image Enhancement By Develop Mehtre Technique

    Directory of Open Access Journals (Sweden)

    Mustafa Salah Khalefa

    2011-12-01

    Full Text Available Fingerprint identification is one of the most reliable biometrics technologies. There are manyapplications of fingerprint recognition such as voting, ecommerce, bank, virtual banks and military.Fingerprint image enhancement is an essential preprocessing step in extract minutiae from the inputfingerprint images. In this paper, we propose an image enhancement method by developing Mehtermethod for directional image. The enhancement is done by added the Block Filtering, HistogramEqualization and High-Pass Filtering. We have evaluated the performance of the enhancement imagemethod by tested it with 100 fingerprint images. Experimental results show the enhancement methodimproves the recognition more accuracy.

  6. Fingerprint Recognition on Various Authentication Sensors

    Institute of Scientific and Technical Information of China (English)

    A.Tirupathi Rao; N.Pattabhi Ramaiah; C.Krishna Mohan

    2014-01-01

    Fingerprint is a very popular and an ancient biometric technology to uniquely identify a person. In this paper, a fingerprint matcher is proposed which uses the global and local adaptive binarization and global minutia features. The fingerprint data is collected using three different authentication devices based on optical sensors. The experimental results are compared with the National Institute of Standards and Technology (NIST) Bozorth algorithm and various authentication fingerprint sensors. The accuracy of the proposed algorithm has been improved significantly compared with that of the NIST Bozorth algorithm.

  7. FINGERPRINT-BASED KEY BINDING/RECOVERING SCHEME BASED ON FUZZY VAULT

    Institute of Scientific and Technical Information of China (English)

    Feng Quan; Su Fei; Cai Anni

    2008-01-01

    This letter proposes fingerprint-based key binding/recovering with fuzzy vault. Fingerprint minutiae data and the cryptographic key are merged together by a multivariable linear function. First,the minutiae data are bound by a set of random data through the linear function. The number of the function's variables is determined by the required number of matched minutiae. Then, a new key derived from the random data is used to encrypt the cryptographic key. Lastly, the binding data are protected using fuzzy vault scheme. The proposed scheme provides the system with the flexibility to use changeable number of minutiae to bind/recover the protected key and a unified method regardless of the length of the key.

  8. A fingerprint identification algorithm by clustering similarity

    Institute of Scientific and Technical Information of China (English)

    TIAN Jie; HE Yuliang; CHEN Hong; YANG Xin

    2005-01-01

    This paper introduces a fingerprint identification algorithm by clustering similarity with the view to overcome the dilemmas encountered in fingerprint identification.To decrease multi-spectrum noises in a fingerprint, we first use a dyadic scale space (DSS) method for image enhancement. The second step describes the relative features among minutiae by building a minutia-simplex which contains a pair of minutiae and their local associated ridge information, with its transformation-variant and invariant relative features applied for comprehensive similarity measurement and for parameter estimation respectively. The clustering method is employed to estimate the transformation space.Finally, multi-resolution technique is used to find an optimal transformation model for getting the maximal mutual information between the input and the template features. The experimental results including the performance evaluation by the 2nd International Verification Competition in 2002 (FVC2002), over the four fingerprint databases of FVC2002 indicate that our method is promising in an automatic fingerprint identification system (AFIS).

  9. Evidence evaluation in fingerprint comparison and automated fingerprint identification systems--modelling within finger variability.

    Science.gov (United States)

    Egli, Nicole M; Champod, Christophe; Margot, Pierre

    2007-04-11

    Recent challenges and errors in fingerprint identification have highlighted the need for assessing the information content of a papillary pattern in a systematic way. In particular, estimation of the statistical uncertainty associated with this type of evidence is more and more called upon. The approach used in the present study is based on the assessment of likelihood ratios (LRs). This evaluative tool weighs the likelihood of evidence given two mutually exclusive hypotheses. The computation of likelihood ratios on a database of marks of known sources (matching the unknown and non-matching the unknown mark) allows an estimation of the evidential contribution of fingerprint evidence. LRs are computed taking advantage of the scores obtained from an automated fingerprint identification system and hence are based exclusively on level II features (minutiae). The AFIS system attributes a score to any comparison (fingerprint to fingerprint, mark to mark and mark to fingerprint), used here as a proximity measure between the respective arrangements of minutiae. The numerator of the LR addresses the within finger variability and is obtained by comparing the same configurations of minutiae coming from the same source. Only comparisons where the same minutiae are visible both on the mark and on the print are therefore taken into account. The denominator of the LR is obtained by cross-comparison with a database of prints originating from non-matching sources. The estimation of the numerator of the LR is much more complex in terms of specific data requirements than the estimation of the denominator of the LR (that requires only a large database of prints from an non-associated population). Hence this paper addresses specific issues associated with the numerator or within finger variability. This study aims at answering the following questions: (1) how a database for modelling within finger variability should be acquired; (2) whether or not the visualisation technique or the

  10. Fingerprint matching by thin-plate spline modelling of elastic deformations

    NARCIS (Netherlands)

    Bazen, Asker M.; Gerez, Sabih H.

    2003-01-01

    This paper presents a novel minutiae matching method that describes elastic distortions in fingerprints by means of a thin-plate spline model, which is estimated using a local and a global matching stage. After registration of the fingerprints according to the estimated model, the number of matching

  11. Partial fingerprint matching based on SIFT Features

    Directory of Open Access Journals (Sweden)

    Ms. S.Malathi,

    2010-07-01

    Full Text Available 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 sufficient 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 fingerprints obtained. Recent research has begun to delve into the problems of latent or partial fingerprints. In this paper we present a novel approach for partial fingerprint matching scheme based on SIFT(Scale Invariant Feature Transform features and matching is achieved using a modified point matching process. Using Neurotechnology database, we demonstrate that the proposed method exhibits an improved performance when matching full print against partial print.

  12. Quantum Fingerprints that Keep Secrets

    CERN Document Server

    Gavinsky, Dmitry

    2010-01-01

    We introduce a new type of cryptographic primitive that we call \\e{hiding fingerprinting}. A (quantum) fingerprinting scheme translates a binary string of length $n$ to $d$ (qu)bits, typically $d\\ll n$, such that given any string $y$ and a fingerprint of $x$, one can decide with high accuracy whether $x=y$. Classical fingerprinting schemes cannot hide information very well:\\ a classical fingerprint of $x$ that guarantees error $\\le\\eps$ necessarily reveals \\asOm{\\log(1/\\eps)} bits about $x$. We call a scheme \\e{hiding} if it reveals \\aso{\\log(1/\\eps)} bits; accordingly, no classical scheme is hiding. For any constant $c$, we construct two kinds of hiding fingerprinting schemes, both mapping $x\\in\\01^n$ to \\asO{\\log n} qubits and guaranteeing one-sided error probability at most $1/n^c$. The first kind uses pure states and leaks at most \\asO1 bits, and the second kind uses mixed states and leaks at most $1/n^c$ bits, where the ``leakage'' is bounded via accessible information. The schemes are computationally ef...

  13. An effective one-dimensional anisotropic fingerprint enhancement algorithm

    Science.gov (United States)

    Ye, Zhendong; Xie, Mei

    2012-01-01

    Fingerprint identification is one of the most important biometric technologies. The performance of the minutiae extraction and the speed of the fingerprint verification system rely heavily on the quality of the input fingerprint images, so the enhancement of the low fingerprint is a critical and difficult step in a fingerprint verification system. In this paper we proposed an effective algorithm for fingerprint enhancement. Firstly we use normalization algorithm to reduce the variations in gray level values along ridges and valleys. Then we utilize the structure tensor approach to estimate each pixel of the fingerprint orientations. At last we propose a novel algorithm which combines the advantages of onedimensional Gabor filtering method and anisotropic method to enhance the fingerprint in recoverable region. The proposed algorithm has been evaluated on the database of Fingerprint Verification Competition 2004, and the results show that our algorithm performs within less time.

  14. A Computational Discriminability Analysis on Twin Fingerprints

    Science.gov (United States)

    Liu, Yu; Srihari, Sargur N.

    Sharing similar genetic traits makes the investigation of twins an important study in forensics and biometrics. Fingerprints are one of the most commonly found types of forensic evidence. The similarity between twins’ prints is critical establish to the reliability of fingerprint identification. We present a quantitative analysis of the discriminability of twin fingerprints on a new data set (227 pairs of identical twins and fraternal twins) recently collected from a twin population using both level 1 and level 2 features. Although the patterns of minutiae among twins are more similar than in the general population, the similarity of fingerprints of twins is significantly different from that between genuine prints of the same finger. Twins fingerprints are discriminable with a 1.5%~1.7% higher EER than non-twins. And identical twins can be distinguished by examine fingerprint with a slightly higher error rate than fraternal twins.

  15. Minutiae filtering using ridge-valley method

    Directory of Open Access Journals (Sweden)

    Marco Antonio AMELLER

    2016-10-01

    Full Text Available In order to identify subjects in a convenient and efficient way one must use some special feature that makes it possible to discriminate between persons. Some of the features are biometric in nature, such as iris texture, hand shape, the human face, and of course finger prints. These play an important role in many automatic identification systems, since every person is believed to have a unique set of fingerprints. Before a fingerprint image can be looked up in a database, it has to be classified into one of 5 types in order to reduce processing times.

  16. An Efficient Automatic Attendance System using Fingerprint Verification Technique

    OpenAIRE

    Chitresh Saraswat,; Amit Kumar

    2010-01-01

    The main aim of this paper is to develop an accurate, fast and very efficient automatic attendance system using fingerprint verification technique. We propose a system in which fingerprint verification is done by using extraction of minutiae technique and the system that automates the whole process of taking attendance, Manually which is a laborious and troublesome work and waste a lot of time, with its managing and maintaining the records for a period of time is also a burdensome task. For t...

  17. Study of fingerprints in Argentina population for application in personal identification.

    Science.gov (United States)

    Rivaldería, Noemí; Gutiérrez-Redomero, Esperanza; Alonso-Rodríguez, Concepción; Dipierri, José E; Martín, Luis M

    2017-05-01

    The fingerprints of the Buenos Aires and Chubut provinces in Argentina have been studied, with the aim of knowing and quantifying the variability of these features, which are used in the identification process. The data studied for this research was obtained from 330 individuals, of both sexes, from two Argentinian population samples (170 individuals from Buenos Aires and 160 from Chubut), which amounts to a total of 3300 fingerprints. The different types of minutiae were located, identified, and visually quantified in four areas on the fingerprint. Two perpendicular axes were drawn whose intersection was located in the center of fingerprint. In addition, a circle was defined on these quadrants whose radius cut fifteen ridges. This method divides the fingerprints into four quadrants with two sectors apiece. The results obtained for both populations were compared statistically with those published previously for an Argentinian population sample, which had been collected using the same methodology. Therefore, Argentina becomes the country with the most information in this matter. For both populations, the highest frequencies were of ridge endings, followed by bifurcations and convergences. In this study of minutiae, statistically significant differences were found between the area of the fingerprint (inside and outside the circle), males and females, and types of main pattern for both samples. However, although the results show common patterns in the distribution of minutiae, there are also significant differences between populations. This reveals a significant ancestral and frequency effect of the minutiae, which would indicate that the minutiae are more genetically dependent than has been suspected so far. Furthermore, the non-equiprobability found for the frequency of the types of minutiae indicates that the weight provided by these characteristics is not the same when applied in identification processes, whether used quantitatively (numerical standard) or

  18. Efficient Fingerprint Matching Algorithm for Integrated Circuit Cards

    Institute of Scientific and Technical Information of China (English)

    Jian-Wei Yang; Li-Feng Liu; Tian-Zi Jiang

    2004-01-01

    Fingerprint matching is a crucial step in fingerprint identification.Recently,a variety of algorithms for this issue have been developed.Each of them is application situation specific and has its advantages and disadvantages.It is highly desired to develop an efficient fingerprint verification technology for Integrated Circuit(IC)Cards or chips.IC cards have some special characteristics,such as very small storage space and slow processing speed,which hinder the use of most fingerprint matching algorithms in such situations.In order to solve this problem,the paper presents an improved minutia-pattern(minutiae-based)matching algorithm by employing the orientation field of the fingerprint as a new feature.Our algorithm not only inherits the advantages of the general minutia-pattern matching algorithms,but also overcomes their disadvantages.Experimental results show that the proposed algorithm can greatly improve the performance of fingerprint matching in both accuracy and efficiency,and it is very suitable for applications in IC cards.

  19. A study of Hough Transform-based fingerprint alignment algorithms

    CSIR Research Space (South Africa)

    Mlambo, CS

    2014-10-01

    Full Text Available array. In 2013 Paulino et al [10] applied Ratha et al’s [2] approach in latent fingerprint matching to present a descriptor-based Hough transform. This involved the use of orientation field and minutiae information to accumulate evidence into accumulator... and improves on the early work presented in the 1990’s, as presented in [5], [14], [8], [17], [11], [10], and [12]. As a result, the memory requirements, computing time and performance on different conditions of minutiae points has not been presented...

  20. Minutiae Matching with Privacy Protection Based on the Combination of Garbled Circuit and Homomorphic Encryption

    Directory of Open Access Journals (Sweden)

    Mengxing Li

    2014-01-01

    Full Text Available Biometrics plays an important role in authentication applications since they are strongly linked to holders. With an increasing growth of e-commerce and e-government, one can expect that biometric-based authentication systems are possibly deployed over the open networks in the near future. However, due to its openness, the Internet poses a great challenge to the security and privacy of biometric authentication. Biometric data cannot be revoked, so it is of paramount importance that biometric data should be handled in a secure way. In this paper we present a scheme achieving privacy-preserving fingerprint authentication between two parties, in which fingerprint minutiae matching algorithm is completed in the encrypted domain. To improve the efficiency, we exploit homomorphic encryption as well as garbled circuits to design the protocol. Our goal is to provide protection for the security of template in storage and data privacy of two parties in transaction. The experimental results show that the proposed authentication protocol runs efficiently. Therefore, the protocol can run over open networks and help to alleviate the concerns on security and privacy of biometric applications over the open networks.

  1. Minutiae matching with privacy protection based on the combination of garbled circuit and homomorphic encryption.

    Science.gov (United States)

    Li, Mengxing; Feng, Quan; Zhao, Jian; Yang, Mei; Kang, Lijun; Wu, Lili

    2014-01-01

    Biometrics plays an important role in authentication applications since they are strongly linked to holders. With an increasing growth of e-commerce and e-government, one can expect that biometric-based authentication systems are possibly deployed over the open networks in the near future. However, due to its openness, the Internet poses a great challenge to the security and privacy of biometric authentication. Biometric data cannot be revoked, so it is of paramount importance that biometric data should be handled in a secure way. In this paper we present a scheme achieving privacy-preserving fingerprint authentication between two parties, in which fingerprint minutiae matching algorithm is completed in the encrypted domain. To improve the efficiency, we exploit homomorphic encryption as well as garbled circuits to design the protocol. Our goal is to provide protection for the security of template in storage and data privacy of two parties in transaction. The experimental results show that the proposed authentication protocol runs efficiently. Therefore, the protocol can run over open networks and help to alleviate the concerns on security and privacy of biometric applications over the open networks.

  2. Fingerprint Recognition Using Local Features and Hu Moments

    Directory of Open Access Journals (Sweden)

    G. Aguilar-Torres

    2012-10-01

    Full Text Available Person identification systems based on fingerprint patterns called Automatic Fingerprint Identification Systems, AFIS,are some of the most widely used biometric methods since they provide a high degree of success. The accuracy ofAFIS is mainly due to some unique characteristics called minutiae, which are points where a curve track finishes,intersects with another curve track, or branches off. During past decades several efficient minutia-based fingerprintrecognition algorithms have been proposed which achieve false recognition rates close to 1%, however, theirrecognition rate may be still improved. To this end, this paper presents a fingerprint recognition method using acombination of the Fast Fourier Transform (FFT with Gabor filters for image enhancement. Next, fingerprintrecognition is carried out using a novel recognition stage based on Local Features and Hu invariant moments forverification.

  3. Finger-vein and fingerprint recognition based on a feature-level fusion method

    Science.gov (United States)

    Yang, Jinfeng; Hong, Bofeng

    2013-07-01

    Multimodal biometrics based on the finger identification is a hot topic in recent years. In this paper, a novel fingerprint-vein based biometric method is proposed to improve the reliability and accuracy of the finger recognition system. First, the second order steerable filters are used here to enhance and extract the minutiae features of the fingerprint (FP) and finger-vein (FV). Second, the texture features of fingerprint and finger-vein are extracted by a bank of Gabor filter. Third, a new triangle-region fusion method is proposed to integrate all the fingerprint and finger-vein features in feature-level. Thus, the fusion features contain both the finger texture-information and the minutiae triangular geometry structure. Finally, experimental results performed on the self-constructed finger-vein and fingerprint databases are shown that the proposed method is reliable and precise in personal identification.

  4. Comparison between fingerprints of the epidermis and dermis: Perspectives in the identifying of corpses.

    Science.gov (United States)

    Mizokami, Leila Lopes; Silva, Lara Rosana Vieira; Kückelhaus, Selma Aparecida Souza

    2015-07-01

    In forensic science, the putrefaction, maceration, mummification or burning make it difficult to collect the fingerprints of the epidermis for identification purposes. In such cases, the comparison between fingerprints collected from the dermal surface and the ante mortem pattern of the epidermal surface archived in databases must be performed. Therefore, considering that the identification of corpses is done by comparison of fingerprints on different surfaces, this study aimed to compare the epidermal and the dermal fingerprints to determine the discrepancies between the minutiae of both surfaces. The study was conducted with excised fingers of 19 fresh adult corpses. Once selected, excised and photographed, the fingers were subjected to maceration with 0.5% acetic acid solution for the removal of the epidermal glove and for registering the dermal fingerprint. Then, an area of 1cm(2) in the epidermal and dermal photographies was selected and the minutiae of each were separately marked by an expert in identification. The comparison between minutiae of the epidermal and dermal surfaces showed that: (1) both surfaces maintained the patterns and characteristics of fingerprints (arch, whorl or loop) and the characteristics related to the systems and the disposal of the lines, meaning the formation or not of deltas; (2) the total number of marked minutiae did not differ between both surfaces for the group of individuals (paired t test, p=0.48); (3) the percentage of coincidences and divergences (minutiae present on only one surface) between minutiae were 63.0±20.0% and 37.0±20.0%, respectively; (4) identification was possible for 16 fingers/individuals, but not for 3 of them; (5) the increase in the number of marked minutiae does not affect the percentage of coincidences. Our results demonstrate the feasibility of the dermal surface for identification purposes due to the high percentage of matching minutiae, but considering the discrepancies and the inconclusive

  5. Security and matching of partial fingerprint recognition systems

    Science.gov (United States)

    Jea, Tsai-Yang; Chavan, Viraj S.; Govindaraju, Venu; Schneider, John K.

    2004-08-01

    Despite advances in fingerprint identification techniques, matching incomplete or partial fingerprints still poses a difficult challenge. While the introduction of compact silicon chip-based sensors that capture only a part of the fingerprint area have made this problem important from a commercial perspective, there is also considerable interest on the topic for processing partial and latent fingerprints obtained at crime scenes. Attempts to match partial fingerprints using singular ridge structures-based alignment techniques fail when the partial print does not include such structures (e.g., core or delta). We present a multi-path fingerprint matching approach that utilizes localized secondary features derived using only the relative information of minutiae. Since the minutia-based fingerprint representation, is an ANSI-NIST standard, our approach has the advantage of being directly applicable to already existing databases. We also analyze the vulnerability of partial fingerprint identification systems to brute force attacks. The described matching approach has been tested on one of FVC2002"s DB1 database11. The experimental results show that our approach achieves an equal error rate of 1.25% and a total error rate of 1.8% (with FAR at 0.2% and FRR at 1.6%).

  6. FINGERPRINT MATCHING BASED ON PORE CENTROIDS

    Directory of Open Access Journals (Sweden)

    S. Malathi

    2011-05-01

    Full Text Available In recent years there has been exponential growth in the use of bio- metrics for user authentication applications. Automated Fingerprint Identification systems have become popular tool in many security and law enforcement applications. Most of these systems rely on minutiae (ridge ending and bifurcation features. With the advancement in sensor technology, high resolution fingerprint images (1000 dpi pro- vide micro level of features (pores that have proven to be useful fea- tures for identification. In this paper, we propose a new strategy for fingerprint matching based on pores by reliably extracting the pore features The extraction of pores is done by Marker Controlled Wa- tershed segmentation method and the centroids of each pore are con- sidered as feature vectors for matching of two fingerprint images. Experimental results shows that the proposed method has better per- formance with lower false rates and higher accuracy.

  7. A medium resolution fingerprint matching system

    Directory of Open Access Journals (Sweden)

    Ayman Mohammad Bahaa-Eldin

    2013-09-01

    Full Text Available In this paper, a novel minutiae based fingerprint matching system is proposed. The system is suitable for medium resolution fingerprint images obtained by low cost commercial sensors. The paper presents a new thinning algorithm, a new features extraction and representation, and a novel feature distance matching algorithm. The proposed system is rotation and translation invariant and is suitable for complete or partial fingerprint matching. The proposed algorithms are optimized to be executed on low resource environments both in CPU power and memory space. The system was evaluated using a standard fingerprint dataset and good performance and accuracy were achieved under certain image quality requirements. In addition, the proposed system was compared favorably to that of the state of the art systems.

  8. Measuring what latent fingerprint examiners consider sufficient information for individualization determinations.

    Science.gov (United States)

    Ulery, Bradford T; Hicklin, R Austin; Roberts, Maria Antonia; Buscaglia, JoAnn

    2014-01-01

    Latent print examiners use their expertise to determine whether the information present in a comparison of two fingerprints (or palmprints) is sufficient to conclude that the prints were from the same source (individualization). When fingerprint evidence is presented in court, it is the examiner's determination--not an objective metric--that is presented. This study was designed to ascertain the factors that explain examiners' determinations of sufficiency for individualization. Volunteer latent print examiners (n = 170) were each assigned 22 pairs of latent and exemplar prints for examination, and annotated features, correspondence of features, and clarity. The 320 image pairs were selected specifically to control clarity and quantity of features. The predominant factor differentiating annotations associated with individualization and inconclusive determinations is the count of corresponding minutiae; other factors such as clarity provided minimal additional discriminative value. Examiners' counts of corresponding minutiae were strongly associated with their own determinations; however, due to substantial variation of both annotations and determinations among examiners, one examiner's annotation and determination on a given comparison is a relatively weak predictor of whether another examiner would individualize. The extensive variability in annotations also means that we must treat any individual examiner's minutia counts as interpretations of the (unknowable) information content of the prints: saying "the prints had N corresponding minutiae marked" is not the same as "the prints had N corresponding minutiae." More consistency in annotations, which could be achieved through standardization and training, should lead to process improvements and provide greater transparency in casework.

  9. Reversible Data Hiding Techniques

    Directory of Open Access Journals (Sweden)

    Dhananjay Yadav

    2012-03-01

    Full Text Available Reversible data hiding is a technique that is used to hide data inside an image. The data is hidden in such a way that the exact or original data is not visible. The hidden data can be retrieved as and when required. There are several methods that are used in reversible data hiding techniques like Watermarking, Lossless embedding and encryption. In this paper we present a review of reversible watermarking techniques and show different methods that are used to get reversible data hiding technique with higher embedding capacity and invisible objects. Watermark need not be hidden. Watermarking can be applied to 1. Images, 2. Text, 3. Audio/video, 4. Software.

  10. An Investigation on the Problem of Thinning in Fingerprint Processing

    Directory of Open Access Journals (Sweden)

    I. O. Omeiza

    2012-06-01

    Full Text Available A high-integrity thinning procedure for binarised fingerprints is proposed in this paper. Several authors and software developers have approached the thinning problems in fingerprint-processing differently. Their approach produced in most cases, fingerprint skeletons with low reliability and thus require additional minutiae-pruning stage to discard the erroneous minutiae in the obtained skeletons. The work involves a careful blending of some already existing algorithms to achieve optimal performance in thinning binarised fingerprint images. The algorithms considered are as follows. The "Zhang and Suen" parallel algorithm for thinning digital patterns, the improved parallel thinning algorithm by Holt and company and template-based thinning algorithm by Stentiford and Mortimer. The idea of combining these stand-alone algorithms to improve the quality of obtained objects skeleton in general image processing was first suggested in a text by Parker in 1998. However, his work does not specifically address the fingerprint problem. This work has examined and proves the plausibility of this thinning approach in the particular case of fingerprint application domain. The thinning procedure obtained satisfactory skeletons for fingerprint applications.

  11. Nonminutiae-Based Decision-Level Fusion for Fingerprint Verification

    Directory of Open Access Journals (Sweden)

    Hassan Ghassemian

    2007-01-01

    Full Text Available Most of the proposed methods used for fingerprint verification are based on local visible features called minutiae. However, due to problems for extracting minutiae from low-quality fingerprint images, other discriminatory information has been considered. In this paper, the idea of decision-level fusion of orientation, texture, and spectral features of fingerprint image is proposed. At first, a value is assigned to the similarity of block orientation field of two-fingerprint images. This is also performed for texture and spectral features. Each one of the proposed similarity measure does not need core-point existence and detection. Rotation and translation of two fingerprint images are also taken into account in each method and all points of fingerprint image are employed in feature extraction. Then, the similarity of each feature is normalized and used for decision-level fusion of fingerprint information. The experimental results on FVC2000 database demonstrate the effectiveness of the proposed fusion method and its significant accuracy.

  12. Hiding Information under Speech

    Science.gov (United States)

    2005-12-12

    as it arrives in real time, and it disappears as fast as it arrives. Furthermore, our cognitive process for translating audio sounds to the meaning... steganography , whose goal is to make the embedded data completely undetectable. In addi- tion, we must dismiss the idea of hiding data by using any...therefore, an image has more room to hide data; and (2) speech steganography has not led to many money-making commercial businesses. For these two

  13. HIDE: HI Data Emulator

    Science.gov (United States)

    Akeret, Joel; Seehars, Sebastian; Chang, Chihway; Monstein, Christian; Amara, Adam; Refregier, Alexandre

    2016-07-01

    HIDE (HI Data Emulator) forward-models the process of collecting astronomical radio signals in a single dish radio telescope instrument and outputs pixel-level time-ordered-data. Written in Python, HIDE models the noise and RFI modeling of the data and with its companion code SEEK (ascl:1607.020) provides end-to-end simulation and processing of radio survey data.

  14. An Asymmetric Fingerprint Matching Algorithm for Java Card

    OpenAIRE

    Bistarelli, Stefano; Santini, Francesco; Vaccarelli, Anna

    2004-01-01

    A novel fingerprint matching algorithm is proposed in this paper. The algorithm is based on the minutiae local structures, that are invariant with respect to global transformations like translation and rotation. Match algorithm has been implemented inside a smartcard over the Java Card? platform, meeting the individual's need for information privacy and the overall authentication procedure security, since the card owner biometric template never leaves the private support device and the match ...

  15. Secure fingerprint hashes using subsets of local structures

    Science.gov (United States)

    Effland, Tom; Schneggenburger, Mariel; Schuler, Jim; Zhang, Bingsheng; Hartloff, Jesse; Dobler, Jimmy; Tulyakov, Sergey; Rudra, Atri; Govindaraju, Venu

    2014-05-01

    In order to fulfill the potential of fingerprint templates as the basis for authentication schemes, one needs to design a hash function for fingerprints that achieves acceptable matching accuracy and simultaneously has provable security guarantees, especially for parameter regimes that are needed to match fingerprints in practice. While existing matching algorithms can achieve impressive matching accuracy, they have no security guarantees. On the other hand, provable secure hash functions have bad matching accuracy and/or do not guarantee security when parameters are set to practical values. In this work, we present a secure hash function that has the best known tradeoff between security guarantees and matching accuracy. At a high level, our hash function is simple: we apply an off-the shelf hash function on certain collections of minutia points (in particular, triplets of minutia triangles"). However, to realize the potential of this scheme, we have to overcome certain theoretical and practical hurdles. In addition to the novel idea of combining clustering ideas from matching algorithms with ideas from the provable security of hash functions, we also apply an intermediate translation-invariant but rotation-variant map to the minutia points before applying the hash function. This latter idea helps improve the tradeoff between matching accuracy and matching efficiency.

  16. Secure Identity-authentication Scheme Based on Minutiae Classification%基于指纹多生物特征的安全身份认证方案

    Institute of Scientific and Technical Information of China (English)

    黄家斌; 曹珍富

    2013-01-01

    由于多生物特征身份认证的安全稳定性,美国司法部引入指纹汗孔信息来帮助身份认证.然而指纹汗孔信息的泄露可以充分还原出指纹纹路信息.本文提出一种保护指纹汗孔等个人隐私信息的方案.方案采用高分辨率指纹仪提取带有汗孔的指纹数字图像,使用指纹细节点进行预对齐,指纹汗孔进行密钥绑定.现有的模糊金库方案在应用上都假设指纹预先对齐或采用一些准确率不高的对齐方法,本文首次将指纹第三层汗孔信息与模糊金库方案相结合.%As multi-biometric feature identification can get higher accuracy,the U.S.department of justice launched the next generation identification (NGI) project which will add the fingerprint pore information to help the identification.However,the leaking of personal fingerprint pore information can make it easy to restore the fingerprint ridges.The paper presents a scheme which can protect personal private pore information.The scheme uses high-resolution fingerprint scan device to capture fingerprint digital image with pores,aligns fingerprints by using minutiae,and binds key by using pore.Existing Fuzzy Vault scheme assumes fingerprints are pre-aligned or uses inaccurate methods to align fingerprints.The paper firstly combines fingerprint level3 information with Fuzzy Vault scheme.

  17. Fingerprint image mosaicking by recursive ridge mapping.

    Science.gov (United States)

    Choi, Kyoungtaek; Choi, Heeseung; Lee, Sangyoun; Kim, Jaihie

    2007-10-01

    To obtain a large fingerprint image from several small partial images, mosaicking of fingerprint images has been recently researched. However, existing approaches cannot provide accurate transformations for mosaics when it comes to aligning images because of the plastic distortion that may occur due to the nonuniform contact between a finger and a sensor or the deficiency of the correspondences in the images. In this paper, we propose a new scheme for mosaicking fingerprint images, which iteratively matches ridges to overcome the deficiency of the correspondences and compensates for the amount of plastic distortion between two partial images by using a thin-plate spline model. The proposed method also effectively eliminates erroneous correspondences and decides how well the transformation is estimated by calculating the registration error with a normalized distance map. The proposed method consists of three phases: feature extraction, transform estimation, and mosaicking. Transform is initially estimated with matched minutia and the ridges attached to them. Unpaired ridges in the overlapping area between two images are iteratively matched by minimizing the registration error, which consists of the ridge matching error and the inverse consistency error. During the estimation, erroneous correspondences are eliminated by considering the geometric relationship between the correspondences and checking if the registration error is minimized or not. In our experiments, the proposed method was compared with three existing methods in terms of registration accuracy, image quality, minutia extraction rate, processing time, reject to fuse rate, and verification performance. The average registration error of the proposed method was less than three pixels, and the maximum error was not more than seven pixels. In a verification test, the equal error rate was reduced from 10% to 2.7% when five images were combined by our proposed method. The proposed method was superior to other

  18. Coarse Fingerprint Registration Using Orientation Fields

    Directory of Open Access Journals (Sweden)

    Yager Neil

    2005-01-01

    Full Text Available The majority of traditional research into automated fingerprint identification has focused on algorithms using minutiae-based features. However, shortcomings of this approach are becoming apparent due to the difficulty of extracting minutiae points from noisy or low-quality images. Therefore, there has been increasing interest in algorithms based on nonminutiae features in recent years. One vital stage in most fingerprint verification systems is registration, which involves recovering the transformation parameters that align features from each fingerprint. This paper investigates the use of orientation fields for registration; an approach that has the potential to perform robustly for poor-quality images. Three diverse algorithms have been implemented for the task. The first algorithm is based on the generalized Hough transform, and it works by accumulating evidence for transformations in a discretized parameter space. The second algorithm is based on identifying distinctive local orientations, and using these as landmarks for alignment. The final algorithm follows the path of steepest descent in the parameter space to quickly find solutions that are locally optimal. The performance of these three algorithms is evaluated using an FVC2002 dataset.

  19. Attacks on biometric systems: a case study in fingerprints

    Science.gov (United States)

    Uludag, Umut; Jain, Anil K.

    2004-06-01

    In spite of numerous advantages of biometrics-based personal authentication systems over traditional security systems based on token or knowledge, they are vulnerable to attacks that can decrease their security considerably. In this paper, we analyze these attacks in the realm of a fingerprint biometric system. We propose an attack system that uses a hill climbing procedure to synthesize the target minutia templates and evaluate its feasibility with extensive experimental results conducted on a large fingerprint database. Several measures that can be utilized to decrease the probability of such attacks and their ramifications are also presented.

  20. Touch-less Fingerprint Analysis — A Review and Comparison

    Directory of Open Access Journals (Sweden)

    Prabhjot Kaur

    2012-06-01

    Full Text Available Touch-less fingerprint recognition system is a reliable alternative to conventional touch-based fingerprint recognition system. Touch-less system is different from conventional system in the sense that they make use of digital camera to acquire the fingerprint image where as conventional system uses live-acquisition techniques. The conventional fingerprint systems are simple but they suffer from various problems such as hygienic, maintenance and latent fingerprints. In this paper we present a review of touch-less fingerprint recognition systems that use digital camera. We present some challenging problems that occur while developing the touch-less system. These problems are low contrast between the ridge and the valley pattern on fingerprint image, non-uniform lighting, motion blurriness and defocus, due to less depth of field of digital camera. The touch-less fingerprint recognition system can be divided into three main modules: preprocessing, feature extraction and matching. Preprocessing is an important step prior to fingerprint feature extraction and matching. In this paper we put our more emphasis on preprocessing so that the drawbacks stated earlier can be removed. Further preprocessing is divided into four parts: first is normalization, second is fingerprint Segmentation, third is fingerprint enhancement and last is the core point detection. Feature extraction can be done by Gabor filter or by minutia extraction and the matching can be done by Support Vector Machine or Principal Component Analysis and three distance method.

  1. Examination of Speed Contribution of Parallelization for Several Fingerprint Pre-Processing Algorithms

    Directory of Open Access Journals (Sweden)

    GORGUNOGLU, S.

    2014-05-01

    Full Text Available In analysis of minutiae based fingerprint systems, fingerprints needs to be pre-processed. The pre-processing is carried out to enhance the quality of the fingerprint and to obtain more accurate minutiae points. Reducing the pre-processing time is important for identification and verification in real time systems and especially for databases holding large fingerprints information. Parallel processing and parallel CPU computing can be considered as distribution of processes over multi core processor. This is done by using parallel programming techniques. Reducing the execution time is the main objective in parallel processing. In this study, pre-processing of minutiae based fingerprint system is implemented by parallel processing on multi core computers using OpenMP and on graphics processor using CUDA to improve execution time. The execution times and speedup ratios are compared with the one that of single core processor. The results show that by using parallel processing, execution time is substantially improved. The improvement ratios obtained for different pre-processing algorithms allowed us to make suggestions on the more suitable approaches for parallelization.

  2. Efficient and Secure Fingerprint Verification for Embedded Devices

    Directory of Open Access Journals (Sweden)

    Sakiyama Kazuo

    2006-01-01

    Full Text Available This paper describes a secure and memory-efficient embedded fingerprint verification system. It shows how a fingerprint verification module originally developed to run on a workstation can be transformed and optimized in a systematic way to run real-time on an embedded device with limited memory and computation power. A complete fingerprint recognition module is a complex application that requires in the order of 1000 M unoptimized floating-point instruction cycles. The goal is to run both the minutiae extraction and the matching engines on a small embedded processor, in our case a 50 MHz LEON-2 softcore. It does require optimization and acceleration techniques at each design step. In order to speed up the fingerprint signal processing phase, we propose acceleration techniques at the algorithm level, at the software level to reduce the execution cycle number, and at the hardware level to distribute the system work load. Thirdly, a memory trace map-based memory reduction strategy is used for lowering the system memory requirement. Lastly, at the hardware level, it requires the development of specialized coprocessors. As results of these optimizations, we achieve a 65% reduction on the execution time and a 67% reduction on the memory storage requirement for the minutiae extraction process, compared against the reference implementation. The complete operation, that is, fingerprint capture, feature extraction, and matching, can be done in real-time of less than 4 seconds

  3. Efficient and Secure Fingerprint Verification for Embedded Devices

    Science.gov (United States)

    Yang, Shenglin; Sakiyama, Kazuo; Verbauwhede, Ingrid

    2006-12-01

    This paper describes a secure and memory-efficient embedded fingerprint verification system. It shows how a fingerprint verification module originally developed to run on a workstation can be transformed and optimized in a systematic way to run real-time on an embedded device with limited memory and computation power. A complete fingerprint recognition module is a complex application that requires in the order of 1000 M unoptimized floating-point instruction cycles. The goal is to run both the minutiae extraction and the matching engines on a small embedded processor, in our case a 50 MHz LEON-2 softcore. It does require optimization and acceleration techniques at each design step. In order to speed up the fingerprint signal processing phase, we propose acceleration techniques at the algorithm level, at the software level to reduce the execution cycle number, and at the hardware level to distribute the system work load. Thirdly, a memory trace map-based memory reduction strategy is used for lowering the system memory requirement. Lastly, at the hardware level, it requires the development of specialized coprocessors. As results of these optimizations, we achieve a 65% reduction on the execution time and a 67% reduction on the memory storage requirement for the minutiae extraction process, compared against the reference implementation. The complete operation, that is, fingerprint capture, feature extraction, and matching, can be done in real-time of less than 4 seconds

  4. Hiding dependence-discovery of F-hiding laws and system laws

    Institute of Scientific and Technical Information of China (English)

    Zhou Houyong; Huang Shunliang; Shi Kaiquan

    2009-01-01

    Function one direction S-rough sets have dynamic characteristics and law characteristics. By using the function one direction S-rough sets, this article presents the concepts of the f-hiding law, F-hiding law, f-hiding law dependence and F-hiding law dependence. Based on the concepts above, this article proposes the hiding-dependence theorem of f-hiding laws, the hiding-dependence theorem of F-hiding laws, the hiding-dependence separation theorem, the hiding dependencs-discovery principle of unknown laws. Finally, the application of the hiding dependence of hiding laws in the discovery of system laws is given.

  5. Multifinger Feature Level Fusion Based Fingerprint Identification

    Directory of Open Access Journals (Sweden)

    Praveen N

    2012-12-01

    Full Text Available Fingerprint based authentication systems are one of the cost-effective biometric authentication techniques employed for personal identification. As the data base population increases, fast identification/recognition algorithms are required with high accuracy. Accuracy can be increased using multimodal evidences collected by multiple biometric traits. In this work, consecutive fingerprint images are taken, global singularities are located using directional field strength and their local orientation vector is formulated with respect to the base line of the finger. Featurelevel fusion is carried out and a 32 element feature template is obtained. A matching score is formulated for the identification and 100% accuracy was obtained for a database of 300 persons. The polygonal feature vector helps to reduce the size of the feature database from the present 70-100 minutiae features to just 32 features and also a lower matching threshold can be fixed compared to single finger based identification

  6. Generating cancelable fingerprint templates.

    Science.gov (United States)

    Ratha, Nalini K; Chikkerur, Sharat; Connell, Jonathan H; Bolle, Ruud M

    2007-04-01

    Biometrics-based authentication systems offer obvious usability advantages over traditional password and token-based authentication schemes. However, biometrics raises several privacy concerns. A biometric is permanently associated with a user and cannot be changed. Hence, if a biometric identifier is compromised, it is lost forever and possibly for every application where the biometric is used. Moreover, if the same biometric is used in multiple applications, a user can potentially be tracked from one application to the next by cross-matching biometric databases. In this paper, we demonstrate several methods to generate multiple cancelable identifiers from fingerprint images to overcome these problems. In essence, a user can be given as many biometric identifiers as needed by issuing a new transformation "key." The identifiers can be cancelled and replaced when compromised. We empirically compare the performance of several algorithms such as Cartesian, polar, and surface folding transformations of the minutiae positions. It is demonstrated through multiple experiments that we can achieve revocability and prevent cross-matching of biometric databases. It is also shown that the transforms are noninvertible by demonstrating that it is computationally as hard to recover the original biometric identifier from a transformed version as by randomly guessing. Based on these empirical results and a theoretical analysis we conclude that feature-level cancelable biometric construction is practicable in large biometric deployments.

  7. Image-based fingerprint verification system using LabVIEW

    Directory of Open Access Journals (Sweden)

    Sunil K. Singla

    2008-09-01

    Full Text Available Biometric-based identification/verification systems provide a solution to the security concerns in the modern world where machine is replacing human in every aspect of life. Fingerprints, because of their uniqueness, are the most widely used and highly accepted biometrics. Fingerprint biometric systems are either minutiae-based or pattern learning (image based. The minutiae-based algorithm depends upon the local discontinuities in the ridge flow pattern and are used when template size is important while image-based matching algorithm uses both the micro and macro feature of a fingerprint and is used if fast response is required. In the present paper an image-based fingerprint verification system is discussed. The proposed method uses a learning phase, which is not present in conventional image-based systems. The learning phase uses pseudo random sub-sampling, which reduces the number of comparisons needed in the matching stage. This system has been developed using LabVIEW (Laboratory Virtual Instrument Engineering Workbench toolbox version 6i. The availability of datalog files in LabVIEW makes it one of the most promising candidates for its usage as a database. Datalog files can access and manipulate data and complex data structures quickly and easily. It makes writing and reading much faster. After extensive experimentation involving a large number of samples and different learning sizes, high accuracy with learning image size of 100 100 and a threshold value of 700 (1000 being the perfect match has been achieved.

  8. A comprehensive and real-time fingerprint verification system for embedded devices

    Science.gov (United States)

    Yeung, Hoi Wo; Moon, Yiu Sang; Chen, Jiansheng; Chan, Fai; Ng, Yuk Man; Chung, Hin Shun; Pun, Kwok Ho

    2005-03-01

    This paper describes an embedded multi-user login system based on fingerprint recognition. The system, built using the Sitsang development board and embedded Linux, implements all fingerprint acquisition, preprocessing, minutia extraction, match, identification, user registration, and template encryption on the board. By careful analysis of the accuracy requirement as well as the arithmetic precision to be used, we optimized the algorithms so that the whole system can work in real-time in the embedded environment based on Intel(R) PXA255 processor. The fingerprint verification, which is the core part of the system, is fully tested on a fingerprint database consists of 1149 fingerprint images. The result shows that we can achieve an accuracy of more than 95%. Field testing of 20 registered users has further proved the reliability of our system. The core part of our system, then embedded fingerprint authentication, can also be applied in many different embedded applications concerning security problems.

  9. Performance evaluation of fusing protected fingerprint minutiae templates on the decision level

    NARCIS (Netherlands)

    Yang, B.; Groot, K.T.J. de; Christoph Busch; Veldhuis, R.N.J.; Xu, H.

    2013-01-01

    In a biometric authentication system using protected templates, a pseudonymous identifier is the part of a protected template that can be directly compared. Each compared pair of pseudonymous identifiersresults in a decision testing whether both identifiers are derived from the same biometric charac

  10. Hide receives the Bowie Medal

    Science.gov (United States)

    Dickey, Jean O.; Hide, Raymond

    The 1997 William Bowie Medal, given by AGU for outstanding contributions to fundamental geophysics and for unselfish cooperation in research, was presented to Raymond Hide at the AGU Spring Meeting Honor Ceremony on May 28 in Baltimore. The award citation and Hide's response are given here.

  11. Supporting fingerprint identification assessments using a skin stretch model - A preliminary study.

    Science.gov (United States)

    Lee, Rebecca; Comber, Bruce; Abraham, Joshua; Wagner, Michael; Lennard, Chris; Spindler, Xanthe; Roux, Claude

    2017-03-01

    To support fingerprint expert opinion, this research proposes an approach that combines subjective human analysis (as currently applied by fingerprint practitioners) with a statistical test of the result. This approach relies on the hypothesis that there are limits to the distortion caused by skin stretch. Such limits can be modelled by applying a multivariate normal probability density function to the distances and angle formed by a marked ridge characteristic and the two closest neighbouring minutiae. This study presents a model tested on 5 donors in total. The "expected range" of distortion in a within-source comparison using 10 minutiae was determined and compared to between-source comparisons. The expected range of log probability densities for within-source comparisons marked with 10 minutiae was determined to be from -33.4 to -60.0, with all between-source data falling outside this range, between -83 and -305. These results suggest that the proposed generated metric could be a powerful tool for the assessment of fingerprint expert opinion in operational casework.

  12. An Approach to Fingerprint Image Pre-Processing

    Directory of Open Access Journals (Sweden)

    Om Preeti Chaurasia

    2012-07-01

    Full Text Available In this paper we have used all existing algorithms. When a fingerprint image is captured it is made pass through all the algorithms arranged in a particular order. We found that if we process a fingerprint in this particular order, the final output is good enough for minutiae detection and feature extraction. We have done many experiments on fingerprint images and found that this particular order of processing is producing better result. But for this we assume that the quality of the captured image is good enough. We have not worked on image quality enhancement. So if the input image is good our method will produce a good output. Off course this is a limitation of our proposed method, but if image is captured using a good quality device, then our method will produce an equal quality output as in other existing techniques.

  13. Quantum fingerprinting

    CERN Document Server

    Buhrman, H; Watrous, J; De Wolf, R; Buhrman, Harry; Cleve, Richard; Watrous, John; Wolf, Ronald de

    2001-01-01

    Classical fingerprinting associates with each string a shorter string (its fingerprint), such that, with high probability, any two distinct strings can be distinguished by comparing their fingerprints alone. The fingerprints can be exponentially smaller than the original strings if the parties preparing the fingerprints share a random key, but not if they only have access to uncorrelated random sources. In this paper we show that fingerprints consisting of quantum information can be made exponentially smaller than the original strings without any correlations or entanglement between the parties: we give a scheme where the quantum fingerprints are exponentially shorter than the original strings and we give a test that distinguishes any two unknown quantum fingerprints with high probability. Our scheme implies an exponential quantum/classical gap for the equality problem in the simultaneous message passing model of communication complexity. We optimize several aspects of our scheme.

  14. Magnetic fingerprint powder from a mineral indigenous to Thailand.

    Science.gov (United States)

    Thonglon, Thatsanee; Chaikum, Nopadol

    2010-09-01

    A study was conducted to investigate whether natural magnetite (Fe3O4), which is an abundant mineral in Thailand, could be used as a magnetic powder in the detection of latent fingerprints. Because of the presence of impurities, powdered magnetite is only weakly attracted by a magnet and cannot be used as a magnetic fingerprint powder by itself. Mixing a small amount of magnetite powder with nickel powder greatly enhances the magnetic attraction. A mixture of magnetite powder and nickel powder in a mass ratio of approximately 1:100 was found to be suitable for use as a magnetic fingerprint powder. Fingerprints developed using the magnetite/nickel mixture on nonporous surfaces were found to exhibit good adherence and clarity. Using an automated fingerprint identification system, the number of minutiae detected in fingerprints developed by using the prepared powder on nonporous surfaces was found to be comparable to those detected in fingerprints developed by using a commercial black magnetic powder. The cost is lowered by more than 60%.

  15. Study on Fingerprint Examiner’s Stability of Feature Selection%指纹鉴定人员点取细节特征稳定性问题研究

    Institute of Scientific and Technical Information of China (English)

    刘世权; 糜忠良; 罗亚平; 吴剑

    2015-01-01

    保指纹鉴定质量。%The decision of fingerprint identification depends on the fingerprint examiner’s knowledge and experience. The fingerprint identification process is a recognition process which can be described as a process from perceptual cognition to rational cognition. During the process, one of the factors that impacts the quality of fingerprint identification is the capability of the fingerprint examiner. Fingerprint examiners select corresponding minutiae on fingermark in comparison phase and the capability can be measured by fingerprint examiners’ stability of minutiae selection. Some research has demonstrated that stability of minutiae selection has influenced the quality of fingerprint identification conclusion, hence it is critical for conducting such fundamental research on stability of minutiae selection for Chinese fingerprint examiners. Our research is focused on analysis of stability of minutiae selection between analysis phase and comparison phase and can help us to understand: how fingerprint examiners understand the minutiae of fingermark in analysis phase; how to control fingerprint impacts fingerprint examiners’ decision in minutiae selection in comparison phase; what is the relationship between stability of minutiae selection and fingerprint identification ability. In this study 106 fingerprint agencies around China were invited to take a proficiency test and finish four trials from the same source. The data were collected by web-based software and were analyzed by R statistical software. The results show that different analysts performed differently and fingerprint quality impacted the stability of minutiae selection. If fingerprint quality values were high, examiners reported highly stable minutiae selection, while they reported highly unstable minutiae selection if quality values were low, especially on the border of high quality and low quality area. Stability of minutiae selection can be effectively measured by I, which is defined as Minutiae Variability Index

  16. Spatial analysis of corresponding fingerprint features from match and close non-match populations.

    Science.gov (United States)

    Abraham, Joshua; Champod, Christophe; Lennard, Chris; Roux, Claude

    2013-07-10

    The development of statistical models for forensic fingerprint identification purposes has been the subject of increasing research attention in recent years. This can be partly seen as a response to a number of commentators who claim that the scientific basis for fingerprint identification has not been adequately demonstrated. In addition, key forensic identification bodies such as ENFSI [1] and IAI [2] have recently endorsed and acknowledged the potential benefits of using statistical models as an important tool in support of the fingerprint identification process within the ACE-V framework. In this paper, we introduce a new Likelihood Ratio (LR) model based on Support Vector Machines (SVMs) trained with features discovered via morphometric and spatial analyses of corresponding minutiae configurations for both match and close non-match populations often found in AFIS candidate lists. Computed LR values are derived from a probabilistic framework based on SVMs that discover the intrinsic spatial differences of match and close non-match populations. Lastly, experimentation performed on a set of over 120,000 publicly available fingerprint images (mostly sourced from the National Institute of Standards and Technology (NIST) datasets) and a distortion set of approximately 40,000 images, is presented, illustrating that the proposed LR model is reliably guiding towards the right proposition in the identification assessment of match and close non-match populations. Results further indicate that the proposed model is a promising tool for fingerprint practitioners to use for analysing the spatial consistency of corresponding minutiae configurations.

  17. Security analysis for fingerprint fuzzy vaults

    Science.gov (United States)

    Hartloff, Jesse; Bileschi, Maxwell; Tulyakov, Sergey; Dobler, Jimmy; Rudra, Atri; Govindaraju, Venu

    2013-05-01

    In this work we place some of the traditional biometrics work on fingerprint verification via the fuzzy vault scheme within a cryptographic framework. We show that the breaking of a fuzzy vault leads to decoding of Reed-Solomon codes from random errors, which has been proposed as a hard problem in the cryptography community. We provide a security parameter for the fuzzy vault in terms of the decoding problem, which gives context for the breaking of the fuzzy vault, whereas most of the existing literature measures the strength of the fuzzy vault in terms of its resistance to pre-defined attacks or by the entropy of the vault. We keep track of our security parameter, and provide it alongside ROC statistics. We also aim to be more aware of the nature of the fingerprints when placing them in the fuzzy vault, noting that the distribution of minutiae is far from uniformly random. The results we show provide additional support that the fuzzy vault can be a viable scheme for secure fingerprint verification.

  18. Removing the remaining ridges in fingerprint segmentation

    Institute of Scientific and Technical Information of China (English)

    ZHU En; ZHANG Jian-ming; YIN Jian-ping; ZHANG Guo-min; HU Chun-feng

    2006-01-01

    Fingerprint segmentation is an important step in fingerprint recognition and is usually aimed to identify non-ridge regions and unrecoverable low quality ridge regions and exclude them as background so as to reduce the time expenditure of image processing and avoid detecting false features. In high and in low quality ridge regions, often are some remaining ridges which are the afterimages of the previously scanned finger and are expected to be excluded from the foreground. However, existing segmentation methods generally do not take the case into consideration, and often, the remaining ridge regions are falsely classified as foreground by segmentation algorithm with spurious features produced erroneously including unrecoverable regions as foreground. This paper proposes two steps for fingerprint segmentation aimed at removing the remaining ridge region from the foreground. The non-ridge regions and unrecoverable low quality ridge regions are removed as background in the first step, and then the foreground produced by the first step is further analyzed for possible remove of the remaining ridge region. The proposed method proved effective in avoiding detecting false ridges and in improving minutiae detection.

  19. Fingerprint matching algorithm for poor quality images

    Directory of Open Access Journals (Sweden)

    Vedpal Singh

    2015-04-01

    Full Text Available The main aim of this study is to establish an efficient platform for fingerprint matching for low-quality images. Generally, fingerprint matching approaches use the minutiae points for authentication. However, it is not such a reliable authentication method for low-quality images. To overcome this problem, the current study proposes a fingerprint matching methodology based on normalised cross-correlation, which would improve the performance and reduce the miscalculations during authentication. It would decrease the computational complexities. The error rate of the proposed method is 5.4%, which is less than the two-dimensional (2D dynamic programming (DP error rate of 5.6%, while Lee's method produces 5.9% and the combined method has 6.1% error rate. Genuine accept rate at 1% false accept rate is 89.3% but at 0.1% value it is 96.7%, which is higher. The outcome of this study suggests that the proposed methodology has a low error rate with minimum computational effort as compared with existing methods such as Lee's method and 2D DP and the combined method.

  20. An Evaluation Of Fingerprint Security Using Noninvertible Biohash

    Directory of Open Access Journals (Sweden)

    N.Radha

    2011-08-01

    Full Text Available Biometric analysis for identifying verification is becoming a widespread reality. It is a very challenging and tedious task to develop a biometric template protection scheme which is anonymous, revocable and noninvertible while maintaining decent performance. Cancellable biometrics is one of the best methods used to resolve this problem. In this paper, a new method called as BioHashing which follows the technique of cancellable biometrics in the fingerprint domain is proposed. This proposed method does not require the re-alignment of fingerprints as all the minutiae are translated into a pre-defined two dimensional space based on a reference minutia. After that, the proposed Biohashing method is used to enforce the one-way property (non-invertibility of the biometric template. The proposed approach is very much resistant to minor translation error and rotation distortion. An Equal Error Rates (EER of less than 1% is achieved in this approach and performance of the approach is also significant.

  1. Brain Fingerprinting

    Directory of Open Access Journals (Sweden)

    Ravi Kumar

    2012-12-01

    Full Text Available Brain Fingerprinting is a scientific technique to determine whether or not specific information is stored in an individual's brain by measuring a electrical brain wave response to Word, phrases, or picture that are presented on computer screen. Brain Fingerprinting is a controversial forensic science technique that uses electroencephalography (EEG to determine whether specific information is stored in a subject's brain.

  2. Brain Fingerprinting

    Directory of Open Access Journals (Sweden)

    ravi kumar

    2012-12-01

    Full Text Available Brain Fingerprinting is a scientific technique to determine whether or not specific information is stored in an individual's brain by measuring a electrical brain wave response to Word, phrases, or picture that are presented on computer screen. Brain Fingerprinting is a controversial forensic science technique that uses electroencephalograph y (EEG to determine whether specific information is stored in a subject's brain

  3. Finger-vein image recognition combining modified Hausdorff distance with minutiae feature matching.

    Science.gov (United States)

    Yu, Cheng-Bo; Qin, Hua-Feng; Cui, Yan-Zhe; Hu, Xiao-Qian

    2009-12-01

    In this paper, we propose a novel method for finger-vein recognition. We extract the features of the vein patterns for recognition. Then, the minutiae features included bifurcation points and ending points are extracted from these vein patterns. These feature points are used as a geometric representation of the vein patterns shape. Finally, the modified Hausdorff distance algorithm is provided to evaluate the identification ability among all possible relative positions of the vein patterns shape. This algorithm has been widely used for comparing point sets or edge maps since it does not require point correspondence. Experimental results show that these minutiae feature points can be used to perform personal verification tasks as a geometric representation of the vein patterns shape. Furthermore, by this developed method, we can achieve robust image matching under different lighting conditions.

  4. Performance of the Fuzzy Vault for Multiple Fingerprints (Extended Version)

    CERN Document Server

    Merkle, Johannes; Korte, Ulrike; Niesing, Matthias; Schwaiger, Michael

    2010-01-01

    The fuzzy vault is an error tolerant authentication method that ensures the privacy of the stored reference data. Several publications have proposed the application of the fuzzy vault to fingerprints, but the results of subsequent analyses indicate that a single finger does not contain sufficient information for a secure implementation. In this contribution, we present an implementation of a fuzzy vault based on minutiae information in several fingerprints aiming at a security level comparable to current cryptographic applications. We analyze and empirically evaluate the security, efficiency, and robustness of the construction and several optimizations. The results allow an assessment of the capacity of the scheme and an appropriate selection of parameters. Finally, we report on a practical simulation conducted with ten users.

  5. Information Hiding Techniques: A Tutorial Review

    CERN Document Server

    Thampi, Sabu M

    2008-01-01

    The purpose of this tutorial is to present an overview of various information hiding techniques. A brief history of steganography is provided along with techniques that were used to hide information. Text, image and audio based information hiding techniques are discussed. This paper also provides a basic introduction to digital watermarking.

  6. Informing the judgments of fingerprint analysts using quality metric and statistical assessment tools.

    Science.gov (United States)

    Langenburg, Glenn; Champod, Christophe; Genessay, Thibault

    2012-06-10

    The aim of this research was to evaluate how fingerprint analysts would incorporate information from newly developed tools into their decision making processes. Specifically, we assessed effects using the following: (1) a quality tool to aid in the assessment of the clarity of the friction ridge details, (2) a statistical tool to provide likelihood ratios representing the strength of the corresponding features between compared fingerprints, and (3) consensus information from a group of trained fingerprint experts. The measured variables for the effect on examiner performance were the accuracy and reproducibility of the conclusions against the ground truth (including the impact on error rates) and the analyst accuracy and variation for feature selection and comparison. The results showed that participants using the consensus information from other fingerprint experts demonstrated more consistency and accuracy in minutiae selection. They also demonstrated higher accuracy, sensitivity, and specificity in the decisions reported. The quality tool also affected minutiae selection (which, in turn, had limited influence on the reported decisions); the statistical tool did not appear to influence the reported decisions.

  7. Likelihood ratio data to report the validation of a forensic fingerprint evaluation method.

    Science.gov (United States)

    Ramos, Daniel; Haraksim, Rudolf; Meuwly, Didier

    2017-02-01

    Data to which the authors refer to throughout this article are likelihood ratios (LR) computed from the comparison of 5-12 minutiae fingermarks with fingerprints. These LRs data are used for the validation of a likelihood ratio (LR) method in forensic evidence evaluation. These data present a necessary asset for conducting validation experiments when validating LR methods used in forensic evidence evaluation and set up validation reports. These data can be also used as a baseline for comparing the fingermark evidence in the same minutiae configuration as presented in (D. Meuwly, D. Ramos, R. Haraksim,) [1], although the reader should keep in mind that different feature extraction algorithms and different AFIS systems used may produce different LRs values. Moreover, these data may serve as a reproducibility exercise, in order to train the generation of validation reports of forensic methods, according to [1]. Alongside the data, a justification and motivation for the use of methods is given. These methods calculate LRs from the fingerprint/mark data and are subject to a validation procedure. The choice of using real forensic fingerprint in the validation and simulated data in the development is described and justified. Validation criteria are set for the purpose of validation of the LR methods, which are used to calculate the LR values from the data and the validation report. For privacy and data protection reasons, the original fingerprint/mark images cannot be shared. But these images do not constitute the core data for the validation, contrarily to the LRs that are shared.

  8. Integrated Association Rules Complete Hiding Algorithms

    Directory of Open Access Journals (Sweden)

    Mohamed Refaat Abdellah

    2017-01-01

    Full Text Available This paper presents database security approach for complete hiding of sensitive association rules by using six novel algorithms. These algorithms utilize three new weights to reduce the needed database modifications and support complete hiding, as well as they reduce the knowledge distortion and the data distortions. Complete weighted hiding algorithms enhance the hiding failure by 100%; these algorithms have the advantage of performing only a single scan for the database to gather the required information to form the hiding process. These proposed algorithms are built within the database structure which enables the sanitized database to be generated on run time as needed.

  9. A Block Based Adaptive Video Data Hiding Method Using Forbidden Zone Data Hiding

    DEFF Research Database (Denmark)

    Banoth, Rajkumar

    2013-01-01

    -Data hiding is a process of embedding information into some sort of host media. Especially video data hiding has become an important research topic as it is complex when compared data hiding process in other media. This paper proposes a new method based on erasure correction capability of RA codes...... using forbidden zone data hiding. This method finds suitable host signals that are useful for data hiding. The proposed method also overcomes the problems of frame drop and inserts attacks. The simulation results reveal that this video data hiding framework can be used in data hiding applications...... of the real world. Key Words – RA codes, selective embedding, watermarking, forbidden zone data hiding, simulation, selective embedding, erasure handling, block partitioning...

  10. Fortification of Transport Layer Security Protocol with Hashed Fingerprint Identity Parameter

    Directory of Open Access Journals (Sweden)

    Kuljeet Kaur

    2012-03-01

    Full Text Available Identity over the public links becomes quiet complex as Client and Server needs proper access rights with authentication. For determining clients identity with password Secured Shell Protocol or Public Key Infrastructure is deployed by various organizations. For end to end transport security SSL (Secured Socket Layer is the de facto standard having Record and Handshake protocol dealing with data integrity and data security respectively. It seems secure but many risks lurk in its use. So focus of the paper would be formulating the steps to be used for the enhancement of SSL. One more tier of security to the transport layer security protocol is added in this research paper by using fingerprints for identity authentication along with password for enhancement of SSL. Bio Hashing which will be done with the help of Minutiae Points at the fingerprints would be used for mutual authentication. New hash algorithm RNA-FINNT is generated in this research paper for converting minutiae points into hashed code. Value of hashed code would be stored at the Database in the Multi Server environment of an organization. Research paper will perform mutual authentication in the multi server environment of an organization with the use of fingerprint and password both as identity authentication parameters. This will strengthen record and handshake protocol which will enhance SSL and further enhancement of SSL will result in the fortification of Transport Layer Security Protocol.

  11. Modeling the growth of fingerprints improves matching for adolescents

    CERN Document Server

    Gottschlich, Carsten; Lorenz, Robert; Bernhardt, Stefanie; Hantschel, Michael; Munk, Axel

    2010-01-01

    We study the effect of growth on the fingerprints of adolescents, based on which we suggest a simple method to adjust for growth when trying to recover a juvenile's fingerprint in a database years later. Based on longitudinal data sets in juveniles' criminal records, we show that growth essentially leads to an isotropic rescaling, so that we can use the strong correlation between growth in stature and limbs to model the growth of fingerprints proportional to stature growth as documented in growth charts. The proposed rescaling leads to a 72% reduction of the distances between corresponding minutiae for the data set analyzed. These findings were corroborated by several verification tests. In an identification test on a database containing 3.25 million right index fingers at the Federal Criminal Police Office of Germany, the identification error rate of 20.8% was reduced to 2.1% by rescaling. The presented method is of striking simplicity and can easily be integrated into existing automated fingerprint identifi...

  12. Filter Design and Performance Evaluation for Fingerprint Image Segmentation.

    Directory of Open Access Journals (Sweden)

    Duy Hoang Thai

    Full Text Available Fingerprint recognition plays an important role in many commercial applications and is used by millions of people every day, e.g. for unlocking mobile phones. Fingerprint image segmentation is typically the first processing step of most fingerprint algorithms and it divides an image into foreground, the region of interest, and background. Two types of error can occur during this step which both have a negative impact on the recognition performance: 'true' foreground can be labeled as background and features like minutiae can be lost, or conversely 'true' background can be misclassified as foreground and spurious features can be introduced. The contribution of this paper is threefold: firstly, we propose a novel factorized directional bandpass (FDB segmentation method for texture extraction based on the directional Hilbert transform of a Butterworth bandpass (DHBB filter interwoven with soft-thresholding. Secondly, we provide a manually marked ground truth segmentation for 10560 images as an evaluation benchmark. Thirdly, we conduct a systematic performance comparison between the FDB method and four of the most often cited fingerprint segmentation algorithms showing that the FDB segmentation method clearly outperforms these four widely used methods. The benchmark and the implementation of the FDB method are made publicly available.

  13. Fingerprint detection

    Energy Technology Data Exchange (ETDEWEB)

    Saunders, G.C.

    1992-01-07

    This patent describes a method for detection and visualization of latent fingerprints. It comprises contacting a substrate containing a latent print thereon the a colloidal metal composition at a pH from about 2.5 to about 4.0 for time sufficient to allow reaction of the colloidal metal composition with the latent print; and, preserving or recording the observable print.

  14. Fingerprint Matching and Non-Matching Analysis for Different Tolerance Rotation Degrees in Commercial Matching Algorithms

    Directory of Open Access Journals (Sweden)

    A. J. Perez-Diaz

    2010-08-01

    Full Text Available Fingerprint verification is the most important step in the fingerprint-based biometric systems. The matching score islinked to the chance of identifying a person. Nowadays, two fingerprint matching methods are the most popular: thecorrelation-based method and the minutiae-based method. In this work, three biometric systems were evaluated:Neurotechnology Verifinger 6.0 Extended, Innovatrics IDKit SDK and Griaule Fingerprint SDK 2007. The evaluationwas performed according to the experiments of the Fingerprint Verification Competition (FVC. The influence of thefingerprint rotation degrees on false match rate (FMR and false non-match rate (FNMR was evaluated. The resultsshowed that the FMR values increase as rotation degrees increase too, meanwhile, the FNMR values decrease.Experimental results demonstrate that Verifinger SDK shows good performance on false non-match testing, with anFNMR mean of 7%, followed by IDKit SDK (6.71% ~ 13.66% and Fingerprint SDK (50%. However, Fingerprint SDKdemonstrates a better performance on false match testing, with an FMR mean of ~0%, followed by Verifinger SDK(7.62% - 9% and IDKit SDK (above 28%. As result of the experiments, Verifinger SDK had, in general, the bestperformance. Subsequently, we calculated the regression functions to predict the behavior of FNMR and FMR fordifferent threshold values with different rotation degrees.

  15. Fingerprint recognition using standardized fingerprint model

    CERN Document Server

    Thai, Le Hoang

    2011-01-01

    Fingerprint recognition is one of most popular and accuracy Biometric technologies. Nowadays, it is used in many real applications. However, recognizing fingerprints in poor quality images is still a very complex problem. In recent years, many algorithms, models...are given to improve the accuracy of recognition system. This paper discusses on the standardized fingerprint model which is used to synthesize the template of fingerprints. In this model, after pre-processing step, we find the transformation between templates, adjust parameters, synthesize fingerprint, and reduce noises. Then, we use the final fingerprint to match with others in FVC2004 fingerprint database (DB4) to show the capability of the model.

  16. Cognitive Fingerprints

    Science.gov (United States)

    2015-03-25

    approaches vary but most involve machine learning and data mining techniques and specific computational methods will be highlighted. Digital traces from...dynamics (which are a behavioral biometric) with linguistic features (Juola et al. 2013). Linguistic features include lexical statis- tics (e.g., word...concerning aggregated features suggesting the possibility of similar computational approaches in cap- turing a cognitive fingerprint. Prior work in Web

  17. Fingerprint Segmentation

    OpenAIRE

    Jomaa, Diala

    2009-01-01

    In this thesis, a new algorithm has been proposed to segment the foreground of the fingerprint from the image under consideration. The algorithm uses three features, mean, variance and coherence. Based on these features, a rule system is built to help the algorithm to efficiently segment the image. In addition, the proposed algorithm combine split and merge with modified Otsu. Both enhancements techniques such as Gaussian filter and histogram equalization are applied to enhance and improve th...

  18. Nanoscale control of interfacial processes for latent fingerprint enhancement.

    Science.gov (United States)

    Sapstead, Rachel M; Ryder, Karl S; Fullarton, Claire; Skoda, Maximilian; Dalgliesh, Robert M; Watkins, Erik B; Beebee, Charlotte; Barker, Robert; Glidle, Andrew; Hillman, A Robert

    2013-01-01

    Latent fingerprints on metal surfaces may be visualized by exploiting the insulating characteristics of the fingerprint deposit as a "mask" to direct electrodeposition of an electroactive polymer to the bare metal between the fingerprint ridges. This approach is complementary to most latent fingerprint enhancement methods, which involve physical or chemical interaction with the fingerprint residue. It has the advantages of sensitivity (a nanoscale residue can block electron transfer) and, using a suitable polymer, optimization of visual contrast. This study extends the concept in two significant respects. First, it explores the feasibility of combining observation based on optical absorption with observation based on fluorescence. Second, it extends the methodology to materials (here, polypyrrole) that may undergo post-deposition substitution chemistry, here binding of a fluorophore whose size and geometry preclude direct polymerization of the functionalised monomer. The scenario involves a lateral spatial image (the whole fingerprint, first level detail) at the centimetre scale, with identification features (minutiae, second level detail) at the 100-200 microm scale and finer features (third level detail) at the 10-50 microm scale. However, the strategy used requires vertical spatial control of the (electro)chemistry at the 10-100 nm scale. We show that this can be accomplished by polymerization of pyrrole functionalised with a good leaving group, ester-bound FMOC, which can be hydrolysed and eluted from the deposited polymer to generate solvent "voids". Overall the "void" volume and the resulting effect on polymer dynamics facilitate entry and amide bonding of Dylight 649 NHS ester, a large fluorophore. FTIR spectra demonstrate the spatially integrated compositional changes. Both the hydrolysis and fluorophore functionalization were followed using neutron reflectivity to determine vertical spatial composition variations, which control image development in the

  19. Fingerprint Feature Extraction Algorithm

    OpenAIRE

    Mehala. G

    2014-01-01

    The goal of this paper is to design an efficient Fingerprint Feature Extraction (FFE) algorithm to extract the fingerprint features for Automatic Fingerprint Identification Systems (AFIS). FFE algorithm, consists of two major subdivisions, Fingerprint image preprocessing, Fingerprint image postprocessing. A few of the challenges presented in an earlier are, consequently addressed, in this paper. The proposed algorithm is able to enhance the fingerprint image and also extractin...

  20. Linear and Nonlinear Oblivious Data Hiding

    Directory of Open Access Journals (Sweden)

    Akansu Ali N

    2004-01-01

    Full Text Available The majority of the existing data hiding schemes are based on the direct-sequence (DS modulation where a low-power random sequence is embedded into the original cover signal to represent hidden information. In this paper, we investigate linear and nonlinear modulation approaches in digital data hiding. One typical DS modulation algorithm is explored and its optimal oblivious detector is derived. The results expose its poor cover noise suppression as the hiding signature signal always has much lower energy than the cover signal. A simple nonlinear algorithm, called set partitioning, is proposed and its performance is analyzed. Analysis and simulation studies further demonstrate improvements over the existing schemes.

  1. Recent Advances in Information Hiding and Applications

    CERN Document Server

    Huang, Hsiang-Cheh; Jain, Lakhmi; Zhao, Yao

    2013-01-01

    This research book presents a sample of recent advances in information hiding techniques and their applications. It includes:   Image data hiding scheme based on vector quantization and image graph coloring The copyright protection system for Android platform Reversible data hiding ICA-based image and video watermarking Content-based invariant image watermarking Single bitmap block truncation coding of color images using cat swarm optimization Genetic-based wavelet packet watermarking for copyright protection Lossless text steganography in compression coding Fast and low-distortion capacity acoustic synchronized acoustic-to-acoustic steganography scheme Video watermarking with shot detection

  2. 改进的可撤销指纹Fuzzy Vault方案%Improved cancelable fingerprint fuzzy vault system

    Institute of Scientific and Technical Information of China (English)

    张镕麟; 刘而云; 赵恒; 庞辽军

    2011-01-01

    Fuzzy vault has been widely applied in biometric encryption domain for key binding, suitable for set feature representation, such as minutiae set of fingerprint image. However, with the real minutia points contained in vault, fuzzy vault is suffered from cross matching problem, which makes attackers easily obtain real minutia information from multiple vault templates and threatens user privacy and secret key security. In this paper, an improved cancelable fuzzy vault scheme is proposed, in which an one-way function based on password is constructed to transform original minutia information and then the transformed minutiae are fed to fuzzy vault system. The attackers can not obtain the original minutia features even though multiple vaults are at hand, and the users can reissue a new vault template by changing password. Experimental results on FVC2002 DB2 show that the proposed method can effectively reduce the hidden troubles and increase security of system.%Fuzzy Vault系统是生物特征加密(Biometric Encryption,BE)领域中广泛应用的密钥绑定框架,适用于集合特征(例如指纹细节点)与密钥的绑定.然而,Vault模板中包含了真实指纹细节点特征,攻击者可以从多个发布的Vault模板中获取真实指纹信息,因而严重威胁到用户的隐私和密钥安全.笔者提出一种改进的可撤销指纹Fuzzy Vault方案.首先,基于口令构造一个不可逆变换函数,应用该变换函数对细节点特征进行变换,然后使用变换后的细节点输入Fuzzy Vault系统.攻击者即使得到多个应用系统上的Vault也不能获得原始指纹细节点特征,且用户可以通过随时更换口令来发布新的Vault模板.在FVC2002 DB2上的实验表明,所提出的方案能有效降低交叉匹配带来的安全隐患,提高系统安全性.

  3. Fingerprint recognition using standardized fingerprint model

    OpenAIRE

    Le Hoang Thai; Ha Nhat Tam

    2011-01-01

    Fingerprint recognition is one of most popular and accuracy Biometric technologies. Nowadays, it is used in many real applications. However, recognizing fingerprints in poor quality images is still a very complex problem. In recent years, many algorithms, models are given to improve the accuracy of recognition system. This paper discusses on the standardized fingerprint model which is used to synthesize the template of fingerprints. In this model, after pre-processing step, we find the transf...

  4. Hiding Information into Palette-Based Image

    Institute of Scientific and Technical Information of China (English)

    WU Hong-tao; ZHU Bo-cheng; YANG Yi-xian

    2005-01-01

    After pointing out the weakness of the known palette-based image information hiding by palette matrix,a new spacial effective robust information hiding algorithm is proposed,which can resist the operation of ‘select all’,‘copy’,‘paste’ from cover to original,and can resist gently modification the palette matrix,and can resist the image format changed between true color image and palette-based image.The hiding capacity can reach 25% of the number of pixel index matrix.Due to the advisement of information hiding security an update algorithm is proposed at the end of the paper,with the capacity reduced and vision effect increased.

  5. 'Medical Tattoos' Help Hide Surgical Scars

    Science.gov (United States)

    ... https://medlineplus.gov/news/fullstory_161132.html 'Medical Tattoos' Help Hide Surgical Scars Pigments can restore more ... scars from cancer surgeries may benefit from "medical tattoos" that can help restore some of the skin's ...

  6. Hiding robot inertia using resonance.

    Science.gov (United States)

    Vallery, Heike; Duschau-Wicke, Alexander; Riener, Robert

    2010-01-01

    To enable compliant training modes with a rehabilitation robot, an important prerequisite is that any undesired human-robot interaction forces caused by robot dynamics must be avoided, either by an appropriate mechanical design or by compensating control strategies. Our recently proposed control scheme of "Generalized Elasticities" employs potential fields to compensate for robot dynamics, including inertia, beyond what can be done using closed-loop force control. In this paper, we give a simple mechanical equivalent using the example of the gait rehabilitation robot Lokomat. The robot consists of an exoskeleton that is attached to a frame around the patient's pelvis. This frame is suspended by a springloaded parallelogram structure. The mechanism allows vertical displacement while providing almost constant robot gravity compensation. However, inertia of the device when the patient's pelvis moves up and down remains a source of large interaction forces, which are reflected in increased ground reaction forces. Here, we investigate an alternative suspension: To hide not only gravity, but also robot inertia during vertical pelvis motion, we suspend the robot frame by a stiff linear spring that allows the robot to oscillate vertically at an eigenfrequency close to the natural gait frequency. This mechanism reduces human-robot interaction forces, which is demonstrated in pilot experimental results.

  7. Fully Traversable Wormholes Hiding Charge

    CERN Document Server

    Guendelman, Eduardo

    2012-01-01

    The charge-hiding effect by a wormhole, which was studied for the case where gravity/gauge-field system is self-consistently interacting with a charged lightlike brane (LLB) as a matter source, is now studied for the case of a time like brane. From the demand that no surfaces of infinite coordinate time redshift appear in the problem we are lead now to a completly traversable wormhole space, according to not only the traveller that goes through the wormhole (as was the case for the LLB), but also to a static external observer, this requires negative surface energy density for the shell sitting at the throat of the wormhole. We study a gauge field subsystem which is of a special non-linear form containing a square-root of the Maxwell term and which previously has been shown to produce a QCD-like confining gauge field dynamics in flat space-time. The condition of finite energy of the system or asymptotic flatness on one side of the wormhole implies that the charged object sitting at the wormhole throat expels a...

  8. Fingerprint recognition with identical twin fingerprints.

    Directory of Open Access Journals (Sweden)

    Xunqiang Tao

    Full Text Available Fingerprint recognition with identical twins is a challenging task due to the closest genetics-based relationship existing in the identical twins. Several pioneers have analyzed the similarity between twins' fingerprints. In this work we continue to investigate the topic of the similarity of identical twin fingerprints. Our study was tested based on a large identical twin fingerprint database that contains 83 twin pairs, 4 fingers per individual and six impressions per finger: 3984 (83*2*4*6 images. Compared to the previous work, our contributions are summarized as follows: (1 Two state-of-the-art fingerprint identification methods: P071 and VeriFinger 6.1 were used, rather than one fingerprint identification method in previous studies. (2 Six impressions per finger were captured, rather than just one impression, which makes the genuine distribution of matching scores more realistic. (3 A larger sample (83 pairs was collected. (4 A novel statistical analysis, which aims at showing the probability distribution of the fingerprint types for the corresponding fingers of identical twins which have same fingerprint type, has been conducted. (5 A novel analysis, which aims at showing which finger from identical twins has higher probability of having same fingerprint type, has been conducted. Our results showed that: (a A state-of-the-art automatic fingerprint verification system can distinguish identical twins without drastic degradation in performance. (b The chance that the fingerprints have the same type from identical twins is 0.7440, comparing to 0.3215 from non-identical twins. (c For the corresponding fingers of identical twins which have same fingerprint type, the probability distribution of five major fingerprint types is similar to the probability distribution for all the fingers' fingerprint type. (d For each of four fingers of identical twins, the probability of having same fingerprint type is similar.

  9. Aerogel Fingerprint Media

    Energy Technology Data Exchange (ETDEWEB)

    Miller, Fred S.; Andresen, Brian D.

    1999-09-21

    A fingerprint medium which is made of an aerogel having a predetermined density. The fingerprint medium may have a midrange density for forming plates or may be crushed forming a powder. The fingerprint medium may further include at least one of a metal and metal oxide to enhance characteristics desirable in a fingerprint medium.

  10. Data Hiding in JPEG Images

    Directory of Open Access Journals (Sweden)

    Sushil Kumar

    2009-07-01

    perceptibility [5, 1].We shall use digital images as the cover object in this paper inwhich we embed the hidden information. The challenge ofusing steganography in cover images is to hide as much data aspossible with the least noticeable difference in the stego-image.Steganographic algorithms operate on basically three types ofimages: Raw images (i.e., bmp format, Palette based images(i.e., GIF images and JPEG images. JPEG images areroutinely used in Steganographic algorithms due to the mostpopular lossy image compression method. Usually it is foundthat an algorithm used to hide large amounts of informationtypically result in lower perceptibility (i.e., greater change tothe image appearance and a more robust algorithm result intolower embedding capacity. The JPEG image generation firstdecomposed the input image into a number of 8 x 8 blocks.Then DCT of each block are computed and the resultant DCTcoefficient matrix is quantized using a standard quantizationtable. Finally the inverse DCT of quantized coefficient matrixare evaluated and the final JPEG image is obtained afterrounding the values.

  11. Improved Adaptive Fingerprint Binarization

    OpenAIRE

    Bartunek, Josef Ström; Nilsson, Mikael; Nordberg, Jörgen; Claesson, Ingvar

    2008-01-01

    In this paper improvements to a previous work are presented. Removing the redundant artifacts in the fingerprint mask is introduced enhancing the final result. The proposed method is entirely adaptive process adjusting to each fingerprint without any further supervision of the user. Hence, the algorithm is insensitive to the characteristics of the fingerprint sensor and the various physical appearances of the fingerprints. Further, a detailed description of fingerprint mask generation not ful...

  12. Steganography An Art of Hiding Data

    CERN Document Server

    Channalli, Shashikala

    2009-01-01

    In today's world the art of sending & displaying the hidden information especially in public places, has received more attention and faced many challenges. Therefore, different methods have been proposed so far for hiding information in different cover media. In this paper a method for hiding of information on the billboard display is presented. It is well known that encryption provides secure channels for communicating entities. However, due to lack of covertness on these channels, an eavesdropper can identify encrypted streams through statistical tests and capture them for further cryptanalysis. In this paper we propose a new form of steganography, on-line hiding of information on the output screens of the instrument. This method can be used for announcing a secret message in public place. It can be extended to other means such as electronic advertising board around sports stadium, railway station or airport. This method of steganography is very similar to image steganography and video steganography. Pr...

  13. Advanced Fingerprint Analysis Project Fingerprint Constituents

    Energy Technology Data Exchange (ETDEWEB)

    GM Mong; CE Petersen; TRW Clauss

    1999-10-29

    The work described in this report was focused on generating fundamental data on fingerprint components which will be used to develop advanced forensic techniques to enhance fluorescent detection, and visualization of latent fingerprints. Chemical components of sweat gland secretions are well documented in the medical literature and many chemical techniques are available to develop latent prints, but there have been no systematic forensic studies of fingerprint sweat components or of the chemical and physical changes these substances undergo over time.

  14. Short term preservation of hide using vacuum: influence on properties of hide and of processed leather.

    Science.gov (United States)

    Gudro, Ilze; Valeika, Virgilijus; Sirvaitytė, Justa

    2014-01-01

    The objective of this work was to investigate vacuum influence on hide preservation time and how it affects hide structure. It was established that vacuum prolongs the storage time without hide tissue putrefaction up to 21 days when the storage temperature is 4°C. The microorganisms act for all storage times, but the action is weak and has no observable influence on the quality of hide during the time period mentioned. The hide shrinkage temperature decrease is negligible, which shows that breaking of intermolecular bonds does not occur. Optical microscopy, infrared spectroscopy and differential scanning calorimetry also did not show any structural changes which can influence the quality of leather produced from such hide. The qualitative indexes of wet blue processed under laboratory conditions and of leather produced during industrial trials are presented. Indexes such as chromium compounds exhaustion, content of chromium in leather, content of soluble matter in dichloromethane, strength properties, and shrinkage temperature were determined. Properties of the leather produced from vacuumed hide under industrial conditions conformed to the requirements of shoe upper leather.

  15. Reversible Data Hiding Based on DNA Computing

    Directory of Open Access Journals (Sweden)

    Bin Wang

    2017-01-01

    Full Text Available Biocomputing, especially DNA, computing has got great development. It is widely used in information security. In this paper, a novel algorithm of reversible data hiding based on DNA computing is proposed. Inspired by the algorithm of histogram modification, which is a classical algorithm for reversible data hiding, we combine it with DNA computing to realize this algorithm based on biological technology. Compared with previous results, our experimental results have significantly improved the ER (Embedding Rate. Furthermore, some PSNR (peak signal-to-noise ratios of test images are also improved. Experimental results show that it is suitable for protecting the copyright of cover image in DNA-based information security.

  16. Alignment and bit extraction for secure fingerprint biometrics

    Science.gov (United States)

    Nagar, A.; Rane, S.; Vetro, A.

    2010-01-01

    Security of biometric templates stored in a system is important because a stolen template can compromise system security as well as user privacy. Therefore, a number of secure biometrics schemes have been proposed that facilitate matching of feature templates without the need for a stored biometric sample. However, most of these schemes suffer from poor matching performance owing to the difficulty of designing biometric features that remain robust over repeated biometric measurements. This paper describes a scheme to extract binary features from fingerprints using minutia points and fingerprint ridges. The features are amenable to direct matching based on binary Hamming distance, but are especially suitable for use in secure biometric cryptosystems that use standard error correcting codes. Given all binary features, a method for retaining only the most discriminable features is presented which improves the Genuine Accept Rate (GAR) from 82% to 90% at a False Accept Rate (FAR) of 0.1% on a well-known public database. Additionally, incorporating singular points such as a core or delta feature is shown to improve the matching tradeoff.

  17. Touchless fingerprint biometrics

    CERN Document Server

    Labati, Ruggero Donida; Scotti, Fabio

    2015-01-01

    Offering the first comprehensive analysis of touchless fingerprint-recognition technologies, Touchless Fingerprint Biometrics gives an overview of the state of the art and describes relevant industrial applications. It also presents new techniques to efficiently and effectively implement advanced solutions based on touchless fingerprinting.The most accurate current biometric technologies in touch-based fingerprint-recognition systems require a relatively high level of user cooperation to acquire samples of the concerned biometric trait. With the potential for reduced constraints, reduced hardw

  18. Preparation of biobased sponges from un-tanned hides

    Science.gov (United States)

    One of our research endeavors to address ongoing challenges faced by the U.S. hide and leather industries is to develop innovative uses and novel biobased products from hides to improve prospective markets and to secure a viable future for hides and leather industries. We had previously investigate...

  19. Hiding an Inconvenient Truth : Lies and Vagueness

    NARCIS (Netherlands)

    Serra Garcia, M.; van Damme, E.E.C.; Potters, J.J.M.

    2010-01-01

    When truth conflicts with e¢ ciency, can verbal communication destroy efficiency? Or are lies or vagueness used to hide inconvenient truths? We consider a sequential 2-player public good game in which the leader has private information about the value of the public good. This value can be low, high,

  20. Hiding levitating objects above a ground plane

    DEFF Research Database (Denmark)

    Zhang, Jingjing; Luo, Yu; Mortensen, Asger

    2010-01-01

    An approach to hiding objects levitating above a conducting sheet is suggested in this paper. The proposed device makes use of isotropic negative-refractive-index materials without extreme material parameters, and creates an illusion of a remote conducting sheet. Numerical simulations are perform...

  1. An Approach to Hide Secret Speech Information

    Institute of Scientific and Technical Information of China (English)

    WU Zhi-jun; DUAN Hai-xin; LI Xing

    2006-01-01

    This paper presented an approach to hide secret speech information in code excited linear prediction(CELP)-based speech coding scheme by adopting the analysis-by-synthesis (ABS)-based algorithm of speech information hiding and extracting for the purpose of secure speech communication. The secret speech is coded in 2.4Kb/s mixed excitation linear prediction (MELP), which is embedded in CELP type public speech. The ABS algorithm adopts speech synthesizer in speech coder. Speech embedding and coding are synchronous, i.e. a fusion of speech information data of public and secret. The experiment of embedding 2.4 Kb/s MELP secret speech in G.728 scheme coded public speech transmitted via public switched telephone network (PSTN) shows that the proposed approach satisfies the requirements of information hiding, meets the secure communication speech quality constraints, and achieves high hiding capacity of average 3.2 Kb/s with an excellent speech quality and complicating speakers' recognition.

  2. Understanding Information Hiding in iOS

    OpenAIRE

    Caviglione, Luca; Mazurczyk, Wojciech

    2014-01-01

    The Apple operating system (iOS) has so far proved resistant to information-hiding techniques, which help attackers covertly communicate. However, Siri - a native iOS service that controls iPhones and iPads via voice commands - could change this trend.

  3. An Approach for Message Hiding using Substitution Techniques and Audio Hiding in Steganography

    CERN Document Server

    Mukhopadhyay, Debajyoti; Ghosh, Surjya; Biswas, Sudipto; Chakraborty, Poulami

    2011-01-01

    A crypto system can be used to encrypt messages sent between two communicating parties so that an eavesdropper who overhears the encrypted messages will not be able to decode them. The paper mainly concentrates on the method in which the substitution technique of steganography can been used to hide data in a 24-bit bitmap file. Popular audio hiding techniques based on methods of steganography is also discussed here.

  4. Pores and ridges: high-resolution fingerprint matching using level 3 features.

    Science.gov (United States)

    Jain, Anil K; Chen, Yi; Demirkus, Meltem

    2007-01-01

    Fingerprint friction ridge details are generally described in a hierarchical order at three different levels, namely, Level 1 (pattern), Level 2 (minutia points), and Level 3 (pores and ridge contours). Although latent print examiners frequently take advantage of Level 3 features to assist in identification, Automated Fingerprint Identification Systems (AFIS) currently rely only on Level 1 and Level 2 features. In fact, the Federal Bureau of Investigation's (FBI) standard of fingerprint resolution for AFIS is 500 pixels per inch (ppi), which is inadequate for capturing Level 3 features, such as pores. With the advances in fingerprint sensing technology, many sensors are now equipped with dual resolution (500 ppi/1,000 ppi) scanning capability. However, increasing the scan resolution alone does not necessarily provide any performance improvement in fingerprint matching, unless an extended feature set is utilized. As a result, a systematic study to determine how much performance gain one can achieve by introducing Level 3 features in AFIS is highly desired. We propose a hierarchical matching system that utilizes features at all the three levels extracted from 1,000 ppi fingerprint scans. Level 3 features, including pores and ridge contours, are automatically extracted using Gabor filters and wavelet transform and are locally matched using the Iterative Closest Point (ICP) algorithm. Our experiments show that Level 3 features carry significant discriminatory information. There is a relative reduction of 20 percent in the equal error rate (EER) of the matching system when Level 3 features are employed in combination with Level 1 and 2 features. This significant performance gain is consistently observed across various quality fingerprint images.

  5. Design and implementation of fingerprint verification system based on STM32%基于STM32的嵌入式指纹识别系统的设计与实现

    Institute of Scientific and Technical Information of China (English)

    王春蕾; 周美娇; 易淑友

    2013-01-01

    In view of the fingerprint identification system has high requirements in real-time and accuracy, this article described an embedded fingerprint identification system based on the STM32 chip and the optical fingerprint sensor. It improved Gabor filter enhancement algorithms was used for fingerprint image pre-processing, it extracted minutiae by the minutiae detection template. The simulation results in the platform of VC + + environment show that the system has reached the desired effect.%鉴于指纹识别系统较高实时性、准确性的要求,对一种基于STM32芯片和中控光学指纹采集仪的嵌入式指纹识别系统进行了研究和实现.利用改进的Gabor滤波增强算法对指纹数据进行图像预处理后,采用指纹纹线的二值化细化中心线提取法提取图像的细节特征点,在VC++环境平台下进行仿真,结果显示系统达到了预期的效果.

  6. Information Hiding Using Improper Frame Padding

    CERN Document Server

    Jankowski, Bartosz; Szczypiorski, Krzysztof

    2010-01-01

    Hiding information in network traffic may lead to leakage of confidential information. In this paper we introduce a new steganographic system: the PadSteg (Padding Steganography). To authors' best knowledge it is the first information hiding solution which represents interprotocol steganography i.e. usage of relation between two or more protocols from the TCP/IP stack to enable secret communication. PadSteg utilizes ARP and TCP protocols together with an Etherleak vulnerability (improper Ethernet frame padding) to facilitate secret communication for hidden groups in LANs (Local Area Networks). Basing on real network traces we confirm that PadSteg is feasible in today's networks and we estimate what steganographic bandwidth is achievable while limiting the chance of disclosure. We also point at possible countermeasures against PadSteg.

  7. Estimation of Information Hiding Algorithms and Parameters

    Science.gov (United States)

    2007-02-21

    growing false positives. 15. SUBJECT TERMS Information hiding, reverse-engineering, steganography , steganalysis, watermarking 16. SECURITY...specialist in breaking a covert communication system given very little information. Since it is likely for steganography to be used on very large...multimedia files, e.g. audio and video, there are substantial issues to be addressed on the implementation end of such a system as well as the theoretical

  8. Secured Cryptographic Key Generation From Multimodal Biometrics Feature Level Fusion Of Fingerprint And Iris

    CERN Document Server

    Jagadeesan, A

    2010-01-01

    Human users have a tough time remembering long cryptographic keys. Hence, researchers, for so long, have been examining ways to utilize biometric features of the user instead of a memorable password or passphrase, in an effort to generate strong and repeatable cryptographic keys. Our objective is to incorporate the volatility of the users biometric features into the generated key, so as to make the key unguessable to an attacker lacking significant knowledge of the users biometrics. We go one step further trying to incorporate multiple biometric modalities into cryptographic key generation so as to provide better security. In this article, we propose an efficient approach based on multimodal biometrics (Iris and fingerprint) for generation of secure cryptographic key. The proposed approach is composed of three modules namely, 1) Feature extraction, 2) Multimodal biometric template generation and 3) Cryptographic key generation. Initially, the features, minutiae points and texture properties are extracted from...

  9. Secured Cryptographic Key Generation From Multimodal Biometrics: Feature Level Fusion of Fingerprint and Iris

    CERN Document Server

    Jagadeesan, A

    2010-01-01

    Human users have a tough time remembering long cryptographic keys. Hence, researchers, for so long, have been examining ways to utilize biometric features of the user instead of a memorable password or passphrase, in an effort to generate strong and repeatable cryptographic keys. Our objective is to incorporate the volatility of the user's biometric features into the generated key, so as to make the key unguessable to an attacker lacking significant knowledge of the user's biometrics. We go one step further trying to incorporate multiple biometric modalities into cryptographic key generation so as to provide better security. In this article, we propose an efficient approach based on multimodal biometrics (Iris and fingerprint) for generation of secure cryptographic key. The proposed approach is composed of three modules namely, 1) Feature extraction, 2) Multimodal biometric template generation and 3) Cryptographic key generation. Initially, the features, minutiae points and texture properties are extracted fr...

  10. Method of Fingerprint Identification

    OpenAIRE

    Surachai Panich

    2010-01-01

    Problem statement: The main task of this study was finding out an effective algorithm in order to match two fingerprints taken from database. The fingerprint identification techniques used in a small database in order to find out an effective algorithm to develop the accuracy in matching process. Higher-level application of this proposed algorithm was determined. Approach: The main objectives in this study were the construction of fingerprint database and matching algorithm for comparison of ...

  11. Recent progress in fingerprint recognition

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    Fingerprint recognition has been increasingly used to realize personal identification in civilian's daily life, such as ID card, fingerprints hard disk and so on. Great improvement has been achieved in the on-line fingerprint sensing technology and automatic fingerprint recognition algorithms. Various fingerprint recognition techniques, including fingerprint acquisition, classification, enhancement and matching, are highly improved. This paper overviews recent advances in fingerprint recognition and summarizes the algorithm proposed for every step with special focuses on the enhancement of low-quality fingerprints and the matching of the distorted fingerprint images. Both issues are believed to be significant and challenging tasks. In addition, we also discuss the common evaluation for the fingerprint recognition algorithm of the Fingerprint Verification Competition 2004 (FVC2004) and the Fingerprint Vendor Technology Evaluation 2003 (FpVTE2003), based on which we could measure the performance of the recognition algorithm objectively and uniformly.

  12. S-rough sets and the discovery of F-hiding knowledge

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    Singular rough sets (S-rough sets) have three classes of forms: one-directional S-rough sets, dual of one-directional S-rough sets, and two-directional S-rough sets. Dynamic, hereditary, mnemonic, and hiding properties are the basic characteristics of S-rough sets. By using the S-rough sets, the concepts of f-hiding knowledge, F-hiding knowledge, hiding degree, and hiding dependence degree are given. Then, both the hiding theorem and the hiding dependence theorem of hiding knowledge are proposed. Finally, an application of hiding knowledge is discussed.

  13. Fingerprints in Compressed Strings

    DEFF Research Database (Denmark)

    Bille, Philip; Cording, Patrick Hagge; Gørtz, Inge Li

    2013-01-01

    The Karp-Rabin fingerprint of a string is a type of hash value that due to its strong properties has been used in many string algorithms. In this paper we show how to construct a data structure for a string S of size N compressed by a context-free grammar of size n that answers fingerprint queries...

  14. Photogrammetric fingerprint unwrapping

    Science.gov (United States)

    Paar, Gerhard; del Pilar Caballo Perucha, Maria; Bauer, Arnold; Nauschnegg, Bernhard

    2008-04-01

    Fingerprints are important biometric cues. Compared to conventional fingerprint sensors the use of contact-free stereoscopic image acquisition of the front-most finger segment has a set of advantages: Finger deformation is avoided, the entire relevant area for biometric use is covered, some technical aspects like sensor maintenance and cleaning are facilitated, and access to a three-dimensional reconstruction of the covered area is possible. We describe a photogrammetric workflow for nail-to-nail fingerprint reconstruction: A calibrated sensor setup with typically 5 cameras and dedicated illumination acquires adjacent stereo pairs. Using the silhouettes of the segmented finger a raw cylindrical model is generated. After preprocessing (shading correction, dust removal, lens distortion correction), each individual camera texture is projected onto the model. Image-to-image matching on these pseudo ortho images and dense 3D reconstruction obtains a textured cylindrical digital surface model with radial distances around the major axis and a grid size in the range of 25-50 µm. The model allows for objective fingerprint unwrapping and novel fingerprint matching algorithms since 3D relations between fingerprint features are available as additional cues. Moreover, covering the entire region with relevant fingerprint texture is particularly important for establishing a comprehensive forensic database. The workflow has been implemented in portable C and is ready for industrial exploitation. Further improvement issues are code optimization, unwrapping method, illumination strategy to avoid highlights and to improve the initial segmentation, and the comparison of the unwrapping result to conventional fingerprint acquisition technology.

  15. Towards fraud-proof ID documents using multiple data hiding technologies and biometrics

    Science.gov (United States)

    Picard, Justin; Vielhauer, Claus; Thorwirth, Niels

    2004-06-01

    Identity documents, such as ID cards, passports, and driver's licenses, contain textual information, a portrait of the legitimate holder, and eventually some other biometric characteristics such as a fingerprint or handwritten signature. As prices for digital imaging technologies fall, making them more widely available, we have seen an exponential increase in the ease and the number of counterfeiters that can effectively forge documents. Today, with only limited knowledge of technology and a small amount of money, a counterfeiter can effortlessly replace a photo or modify identity information on a legitimate document to the extent that it is very diffcult to differentiate from the original. This paper proposes a virtually fraud-proof ID document based on a combination of three different data hiding technologies: digital watermarking, 2-D bar codes, and Copy Detection Pattern, plus additional biometric protection. As will be shown, that combination of data hiding technologies protects the document against any forgery, in principle without any requirement for other security features. To prevent a genuine document to be used by an illegitimate user,biometric information is also covertly stored in the ID document, to be used for identification at the detector.

  16. Minimax eigenvector decomposition for data hiding

    Science.gov (United States)

    Davidson, Jennifer

    2005-09-01

    Steganography is the study of hiding information within a covert channel in order to transmit a secret message. Any public media such as image data, audio data, or even file packets, can be used as a covert channel. This paper presents an embedding algorithm that hides a message in an image using a technique based on a nonlinear matrix transform called the minimax eigenvector decomposition (MED). The MED is a minimax algebra version of the well-known singular value decomposition (SVD). Minimax algebra is a matrix algebra based on the algebraic operations of maximum and addition, developed initially for use in operations research and extended later to represent a class of nonlinear image processing operations. The discrete mathematical morphology operations of dilation and erosion, for example, are contained within minimax algebra. The MED is much quicker to compute than the SVD and avoids the numerical computational issues of the SVD because the operations involved only integer addition, subtraction, and compare. We present the algorithm to embed data using the MED, show examples applied to image data, and discuss limitations and advantages as compared with another similar algorithm.

  17. Augmented Reality Marker Hiding with Texture Deformation.

    Science.gov (United States)

    Kawai, Norihiko; Sato, Tomokazu; Nakashima, Yuta; Yokoya, Naokazu

    2016-10-19

    Augmented reality (AR) marker hiding is a technique to visually remove AR markers in a real-time video stream. A conventional approach transforms a background image with a homography matrix calculated on the basis of a camera pose and overlays the transformed image on an AR marker region in a real-time frame, assuming that the AR marker is on a planar surface. However, this approach may cause discontinuities in textures around the boundary between the marker and its surrounding area when the planar surface assumption is not satisfied. This paper proposes a method for AR marker hiding without discontinuities around texture boundaries even under nonplanar background geometry without measuring it. For doing this, our method estimates the dense motion in the marker's background by analyzing the motion of sparse feature points around it, together with a smooth motion assumption, and deforms the background image according to it. Our experiments demonstrate the effectiveness of the proposed method in various environments with different background geometries and textures.

  18. Improved Fuzzy Vault fingerprint encryption scheme%一种改进的指纹Fuzzy Vault加密方案

    Institute of Scientific and Technical Information of China (English)

    谭台哲; 章红燕

    2012-01-01

    In order to overcome the deficiency of the traditional Fuzzy Vault algorithm in the application,this paper proposed an improved Fuzzy Vault algorithm. It mainly adopted a novel polynomial constructor method to realize the cryptographic key and fingerprint minutiae data binding together, and then solved the problem that the matching minutiae number was determined by the length of secret in the traditional Fuzzy Vault algorithm in key decoding phase. The experiment results show that this method further enhances the security and flexibility of the algorithm.%为了克服传统指纹Fuzzy Vault算法在应用上的不足,提出了一种改进的Fuzzy Vault算法.主要采用一种新的多项式构造函数的方法来实现待保护密钥和指纹细节特征点的绑定,进而解决了传统Fuzzy Vault算法中密钥长度决定解码时需要匹配细节点个数的问题.实验结果表明,此方法进一步增强了算法的安全性和灵活性.

  19. Enhancement of LSB based Steganography for Hiding Image in Audio

    OpenAIRE

    Pradeep Kumar Singh; R.K.Aggrawal

    2010-01-01

    In this paper we will take an in-depth look on steganography by proposing a new method of Audio Steganography. Emphasize will be on the proposed scheme of image hiding in audio and its comparison with simple Least Significant Bit insertion method for data hiding in audio.

  20. Selective Redundancy Removal: A Framework for Data Hiding

    Directory of Open Access Journals (Sweden)

    Ugo Fiore

    2010-02-01

    Full Text Available Data hiding techniques have so far concentrated on adding or modifying irrelevant information in order to hide a message. However, files in widespread use, such as HTML documents, usually exhibit high redundancy levels, caused by code-generation programs. Such redundancy may be removed by means of optimization software. Redundancy removal, if applied selectively, enables information hiding. This work introduces Selective Redundancy Removal (SRR as a framework for hiding data. An example application of the framework is given in terms of hiding information in HTML documents. Non-uniformity across documents may raise alarms. Nevertheless, selective application of optimization techniques might be due to the legitimate use of optimization software not supporting all the optimization methods, or configured to not use all of them.

  1. Information hiding in communication networks fundamentals, mechanisms, applications, and countermeasures

    CERN Document Server

    Mazurczyk, Wojciech; Zander, Sebastian; Houmansadr, Amir; Szczypiorski, Krzysztof

    2016-01-01

    Describes Information Hiding in communication networks, and highlights their important issues, challenges, trends, and applications. This book provides the fundamental concepts, terminology, and classifications of information hiding in communication networks along with its historical background. Information Hiding In Communication Networks: Fundamentals, Mechanisms, Applications, and Countermeasures begins with introducing data concealment methods and their evolution. Chapter two discusses the existing terminology and describes the model for hidden communication and related communication scenarios. Chapters three to five present the main classes of information hiding in communication networks accompanied by a discussion of their robustness and undetectability. The book concludes with a discussion of potential countermeasures against information hiding techniques, which includes different types of mechanisms for the detection, limitation and prevention of covert co munication channels.

  2. Advanced fingerprint verification software

    Science.gov (United States)

    Baradarani, A.; Taylor, J. R. B.; Severin, F.; Maev, R. Gr.

    2016-05-01

    We have developed a fingerprint software package that can be used in a wide range of applications from law enforcement to public and private security systems, and to personal devices such as laptops, vehicles, and door- locks. The software and processing units are a unique implementation of new and sophisticated algorithms that compete with the current best systems in the world. Development of the software package has been in line with the third generation of our ultrasonic fingerprinting machine1. Solid and robust performance is achieved in the presence of misplaced and low quality fingerprints.

  3. Molecular fingerprint recombination: generating hybrid fingerprints for similarity searching from different fingerprint types.

    Science.gov (United States)

    Nisius, Britta; Bajorath, Jürgen

    2009-11-01

    Molecular fingerprints have a long history in computational medicinal chemistry and continue to be popular tools for similarity searching. Over the years, a variety of fingerprint types have been introduced. We report an approach to identify preferred bit subsets in fingerprints of different design and "recombine" these bit segments into "hybrid fingerprints". These compound class-directed fingerprint representations are found to increase the similarity search performance of their parental fingerprints, which can be rationalized by the often complementary nature of distinct fingerprint features.

  4. Fingerprinting of music scores

    Science.gov (United States)

    Irons, Jonathan; Schmucker, Martin

    2004-06-01

    Publishers of sheet music are generally reluctant in distributing their content via the Internet. Although online sheet music distribution's advantages are numerous the potential risk of Intellectual Property Rights (IPR) infringement, e.g. illegal online distributions, disables any innovation propensity. While active protection techniques only deter external risk factors, additional technology is necessary to adequately treat further risk factors. For several media types including music scores watermarking technology has been developed, which ebeds information in data by suitable data modifications. Furthermore, fingerprinting or perceptual hasing methods have been developed and are being applied especially for audio. These methods allow the identification of content without prior modifications. In this article we motivate the development of watermarking and fingerprinting technologies for sheet music. Outgoing from potential limitations of watermarking methods we explain why fingerprinting methods are important for sheet music and address potential applications. Finally we introduce a condept for fingerprinting of sheet music.

  5. Expertise in fingerprint identification.

    Science.gov (United States)

    Thompson, Matthew B; Tangen, Jason M; McCarthy, Duncan J

    2013-11-01

    Although fingerprint experts have presented evidence in criminal courts for more than a century, there have been few scientific investigations of the human capacity to discriminate these patterns. A recent latent print matching experiment shows that qualified, court-practicing fingerprint experts are exceedingly accurate (and more conservative) compared with novices, but they do make errors. Here, a rationale for the design of this experiment is provided. We argue that fidelity, generalizability, and control must be balanced to answer important research questions; that the proficiency and competence of fingerprint examiners are best determined when experiments include highly similar print pairs, in a signal detection paradigm, where the ground truth is known; and that inferring from this experiment the statement "The error rate of fingerprint identification is 0.68%" would be unjustified. In closing, the ramifications of these findings for the future psychological study of forensic expertise and the implications for expert testimony and public policy are considered.

  6. Universal Fingerprinting Chip Server

    Science.gov (United States)

    Casique-Almazán, Janet; Larios-Serrato, Violeta; Olguín-Ruíz, Gabriela Edith; Sánchez-Vallejo, Carlos Javier; Maldonado-Rodríguez, Rogelio; Méndez-Tenorio, Alfonso

    2012-01-01

    The Virtual Hybridization approach predicts the most probable hybridization sites across a target nucleic acid of known sequence, including both perfect and mismatched pairings. Potential hybridization sites, having a user-defined minimum number of bases that are paired with the oligonucleotide probe, are first identified. Then free energy values are evaluated for each potential hybridization site, and if it has a calculated free energy of equal or higher negative value than a user-defined free energy cut-off value, it is considered as a site of high probability of hybridization. The Universal Fingerprinting Chip Applications Server contains the software for visualizing predicted hybridization patterns, which yields a simulated hybridization fingerprint that can be compared with experimentally derived fingerprints or with a virtual fingerprint arising from a different sample. Availability http://bioinformatica.homelinux.org/UFCVH/ PMID:22829736

  7. Where is hbar Hiding in Entropic Gravity?

    CERN Document Server

    Chen, Pisin

    2011-01-01

    The entropic gravity scenario recently proposed by Erik Verlinde reproduced the Newton's law of purely classical gravity yet the key assumptions of this approach all have quantum mechanical origins. This is atypical for emergent phenomena in physics, where the underlying, more fundamental physics often reveals itself as corrections to the leading classical behavior. So one naturally wonders: where is hbar hiding in entropic gravity? To address this question, we first revisit the idea of holographic screen as well as entropy and its variation law in order to obtain a self-consistent approach to the problem. Next we argue that when dealing with quantum gravity issues the generalized uncertainty principle (GUP) should be the more appropriate foundation. Indeed based on GUP it has been demonstrated that the black hole Bekenstein entropy area law must be modified not only in the strong but also in the weak gravity regime. In the weak gravity limit, such a GUP modified entropy exhibits a logarithmic correction term...

  8. Hiding secret data into a carrier image

    Directory of Open Access Journals (Sweden)

    Ovidiu COSMA

    2012-06-01

    Full Text Available The object of steganography is embedding hidden information in an appropriate multimedia carrier, e.g., image, audio, or video. There are several known methods of solving this problem, which operate either in the space domain or in the frequency domain, and are distinguished by the following characteristics: payload, robustness and strength. The payload is the amount of secret data that can be embedded in the carrier without inducing suspicious artefacts, robustness indicates the degree in which the secret data is affected by the normal processing of the carrier e.g., compression, and the strength indicate how easy the presence of hidden data can be detected by steganalysis techniques. This paper presents a new method of hiding secret data into a digital image compressed by a technique based on the Discrete Wavelet Transform (DWT [2] and the Set Partitioning In Hierarchical Trees (SPIHT subband coding algorithm [6]. The proposed method admits huge payloads and has considerable strength.

  9. Hiding Quantum Information in the Perfect Code

    CERN Document Server

    Shaw, Bilal A

    2010-01-01

    We present and analyze a protocol for quantum steganography where the sender (Alice) encodes her steganographic information into the error syndromes of the perfect (five-qubit) quantum error-correcting code, and sends it to the receiver (Bob) over a depolarizing channel. Alice and Bob share a classical secret key, and hide quantum information in such a way that to an eavesdropper (Eve) without access to the secret key, the quantum message looks like an innocent codeword with a typical sequence of quantum errors. We calculate the average rate of key consumption, and show how the protocol improves in performance as information is spread over multiple codeword blocks. Alice and Bob utilize different encodings to optimize the average number of steganographic bits that they can send to each other while matching the error statistics of the depolarizing channel.

  10. Multimedia Data Hiding and Authentication via Halftoning and Coordinate Projection

    Directory of Open Access Journals (Sweden)

    Wu Chai Wah

    2002-01-01

    Full Text Available We present image data hiding and authentication schemes based on halftoning and coordinate projection. The proposed data hiding scheme can embed images of the same size and similar bit depth into the cover image and robustness against compression is demonstrated. The image authentication scheme is based on the data hiding scheme and can detect, localize, and repair the tampered area of the image. Furthermore, the self-repairing feature of the authentication scheme has a hologram-like quality; any portion of the image can be used to reconstruct the entire image, with a greater quality of reconstruction as the portion size increases.

  11. 基于特征点分类的模糊金库方案%Fuzzy Vault Scheme Based on Classification of Fingerprint Features Scheme

    Institute of Scientific and Technical Information of China (English)

    孙方圆; 郑建德; 徐千惠

    2016-01-01

    For the purpose of solving fingerprint template leakage problem and the inability of combining fingerprints and traditional keys in the traditional fingerprintidentification,fuzzy vault scheme based on classification of fingerprint features scheme (CFM-FV) is proposed in this paper.In our scheme,singularities will be as helper data for pre-align the fingerprint,while the minutia features will be used to encode the vault in this scheme.In the stage of verification,singularities will be extracted as helper data for fingerprint pre-aligned,then the extracted minutia features will be used to reconstruct the polynomial.In this scheme,the problem that the tradi-tional scheme cannot align the fingerprint blind will be solved to some extent by combining classification method of fingerprint fea-tures with fuzzy vault scheme.%为解决传统指纹认证方案中指纹模板信息泄露以及指纹和密钥无法融合等问题,提出一种基于指纹特征点分类的模糊金库方案(CFM-FV).该方案中,使用指纹奇异点作为辅助数据对指纹图像进行预对齐,将指纹细节点特征应用于模糊金库方案进行密钥绑定.验证时,提取查询指纹奇异点作为辅助数据对指纹预对齐,然后提取指纹细节点特征信息进行多项式的重构.本方案将指纹特征点分类方法与模糊金库方案相结合,一定程度上解决了传统模糊金库方案中无法实现指纹盲对齐带来的影响问题.

  12. Segmentation and Enhancement of Latent Fingerprints: A Coarse to Fine Ridge Structure Dictionary.

    Science.gov (United States)

    Cao, Kai; Liu, Eryun; Jain, Anil K

    2014-09-01

    Latent fingerprint matching has played a critical role in identifying suspects and criminals. However, compared to rolled and plain fingerprint matching, latent identification accuracy is significantly lower due to complex background noise, poor ridge quality and overlapping structured noise in latent images. Accordingly, manual markup of various features (e.g., region of interest, singular points and minutiae) is typically necessary to extract reliable features from latents. To reduce this markup cost and to improve the consistency in feature markup, fully automatic and highly accurate ("lights-out" capability) latent matching algorithms are needed. In this paper, a dictionary-based approach is proposed for automatic latent segmentation and enhancement towards the goal of achieving "lights-out" latent identification systems. Given a latent fingerprint image, a total variation (TV) decomposition model with L1 fidelity regularization is used to remove piecewise-smooth background noise. The texture component image obtained from the decomposition of latent image is divided into overlapping patches. Ridge structure dictionary, which is learnt from a set of high quality ridge patches, is then used to restore ridge structure in these latent patches. The ridge quality of a patch, which is used for latent segmentation, is defined as the structural similarity between the patch and its reconstruction. Orientation and frequency fields, which are used for latent enhancement, are then extracted from the reconstructed patch. To balance robustness and accuracy, a coarse to fine strategy is proposed. Experimental results on two latent fingerprint databases (i.e., NIST SD27 and WVU DB) show that the proposed algorithm outperforms the state-of-the-art segmentation and enhancement algorithms and boosts the performance of a state-of-the-art commercial latent matcher.

  13. Mechanical properties of biobased films prepared from collagen solutions derived from bovine hides

    Science.gov (United States)

    The most valuable byproducts of the meat packing industry are hides. The U.S. is the world’s 3rd largest hide producing country and currently produces approximately 35 million cattle hides annually. Due to fierce competition in global markets, the American leather and hides industry is facing chal...

  14. The dioxin fingerprint

    Energy Technology Data Exchange (ETDEWEB)

    Crane, G.K.; Brasowski, L.; Nagge, C.G.; Aldina, G.J. [Ogden Projects, Inc., Fairfield, NJ (United States)

    1996-12-31

    Insight into the identification of the sources of dioxins in the environment can be obtained from the combustion process itself. Several theories have attributed dioxin formation to a thermal breakdown and molecular rearrangement of precursor compounds available in the combustion process. Dioxin-like compounds studied include polychlorinated dibenzodioxins (PCDDs) and polychlorinated dibenzofurans (PCDFs). Isomers of these compounds which have chlorides in the 2,3,7,8 position have been identified by the authors to have unique distributions or fingerprints associated with a combustion source. This indicates that each combustion source can be identified by its dioxin/furan fingerprint. This paper is a compilation of dioxin and furan data from which the writer has identified unique fingerprints for each combustion source. One important value of establishing a fingerprint of dioxin from a combustion source is in relating the ambient levels found in a local area to that source by its unique isomer distribution. As the data base matures, many other relevant applications of identifying a dioxin fingerprint may abound.

  15. A Multimodal Technique for an Embedded Fingerprint Recognizer in Mobile Payment Systems

    Directory of Open Access Journals (Sweden)

    V. Conti

    2009-01-01

    Full Text Available The development and the diffusion of distributed systems, directly connected to recent communication technologies, move people towards the era of mobile and ubiquitous systems. Distributed systems make merchant-customer relationships closer and more flexible, using reliable e-commerce technologies. These systems and environments need many distributed access points, for the creation and management of secure identities and for the secure recognition of users. Traditionally, these access points can be made possible by a software system with a main central server. This work proposes the study and implementation of a multimodal technique, based on biometric information, for identity management and personal ubiquitous authentication. The multimodal technique uses both fingerprint micro features (minutiae and fingerprint macro features (singularity points for robust user authentication. To strengthen the security level of electronic payment systems, an embedded hardware prototype has been also created: acting as self-contained sensors, it performs the entire authentication process on the same device, so that all critical information (e.g. biometric data, account transactions and cryptographic keys, are managed and stored inside the sensor, without any data transmission. The sensor has been prototyped using the Celoxica RC203E board, achieving fast execution time, low working frequency, and good recognition performance.

  16. Hide and New in the Pi-Calculus

    Directory of Open Access Journals (Sweden)

    Marco Giunti

    2012-08-01

    Full Text Available In this paper, we enrich the pi-calculus with an operator for confidentiality (hide, whose main effect is to restrict the access to the object of the communication, thus representing confidentiality in a natural way. The hide operator is meant for local communication, and it differs from new in that it forbids the extrusion of the name and hence has a static scope. Consequently, a communication channel in the scope of a hide can be implemented as a dedicated channel, and it is more secure than one in the scope of a new. To emphasize the difference, we introduce a spy context that represents a side-channel attack and breaks some of the standard security equations for new. To formally reason on the security guarantees provided by the hide construct, we introduce an observational theory and establish stronger equivalences by relying on a proof technique based on bisimulation semantics.

  17. A Data-reversible Hiding Algorithm in WSNs

    Directory of Open Access Journals (Sweden)

    Jia CHEN

    2013-09-01

    Full Text Available In view of the phenomenon that data-hiding algorithm is easy to be detected by inspecting tool SPAM when carrying information, random insertion and histogram modification are adapted in the data hiding. A data-reversible hiding algorithm in WSNs is put forward. By collecting and referring sub-graph, calculating data fusion algorithm that can protect the data’s completion and privacy and analyzing the reversible hiding data algorithm research, the inspection of SPAM. Finally MATLAB7.0 exploitation is adopted to stimulate the analysis of experiment. The result shows that compared with Kim algorithm, the algorithm is safer to prevent the SPAM inspection and is more suitable for information transfer.

  18. Legionnaires' Hiding in Hospital, Nursing Home Plumbing Systems: CDC

    Science.gov (United States)

    ... gov/news/fullstory_166302.html Legionnaires' Hiding in Hospital, Nursing Home Plumbing Systems: CDC Effective water management, sanitation programs can reduce the risk of exposure to this deadly bacteria To use the sharing ...

  19. 基于二进制加密电路的无预对齐指纹匹配%Garbled Circuits Based Alignment-Free Fingerprint Matching

    Institute of Scientific and Technical Information of China (English)

    李梦醒; 冯全; 杨梅; 赵建; 贺康

    2014-01-01

    针对在加密域中进行指纹匹配时指纹模板和现场样本整体对齐的困难性,提出了一种免对齐的指纹匹配方案。采用具有旋转和平移不变性的细节点纹线方向特征和细节点局部结构,设计实现了相应的加密二进制电路,使得服务器能验证用户指纹,而不会泄露各自的数据。实验结果表明,所提方案在FVC2002-DB2指纹库上具有较高的匹配精度。%When a server authenticates users based on fingerprint over open network, the process of fin-gerprint matching is usually handled in the encrypted domain with purpose of protecting the privacy and security of both parties. However, an accurate alignment of the template and the query sample is rather difficult in this situation. An alignment-free fingerprint-matching scheme was presented, which extracts two kinds of local features around the minutiae, ridge orientation and minutiae local structure. Both fea-tures have the properties of invariant to rotation and translation. Garbled circuits were designed to imple-ment the corresponding matching algorithm, which allow the server to verify the user without leaking the respective data. Experiment shows that the scheme achieves a relatively higher accuracy on FVC2002-DB2 public database.

  20. A Simple Image Encoding Method with Data Lossless Information Hiding

    OpenAIRE

    Zhi-Hui Wang; Chin-Chen Chang; Ming-Chu Li; Tzu-Chuen Lu

    2011-01-01

    In this paper, we propose a simple reversible data hiding method in the spatial domain for block truncation coding (BTC) compressed grayscale images. The BTC method compresses a block of a grayscale image to a bitmap and a pair of quantization numbers. The proposed method first embeds secret bits into a block by changing the order of those two quantization numbers. The compression rate is not enlarged by this embedding scheme. To further improve the hiding capacity, the proposed method embeds...

  1. Information hiding techniques for steganography and digital watermarking

    CERN Document Server

    Katzenbeisser, Stefan

    2000-01-01

    Steganography, a means by which two or more parties may communicate using ""invisible"" or ""subliminal"" communication, and watermarking, a means of hiding copyright data in images, are becoming necessary components of commercial multimedia applications that are subject to illegal use. This new book is the first comprehensive survey of steganography and watermarking and their application to modern communications and multimedia.Handbook of Information Hiding: Steganography and Watermarking helps you understand steganography, the history of this previously neglected element of cryptography, the

  2. A chaos-based approach for information hiding security

    OpenAIRE

    Bahi, Jacques M.; Guyeux, Christophe

    2010-01-01

    This paper introduces a new framework for data hiding security. Contrary to the existing ones, the approach introduced here is not based on probability theory. In this paper, a scheme is considered as secure if its behavior is proven unpredictable. The objective of this study is to enrich the existing notions of data hiding security with a new rigorous and practicable one. This new definition of security is based on the notion of topological chaos. It could be used to reinforce the confidence...

  3. Fingerprinting with Wow

    Science.gov (United States)

    Yu, Eugene; Craver, Scott

    2006-02-01

    Wow, or time warping caused by speed fluctuations in analog audio equipment, provides a wealth of applications in watermarking. Very subtle temporal distortion has been used to defeat watermarks, and as components in watermarking systems. In the image domain, the analogous warping of an image's canvas has been used both to defeat watermarks and also proposed to prevent collusion attacks on fingerprinting systems. In this paper, we explore how subliminal levels of wow can be used for steganography and fingerprinting. We present both a low-bitrate robust solution and a higher-bitrate solution intended for steganographic communication. As already observed, such a fingerprinting algorithm naturally discourages collusion by averaging, owing to flanging effects when misaligned audio is averaged. Another advantage of warping is that even when imperceptible, it can be beyond the reach of compression algorithms. We use this opportunity to debunk the common misconception that steganography is impossible under "perfect compression."

  4. Let’s play hide and seek!

    CERN Multimedia

    Computer Security Team

    2012-01-01

    This week, we would like you to play a small online game called “Virtual Hide & Seek”. The rules are simple: some of our colleagues have published some sensitive or confidential documents on CERN’s central services like Indico, CDS, EDMS or TWiki, as well as on our many websites. Your mission, should you choose to accept it: find them!   If you provide us with documents marked “confidential”, “classified”, “sensitive”, or containing plain text operational passwords, you can win a book on computer security. There are only few conditions: these documents must be visible from outside CERN, must not require a CERN account in order to access them, and must not belong to you or have a direct link with your work. Have fun! But seriously, are you sure that your documents are really properly protected? We regularly find confidential documents stored on one of the CERN central  services and w...

  5. Book Review: No Place To Hide

    Directory of Open Access Journals (Sweden)

    Gary Kessler

    2007-03-01

    Full Text Available O'Harrow, R., Jr. (2006. No Place To Hide. New York: Free Press. 352 pages, ISBN: 0-7432-8705-3 (paper, US$26Reviewed by Gary C. Kessler (gary.kessler@champlain.eduPersonal privacy and the protection of personal identifying information are of concern to all of us. Innumerable articles and conferences address our loss of privacy, either through the sale of consumer databases or our own inattention. Opinions vary from "You have no privacy; get over it" to "This is the end of civil liberties as we know them." We teach people to safely maneuver on the Internet and minimize their exposure to bogus sites set up to steal their identity, warn users about the dangers of phishing and posting personal information on social network sites, use firewalls to protect our databases, and enact laws such as the Health Insurance Portability and Accountability Act (HIPAA and the Family Educational Rights and Privacy Act (FERPA to protect information.(see PDF for full review

  6. 基于纹路的三维指纹模型重建算法%Ridge Based 3D Fingerprint Reconstruction Method

    Institute of Scientific and Technical Information of China (English)

    梁小龙; 殷建平; 祝恩; 官群健

    2012-01-01

    三维指纹识别是近几年兴起的一种基于三维指纹模型进行指纹识别的新技术,能够克服传统接触式指纹识别中存在的纹路变形、残留纹路、对手指皮肤状况敏感等缺陷.基于多角度图像的三维指纹模型重建是整个识别过程中的一个关键步骤.提出了一种基于纹路的重建算法,算法重建的指纹模型直接包含纹路与细节点相关特征.相对于已有文献中将指纹表皮作为重建对象,算法重建结果更有助于特征提取等三维指纹识别后续过程.%Three-dimensional (3D) fingerprint recognition based on 3D fingerprint model could technically solve the problems suffered in traditional touch-based fingerprint system, such as filth, skin deformation) and the latent fingerprints from a dirty sensor. The 3D fingerprint model reconstruction using multiple views is the key procedure in the recognition system. This paper presented a new ridge based method to obtain 3D reconstruction of the fingerprint. Different from the existing algorithms which focus on reconstruction of finger surface, the presented method directly reconstructs ridge pattern and minutiae pattern in 3D space as the 3D fingerprint model and it is expected to be more suitable for subsequent process of recognition, such as feature extraction.

  7. [Rapid quantification of total nitrogen and end-point determination of hide melting in manufacturing of donkey-hide gelatin].

    Science.gov (United States)

    Han, Hai-Fan; Zhang, Lu; Zhang, Yan; Li, Wen-Long; Qu, Hai-Bin

    2014-03-01

    Hide melting presents itself as one of the most critical processes in the production of donkey-hide gelatin. Here a NIR-based method was established for the rapid analysis of in-process hide melting solutions as well as for end-point determination of this process. Near infrared (NIR) spectra of hide melting solutions were collected in transflective mode. With the contents of total nitrogen determined by the Kjeldahl method as reference values, partial least squares regression (PLSR) was employed to build calibration models between NIR spectra and total nitrogen. Model parameters including wavelength range and PLS factors were optimized to achieve best model performance. Based on the contents of total nitrogen predicted by calibration model, end point of hide melting was determined. The constructed PLS model gave a high correlation coefficient (R2) of 0.991 3 and a root mean square error of prediction (RMSEP) of 0.807 g x L(-1). With the predicted total nitrogen and predefined limit, decisions concerning the proper times of melting were made. This research demonstrated that NIR transflectance spectroscopy could be used to expeditiously determine the contents of total nitrogen which was subsequently chosen as the indictor for determining the end-point of hide melting. The proposed procedure may help avoid unnecessary raw material or energy consumption.

  8. 采用八方向Gabor滤波的指纹识别算法%Fingerprint Recognition Algorithm Based on the Eight Directions Gabor Filter

    Institute of Scientific and Technical Information of China (English)

    毛元; 冯桂; 汤继生

    2013-01-01

    This paper solves the center point localization on poor quality fingerprints effectively, by using the fingerprint image enhancement algorithm coupled with the localization of core point by the complex filters, and realizes the translation invariant. In addition, the eight directions Gabor filter can capture the global and local ridge structures by using the method on structure-based fingerprint feature extraction, and realize the rotation invariant The simulation experimental results based on the FVC2004 fingerprint database show that the performance of the paper is better than that of the single finger code-based and the minutiae-based method.%采用指纹增强算法与复滤波器中心点定位结合的方法,有效地解决低质量指纹图像中心点定位问题,实现了平移不变.同时,采用基于结构的指纹特征提取算法,用八方向Gabor滤波提取指纹的全局特征和局部脊线特征,实现了旋转不变.在FVC2004指纹库上的仿真实验表明:该算法取得较好的识别效果,优于基于单Finger Code特征和基于点模式的指纹识别算法.

  9. A Fingerprint Feature Extraction Algorithm Based on Wavelet Transform%一种基于小波变换的指纹特征提取算法

    Institute of Scientific and Technical Information of China (English)

    李峰岳; 李星野

    2012-01-01

    提出了一种基于小波变换的指纹纹理特征提取算法.首先以指纹图像的核心点为中心分割出一片有效的矩形区域,然后对分割后的有效区域做二维小波分解,提取小波分解后各通道的能量值作为特征值来进行识别.与传统的基于指纹细节点的识别算法相比该算法一定程度上减少了计算量,对指纹图像的质量要求也不高,并且识别精度也得到了保证.%A fingerprint feature extraction algorithm based on wavelet transform was proposed. Firstly, the paper centered on the core-points, then divided the fingerprint image into an effective area. Next, the area was analyzed by two-dimension wavelet transform, and the energy of every passage was accurately extracted as the fingerprint features. The proposed algorithm required less computational effort than conventional algorithms which were based upon minutia features extraction. In addition, this algorithm did not need the high quality fingerprint image. Besides, the correct recognition rate also reached a high level.

  10. A Game of Hide and Seek: Expectations of Clumpy Resources Influence Hiding and Searching Patterns.

    Directory of Open Access Journals (Sweden)

    Andreas Wilke

    Full Text Available Resources are often distributed in clumps or patches in space, unless an agent is trying to protect them from discovery and theft using a dispersed distribution. We uncover human expectations of such spatial resource patterns in collaborative and competitive settings via a sequential multi-person game in which participants hid resources for the next participant to seek. When collaborating, resources were mostly hidden in clumpy distributions, but when competing, resources were hidden in more dispersed (random or hyperdispersed patterns to increase the searching difficulty for the other player. More dispersed resource distributions came at the cost of higher overall hiding (as well as searching times, decreased payoffs, and an increased difficulty when the hider had to recall earlier hiding locations at the end of the experiment. Participants' search strategies were also affected by their underlying expectations, using a win-stay lose-shift strategy appropriate for clumpy resources when searching for collaboratively-hidden items, but moving equally far after finding or not finding an item in competitive settings, as appropriate for dispersed resources. Thus participants showed expectations for clumpy versus dispersed spatial resources that matched the distributions commonly found in collaborative versus competitive foraging settings.

  11. A Game of Hide and Seek: Expectations of Clumpy Resources Influence Hiding and Searching Patterns.

    Science.gov (United States)

    Wilke, Andreas; Minich, Steven; Panis, Megane; Langen, Tom A; Skufca, Joseph D; Todd, Peter M

    2015-01-01

    Resources are often distributed in clumps or patches in space, unless an agent is trying to protect them from discovery and theft using a dispersed distribution. We uncover human expectations of such spatial resource patterns in collaborative and competitive settings via a sequential multi-person game in which participants hid resources for the next participant to seek. When collaborating, resources were mostly hidden in clumpy distributions, but when competing, resources were hidden in more dispersed (random or hyperdispersed) patterns to increase the searching difficulty for the other player. More dispersed resource distributions came at the cost of higher overall hiding (as well as searching) times, decreased payoffs, and an increased difficulty when the hider had to recall earlier hiding locations at the end of the experiment. Participants' search strategies were also affected by their underlying expectations, using a win-stay lose-shift strategy appropriate for clumpy resources when searching for collaboratively-hidden items, but moving equally far after finding or not finding an item in competitive settings, as appropriate for dispersed resources. Thus participants showed expectations for clumpy versus dispersed spatial resources that matched the distributions commonly found in collaborative versus competitive foraging settings.

  12. Fingerprint pores extractor

    CSIR Research Space (South Africa)

    Mngenge, NA

    2012-11-01

    Full Text Available alone. Sweat pores have been less utilized in the past due to constraints imposed by fingerprint scanning devices and resolution standards. Recently, progress has been made on both scanning devices and resolution standards to support the use of pores...

  13. 一种采用脊线特征的指纹模糊匹配方法%A fuzzy fingerprint matching method based on ridge features

    Institute of Scientific and Technical Information of China (English)

    魏鸿磊; 张文孝; 华顺刚

    2012-01-01

    针对目前指纹识别系统主要采用手指上细节点的分布来表征和匹配指纹,提出了一种采用指纹脊线特征的匹配算法,以提高细节点数量较少情况下的匹配精度.在特征提取阶段,通过脊线采样,只存储脊线采样点集以降低存储量;在匹配时,对欲匹配的两指纹利用细节特征配准脊线集,在重合区域内对两指纹脊线统一进行编码,通过编码的比较确定相似脊线;以相似脊线的相同位置编码为论域,以相同位置编码的相似程度为隶属度,建立衡量脊线相似程度的模糊集,采用加权平均法对多个相似脊线模糊集进行综合评判得到两指纹脊线总体相似度.最后将脊线匹配相似度与细节点匹配相似度进行加权融合得到两指纹最终的相似度.在FVC2004指纹库上的实验表明该算法能够有效提高指纹匹配的准确性.%Most fingerprint matching systems rely on the distribution of minutiae on the fingertip to represent and match fingerprints. This paper describes a matching scheme that used ridge flow information to represent and match fingerprints in order to improve the accuracy of fingerprints matching in case of a lack of sufficient minutiae. In the phase of features extraction, the ridges were sampled into sets of points so that the size of the template for storage could be shrunk significantly. In the matching phase, two fingerprints were aligned first, and the ridges in the overlap area were coded into sets of ridge codes. By comparing the ridge codes, similar ridge pairs were found. Taking the same position code of similar ridges as the domain, and the degree of similarity of the same position code as the degree of membership, the fuzzy sets of ridge similarity could be achieved. The ridge similarity of two fingerprints could be achieved through evaluating the fuzzy set using the weighted average method. Finally, the weighting fusion was made to calculate the final similarity of two

  14. Alkali-free method of hide preparation for tanning

    Directory of Open Access Journals (Sweden)

    V. Valeika

    2012-06-01

    Full Text Available Usually, beamhouse processes are carried out by varying a medium from strongly alkaline (unhairing-liming up to strongly acid (pickling. This study is designed to develop a preparation of hide for tanning via processes that avoid a sharp change of hide pH. Enzymes active in acid medium are employed for hide unhairing in a buffer system containing 2.5% acetic acid and 0.3% sodium acetate. An oxidative treatment with peracetic acid then allows the complete removal of residual hair and scud. During both processes, unhairing and oxidative treatment, the opening of the derma structure occurs: 13.3-14.6g of non-collagen proteins are removed and amount of dermatan sulphate decreases by 35%. The hide obtained can be chromed directly after the above processes and subsequent treatment with sodium chloride solution omitted conventional pickling. The pH of the hide varies in the range of 8.3-3.7 during the processes of preparation for tanning.

  15. Gabor filter based fingerprint image enhancement

    Science.gov (United States)

    Wang, Jin-Xiang

    2013-03-01

    Fingerprint recognition technology has become the most reliable biometric technology due to its uniqueness and invariance, which has been most convenient and most reliable technique for personal authentication. The development of Automated Fingerprint Identification System is an urgent need for modern information security. Meanwhile, fingerprint preprocessing algorithm of fingerprint recognition technology has played an important part in Automatic Fingerprint Identification System. This article introduces the general steps in the fingerprint recognition technology, namely the image input, preprocessing, feature recognition, and fingerprint image enhancement. As the key to fingerprint identification technology, fingerprint image enhancement affects the accuracy of the system. It focuses on the characteristics of the fingerprint image, Gabor filters algorithm for fingerprint image enhancement, the theoretical basis of Gabor filters, and demonstration of the filter. The enhancement algorithm for fingerprint image is in the windows XP platform with matlab.65 as a development tool for the demonstration. The result shows that the Gabor filter is effective in fingerprint image enhancement technology.

  16. Hiding image to video: A new approach of LSB replacement

    Directory of Open Access Journals (Sweden)

    Saurabh Singh,

    2010-12-01

    Full Text Available Steganography has become great area of interest for researchers as need for secure transaction of information is increasing day by day. Information may be text, image, audio or video. Steganography is a technique in which required information is hided in any other information such that the second information does not change significantly and it appears the same as original. This paper presents a novel approach of hiding image in a video. The proposed algorithm is replacing one LSB of each pixel in video frames. It becomes very difficult for intruder to guess that an image is hidden in the video as individual frames are very difficult to analyze in a video running at 30 frames per second. The process of analysis has been made more difficult by hiding each row of image pixels in multiple frames of the video, so intruder cannot even try to unhide image until he get full video.

  17. EFFICIENT METHOD FOR HIDING DATA BY PIXEL INTENSITY

    Directory of Open Access Journals (Sweden)

    M.Shobana

    2013-02-01

    Full Text Available Data communication substructure has become more universal that there is absolutely no favoritism between different types of data in the carry plane of communication with each and every one skilled to carry it through the public data networks. Steganography technique is used to hide or embed data into an image or audio or video. Here the cover object used is an image. In the existing method for hiding and extraction of information from the given image three kinds of algorithm are used, based on its data and index channel of an image. In the proposed system, three kinds of hiding technique are implemented with some modifications in the logic level. Third algorithm is designed using color channels, based on its intensity. This technique would boost up the number of bits embedding in the image. The accomplishment of all the three algorithms are analyzed and the efficient one is taken into consideration while implementing in FPGA.

  18. Capacity bounds and constructions for reversible data-hiding

    Science.gov (United States)

    Kalker, Ton; Willems, Frans M. J.

    2003-06-01

    An undesirable side effect of many watermarking and data-hiding schemes is that the host signal into which auxiliary data is embedded is distorted. Finding an optimal balance between the amount of information embedded and the induced distortion is therefore an active field of research. In recent years, with the rediscovery of Costa's seminal paper Writing on Dirty Paper, there has been considerable progress in understanding the fundamental limits of the capacity versus distortion of watermarking and data-hiding schemes. For some applications, however, no distortion resulting from auxiliary data, however small, is allowed. In these cases the use of reversible data-hiding methods provide a way out. A reversible data-hiding scheme is defined as a scheme that allows complete and blind restoration (i.e. without additional signaling) of the original host data. Practical reversible data-hiding schemes have been proposed by Fridrich et al., but little attention has been paid to the theoretical limits. Some first results on the capacity of reversible watermarking schemes have been derived. The reversible schemes considered in most previous papers have a highly fragile nature: in those schemes, changing a single bit in the watermarked data would prohibit recovery of both the original host signal as well as the embedded auxiliary data. It is the purpose of this paper to repair this situation and to provide some first results on the limits of robust reversible data-hiding. Admittedly, the examples provided in this paper are toy examples, but they are indicative of more practical schemes that will be presented in subsequent papers.

  19. Fingerprinting with Equiangular Tight Frames

    CERN Document Server

    Mixon, Dustin G; Kiyavash, Negar; Fickus, Matthew

    2011-01-01

    Digital fingerprinting is a framework for marking media files, such as images, music, or movies, with user-specific signatures to deter illegal distribution. Multiple users can collude to produce a forgery that can potentially overcome a fingerprinting system. This paper proposes an equiangular tight frame fingerprint design which is robust to such collusion attacks. We motivate this design by considering digital fingerprinting in terms of compressed sensing. The attack is modeled as linear averaging of multiple marked copies before adding a Gaussian noise vector. The content owner can then determine guilt by exploiting correlation between each user's fingerprint and the forged copy. The worst-case error probability of this detection scheme is analyzed and bounded. Simulation results demonstrate the average-case performance is similar to the performance of orthogonal and simplex fingerprint designs, while accommodating several times as many users.

  20. Fingerprint Matching Algorithm Based on Local Triangular Feature Point Model%基于三角形局部特征点模型指纹匹配算法

    Institute of Scientific and Technical Information of China (English)

    袁东锋; 杜恒; 秦小铁

    2013-01-01

    Fingerprint identification as one of biometric technology, fingerprint matching is an important process. It is a question on how to solve the identified fingerprint problem caused by the fingerprint translation, rotation and deformation because of different pressure of fingerprint, and it is the important subject of this article resolved. In the paper I propose a local triangular model of the feature point matching algorithm based on neighbor point. It is based on the image of fingerprint minutiae and adjacent local minutiae to form a triangle, and import two judgment factors for the algorithm which is distance factor and the ridge line number factor between the two neighboring minutiae points of triangle, in order to effectively address encountered the low recognition rate in the matching process of the fingerprint image caused by the translation, rotation and extrusion deformation. The fingerprint matching algorithm based on local triangular feature point model improved the precision of the fingerprint identification and made it more reliability. Finally, the experimental comparison analysis results obtained the triangle local feature points model based fingerprint matching algorithm has better performance.%指纹识别是一种生物识别技术,指纹匹配是指纹识别的一个重要过程,如何解决指纹匹配过程中出现的待识别指纹出现的指纹平移、旋转与挤压引起的形变问题,是本文重要的研究内容.提出了一种基于局部特征点的三角形模型匹配算法,根据指纹中图像中的细节点,与其相邻的局部细节点构成一个三角形,并引入了它与邻近细节点间的距离、脊线数目作为判断因素,从而有效解决指纹图像匹配过程中遇到的因平移、旋转与挤压引起形变导致的识别率较低的问题,提高了指纹识别的精确度和可靠性.最后通过3个实验的结果表明,本文提出的算法比另外2种算法具有拒识率低、正确识

  1. Selective adsorption of tannins onto hide collagen fibres

    Institute of Scientific and Technical Information of China (English)

    LIAO; Xuepin(廖学品); LU; Zhongbing(陆忠兵); SHI; Bi(石碧)

    2003-01-01

    Hide collagen of animals is used to prepare adsorbent material and its adsorption properties to tannins are investigated. It is indicated that the collagen fibres has excellent adsorption selectivity and high adsorption capacity to tannins. The adsorption rate of tannins is more than 90% whilst less than 10% of functional components are retained by the adsorbent. The adsorption mechanism of tannins onto hide collagen fibres is hydrogen-bonding association. Freundlich model can be used to describe the adsorption isotherms, and the pseudo-second-order rate model can be used to describe adsorption kinetics.

  2. Competitively coupled maps for hiding secret visual information

    Science.gov (United States)

    Vaidelys, M.; Ziaukas, P.; Ragulskis, M.

    2016-02-01

    A novel digital image hiding scheme based on competitively coupled maps is presented in this paper. Self-organizing patterns produced by an array of non-diffusively coupled nonlinear maps are exploited to conceal the secret. The secret image is represented in the form of a dot-skeleton representation and is embedded into a spatially homogeneous initial state far below the noise level. Self-organizing patterns leak the secret image at a predefined set of system parameters. Computational experiments are used to demonstrate the effectiveness and the security of the proposed image hiding scheme.

  3. Modeling Audio Fingerprints: Structure, Distortion, Capacity

    OpenAIRE

    Doets, P.J.O.

    2010-01-01

    An audio fingerprint is a compact low-level representation of a multimedia signal. An audio fingerprint can be used to identify audio files or fragments in a reliable way. The use of audio fingerprints for identification consists of two phases. In the enrollment phase known content is fingerprinted, and ingested into a database, together with all relevant metadata. In the identification phase, unknown audio content is fingerprinted, and the fingerprints form the query to the database. The que...

  4. Hierarchical mixture models for assessing fingerprint individuality

    OpenAIRE

    Dass, Sarat C.; Li, Mingfei

    2009-01-01

    The study of fingerprint individuality aims to determine to what extent a fingerprint uniquely identifies an individual. Recent court cases have highlighted the need for measures of fingerprint individuality when a person is identified based on fingerprint evidence. The main challenge in studies of fingerprint individuality is to adequately capture the variability of fingerprint features in a population. In this paper hierarchical mixture models are introduced to infer the extent of individua...

  5. 9 CFR 95.6 - Untanned hides and skins; importations permitted subject to restrictions.

    Science.gov (United States)

    2010-01-01

    ... 9 Animals and Animal Products 1 2010-01-01 2010-01-01 false Untanned hides and skins; importations... ENTRY INTO THE UNITED STATES § 95.6 Untanned hides and skins; importations permitted subject to restrictions. Hides or skins offered for importation which do not meet the conditions or requirements of §...

  6. 9 CFR 95.5 - Untanned hides and skins; requirements for unrestricted entry.

    Science.gov (United States)

    2010-01-01

    ... 9 Animals and Animal Products 1 2010-01-01 2010-01-01 false Untanned hides and skins; requirements... ENTRY INTO THE UNITED STATES § 95.5 Untanned hides and skins; requirements for unrestricted entry. Untanned hides and/or skins of cattle, buffalo, sheep, goats, other ruminants, and swine which do not...

  7. The physical properties, morphology and viscoelasticity of biobased sponges prepared from un-tanned hides

    Science.gov (United States)

    One of our research endeavors to address ongoing challenges faced by the U.S. hide and leather industries is to develop innovative uses and novel biobased products from hides to improve prospective markets and to secure a viable future for hides and leather industries. We had previously investigate...

  8. The prediction of leather mechanical properties from airborne ultrasonic testing of hides

    Science.gov (United States)

    High quality, clean, and well-preserved hides are paramount for competitiveness in both domestic and export markets. Currently, hides are visually inspected and ranked for quality and sale price, which is not reliable when hair is present on the hides. Advanced technologies are needed to nondestru...

  9. Performance Analysis of Data Hiding in MPEG-4 AAC Audio

    Institute of Scientific and Technical Information of China (English)

    XU Shuzheng; ZHANG Peng; WANG Pengjun; YANG Huazhong

    2009-01-01

    A high capacity data hiding technique was developed for compressed digital audio.As perceptual audio coding has become the accepted technology for storage and transmission of audio signals,compressed audio information hiding enables robust,imperceptible transmission of data within audio signals,thus allowing valuable information to be attached to the content,such as the song title,lyrics,composer's name,and artist or property rights related data.This paper describes simultaneous low bitrate encoding and information hiding for highly compressed audio signals.The information hiding is implemented in the quantization process of the audio content which improves robustness,signal quality,and security.The imperceptibility of the embedded data is ensured based on the masking property of the human auditory system (HAS).The robustness and security are evaluated by various attacking algorithms.Tests with an extended MPEG4 advanced audio coding (AAC) encoder confirm that the method is robust to the regular and singular groups method (RS) and sample pair analysis (SPA) attacks as well as other statistical steganalysis method attacks.

  10. DCT Based Secret Image Hiding In Video Sequence

    Directory of Open Access Journals (Sweden)

    M. Suresh Kumar

    2014-08-01

    Full Text Available Internet which is ever more accessible to interference by not with authority people over the World. It is important to bring down a chance of Information being sensed while Transmitting is the major issue these days. To overcome these problems one of the solution is cryptography. There will be no solitude once it is decoded. So hiding data to make it confidential. Copyright is one of the ways for hiding data and it is security for digital media. Its significance and techniques used in executing hiding of data let us see in brief. The existing LSB modification technique as in this approach the bits are randomly distributes the bits of message in image so which will becomes complex for anonymous persons to extract original message information, it opens the gates for loosing important hidden information. Here hiding and extraction method is used for AVI (Audio Video Interleave. As Higher order coefficients maintains Secret message bits. The hidden information will be in the form of gray scale image pixel values. Grayscale value then converted into binary values .The resultant binary values will be assigned to the higher order coefficient values of DCT of AVI video frames. These experiments were successful. We can analyze the results using Mat lab simulation software.

  11. Video Steganography: Text Hiding In Video By LSB Substitution

    Directory of Open Access Journals (Sweden)

    Kamred Udham Singh

    2014-05-01

    Full Text Available The development of high speed computer networks and Internet has increased the easiness of Information Communication. In contrast with Analog media and Digital media provide several different advantages such as high quality, simple editing, high loyalty copying and authenticity. But in the field of data communication this type of development has increased the fear of sneaking the data while sending data from the sender to the receiver. Due to this reason Information Security is main problem of Data Communication. Steganography plays an important role in field of Information Security. Video and images are very common choice for hiding data. It is very important for effective and successful embedding process to select appropriate pixels in the video frames, which are used to store the secret data. We use video based Steganography because of large size and memory requirements. Hiding information in a carrier file we use least significant bit (LSB insertion technique. In Least significant bit (LSB insertion technique, for hiding information we change LSB of video file with the information bits .This paper will focus on hiding information in specific frames of the video and in specific position of the frame by LSB substitution.

  12. Hide And Seek GPS And Geocaching In The Classroom

    Science.gov (United States)

    Lary, Lynn M.

    2004-01-01

    In short, geocaching is a high-tech, worldwide treasure hunt (geocaches can now be found in more than 180 countries) where a person hides a cache for others to find. Generally, the cache is some type of waterproof container that contains a log book and an assortment of goodies, such as lottery tickets, toys, photo books for cachers to fill with…

  13. Powdered hide model for vegetable tanning II. hydrolyzable tannin

    Science.gov (United States)

    Vegetable tannages employ both condensed and hydrolyzable tannins. As part of our exploration of tanning mechanisms, we reported last year on interactions of the condensed tannin, quebracho, with powdered hide. In this study, the interactions of chestnut extract, a hydrolyzable tannin, with powdere...

  14. Near Reversible Data Hiding Scheme for images using DCT

    Directory of Open Access Journals (Sweden)

    T. Bhaskar

    2015-11-01

    Full Text Available Certain level of modifications to the original content can be acceptable. These schemes are called nearreversible. It has emerging application in remote sensing. In remote sensing application the image is captured while monitoring the damaged regions in the natural disasters such as tsunami, volcanic eruption, etc. Instead of more alterations to the pixels or coefficients here we go for less alterations , low hiding capacity and complexity that exhibit while reversible data hiding. There exist a few near reversible hiding schemes which address the limitations to the triangular trade-off that exists between capacity, robustness and visual quality characteristics. However, for achieving better vision of image, there is a need for near reversible data hiding schemes. Therefore, the traditional metric PSNR are not sufficient to assess the distorted image when the data is embedded in image for assessing the better visual quality of the image with hidden data we present a HVS based metrics like PSNR-HVS, MSSIM. Using DCT evaluates the overall image quality

  15. PALM and STORM: what hides beyond the Rayleigh limit?

    CSIR Research Space (South Africa)

    Henriques, R

    2009-06-01

    Full Text Available -1 Biotechnol. J. 2009, 4, 846?857 Review PALM and STORM: What hides beyond the Rayleigh limit? Ricardo Henriques1 and Musa M. Mhlanga1,2 1 Gene Expression and Biophysics Unit, Instituto de Medicina Molecular, Faculdade de Medicina Universidade de...

  16. Video Data Hiding for Managing Privacy Information in Surveillance Systems

    Directory of Open Access Journals (Sweden)

    Hail MichaelW

    2009-01-01

    Full Text Available From copyright protection to error concealment, video data hiding has found usage in a great number of applications. In this work, we introduce the detailed framework of using data hiding for privacy information preservation in a video surveillance environment. To protect the privacy of individuals in a surveillance video, the images of selected individuals need to be erased, blurred, or re-rendered. Such video modifications, however, destroy the authenticity of the surveillance video. We propose a new rate-distortion-based compression-domain video data hiding algorithm for the purpose of storing that privacy information. Using this algorithm, we can safeguard the original video as we can reverse the modification process if proper authorization can be established. The proposed data hiding algorithm embeds the privacy information in optimal locations that minimize the perceptual distortion and bandwidth expansion due to the embedding of privacy data in the compressed domain. Both reversible and irreversible embedding techniques are considered within the proposed framework and extensive experiments are performed to demonstrate the effectiveness of the techniques.

  17. Quiz Games as a model for Information Hiding

    OpenAIRE

    Bank, Bernd; Heintz, Joos; Matera, Guillermo; Montana, Jose L.; Pardo, Luis M.; Paredes, Andres Rojas

    2015-01-01

    We present a general computation model inspired in the notion of information hiding in software engineering. This model has the form of a game which we call quiz game. It allows in a uniform way to prove exponential lower bounds for several complexity problems of elimination theory.

  18. Frequent Itemset Hiding Algorithm Using Frequent Pattern Tree Approach

    Science.gov (United States)

    Alnatsheh, Rami

    2012-01-01

    A problem that has been the focus of much recent research in privacy preserving data-mining is the frequent itemset hiding (FIH) problem. Identifying itemsets that appear together frequently in customer transactions is a common task in association rule mining. Organizations that share data with business partners may consider some of the frequent…

  19. Frequent Itemset Hiding Algorithm Using Frequent Pattern Tree Approach

    Science.gov (United States)

    Alnatsheh, Rami

    2012-01-01

    A problem that has been the focus of much recent research in privacy preserving data-mining is the frequent itemset hiding (FIH) problem. Identifying itemsets that appear together frequently in customer transactions is a common task in association rule mining. Organizations that share data with business partners may consider some of the frequent…

  20. Fingerprint Feature Extraction Based on Macroscopic Curvature

    Institute of Scientific and Technical Information of China (English)

    Zhang Xiong; He Gui-ming; Zhang Yun

    2003-01-01

    In the Automatic Fingerprint Identification System (AFIS), extracting the feature of fingerprint is very important. The local curvature of ridges of fingerprint is irregular, so people have the barrier to effectively extract the fingerprint curve features to describe fingerprint. This article proposes a novel algorithm; it embraces information of few nearby fingerprint ridges to extract a new characteristic which can describe the curvature feature of fingerprint. Experimental results show the algorithm is feasible, and the characteristics extracted by it can clearly show the inner macroscopic curve properties of fingerprint. The result also shows that this kind of characteristic is robust to noise and pollution.

  1. Image Mosaicing Algorithm for Rolled Fingerprint Construction

    Institute of Scientific and Technical Information of China (English)

    贺迪; 荣钢; 周杰

    2002-01-01

    Fingerprint identification is one of the most important biometric authentication methods. However, current devices for recording digital fingerprints can only capture plain-touch fingerprints. Rolled fingerprints have much more information for recognition, so a method is needed to construct a rolled fingerprint from a series of plain-touch fingerprints. This paper presents a novel algorithm for image mosaicing for real time rolled fingerprint construction in which the images are assembled with corrections to create a smooth, non-fragmented rolled fingerprint in real time. Experimental results demonstrate its effectiveness by comparing it with other conventional algorithms.

  2. Fingerprint Feature Extraction Based on Macroscopic Curvature

    Institute of Scientific and Technical Information of China (English)

    Zhang; Xiong; He; Gui-Ming; 等

    2003-01-01

    In the Automatic Fingerprint Identification System(AFIS), extracting the feature of fingerprint is very important. The local curvature of ridges of fingerprint is irregular, so people have the barrier to effectively extract the fingerprint curve features to describe fingerprint. This article proposes a novel algorithm; it embraces information of few nearby fingerprint ridges to extract a new characterstic which can describe the curvature feature of fingerprint. Experimental results show the algorithm is feasible, and the characteristics extracted by it can clearly show the inner macroscopic curve properties of fingerprint. The result also shows that this kind of characteristic is robust to noise and pollution.

  3. Brain Fingerprinting Technology

    Directory of Open Access Journals (Sweden)

    Ms.J.R.Rajput

    2015-01-01

    Full Text Available Brain Fingerprinting is a new computer-based technology to identify the perpetrator of a crime accurately and scientifically by measuring brain-wave responses to crime-relevant words or pictures presented on a computer screen. Brain Fingerprinting has proven 100% accurate in over 120 tests, including tests on FBI agents, tests for a US intelligence agency and for the US Navy, and tests on real-life situations including felony crimes. Brain fingerprinting is based on finding that the brain generates a unique brain wave pattern when a person encounters a familiar stimulus Use of functional magnetic resonance imaging in lie detection derives from studies suggesting that persons asked to lie show different patterns of brain activity than they do when being truthful. Issues related to the use of such evidence in courts are discussed. The author concludes that neither approach is currently supported by enough data regarding its accuracy in detecting deception to warrant use in court. In the field of criminology, a new lie detector has been developed in the United States of America. This is called “brain fingerprinting”. This invention is supposed to be the best lie detector available as on date and is said to detect even smooth criminals who pass the polygraph test (the conventional lie detector test with ease. The new method employs brain waves, which are useful in detecting whether the person subjected to the test, remembers finer details of the crime. Even if the person willingly suppresses the necessary information, the brain wave is sure to trap him, according to the experts, who are very excited about the new kid on the block.

  4. Fingerprint Image's Feature Extraction and Noting Information%指纹图像的特征提取及特征点记录

    Institute of Scientific and Technical Information of China (English)

    杨娱

    2009-01-01

    This paper focus on the study of the fingerprint image's feature extraction approach, which is based on minutia features. In the aspect post-processing, a new approach to diminate false features is presented. The elimination algorithm of false features is based on the distributing disciplinarian of fingerprint features. In the noting information of features, we raise a new method. The method doesn't depend on the existence of the center of fingerprint in images and uses the ridge count as the distance between two features.%该文主要研究了基于细节点的方法来提取指纹特征特点,在后处理部分.结合细化指纹图像中细节特征点固有的分布规律,提出了一种新的滤除指纹细节伪特征点的方法.在记录特征点信息部分,该文提出了一种新的记录特征点信息的方法.该方法不依赖于指纹中心点的录入并将特征点之间的距离用纹线数表示,从而增加了算法的鲁棒性.

  5. 指纹图像特征点提取的改进算法%A method for Feature Point Extraction of Fingerprint Image

    Institute of Scientific and Technical Information of China (English)

    王建英

    2013-01-01

    Because of the interference in image quality and noise, there are lots of spurious minutiae in the feature extraction of the fingerprint image. Existing false feature point, makes the matching speed greatly reduced, and causes the performance of the recognition system bad. This paper proposes a method to remove the pseudo fingerprint feature points effectively, retained the true features, and improve the efficiency of the fingerprint recognition.%  在提取指纹图像的细节特征中,由于图像质量和噪声的干扰,存在大量的伪特征点,伪特征点的存在,不仅会使匹配的速度大大降低,还会造成识别系统的拒真率和误识率的上升,本文提出了一种去伪特征点的方法,有效的去除了指纹的伪特征点,保留了真特征点,提高了指纹识别的效率。

  6. Petrographers fingerprint coals

    Energy Technology Data Exchange (ETDEWEB)

    Pearson, D.E. [Pearson and Associates Ltd. (USA)

    2001-05-01

    A new system of coal fingerprinting called Digipet generates reflectance profiles by using an automated digital imaging system in which tens of millions of individual reflectance measurements are obtained. Images are conditioned to generate a detailed smooth histogram which convey information on the coal sample's provenance and history. Expert interpretation can reveal further information. The article gives details of the instrument and shows sample reflectance profiles. It discusses some applications in sampling coal charged to coke ovens of the Indiana Harbor Coke Co, and at a Midwest generating plant where it detected the presence of rogue high volatile coal. 3 figs.

  7. Fingerprints of Mott Superconductivity

    Institute of Scientific and Technical Information of China (English)

    王强华

    2003-01-01

    We improve a previous theory of doped Mott insulators with duality between pairing and magnetism by a further duality transform. As the result we obtained a quantum Ginzburg-Landau theory describing the Cooper pair condensate and the dual of spin condensate. We address the superconductivity by doping a Mott insulator,which we call the Mott superconductivity. Some fingerprints of such novelty in cuprates are the scaling between neutron resonance energy and superfluid density, and the induced quantized spin moment by vortices or Zn impurity (together with circulating charge super-current to be checked by experiments).

  8. Joint data-hiding and rate-distortion optimization for H.264/AVC videos

    Science.gov (United States)

    Lin, Yih-Chuan; Li, Jung-Hong

    2012-07-01

    We address video data-hiding on the context-adaptive variable-length coding domain of the H.264/AVC standard. It is challenging to maintain a minimum variation of rate-distortion performance when hiding data in compressed videos by slightly modifying one or more transform coefficients of prediction residual data. The fluctuant variation of rate-distortion performance is especially serious in the case of hiding data in H.264/AVC compressed videos due to the thorough use of various prediction modes. Most current video data-hiding schemes concentrate on hiding messages in video intra (I)-frames to mitigate performance degradation at the expense of limited hiding capacity and applicability. Unlike most previous video data-hiding schemes, this paper considers data-hiding schemes on both I- and predicted (P)-frames of videos. We first investigate the possible ways used to suppress the significant degradation of the rate-distortion performance for hiding data in H.264/AVC videos. Based on the investigation, a hybrid video data-hiding scheme is designed to perform the classification of 4×4 residual blocks according to the characteristics of each block and to hide message data differently in each classified block in order to reduce the performance degradation caused by the data-hiding process. The block classification is based on the magnitude of the last non-zero coefficient and the coefficient difference energy of each block to select suitable blocks that are capable of contributing less degradation of coding performance for hiding additional messages. Moreover, the proposed data-hiding algorithm is incorporated with the rate-distortion optimization loop of the H.264/AVC encoder to provide further degradation suppression on the output bit-rate and decoded quality. From experiments on several well-known test videos, it can be seen that the proposed data-hiding scheme demonstrates improved efficiency on video quality and output bit-rate compared to other similar methods.

  9. Evaluation of Fingerprint Images Captured by Optical Fingerprint Scanner

    Science.gov (United States)

    Takeuchi, Hideyo; Matsumoto, Noriyuki; Kuwayama, Kiyoaki; Umezaki, Taizo

    In this paper, we propose the way to evaluate fingerprint image-quality and how to discriminate remnants from captured images. First, we investigate evaluating fingerprint image-quality. Fingerprint image-quality can be digitized using the "measure" we proposed. We simulate using the dataset consists of 1425 fingerprint images captured from 57 people in Feb, which contains a lot of faded images. In the simulation using all our database, recognition rate is 95.6% while type II error is 0.01%. Recognition rate is improved to 98.1%, with rejecting 3.7% faded images evaluated by our measure from the database. Recognition rate is improved to 99.6%, rejecting 14.2% faded images. And we investigate the way to apply the measure of image-quality to fingerprint verification device with customer’s satisfaction in real world. Next we propose the way to discriminate between remnants and fingerprint images captured from optical scanner by using frequency analysis. We can perfectly prevent the fingerprint verification device from malfunctioning caused by remnant, when strong flashlight or direct sunlight slant in optical scanner in real world.

  10. Modeling Audio Fingerprints: Structure, Distortion, Capacity

    NARCIS (Netherlands)

    Doets, P.J.O.

    2010-01-01

    An audio fingerprint is a compact low-level representation of a multimedia signal. An audio fingerprint can be used to identify audio files or fragments in a reliable way. The use of audio fingerprints for identification consists of two phases. In the enrollment phase known content is fingerprinted,

  11. Fast Pseudo-Random Fingerprints

    CERN Document Server

    Bachrach, Yoram

    2010-01-01

    We propose a method to exponentially speed up computation of various fingerprints, such as the ones used to compute similarity and rarity in massive data sets. Rather then maintaining the full stream of $b$ items of a universe $[u]$, such methods only maintain a concise fingerprint of the stream, and perform computations using the fingerprints. The computations are done approximately, and the required fingerprint size $k$ depends on the desired accuracy $\\epsilon$ and confidence $\\delta$. Our technique maintains a single bit per hash function, rather than a single integer, thus requiring a fingerprint of length $k = O(\\frac{\\ln \\frac{1}{\\delta}}{\\epsilon^2})$ bits, rather than $O(\\log u \\cdot \\frac{\\ln \\frac{1}{\\delta}}{\\epsilon^2})$ bits required by previous approaches. The main advantage of the fingerprints we propose is that rather than computing the fingerprint of a stream of $b$ items in time of $O(b \\cdot k)$, we can compute it in time $O(b \\log k)$. Thus this allows an exponential speedup for the finge...

  12. Fingerprinting Dark Energy

    CERN Document Server

    Sapone, Domenico

    2009-01-01

    Dark energy perturbations are normally either neglected or else included in a purely numerical way, obscuring their dependence on underlying parameters like the equation of state or the sound speed. However, while many different explanations for the dark energy can have the same equation of state, they usually differ in their perturbations so that these provide a fingerprint for distinguishing between different models with the same equation of state. In this paper we derive simple yet accurate approximations that are able to characterize a specific class of models (encompassing most scalar field models) which is often generically called "dark energy". We then use the approximate solutions to look at the impact of the dark energy perturbations on the dark matter power spectrum and on the integrated Sachs-Wolfe effect in the cosmic microwave background radiation.

  13. Optical image hiding based on computational ghost imaging

    Science.gov (United States)

    Wang, Le; Zhao, Shengmei; Cheng, Weiwen; Gong, Longyan; Chen, Hanwu

    2016-05-01

    Imaging hiding schemes play important roles in now big data times. They provide copyright protections of digital images. In the paper, we propose a novel image hiding scheme based on computational ghost imaging to have strong robustness and high security. The watermark is encrypted with the configuration of a computational ghost imaging system, and the random speckle patterns compose a secret key. Least significant bit algorithm is adopted to embed the watermark and both the second-order correlation algorithm and the compressed sensing (CS) algorithm are used to extract the watermark. The experimental and simulation results show that the authorized users can get the watermark with the secret key. The watermark image could not be retrieved when the eavesdropping ratio is less than 45% with the second-order correlation algorithm, whereas it is less than 20% with the TVAL3 CS reconstructed algorithm. In addition, the proposed scheme is robust against the 'salt and pepper' noise and image cropping degradations.

  14. Hiding a Realistic Object Using a Broadband Terahertz Invisibility Cloak

    CERN Document Server

    Zhou, Fan; Cao, Wei; Stuart, Colin T; Gu, Jianqiang; Zhang, Weili; Sun, Cheng

    2011-01-01

    The invisibility cloak has been a long-standing dream for many researchers over the decades. The introduction of transformational optics has revitalized this field by providing a general method to design material distributions to hide the subject from detection. By transforming space and light propagation, a three-dimensional (3D) object is perceived as having a reduced number of dimensions, in the form of points, lines, and thin sheets, making it "undetectable" judging from the scattered field. Although a variety of cloaking devices have been reported at microwave and optical frequencies, the spectroscopically important Terahertz (THz) domain remains unexplored. Moreover, due to the difficulties in fabricating cloaking devices that are optically large in all three dimensions, hiding realistic 3D objects has yet to be demonstrated. Here, we report the first experimental demonstration of a 3D THz cloaking device fabricated using a scalable Projection Microstereolithography process. The cloak operates at a broa...

  15. Steganography Algorithm to Hide Secret Message inside an Image

    CERN Document Server

    Ibrahim, Rosziati

    2011-01-01

    In this paper, the authors propose a new algorithm to hide data inside image using steganography technique. The proposed algorithm uses binary codes and pixels inside an image. The zipped file is used before it is converted to binary codes to maximize the storage of data inside the image. By applying the proposed algorithm, a system called Steganography Imaging System (SIS) is developed. The system is then tested to see the viability of the proposed algorithm. Various sizes of data are stored inside the images and the PSNR (Peak signal-to-noise ratio) is also captured for each of the images tested. Based on the PSNR value of each images, the stego image has a higher PSNR value. Hence this new steganography algorithm is very efficient to hide the data inside the image.

  16. The effect of media on knowledge hiding in entrepreneurial firms

    DEFF Research Database (Denmark)

    Labafi, Somayeh; Khajeheian, Datis; Williams, Idongesit

    2017-01-01

    in a qualitative study. Thematic analysis is used to analyze transcribed interview data from employees in a software company in Iran. The findings of the analysis show that media richness significantly impacts on organizational learning and influences on knowledge hiding behavior in employees. This article...... suggests that entrepreneurs and managers of small firms should provide employees’ access to rich media content as well as established organizational learning as part of their organizational culture........ For this reason, factors that influence on the tendency of employees to expose and use their knowledge would be appreciated by managers of organizations. This paper investigates the effect of the media on knowledge hiding in organizations. The investigation is done with the aid of a conceptual framework...

  17. Robust color image hiding method in DCT domain

    Institute of Scientific and Technical Information of China (English)

    LI Qing-zhong; YU Chen; CHU Dong-sheng

    2006-01-01

    This paper presents a robust color image hiding method based on YCbCr color system in discrete cosine transform (DCT) domain,which can hide a secret color image behind a public color cover image and is compatible with the international image compression standard of JPEG.To overcome the grave distortion problem in the restored secret image,this paper proposes a new embedding scheme consisting of reasonable partition of a pixel value and sign embedding.Moreover,based on human visual system (HVS) and fuzzy theory,this paper also presents a fuzzy classification method for DCT sub-blocks to realize the adaptive selection of embedding strength.The experimental results show that the maximum distortion error in pixel value for the extracted secret image is ±1.And the color cover image can provide good quality after embedding large amount of data.

  18. Hiding an image in cascaded Fresnel digital holograms

    Institute of Scientific and Technical Information of China (English)

    Shaogeng Deng; Liren Liu; Haitao Lang; Weiqing Pan; Dong Zhao

    2006-01-01

    @@ A system of two separated computer-generated holograms termed cascaded Fresnel digital holography (CFDH) is proposed and its application to hiding information is demonstrated by a computer simulation experiment. The technique is that the reconstructed image is the result of the wave Fresnel diffractionof two sub-holograms located at different distances from the imaging plane along the illuminating beam. The two sub-holograms are generated by an iterative algorithm based on the projection onto convex sets. In the application to the hiding of optical information, the information to be hidden is encoded into thesub-hologram which is multiplied by the host image in the input plane, the other sub-hologram in the filterplane is used for the deciphering key, the hidden image can be reconstructed in the imaging plane of the CFDH setup.

  19. A NEW APPROACH FOR HIDING DATA USING B-BOX

    Directory of Open Access Journals (Sweden)

    Dr. Saad Abdual azize AL_ani

    2013-11-01

    Full Text Available Digital Images and video encryption play an important role in today’s multimedia world. Many encryption schemes have been proposed to provide a security for digital images. This paper designs an efficient cryptosystem for video. Our method can achieve two goals; the first goal is to design a height security for hiding a data in video, the second goal is to design a computational complexity cryptosystem.

  20. Study on the fingerprint image thinning algorithm%指纹图像细化算法的研究

    Institute of Scientific and Technical Information of China (English)

    钱超; 王福明

    2012-01-01

    指纹识别是一种重要的生物特征鉴别技术。随着计算机技术的不断发展,自动指纹识别系统得到广泛的应用。因此进一步提高指纹识别的性能具有十分重要的意义,而指纹图像增强在指纹图像预处理过程中非常重要,直接影响指纹识别的识别率和识别速度。对指纹图像的细化算法进行了较深入的研究,分析了OPTA算法并且在OPTA算法的基础上,重新构建了细化模板,提出了一种新的细化算法.经过实验证明,该算法能够很好地满足细化的要求,细化完全彻底,细化以后的指纹骨架在纹线中心线,并保持了纹线原有的拓扑结构和细节特征,而且光滑无毛刺,运算速度也很快。%Fingerprint identification technique is an important biometric technology. But fingerprint identification can't meet the need for a lot of practical applications in the rate of accuracy and the speed. So improving the performance of fingerprint recognition further is important., fingerprint Image Enhancement in the fingerprint image preprocessing is very important which affect the fingerprint recognition rate and recognition speed directly. Analysis of the OPTA algorithms and on the basis of the OPTA algorithm, the thinning templates are redesigned, and a new improved thinning algorithm is presented, Through experiments, the new algorithm has been proved to have many advantages such as complete thinning, quick speed,smooth Skeleton, center location of ridges.maintenance of minutiae,and so on.

  1. Unitary embedding for data hiding with the SVD

    Science.gov (United States)

    Bergman, Clifford; Davidson, Jennifer

    2005-03-01

    Steganography is the study of data hiding for the purpose of covert communication. A secret message is inserted into a cover file so that the very existence of the message is not apparent. Most current steganography algorithms insert data in the spatial or transform domains; common transforms include the discrete cosine transform, the discrete Fourier transform, and discrete wavelet transform. In this paper, we present a data-hiding algorithm that exploits a decomposition representation of the data instead of a frequency-based transformation of the data. The decomposition transform used is the singular value decomposition (SVD). The SVD of a matrix A is a decomposition A= USV' in which S is a nonnegative diagonal matrix and U and V are orthogonal matrices. We show how to use the orthogonal matrices in the SVD as a vessel in which to embed information. Several challenges were presented in order to accomplish this, and we give effective information-hiding using the SVD can be just as effective as using transform-based techniques. Furthermore, different problems arise when using the SVD than using a transform-based technique. We have applied the SVD to image data, but the technique can be formulated for other data types such as audio and video.

  2. Steganographic Techniques of Data Hiding Using Digital Images (Review Paper

    Directory of Open Access Journals (Sweden)

    Babloo Saha

    2012-01-01

    Full Text Available Steganography is an art that involves communication of secret data in an appropriate carrier, e.g., image, audio, video or TCP/IP header file. Steganography’s goal is to hide the very existence of embedded data so as not to arouse an eavesdropper’s suspicion. For hiding secret data in digital images, large varieties of steganographic techniques are available, some are more complex than others, and all of them have their respective pros and cons. Steganography has various useful applications and the technique employed depends on the requirements of the application to be designed for. For instance. applications may require absolute invisibility of the secret data, larger secret data to be hidden or high degree of robustness of the carrier. This paper intends to give thorough understanding and evolution of different existing digital image steganography techniques of data hiding in spatial, transform and compression domains. It covers and integrates recent research work without going in to much detail of steganalysis, which is the art and science of defeating steganography.Defence Science Journal, 2012, 62(1, pp.11-18, DOI:http://dx.doi.org/10.14429/dsj.62.1436

  3. High Capacity data hiding using LSB Steganography and Encryption

    Directory of Open Access Journals (Sweden)

    Shamim Ahmed Laskar

    2013-01-01

    Full Text Available The network provides a method of communication to distribute information to the masses. With the growthof data communication over computer network, the security of information has become a major issue.Steganography and cryptography are two different data hiding techniques. Steganography hides messagesinside some other digital media. Cryptography, on the other hand obscures the content of the message. Wepropose a high capacity data embedding approach by the combination of Steganography andcryptography. In the process a message is first encrypted using transposition cipher method and then theencrypted message is embedded inside an image using LSB insertion method. The combination of these twomethods will enhance the security of the data embedded. This combinational methodology will satisfy therequirements such as capacity, security and robustness for secure data transmission over an open channel.A comparative analysis is made to demonstrate the effectiveness of the proposed method by computingMean square error (MSE and Peak Signal to Noise Ratio (PSNR. We analyzed the data hiding techniqueusing the image performance parameters like Entropy, Mean and Standard Deviation. The stego imagesare tested by transmitting them and the embedded data are successfully extracted by the receiver. The mainobjective in this paper is to provide resistance against visual and statistical attacks as well as highcapacity.

  4. Data Hiding Techniques Using Prime and Natural Numbers

    CERN Document Server

    Dey, Sandipan; Bandyopadhyay, Bijoy; Sanyal, Sugata

    2010-01-01

    In this paper, a few novel data hiding techniques are proposed. These techniques are improvements over the classical LSB data hiding technique and the Fibonacci LSB data-hiding technique proposed by Battisti et al. \\cite{r1}. The classical LSB technique is the simplest, but using this technique it is possible to embed only in first few bit-planes, since image quality becomes drastically distorted when embedding in higher bit-planes. Battisti et al. \\cite{r1} proposed an improvement over this by using Fibonacci decomposition technique and generating a different set of virtual bit-planes all together, thereby increasing the number of bit-planes. In this paper, first we mathematically model and generalize this particular approach of virtual bit-plane generation. Then we propose two novel embedding techniques, both of which are special-cases of our generalized model. The first embedding scheme is based on decomposition of a number (pixel-value) in sum of prime numbers, while the second one is based on decompositi...

  5. Hiding Data in Images Using New Random Technique

    Directory of Open Access Journals (Sweden)

    Obaida Mohammad Awad Al-Hazaimeh

    2012-07-01

    Full Text Available Steganography is the art of hiding the fact that communication is taking place by hiding information in other information. In the field of Data Communication, Steganography play a major role. The transmission of information via the Internet may expose it to detect and theft. Some solution to be discussed is how to passing information in a manner that the very existence of the message is unknown in order to repel attention of the potential attacker. We focus on the Least Significant Bit (LSB technique which is the most common Steganographic technique is employed in this paper. An improvement to this technique is suggested by randomly inserting the bits of the message in the image to produce more secured system. In this paper, the security goals were enhanced via a proposed cryptosystems to maintain the security on the Cover-image. The proposed solution consists of a simple, but strong to hiding the text data and the human eye would be unable to notice the hidden data in the Stego-image.

  6. An r-Hiding Revocable Group Signature Scheme: Group Signatures with the Property of Hiding the Number of Revoked Users

    Directory of Open Access Journals (Sweden)

    Keita Emura

    2014-01-01

    Full Text Available If there are many displaced workers in a company, then a person who goes for job hunting might not select this company. That is, the number of members who quit is quite negative information. Similarly, in revocable group signature schemes, if one knows (or guesses the number of revoked users (say r, then one may guess the reason behind such circumstances, and it may lead to harmful rumors. However, no previous revocation procedure can achieve hiding r. In this paper, we propose the first revocable group signature scheme, where r is kept hidden, which we call r-hiding revocable group signature. To handle this property, we newly define the security notion called anonymity with respect to the revocation which guarantees the unlinkability of revoked users.

  7. Biometric Security - Fingerprint Recognition System

    Directory of Open Access Journals (Sweden)

    Alexandra Emanuela Vacarus

    2015-03-01

    Full Text Available The paper presents an application, FingerTouch that provides a secure method of storing usernames and passwords for different types of accounts by using biometric fingerprint authentication. Recent developments in the smartphone area regarding fingerprint authentication on mobile devices is discussed. The purpose of the application and the technologies that were used in the development are described. The features, architecture and implementation of the application are analyzed.

  8. Function S-rough sets and security-authentication of hiding law

    Institute of Scientific and Technical Information of China (English)

    SHI KaiQuan; ZHAO JianLi

    2008-01-01

    Function S-rough sets are defined by R-function equivalence class,which have dynamic characteristic.Function S-rough sets have dynamic characteristic,law characteristic and law-hiding characteristic.Function S-rough sets can generate f-hiding law and f-hiding law.By engrafting,crossing,and penetrating between the information security theory and function S-rough sets,the security hiding and the authentication of f-hiding law and f-hiding law are given respectively in this paper.The fusion and share between function S-rough sets and information secu-rity theory is a new research direction of the application of information law in in-formation system.

  9. Visualization of molecular fingerprints.

    Science.gov (United States)

    Owen, John R; Nabney, Ian T; Medina-Franco, José L; López-Vallejo, Fabian

    2011-07-25

    A visualization plot of a data set of molecular data is a useful tool for gaining insight into a set of molecules. In chemoinformatics, most visualization plots are of molecular descriptors, and the statistical model most often used to produce a visualization is principal component analysis (PCA). This paper takes PCA, together with four other statistical models (NeuroScale, GTM, LTM, and LTM-LIN), and evaluates their ability to produce clustering in visualizations not of molecular descriptors but of molecular fingerprints. Two different tasks are addressed: understanding structural information (particularly combinatorial libraries) and relating structure to activity. The quality of the visualizations is compared both subjectively (by visual inspection) and objectively (with global distance comparisons and local k-nearest-neighbor predictors). On the data sets used to evaluate clustering by structure, LTM is found to perform significantly better than the other models. In particular, the clusters in LTM visualization space are consistent with the relationships between the core scaffolds that define the combinatorial sublibraries. On the data sets used to evaluate clustering by activity, LTM again gives the best performance but by a smaller margin. The results of this paper demonstrate the value of using both a nonlinear projection map and a Bernoulli noise model for modeling binary data.

  10. Fingerprint image enhancement using CNN filtering techniques.

    Science.gov (United States)

    Saatci, Ertugrul; Tavsanoglu, Vedat

    2003-12-01

    Due to noisy acquisition devices and variation in impression conditions, the ridgelines of fingerprint images are mostly corrupted by various kinds of noise causing cracks, scratches and bridges in the ridges as well as blurs. These cause matching errors in fingerprint recognition. For an effective recognition the correct ridge pattern is essential which requires the enhancement of fingerprint images. Segment by segment analysis of the fingerprint pattern yields various ridge direction and frequencies. By selecting a directional filter with correct filter parameters to match ridge features at each point, we can effectively enhance fingerprint ridges. This paper proposes a fingerprint image enhancement based on CNN Gabor-Type filters.

  11. Fingerprint Identification - Feature Extraction, Matching and Database Search

    NARCIS (Netherlands)

    Bazen, Asker Michiel

    2002-01-01

    Presents an overview of state-of-the-art fingerprint recognition technology for identification and verification purposes. Three principal challenges in fingerprint recognition are identified: extracting robust features from low-quality fingerprints, matching elastically deformed fingerprints and eff

  12. Hiding message into DNA sequence through DNA coding and chaotic maps.

    Science.gov (United States)

    Liu, Guoyan; Liu, Hongjun; Kadir, Abdurahman

    2014-09-01

    The paper proposes an improved reversible substitution method to hide data into deoxyribonucleic acid (DNA) sequence, and four measures have been taken to enhance the robustness and enlarge the hiding capacity, such as encode the secret message by DNA coding, encrypt it by pseudo-random sequence, generate the relative hiding locations by piecewise linear chaotic map, and embed the encoded and encrypted message into a randomly selected DNA sequence using the complementary rule. The key space and the hiding capacity are analyzed. Experimental results indicate that the proposed method has a better performance compared with the competing methods with respect to robustness and capacity.

  13. Video fingerprinting for live events

    Science.gov (United States)

    Celik, Mehmet; Haitsma, Jaap; Barvinko, Pavlo; Langelaar, Gerhard; Maas, Martijn

    2009-02-01

    Multimedia fingerprinting (robust hashing) as a content identification technology is emerging as an effective tool for preventing unauthorized distribution of commercial content through user generated content (UGC) sites. Research in the field has mainly considered content types with slow distribution cycles, e.g. feature films, for which reference fingerprint ingestion and database indexing can be performed offline. As a result, research focus has been on improving the robustness and search speed. Live events, such as live sports broadcasts, impose new challenges on a fingerprinting system. For instance, highlights from a soccer match are often available-and viewed-on UGC sites well before the end of the match. In this scenario, the fingerprinting system should be able to ingest and index live content online and offer continuous search capability, where new material is identifiable within minutes of broadcast. In this paper, we concentrate on algorithmic and architectural challenges we faced when developing a video fingerprinting solution for live events. In particular, we discuss how to effectively utilize fast sorting algorithms and a master-slave architecture for fast and continuous ingestion of live broadcasts.

  14. Contourlet-Based Fingerprint Antispoofing

    Directory of Open Access Journals (Sweden)

    Shankar Bhausaheb Nikam

    2013-05-01

    Full Text Available We propose an image-based method using Contourlet t ransform [5] to detect liveness in fingerprint biometric systems. We observe that real and spoof fingerprint images exhibit different textural characteristics. Wavelet transfo rm although widely used for liveness detection is not the ideal one. Wavelets are not very effecti ve in representing images containing lines and contours [5]. Recent Contourlet transform allows re presenting contours in a more efficient way than the wavelets [5]. Fingerprint is made of only contours of ridges; hence Contourlet transform is more suitable for fingerprint processi ng than the wavelets. Therefore, we use Contourlet energy and co-occurrence signatures to c apture textural intricacies of images. After downsizing features with Plus l – take away r metho d, we test them on various classifiers: logistic regression, support vector machine and AdT ree using our databases consisting of 185 real, 90 Fun-Doh (Play-Doh and 150 Gummy fingerpri nt images. We then select the best classifier and use at as a base classifier to form an ensemble classifier obtained by fusing a stack of “K” base classifiers using the “Majority V oting Rule” (i.e. bagging. Experimental results indicate that, the new liveness detection a pproach is very promising as it needs only one fingerprint and no extra hardware to detect vitalit y.

  15. Partitioning and Scheduling DSP Applications with Maximal Memory Access Hiding

    Directory of Open Access Journals (Sweden)

    Sha Edwin Hsing-Mean

    2002-01-01

    Full Text Available This paper presents an iteration space partitioning scheme to reduce the CPU idle time due to the long memory access latency. We take into consideration both the data accesses of intermediate and initial data. An algorithm is proposed to find the largest overlap for initial data to reduce the entire memory traffic. In order to efficiently hide the memory latency, another algorithm is developed to balance the ALU and memory schedules. The experiments on DSP benchmarks show that the algorithms significantly outperform the known existing methods.

  16. A New Images Hiding Scheme Based on Chaotic Sequences

    Institute of Scientific and Technical Information of China (English)

    LIU Nian-sheng; GUO Dong-hui; WU Bo-xi; Parr G

    2005-01-01

    We propose a data hidding technique in a still image. This technique is based on chaotic sequence in the transform domain of covert image. We use different chaotic random sequences multiplied by multiple sensitive images, respectively, to spread the spectrum of sensitive images. Multiple sensitive images are hidden in a covert image as a form of noise. The results of theoretical analysis and computer simulation show the new hiding technique have better properties with high security, imperceptibility and capacity for hidden information in comparison with the conventional scheme such as LSB (Least Significance Bit).

  17. Text Hiding Based on True Color Image Classification

    OpenAIRE

    Shahd Abdul-Rhman Hasso

    2012-01-01

    In this work a new approach was built to apply k-means algorithm on true colored images (24bit images) which are usually treated by researchers as three image (RGB) that are classified to 15 class maximum only. We find the true image as 24 bit and classify it to more than 15 classes. As we know k-means algorithm classify images to many independent classes or features and we could increase the class number therefore we could hide information in the classes or features that have minimum number ...

  18. Approaches to Computer Modeling of Phosphate Hide-Out.

    Science.gov (United States)

    1984-06-28

    phosphate acts as a buffer to keep pH at a value above which acid corrosion occurs . and below which caustic corrosion becomes significant. Difficulties are...ionization of dihydrogen phosphate : HIPO - + + 1PO, K (B-7) H+ + - £Iao 1/1, (B-8) H , PO4 - + O- - H0 4 + H20 K/Kw (0-9) 19 * Such zero heat...OF STANDARDS-1963-A +. .0 0 0 9t~ - 4 NRL Memorandum Report 5361 4 Approaches to Computer Modeling of Phosphate Hide-Out K. A. S. HARDY AND J. C

  19. 一种基于形态学运算的指纹方向场计算方法%Fingerprint Orientation Estimation Based on Morphological Operation

    Institute of Scientific and Technical Information of China (English)

    官群健; 祝恩; 殷建平; 梁小龙; 赵建民

    2012-01-01

    Fingerprint recognition is one of the most popular methods for biometric authentication. In the process of recognition, the ridge orientation estimation is the most important step,since it serves for segmentation,enhancement,minutiae extraction and matching. We proposed a method for orientation estimation based on morphological operation to regulate the orientation field. The experience shows that this method can correctly and robustly estimate the fingerprint orientation field for low quality images, especially for those with creases.%指纹识别是生物认证技术中应用最为广泛的技术之一,其中指纹方向场计算是自动指纹识别系统中最关键的步骤,指纹图像预处理、特征提取和匹配的过程都以方向场为基础.因此提出一种基于对指纹图像方向场进行形态学运算的方向场计算方法.实验证明,该方法可以正确有效地计算低质量指纹图像,特别是褶皱类型指纹图像的方向场.

  20. Design of Collusion-Resistant Fingerprinting Systems: Review and New Results

    Science.gov (United States)

    Kuo, C.-C. Jay

    To protect the copyright of a media file, one idea is to develop a traitor tracing system that identifies its unauthorized distribution or usage by tracing fingerprints of illegal users (i.e., traitors). There exists a simple yet effective attack that can break a naive traitor tracing system easily known as the collusion attack. The design of a fingerprinting system that is robust against collusion attacks has been intensively studied in the last decade. A review of previous work in this field will be given. Most previous work deals with collusion attacks with equal weights or its variants (e.g., the cascade of several collusion attacks with equal weights). Consequently, the weight of each colluder is a constant throughout the collusion process. The collusion attack on continuous media such as audio and video with time-varying weights is simple to implement. However, we are not aware of any effective solution to this type of attacks. To address this problem, we first show that this can be formulated as a multi-user detection problem in a wireless communication system with a time-varying channel response. Being inspired by the multi-carrier code division multiaccess (MC-CDMA) technique, we propose a new fingerprinting system that consists of the following modules: 1) codeword generation with a multi-carrier approach, 2) colluder weight estimation, 3) advanced message symbol detection. We construct hiding codes with code spreading followed by multi-carrier modulation. For colluder weight estimation, we show that the colluder weight estimation is analogous to channel response estimation, which can be solved by inserting pilot signals in the embedded fingerprint. As to advanced message symbol detection, we replace the traditional correlation-based detector with the maximal ratio combining (MRC) detector and the parallel interference cancellation (PIC) multiuser detector. The superior performance of the proposed fingerprinting system in terms of user/colluder capacity

  1. Fingerprint separation: an application of ICA

    Science.gov (United States)

    Singh, Meenakshi; Singh, Deepak Kumar; Kalra, Prem Kumar

    2008-04-01

    Among all existing biometric techniques, fingerprint-based identification is the oldest method, which has been successfully used in numerous applications. Fingerprint-based identification is the most recognized tool in biometrics because of its reliability and accuracy. Fingerprint identification is done by matching questioned and known friction skin ridge impressions from fingers, palms, and toes to determine if the impressions are from the same finger (or palm, toe, etc.). There are many fingerprint matching algorithms which automate and facilitate the job of fingerprint matching, but for any of these algorithms matching can be difficult if the fingerprints are overlapped or mixed. In this paper, we have proposed a new algorithm for separating overlapped or mixed fingerprints so that the performance of the matching algorithms will improve when they are fed with these inputs. Independent Component Analysis (ICA) has been used as a tool to separate the overlapped or mixed fingerprints.

  2. A Preliminary Study of Fake Fingerprints

    Directory of Open Access Journals (Sweden)

    Qinghai Gao

    2014-11-01

    Full Text Available Fingerprint is a widely used biometrics. Its extensive usage motivates imposter to fabricate fake fingerprints. Vitality detection has been proposed to prevent counterfeit finger attack. Currently the detection can be done either during the process of acquiring fingerprint image or by comparing multiple sequentially acquired images. It is an ongoing research problem to detect whether a given fingerprint image is obtained from a real or a fake fingertip. In this paper we look into the differences between real and fake fingerprints as the first step to approach this problem. Specifically, we study the effects of different imaging sensors on the sizes of templates and on the matching scores between real and fake fingerprints. We also compare the fake fingerprints made from different materials. Experiments are carried out with two publicly available fingerprint databases and the findings are reported.

  3. Fingerprint fake detection by optical coherence tomography

    Science.gov (United States)

    Meissner, Sven; Breithaupt, Ralph; Koch, Edmund

    2013-03-01

    The most established technique for the identification at biometric access control systems is the human fingerprint. While every human fingerprint is unique, fingerprints can be faked very easily by using thin layer fakes. Because commercial fingerprint scanners use only a two-dimensional image acquisition of the finger surface, they can only hardly differentiate between real fingerprints and fingerprint fakes applied on thin layer materials. A Swept Source OCT system with an A-line rate of 20 kHz and a lateral and axial resolution of approximately 13 μm, a centre wavelength of 1320 nm and a band width of 120 nm (FWHM) was used to acquire fingerprints and finger tips with overlying fakes. Three-dimensional volume stacks with dimensions of 4.5 mm x 4 mm x 2 mm were acquired. The layering arrangement of the imaged finger tips and faked finger tips was analyzed and subsequently classified into real and faked fingerprints. Additionally, sweat gland ducts were detected and consulted for the classification. The manual classification between real fingerprints and faked fingerprints results in almost 100 % correctness. The outer as well as the internal fingerprint can be recognized in all real human fingers, whereby this was not possible in the image stacks of the faked fingerprints. Furthermore, in all image stacks of real human fingers the sweat gland ducts were detected. The number of sweat gland ducts differs between the test persons. The typical helix shape of the ducts was observed. In contrast, in images of faked fingerprints we observe abnormal layer arrangements and no sweat gland ducts connecting the papillae of the outer fingerprint and the internal fingerprint. We demonstrated that OCT is a very useful tool to enhance the performance of biometric control systems concerning attacks by thin layer fingerprint fakes.

  4. Fingerprint Indoor Position System Based

    Directory of Open Access Journals (Sweden)

    José Antonio Gómez Martin

    2013-01-01

    Full Text Available This paper presents a research and a development of a fingerprint-indoor-positioning system using the Received Signal Strength Indication (RSSI of a Wireless Sensor Network (WSN. The WSN implementation is based on two different protocol stacks: BitCloud and OpenMAC, a certified ZigBee Compliant Platform (ZCP and an IEEE 802.15.4 embedded software implementation respectively, both from Atmel, and the system uses two different fingerprint algorithms, Simple and Centroid. A comparative analysis of both algorithms using both protocol stacks implementations have been performed to ascertain the best WSN protocol stack and the best algorithm for positioning purposes.

  5. Forensic Chemistry: The Revelation of Latent Fingerprints

    Science.gov (United States)

    Friesen, J. Brent

    2015-01-01

    The visualization of latent fingerprints often involves the use of a chemical substance that creates a contrast between the fingerprint residues and the surface on which the print was deposited. The chemical-aided visualization techniques can be divided into two main categories: those that chemically react with the fingerprint residue and those…

  6. Indexing Fingerprint Databases Based on Multiple Features

    NARCIS (Netherlands)

    Boer, de Johan; Bazen, Asker M.; Gerez, Sabih H.

    2001-01-01

    In a fingerprint identification system, a person is identified only by his fingerprint. To accomplish this, a database is searched by matching all entries to the given fingerprint. However, the maximum size of the database is limited, since each match takes some amount of time and has a small probab

  7. Fingerprint Analysis with Marked Point Processes

    DEFF Research Database (Denmark)

    Forbes, Peter G. M.; Lauritzen, Steffen; Møller, Jesper

    We present a framework for fingerprint matching based on marked point process models. An efficient Monte Carlo algorithm is developed to calculate the marginal likelihood ratio for the hypothesis that two observed prints originate from the same finger against the hypothesis that they originate from...... different fingers. Our model achieves good performance on an NIST-FBI fingerprint database of 258 matched fingerprint pairs....

  8. Forensic Chemistry: The Revelation of Latent Fingerprints

    Science.gov (United States)

    Friesen, J. Brent

    2015-01-01

    The visualization of latent fingerprints often involves the use of a chemical substance that creates a contrast between the fingerprint residues and the surface on which the print was deposited. The chemical-aided visualization techniques can be divided into two main categories: those that chemically react with the fingerprint residue and those…

  9. Data Security by Preprocessing the Text with Secret Hiding

    Directory of Open Access Journals (Sweden)

    Ajit Singh

    2012-06-01

    Full Text Available With the advent of the Internet, an open forum, the massive increase in the data travel across networkmake an issue for secure transmission. Cryptography is the term that involves many encryption method to make data secure. But the transmission of the secure data is an intricate task. Steganography here comes with effect of transmission without revealing the secure data. The research paper provide the mechanism which enhance the security of data by using a crypto+stegano combination to increase the security level without knowing the fact that some secret data is sharing across networks. In the firstphase data is encrypted by manipulating the text using the ASCII codes and some random generated strings for the codes by taking some parameters. Steganography related to cryptography forms the basisfor many data hiding techniques. The data is encrypted using a proposed approach and then hide the message in random N images with the help of perfect hashing scheme which increase the security of the message before sending across the medium. Thus the sending and receiving of message will be safe and secure with an increased confidentiality.

  10. A Study of Various Steganographic Techniques Used for Information Hiding

    Directory of Open Access Journals (Sweden)

    C.P.Sumathi

    2013-12-01

    Full Text Available The art of information hiding has received much att ention in the recent years as security of informati on has become a big concern in this internet era. As shari ng of sensitive information via a common communicat ion channel has become inevitable, Steganography – the art and science of hiding information has gained much attention. We are also surrounded by a world of secret communi cation, where people of all types are transmitting information as innocent as an encrypte d credit card number to an online-store and as insidious as a terrorist plot to hijackers. Stegano graphy derives from the Greek word steganos, meanin g covered or secret, and graphy (writing or drawing [1]. Steganography is a technology where modern da ta compression, information theory, spread spectrum, a nd cryptography technologies are brought together t o satisfy the need for privacy on the Internet. This paper is an attempt to analyse the various tec hniques used in steganography and to identify areas in which thi s technique can be applied, so that the human race can be benefited at large

  11. A Novel Image Data Hiding Scheme with Diamond Encoding

    Directory of Open Access Journals (Sweden)

    Wu Hsien-Chu

    2009-01-01

    Full Text Available A novel data hiding scheme in digital images with the diamond encoding by pixel value adjustment is proposed. The proposed method is the extension of the exploiting modification direction (EMD embedding scheme. First, the process of embedding partitions the cover image into nonoverlapping blocks of two consecutive pixels and transforms the secret messages to a series of -ary digits. For each block, the diamond encoding technique is applied to calculate the diamond characteristic value, and one secret -ary digit is concealed into the diamond characteristic value. The diamond characteristic value is modified to secret digit and it can be obtained by adjusting pixel values in a block. This scheme is designed in such a way that the distortion of each block after diamond encoding is never out of the embedding parameter , and the block capacity is equal to . The diamond encoding provides an easy way to produce a more perceptible result than those yielded by simple least-significant-bit substitution methods. The embedded secret data can be extracted without the original cover image. Experimental results have demonstrated that the proposed method is capable of hiding more secret data while keeping the stego-image quality degradation imperceptible.

  12. Cryptographic Path Hardening: Hiding Vulnerabilities in Software through Cryptography

    CERN Document Server

    Ganesh, Vijay; Rinard, Martin

    2012-01-01

    We propose a novel approach to improving software security called Cryptographic Path Hardening, which is aimed at hiding security vulnerabilities in software from attackers through the use of provably secure and obfuscated cryptographic devices to harden paths in programs. By "harden" we mean that certain error-checking if-conditionals in a given program P are replaced by equivalent" we mean that adversaries cannot use semi-automatic program analysis techniques to reason about the hardened program paths and thus cannot discover as-yet-unknown errors along those paths, except perhaps through black-box dictionary attacks or random testing (which we can never prevent). Other than these unpreventable attack methods, we can make program analysis aimed at error-finding "provably hard" for a resource-bounded attacker, in the same sense that cryptographic schemes are hard to break. Unlike security-through-obscurity, in Cryptographic Path Hardening we use provably-secure crypto devices to hide errors and our mathemati...

  13. Error Concealment using Data Hiding in Wireless Image Transmission

    Directory of Open Access Journals (Sweden)

    A. Akbari

    2016-11-01

    Full Text Available The transmission of image/video over unreliable medium like wireless networks generally results in receiving a damaged image/video. In this paper, a novel image error concealment scheme based on the idea of data hiding and Set Partitioning In Hierarchical Trees (SPIHT coding is investigated. In the encoder side, the coefficients of wavelet decomposed image are partitioned into “perfect trees”. The SPIHT coder is applied to encode each per-fect tree independently and generate an efficiently compressed reference code. This code is then embedded into the coefficients of another perfect tree which is located in a different place, using a robust data hiding scheme based on Quantization Index Modulation (QIM. In the decoder side, if a part of the image is lost, the algorithm extracts the embedded code for reference trees related to this part to reconstruct the lost information. Performance results show that for an error prone transmission, the proposed technique is promising to efficiently conceal the lost areas of the transmitted image.

  14. A secure and robust information hiding technique for covert communication

    Science.gov (United States)

    Parah, S. A.; Sheikh, J. A.; Hafiz, A. M.; Bhat, G. M.

    2015-08-01

    The unprecedented advancement of multimedia and growth of the internet has made it possible to reproduce and distribute digital media easier and faster. This has given birth to information security issues, especially when the information pertains to national security, e-banking transactions, etc. The disguised form of encrypted data makes an adversary suspicious and increases the chance of attack. Information hiding overcomes this inherent problem of cryptographic systems and is emerging as an effective means of securing sensitive data being transmitted over insecure channels. In this paper, a secure and robust information hiding technique referred to as Intermediate Significant Bit Plane Embedding (ISBPE) is presented. The data to be embedded is scrambled and embedding is carried out using the concept of Pseudorandom Address Vector (PAV) and Complementary Address Vector (CAV) to enhance the security of the embedded data. The proposed ISBPE technique is fully immune to Least Significant Bit (LSB) removal/replacement attack. Experimental investigations reveal that the proposed technique is more robust to various image processing attacks like JPEG compression, Additive White Gaussian Noise (AWGN), low pass filtering, etc. compared to conventional LSB techniques. The various advantages offered by ISBPE technique make it a good candidate for covert communication.

  15. Fingerprints in Silicon: Towards a low-cost fingerprint detector

    NARCIS (Netherlands)

    Qin, M.; Van der Net, M.; Van Leuken, R.

    2008-01-01

    Several years ago the Circuit and System group started an MSc project with the goal of finding an optimal electronic system architecture which would be capable of identifying a person based on its fingerprint. Suppose that we can succeed to design a ‘personal smart card’, which is activated based on

  16. Comparison of effective Hough transform-based fingerprint alignment approaches

    CSIR Research Space (South Africa)

    Mlambo, CS

    2014-08-01

    Full Text Available points set with larger rotation and small number of points. The DRBA approach was found to perform better with minutiae points with large amount of translation, and the computational time was less than that of LMBA approach. However, the memory usage...

  17. Changes in latent fingerprint examiners' markup between analysis and comparison.

    Science.gov (United States)

    Ulery, Bradford T; Hicklin, R Austin; Roberts, Maria Antonia; Buscaglia, JoAnn

    2015-02-01

    After the initial analysis of a latent print, an examiner will sometimes revise the assessment during comparison with an exemplar. Changes between analysis and comparison may indicate that the initial analysis of the latent was inadequate, or that confirmation bias may have affected the comparison. 170 volunteer latent print examiners, each randomly assigned 22 pairs of prints from a pool of 320 total pairs, provided detailed markup documenting their interpretations of the prints and the bases for their comparison conclusions. We describe changes in value assessments and markup of features and clarity. When examiners individualized, they almost always added or deleted minutiae (90.3% of individualizations); every examiner revised at least some markups. For inconclusive and exclusion determinations, changes were less common, and features were added more frequently when the image pair was mated (same source). Even when individualizations were based on eight or fewer corresponding minutiae, in most cases some of those minutiae had been added during comparison. One erroneous individualization was observed: the markup changes were notably extreme, and almost all of the corresponding minutiae had been added during comparison. Latents assessed to be of value for exclusion only (VEO) during analysis were often individualized when compared to a mated exemplar (26%); in our previous work, where examiners were not required to provide markup of features, VEO individualizations were much less common (1.8%).

  18. 9 CFR 95.24 - Methods for disinfection of hides, skins, and other materials.

    Science.gov (United States)

    2010-01-01

    ... 9 Animals and Animal Products 1 2010-01-01 2010-01-01 false Methods for disinfection of hides... ENTRY INTO THE UNITED STATES § 95.24 Methods for disinfection of hides, skins, and other materials... subjected to disinfection by methods found satisfactory and approved from time to time by the Deputy...

  19. A method for removing adobe-type manure from hides using an oxidizing agent

    Science.gov (United States)

    Adobe-type (hardened) manure attached to bovine hair is a major source of meat contamination, hide quality deterioration, and devalued leather products. Therefore, it is important to develop cleaning solutions that can rapidly remove adobe-type manure to improve the quality of hides delivered to tan...

  20. Tactical deception to hide sexual behaviour : macaques use distance, not visibility

    NARCIS (Netherlands)

    Overduin-de Vries, A. M.; Spruijt, B. M.; de Vries, H.; Sterck, E. H. M.

    2015-01-01

    Although tactical deception (TD) may be employed to hide sexual behaviour, there is as yet no firm evidence for it. Hiding may be guided by cognitive mechanisms consistent with either no, low or high level TD, such as exploiting male peripheral positions (no TD), creating distance (TD level 1) or hi

  1. A Review on Reversible Data Hiding Scheme by Image Contrast Enhancement

    Directory of Open Access Journals (Sweden)

    Khushboo Lapa Patwari

    2016-09-01

    Full Text Available In present world demand of high quality images, security of the information on internet is one of the most important issues of research. Data hiding is a method of hiding a useful information by embedding it on another image (cover image to provide security and only the authorize person is able to extract the original information from the embedding data. This paper is a review which describes several different algorithms for Reversible Data Hiding (RDH. Previous literature has shown that histogram modification, histogram equalization (HE and interpolation are the most common methods for data hiding. To improve security these methods are used in encrypted images. This paper is a comprehensive study of all the major reversible data hiding approaches implemented as found in the literature.

  2. Proposed System for data hiding using Cryptography and Steganography Proposed System for data hiding using Cryptography and Steganography

    CERN Document Server

    Sarmah, Dipti Kapoor

    2010-01-01

    Steganography and Cryptography are two popular ways of sending vital information in a secret way. One hides the existence of the message and the other distorts the message itself. There are many cryptography techniques available; among them AES is one of the most powerful techniques. In Steganography we have various techniques in different domains like spatial domain, frequency domain etc. to hide the message. It is very difficult to detect hidden message in frequency domain and for this domain we use various transformations like DCT, FFT and Wavelets etc. In this project we are developing a system where we develop a new technique in which Cryptography and Steganography are used as integrated part along with newly developed enhanced security module. In Cryptography we are using AES algorithm to encrypt a message and a part of the message is hidden in DCT of an image; remaining part of the message is used to generate two secret keys which make this system highly secured. Keyword: Cryptography, Steganography, S...

  3. Longest Common Extensions via Fingerprinting

    DEFF Research Database (Denmark)

    Bille, Philip; Gørtz, Inge Li; Kristensen, Jesper

    2012-01-01

    query time, no extra space and no preprocessing achieves significantly better average case performance. We show a new algorithm, Fingerprint k , which for a parameter k, 1 ≤ k ≤ [log n], on a string of length n and alphabet size σ, gives O(k n1/k) query time using O(k n) space and O(k n + sort...

  4. Mother-young recognition in goitered gazelle during hiding period.

    Science.gov (United States)

    Blank, D A; Yang, W

    2017-09-01

    The mother-young recognition process is crucial for the growth and survival of progeny. In "follower" ungulate species, vocal and visual cues have been found to play a leading role in the mother-young identification process from the first days postpartum, with olfactory cues also important in establishing the initial selective mother-young bond immediately after birth. In "hider" species, however, much less has been documented of mother-young recognition behaviors, especially in their natural habitat. In this paper, we investigated this process in goitered gazelle (Gazella subgutturosa), a typical hider species, in its native environment in Kazakhstan. Over the course of our study period, we investigated the behaviors of 257 females with twins and 158 females with singles through visual observations. We found that within the first month after birth, when females spend only a short time with their young, mothers recognized their fawns using mostly olfactory cues, while vision was used to locate their hiding offspring. Fawns vocalized very rarely, producing only distress calls that did not seem intended for individual identification. Licking of young by their mothers was observed frequently, not only during the first week after birth, when this action was very important for fawn stimulation for a number of physiological functions, but for several weeks after (until one month of age), when licking lost its physiological importance and likely became more of a recognition procedure. Fawns did not recognize their mothers at all, either through vision or vocalizations, since during their first weeks after birth, they responded to any gazelle that approached their hiding area. By a month after birth, when mothers and fawns began to stay together for longer periods of time, their recognition process became more enhanced, and in addition to olfactory cues, the mother and her young began to use more and more visual cues for longer distance identification, as well as

  5. Hiding Secret Information in Movie Clip: A Steganographic Approach

    CERN Document Server

    Sahoo, G

    2011-01-01

    Establishing hidden communication is an important subject of discussion that has gained increasing importance nowadays with the development of the internet. One of the key methods for establishing hidden communication is steganography. Modern day steganography mainly deals with hiding information within files like image, text, html, binary files etc. These file contains small irrelevant information that can be substituted for small secret data. To store a high capacity secret data these carrier files are not very supportive. To overcome the problem of storing the high capacity secret data with the utmost security fence, we have proposed a novel methodology for concealing a voluminous data with high levels of security wall by using movie clip as a carrier file.

  6. An efficient steganography method for hiding patient confidential information.

    Science.gov (United States)

    Al-Dmour, Hayat; Al-Ani, Ahmed; Nguyen, Hung

    2014-01-01

    This paper deals with the important issue of security and confidentiality of patient information when exchanging or storing medical images. Steganography has recently been viewed as an alternative or complement to cryptography, as existing cryptographic systems are not perfect due to their vulnerability to certain types of attack. We propose in this paper a new steganography algorithm for hiding patient confidential information. It utilizes Pixel Value Differencing (PVD) to identify contrast regions in the image and a Hamming code that embeds 3 secret message bits into 4 bits of the cover image. In order to preserve the content of the region of interest (ROI), the embedding is only performed using the Region of Non-Interest (RONI).

  7. Analysis Of Aspects Of Messages Hiding In Text Environments

    Directory of Open Access Journals (Sweden)

    Afanasyeva Olesya

    2015-09-01

    Full Text Available In the work are researched problems, which arise during hiding of messages in text environments, being transmitted by electronic communication channels and the Internet. The analysis of selection of places in text environment (TE, which can be replaced by word from the message is performed. Selection and replacement of words in the text environment is implemented basing on semantic analysis of text fragment, consisting of the inserted word, and its environment in TE. For implementation of such analysis is used concept of semantic parameters of words coordination and semantic value of separate word. Are used well-known methods of determination of values of these parameters. This allows moving from quality level to quantitative level analysis of text fragments semantics during their modification by word substitution. Invisibility of embedded messages is ensured by providing preset values of the semantic cooperation parameter deviations.

  8. Reversible Data Hiding In Encrypted Images Using Improved Encryption Technique

    Directory of Open Access Journals (Sweden)

    Balika J. Chelliah

    2015-11-01

    Full Text Available Recently more and more attention is paid to reversible data hiding (RDH in encrypted images, since it maintains the excellent property that the original cover can be losslessly recovered after embedded data is extracted while protecting the image content‟s confidentiality. All previous methods embed data by reversibly vacating room from the encrypted images, which may be some errors on data extraction and/or image restoration. In this paper we propose a different scheme which attains real reversibility by reserving room before encryption with a traditional RDH algorithm, and then encrypting the data and embedding the data in the encrypted image, which is encrypted using a new proposed algorithm. The proposed method can achieve real reversibility that is data extraction and image recoveries are free of any error.

  9. Reversible Data Hiding In Encrypted Images Using Improved Encryption Technique

    Directory of Open Access Journals (Sweden)

    Mr. Balika J. Chelliah

    2014-03-01

    Full Text Available Recently more and more attention is paid to reversible data hiding (RDH in encrypted images, since it maintains the excellent property that the original cover can be losslessly recovered after embedded data is extracted while protecting the image content‟s confidentiality. All previous methods embed data by reversibly vacating room from the encrypted images, which may be some errors on data extraction and/or image restoration. In this paper we propose a different scheme which attains real reversibility by reserving room before encryption with a traditional RDH algorithm, and then encrypting the data and embedding the data in the encrypted image, which is encrypted using a new proposed algorithm. The proposed method can achieve real reversibility that is data extraction and image recoveries are free of any error.

  10. A Security Enhanced Robust Steganography Algorithm for Data Hiding

    Directory of Open Access Journals (Sweden)

    Siddharth Singh

    2012-05-01

    Full Text Available In this paper, a new robust steganography algorithm based on discrete cosine transform (DCT, Arnold transform and chaotic system is proposed. The chaotic system is used to generate a random sequence to be used for spreading data in the middle frequency band DCT coefficient of the cover image. The security is further enhanced by scrambling the secret data using Arnold Cat map before embedding. The recovery process is blind. A series of experiments is conducted to prove the security and robustness of the proposed algorithm. The experimental results demonstrate that the proposed algorithm achieves higher security and robustness against JPEG compression, addition of noise, low pass filtering and cropping attacks as compared to other existing algorithms for data hiding in the DCT domain.

  11. Statistical Hiding Fuzzy Commitment Scheme for Securing Biometric Templates

    Directory of Open Access Journals (Sweden)

    Alawi A. Al-Saggaf

    2013-04-01

    Full Text Available By considering the security flaws in cryptographic hash functions, any commitment scheme designed straight through hash function usage in general terms is insecure. In this paper, we develop a general fuzzy commitment scheme called an ordinary fuzzy commitment scheme (OFCS, in which many fuzzy commitment schemes with variety complexity assumptions is constructed. The scheme is provably statistical hiding (the advisory gets almost no statistically advantages about the secret message. The efficiency of our scheme offers different security assurance, and the trusted third party is not involved in the exchange of commitment.The characteristic of our scheme makes it useful for biometrics systems. If the biometrics template is compromised, then there is no way to use it directly again even in secure biometrics systems. This paper combines biometrics and OFCS to achieve biometric protection scheme using smart cards with renewability of protected biometrics template property.

  12. Accountable Metadata-Hiding Escrow: A Group Signature Case Study

    Directory of Open Access Journals (Sweden)

    Kohlweiss Markulf

    2015-06-01

    Full Text Available A common approach to demands for lawful access to encrypted data is to allow a trusted third party (TTP to gain access to private data. However, there is no way to verify that this trust is well placed as the TTP may open all messages indiscriminately. Moreover, existing approaches do not scale well when, in addition to the content of the conversation, one wishes to hide one’s identity. Given the importance of metadata this is a major problem. We propose a new approach in which users can retroactively verify cryptographically whether they were wiretapped. As a case study, we propose a new signature scheme that can act as an accountable replacement for group signatures, accountable forward and backward tracing signatures.

  13. Universal Steganalysis of Data Hiding in Grayscale Images

    Institute of Scientific and Technical Information of China (English)

    HUANG Ji-feng; LIN Jia-jun

    2007-01-01

    This paper proposed an universal steganalysis program based on quantification attack which can detect several kinds of data hiding algorithms for grayscale images. In practice, most techniques produce stego images that are perceptually identical to the cover images but exhibit statistical irregularities that distinguish them from cover images. Attacking the suspicious images using the quantization method, we can obtain statistically different from embedded-and-quantization attacked images and from quantization attacked-but-not-embedded sources. We have developed a technique based on one-class SVM for discriminating between cover-images and stego-images. Simulation results show our approach is able to distinguish between cover and stego images with reasonable accuracy.

  14. A Lossless Data Hiding Technique based on AES-DWT

    Directory of Open Access Journals (Sweden)

    Gustavo Fernandaacute;ndez Torres2

    2012-09-01

    Full Text Available In this paper we propose a new data hiding technique. The new technique uses steganography and cryptography on images with a size of 256x256 pixels and an 8-bit grayscale format. There are design restrictions such as a fixed-size cover image, and reconstruction without error of the hidden image. The steganography technique uses a Haar-DWT (Discrete Wavelet Transform with hard thresholding and LSB (Less Significant Bit technique on the cover image. The algorithms used for compressing and ciphering the secret image are lossless JPG and AES, respectively. The proposed technique is used to generate a stego image which provides a double type of security that is robust against attacks. Results are reported for different thresholds levels in terms of PSNR.

  15. Multi-Bit Data Hiding Scheme for Compressing Secret Messages

    Directory of Open Access Journals (Sweden)

    Wen-Chung Kuo

    2015-11-01

    Full Text Available The goal of data hiding techniques usually considers two issues, embedding capacity and image quality. Consequently, in order to achieve high embedding capacity and good image quality, a data hiding scheme combining run-length encoding (RLE with multi-bit embedding is proposed in this paper. This work has three major contributions. First, the embedding capacity is increased 62% because the secret message is compressed before embedding into the cover image. Secondly, the proposed scheme keeps the multi-bit generalized exploiting modification direction (MGEMD characteristics, which are effective to reduce modified pixels in the cover image and to maintain good stego image quality. Finally, the proposed scheme can prevent modern steganalysis methods, such as RS steganalysis and SPAM (subtractive pixel adjacency matrix, and is compared to MiPOD (minimizing the power of the optimal detector scheme. From our simulation results and security discussions, we have the following results: First, there are no perceivable differences between the cover images and stego images from human inspection. For example, the average PSNR of stego images is about 44.61 dB when the secret message (80,000 bits is embedded for test cover images (such as airplane, baboon, Lena of size 512×512. Secondly, Appl. Sci. 2015, 5 1034 on average, 222,087 pixels were not modified after embedding for the cover image. That is to say, 12% less pixels are modified as compared to the MGEMD method. From the performance discussions, the proposed scheme achieves high embedding capacity and good image quality, but also maintains stego image security.

  16. Sensitive plant (Mimosa pudica) hiding time depends on individual and state.

    Science.gov (United States)

    Reed-Guy, Sarah; Gehris, Connor; Shi, Meng; Blumstein, Daniel T

    2017-01-01

    The decisions animals make to adjust their antipredator behavior to rapidly changing conditions have been well studied. Inducible defenses in plants are an antipredator behavior that acts on a longer time scale, but sensitive plants, Mimosa pudica, have a much more rapid antipredator response; they temporarily close their leaves when touched. The time they remain closed is defined as hiding time. We studied hiding time in sensitive plants and found that individual plants differed significantly in their hiding times. We then showed that the effect of individual explained substantial variation in hiding time on a short time scale. Finally, on a longer time scale, individuality persisted but the amount of variation attributed to individual decreased. We hypothesized that variation in plant condition might explain this change. We therefore manipulated sunlight availability and quantified hiding time. When deprived of light for 6 h, sensitive plants significantly shortened their hiding times. But when only half a plant was deprived of light, hiding times on the deprived half and light exposed half were not significantly different. This suggests that overall condition best explains variation in sensitive plant antipredator behavior. Just like in animals, sensitive plant antipredator behavior is condition dependent, and, just like in animals, a substantial amount of the remaining variation is explained by individual differences between plants. Thus, models designed to predict plasticity in animal behavior may be successfully applied to understand behavior in other organisms, including plants.

  17. Sensitive plant (Mimosa pudica hiding time depends on individual and state

    Directory of Open Access Journals (Sweden)

    Sarah Reed-Guy

    2017-07-01

    Full Text Available The decisions animals make to adjust their antipredator behavior to rapidly changing conditions have been well studied. Inducible defenses in plants are an antipredator behavior that acts on a longer time scale, but sensitive plants, Mimosa pudica, have a much more rapid antipredator response; they temporarily close their leaves when touched. The time they remain closed is defined as hiding time. We studied hiding time in sensitive plants and found that individual plants differed significantly in their hiding times. We then showed that the effect of individual explained substantial variation in hiding time on a short time scale. Finally, on a longer time scale, individuality persisted but the amount of variation attributed to individual decreased. We hypothesized that variation in plant condition might explain this change. We therefore manipulated sunlight availability and quantified hiding time. When deprived of light for 6 h, sensitive plants significantly shortened their hiding times. But when only half a plant was deprived of light, hiding times on the deprived half and light exposed half were not significantly different. This suggests that overall condition best explains variation in sensitive plant antipredator behavior. Just like in animals, sensitive plant antipredator behavior is condition dependent, and, just like in animals, a substantial amount of the remaining variation is explained by individual differences between plants. Thus, models designed to predict plasticity in animal behavior may be successfully applied to understand behavior in other organisms, including plants.

  18. Sensor performance evaluation analysis of imitation fingerprint

    Science.gov (United States)

    Yu, Kyung-hee; Lee, Hyunsuk; Bae, You-suk

    2008-04-01

    The fingerprint recognition is the most developed field in the biometrics recognition and it can apply to the various applications. So the various studies are in progress for an enhancement of fingerprint recognition performance. In this paper, we will study the fingerprint recognition sensor. The fingerprint becomes input using fingerprint sensor to the fingerprint recognition system and the performance of the sensor has an effect on the fingerprint quality. Therefore, the improvement of system performance is possible by improving the performance of sensor. In this paper, we will study sensors which can be protected or unprotected from artificial fingerprint attack. We make various artificial fingerprints, and test sensors to overcome artificial fingerprint attack. We will analyze results of scanning test according to the various sensors and propose the method using the histogram of the normal image in order to measure the performance of these sensors. The measured characteristics are the resolution, shift, gradient, contrast, and rotation. The purpose of this paper is to propose the ways of the performance measurement which can be a criterion to evaluate the sensor performance.

  19. Enhancement of Fingerprint Extraction: Algorithms and Performance Evaluation

    Directory of Open Access Journals (Sweden)

    Priti Jain H. K. Sawant

    2012-04-01

    Full Text Available The fingerprint recognition problem can be grouped into two sub-domains: one is fingerprint verification and the other is fingerprint identification. In addition, different from the manual approach for fingerprint recognition by experts, the fingerprint recognition here is referred as Fingerprint Recognition System, which is program-based. Fingerprint verification is to verify the authenticity of one person by his fingerprint. The user provides his fingerprint together with his identity information like his ID number. The fingerprint verification system retrieves the fingerprint template according to the ID number and matches the template with the real-time acquired fingerprint from the user. Usually it is the underlying design principle of Fingerprint Authentication System.

  20. A Support Vector Machine Approach for Truncated Fingerprint Image Detection from Sweeping Fingerprint Sensors

    Directory of Open Access Journals (Sweden)

    Chi-Jim Chen

    2015-03-01

    Full Text Available A sweeping fingerprint sensor converts fingerprints on a row by row basis through image reconstruction techniques. However, a built fingerprint image might appear to be truncated and distorted when the finger was swept across a fingerprint sensor at a non-linear speed. If the truncated fingerprint images were enrolled as reference targets and collected by any automated fingerprint identification system (AFIS, successful prediction rates for fingerprint matching applications would be decreased significantly. In this paper, a novel and effective methodology with low time computational complexity was developed for detecting truncated fingerprints in a real time manner. Several filtering rules were implemented to validate existences of truncated fingerprints. In addition, a machine learning method of supported vector machine (SVM, based on the principle of structural risk minimization, was applied to reject pseudo truncated fingerprints containing similar characteristics of truncated ones. The experimental result has shown that an accuracy rate of 90.7% was achieved by successfully identifying truncated fingerprint images from testing images before AFIS enrollment procedures. The proposed effective and efficient methodology can be extensively applied to all existing fingerprint matching systems as a preliminary quality control prior to construction of fingerprint templates.

  1. A Support Vector Machine Approach for Truncated Fingerprint Image Detection from Sweeping Fingerprint Sensors

    Science.gov (United States)

    Chen, Chi-Jim; Pai, Tun-Wen; Cheng, Mox

    2015-01-01

    A sweeping fingerprint sensor converts fingerprints on a row by row basis through image reconstruction techniques. However, a built fingerprint image might appear to be truncated and distorted when the finger was swept across a fingerprint sensor at a non-linear speed. If the truncated fingerprint images were enrolled as reference targets and collected by any automated fingerprint identification system (AFIS), successful prediction rates for fingerprint matching applications would be decreased significantly. In this paper, a novel and effective methodology with low time computational complexity was developed for detecting truncated fingerprints in a real time manner. Several filtering rules were implemented to validate existences of truncated fingerprints. In addition, a machine learning method of supported vector machine (SVM), based on the principle of structural risk minimization, was applied to reject pseudo truncated fingerprints containing similar characteristics of truncated ones. The experimental result has shown that an accuracy rate of 90.7% was achieved by successfully identifying truncated fingerprint images from testing images before AFIS enrollment procedures. The proposed effective and efficient methodology can be extensively applied to all existing fingerprint matching systems as a preliminary quality control prior to construction of fingerprint templates. PMID:25835186

  2. A topology based approach to categorization of fingerprint images

    DEFF Research Database (Denmark)

    Aabrandt, A.; Olsen, M. A.; Busch, C.

    2012-01-01

    This paper discusses the use of betti numbers to characterize fingerprint and iris images. The goal is to automatically separate fingerprint images from non-fingerprint images; where non-fingerprint images of special interest are biometric samples which are not fingerprints. In this regard, an im...

  3. 基于方向图和 Gabor 滤波的指纹预处理算法%Preprocessing Algorithm for Fingerprint Image Based on Orientation and Gabor Filter

    Institute of Scientific and Technical Information of China (English)

    付玉虎; 杜月荣; 李哲哲

    2014-01-01

    The fingerprint image in preprocessing is often affected by many factors , but sometimes can not meet the requirements of fingerprint identification system .In this article , an effective fingerprint preprocessing algorithm is presented based on the tradi-tional methods for preprocessing .Firstly, a method based on block gradient variance is implemented to achieve the separation of the fingerprint image and the background area .Secondly , according to the fingerprint feature , we use orientation map and mean filter to enhance the image .And using simplified Gabor filter improves the filtering template to filter edge blur effect .After binari-zation, thinning and eliminating pseudo minutiae , we get the fingerprint image skeletonization and extract the fingerprint feature points.Experiments show that the preprocessing algorithm is applicable to images of different qualities and levels .It is flexible, efficient, easy, and accurate, meets the requirement of fingerprint identification system .%指纹图像在预处理过程中往往受多方面因素制约,有时无法满足指纹识别系统的要求。本文在传统指纹预处理算法基础上,给出一种有效的指纹预处理改进算法。首先,采用分块方差梯度分割算法分离指纹图像和背景区;再根据指纹特征,用方向图和均值滤波器进行图像增强,并用简化的Gabor滤波器,改进滤波模板滤除边缘模糊效应。二值化、细化并删除伪特征点后,提取出指纹脊线骨架并获得指纹特征点。实验表明,该预处理算法对不同质量的指纹图像均具有较好效果,算法灵活高效、易于实现、精确度高,达到了指纹识别系统的要求。

  4. FROG - Fingerprinting Genomic Variation Ontology.

    Directory of Open Access Journals (Sweden)

    E Abinaya

    Full Text Available Genetic variations play a crucial role in differential phenotypic outcomes. Given the complexity in establishing this correlation and the enormous data available today, it is imperative to design machine-readable, efficient methods to store, label, search and analyze this data. A semantic approach, FROG: "FingeRprinting Ontology of Genomic variations" is implemented to label variation data, based on its location, function and interactions. FROG has six levels to describe the variation annotation, namely, chromosome, DNA, RNA, protein, variations and interactions. Each level is a conceptual aggregation of logically connected attributes each of which comprises of various properties for the variant. For example, in chromosome level, one of the attributes is location of variation and which has two properties, allosomes or autosomes. Another attribute is variation kind which has four properties, namely, indel, deletion, insertion, substitution. Likewise, there are 48 attributes and 278 properties to capture the variation annotation across six levels. Each property is then assigned a bit score which in turn leads to generation of a binary fingerprint based on the combination of these properties (mostly taken from existing variation ontologies. FROG is a novel and unique method designed for the purpose of labeling the entire variation data generated till date for efficient storage, search and analysis. A web-based platform is designed as a test case for users to navigate sample datasets and generate fingerprints. The platform is available at http://ab-openlab.csir.res.in/frog.

  5. Automated FingerPrint Background removal: FPB

    Directory of Open Access Journals (Sweden)

    Morgante Michele

    2009-04-01

    Full Text Available Abstract Background The construction of a whole-genome physical map has been an essential component of numerous genome projects initiated since the inception of the Human Genome Project. Its usefulness has been proved for whole-genome shotgun projects as a post-assembly validation and recently it has also been used in the assembly step to constrain on BACs positions. Fingerprinting is usually the method of choice for construction of physical maps. A clone fingerprint is composed of true peaks representing real fragments and background peaks, mainly composed of E. coli genomic DNA, partial digestions, star activity by-products, and machine background. High-throughput fingerprinting leads to the production of thousands of BAC clone fingerprints per day. That is why background peaks removal has become an important issue and needs to be automatized, especially in capillary electrophoresis based fingerprints. Results At the moment, the only tools available for such a task are GenoProfiler and its descendant FPMiner. The large variation in the quality of fingerprints that is usually present in large fingerprinting projects represents a major difficulty in the correct removal of background peaks that has only been partially addressed by the methods so far adopted that all require a long manual optimization of parameters. Thus, we implemented a new data-independent tool, FPB (FingerPrint Background removal, suitable for large scale projects as well as mapping of few clones. Conclusion FPB is freely available at http://www.appliedgenomics.org/tools.php. FPB was used to remove the background from all fingerprints of three grapevine physical map projects. The first project consists of about 50,000 fingerprints, the second one consists of about 70,000 fingerprints, and the third one consists of about 45,000 fingerprints. In all cases a successful assembly was built.

  6. Secure Fingerprint Identification of High Accuracy

    Science.gov (United States)

    2014-01-01

    collections of biometric data in use today include, for example, fingerprint , face, and iris images collected by the US Department of Homeland Security...like to know whether the fingerprints they possess correspond to the same individual. In the above formulation, this is the problem of biometric ...solution using a homomorphic encryption scheme. FingerCodes use texture information from a fingerprint to compare two biometrics . The algo- rithm is

  7. The connecting link! Lip prints and fingerprints

    Directory of Open Access Journals (Sweden)

    Amita Negi

    2016-01-01

    Full Text Available Background: Lip prints and fingerprints are considered to be unique to each individual. The study of fingerprints and lip prints is very popular in personal identification of the deceased and in criminal investigations. Aims: This study was done to find the predominant lip and fingerprint patterns in males and females in the North Indian population and also to find any correlation between lip print and fingerprint patterns within a gender. Materials and Methods: Two hundred students (100 males, 100 females were included in the study. Lip prints were recorded for each individual using a dark-colored lipstick and the right thumb impression was recorded using an ink pad. The lip prints and fingerprints were analyzed using a magnifying glass. The Chi-square test was used for statistical analysis. Results: The branched pattern in males and the vertical pattern in females were the predominant lip print patterns. The predominant fingerprint pattern in both males and females was found to be the loop pattern, followed by the whorl pattern and then the arch pattern. No statistically significant correlation was found between lip prints and fingeprints. However, the arch type of fingerprint was found to be associated with different lip print patterns in males and females. Conclusion: Lip prints and fingerprints can be used for personal identification in a forensic scenario. Further correlative studies between lip prints and fingerprints could be useful in forensic science for gender identification.

  8. On the preliminary psychophysics of fingerprint identification.

    Science.gov (United States)

    Vokey, John R; Tangen, Jason M; Cole, Simon A

    2009-05-01

    For a century, the matching of images of fingerprints has been used for forensic identification. Despite that history, there have been no published, peer-reviewed studies directly examining the extent to which people can correctly match fingerprints to one another. The results of three experiments using naïve undergraduates to match images of fingerprints are reported. The results demonstrate that people can identify fingerprints quite well, and that matching accuracy can vary as a function of both source finger type and image similarity.

  9. Embedded Wireless Fingerprint Exam Affair Management

    Directory of Open Access Journals (Sweden)

    Yuan Yuan

    2013-01-01

    Full Text Available This thesis studies the design method of fingerprint identification module based on embedded system, which can realize the design of wireless fingerprint examination management system.This method reduces the hardware cost by building hardware environment whose platform is ARM9 microprocessor and MBF200 fingerprint sensor-integrated module. And, under the enviroment of Linux, adopting framework for embedded fingerprint identification system and introducing relevant technology about fingerprint identification, the design of distributed fingerprint identification system could be realized, which is low-cost and reliable. Meanwhile, by combining wireless network communication with Ethernet communication, it can maintain real time data exchanege with central data bank. This system adopts SQL Server database to manage usres baisc information and information data of their fingerprints characteristics and runs reliably. Comprehensive tests and practical application proved that fingerprint images collected by this system are more clear and less fuzzy. After being processed, the outlines of images are clear and have outstanding features, so that it is easy to classify and identify fingerprints. This system could be applied in the management of large-scale examinations and remote network examination. It also improves traditional checking way which identifies person by his holdings, and is the future direction of examination management.

  10. Transform Domain Fingerprint Identification Based on DTCWT

    Directory of Open Access Journals (Sweden)

    Jossy P. George

    2012-01-01

    Full Text Available The physiological biometric characteristics are better compared to behavioral biometric identification of human beings to identify a person. In this paper, we propose Transform Domain Fingerprint Identification Based on DTCWT. The original Fingerprint is cropped and resized to suitable dimension to apply DTCWT. The DTCWT is applied on Fingerprint to generate coefficient which form features. The performance analysis is discussed with different levels of DTCWT and also with different sizes of Fingerprint database. It is observed that the recognition rate is better in the case of level 7 compared to other levels of DTCWT.

  11. On the introduction of secondary fingerprint classification

    CSIR Research Space (South Africa)

    Msiza, IS

    2011-07-01

    Full Text Available of the fingerprint is extremely acute, hence ?x is extremely small. Figure 5 depicts all three A secondary fingerprint classes. 108 State of the Art in Biometrics On the Introduction of Secondary Fingerprint Classification 5 (a) A-1 secondary class (b) A-2... secondary class (c) A-3 secondary class Fig. 5. Fingerprint patterns that determine the A secondary classes. A-1 class: 0 cores & 0 deltas; A-2 class: equation 1; and A-3 class: equation 2 2.3 Left Loop (LL) primary class and its secondary classes...

  12. STUDY ON AUDIO INFORMATION HIDING METHOD BASED ON MODIFIED PHASE PARTITION

    Institute of Scientific and Technical Information of China (English)

    Tong Ming; Hao Chongyang; Liu Xiaojun; Chen Yanpu

    2005-01-01

    Hiding efficiency of traditional audio information hiding methods is always low since the sentience similarity cannot be guaranteed. A new audio information hiding method is proposed in this letter which can impose the insensitivity with the audio phase for auditory and realize the information hiding through specific algorithm in order to modify local phase within the auditory perception. The algorithm is to introduce the operation of "set 1" and "set 0" for every phase vectors, then the phases must lie on the boundary of a phase area after modified. If it lies on "1" boundary, it comes by set 1 operation. If it lies on "0" boundary, it comes by set 0 operation. The results show that, compared with the legacy method, the proposed method has better auditory similarity, larger information embedding capacity and lower code error rate. As a kind of blind detect method, it fits for application scenario without channel interference.

  13. A Blind High-Capacity Wavelet-Based Steganography Technique for Hiding Images into other Images

    Directory of Open Access Journals (Sweden)

    HAMAD, S.

    2014-05-01

    Full Text Available The flourishing field of Steganography is providing effective techniques to hide data into different types of digital media. In this paper, a novel technique is proposed to hide large amounts of image data into true colored images. The proposed method employs wavelet transforms to decompose images in a way similar to the Human Visual System (HVS for more secure and effective data hiding. The designed model can blindly extract the embedded message without the need to refer to the original cover image. Experimental results showed that the proposed method outperformed all of the existing techniques not only imperceptibility but also in terms of capacity. In fact, the proposed technique showed an outstanding performance on hiding a secret image whose size equals 100% of the cover image while maintaining excellent visual quality of the resultant stego-images.

  14. An evaluation of selected methods for the decontamination of cattle hides prior to skinning.

    Science.gov (United States)

    Small, A; Wells-Burr, B; Buncic, S

    2005-02-01

    The effectiveness of different decontamination treatments in reducing microbial loads on cattle hides was assessed. The 10-s hide treatments were conducted using a wet-and-dry vacuum cleaner filled with one of the liquids (heated to 50 °C) indicated below, followed or not by 10-min drying in the air. Also, the hide was clipped, followed or not by 10-s singeing using a hand-held blowtorch. Before and after each decontamination treatment, the hide was sampled (100 cm(2) areas) by a sponge-swabbing method to compare the total viable counts of bacteria (TVC). The largest bacterial reduction (Psanitizer solution (10% Betane Plus) resulted in significant reductions of 1.80 (Pefficacy of these treatments in the reduction of specific pathogens under commercial conditions.

  15. Motivation to hide emotion and children's understanding of the distinction between real and apparent emotions.

    Science.gov (United States)

    Gosselin, Pierre; Warren, Madeleine; Diotte, Michèle

    2002-12-01

    The authors investigated the extent to which children's understanding of the distinction between real and apparent emotions varied according to the motivation to hide emotions. Children, aged 6-7 and 10-11 years, were read stories designed to elicit either prosocial or self-protective motivated display rules and were asked to predict the facial expressions the protagonists would make to hide felt emotions. Children were found to understand the distinction between real and apparent emotions very well, independently of the type of motivation. Contrary to predictions, boys understood this distinction better than did girls when the motivation to hide positive emotions was prosocial. Children perceived neutralization as the most appropriate strategy to hide felt emotions, followed by masking.

  16. Insight into error hiding: exploration of nursing students' achievement goal orientations.

    Science.gov (United States)

    Dunn, Karee E

    2014-02-01

    An estimated 50% of medication errors go unreported, and error hiding is costly to hospitals and patients. This study explored one issue that may facilitate error hiding. Descriptive statistics were used to examine nursing students' achievement goal orientations in a high-fidelity simulation course. Results indicated that although this sample of nursing students held high mastery goal orientations, they also held moderate levels of performance-approach and performance-avoidance goal orientations. These goal orientations indicate that this sample is at high risk for error hiding, which places the benefits that are typically gleaned from a strong mastery orientation at risk. Understanding variables, such as goal orientation, that can be addressed in nursing education to reduce error hiding is an area of research that needs to be further explored. This article discusses the study results and evidence-based instructional practices for this sample's achievement goal orientation profile.

  17. 16 CFR 1630.61 - Hide carpets and rugs-alternative washing procedure.

    Science.gov (United States)

    2010-01-01

    ... natural “lay” of the hair structure for ten complete strokes. (8) Place test specimen in a circulating... wool or hair attached to the hide with no synthetic fibers and (2) have been treated with a fire...

  18. 16 CFR 1631.61 - Hide carpets and rugs-alternative washing procedure.

    Science.gov (United States)

    2010-01-01

    ... natural “lay” of the hair structure for ten complete strokes. (8) Place test specimen in a circulating... wool or hair attached to the hide with no synthetic fibers and (2) have been treated with a fire...

  19. No Place to Hide: Missing Primitive Stars Outside Milky Way Uncovered

    Science.gov (United States)

    2010-02-01

    , Sculptor, Sextans and Carina dwarf galaxies. Since the dwarf galaxies are typically 300 000 light years away - which is about three times the size of our Milky Way - only strong features in the spectrum could be measured, like a vague, smeared fingerprint. The team found that none of their large collection of spectral fingerprints actually seemed to belong to the class of stars they were after, the rare, extremely metal-poor stars found in the Milky Way. The team of astronomers around Starkenburg has now shed new light on the problem through careful comparison of spectra to computer-based models. They found that only subtle differences distinguish the chemical fingerprint of a normal metal-poor star from that of an extremely metal-poor star, explaining why previous methods did not succeed in making the identification. The astronomers also confirmed the almost pristine status of several extremely metal-poor stars thanks to much more detailed spectra obtained with the UVES instrument on ESO's Very Large Telescope. "Compared to the vague fingerprints we had before, this would be as if we looked at the fingerprint through a microscope," explains team member Vanessa Hill. "Unfortunately, just a small number of stars can be observed this way because it is very time consuming." "Among the new extremely metal-poor stars discovered in these dwarf galaxies, three have a relative amount of heavy chemical elements between only 1/3000 and 1/10 000 of what is observed in our Sun, including the current record holder of the most primitive star found outside the Milky Way," says team member Martin Tafelmeyer. "Not only has our work revealed some of the very interesting, first stars in these galaxies, but it also provides a new, powerful technique to uncover more such stars," concludes Starkenburg. "From now on there is no place left to hide!" Notes [1] According to the definition used in astronomy, "metals" are all the elements other than hydrogen and helium. Such metals, except for a very

  20. Information Theoretical Analysis of Identification based on Active Content Fingerprinting

    OpenAIRE

    Farhadzadeh, F Farzad; Willems, FMJ Frans; Voloshynovskiy, S

    2014-01-01

    Content fingerprinting and digital watermarking are techniques that are used for content protection and distribution monitoring. Over the past few years, both techniques have been well studied and their shortcomings understood. Recently, a new content fingerprinting scheme called {\\em active content fingerprinting} was introduced to overcome these shortcomings. Active content fingerprinting aims to modify a content to extract robuster fingerprints than the conventional content fingerprinting....

  1. Fingerprint image enhancement via log-Gabor filtering

    Science.gov (United States)

    Lu, Zhen-kun; Yu, Zhen-ming

    2011-11-01

    In this paper, a method to enhance the fingerprint image by using Log-Gabor filters is proposed. Firstly, a filter for extracting fingerprint image texture feature is designed. Then, the high frequency components of fingerprint image are extracted by filtering. Finally, the fingerprint image details can be improved by enhancing high frequency components. Experimental results show that the proposed algorithm can effectively improve the quality of fingerprint image and the reliability of fingerprint identification.

  2. Fingerprint Recognition: Enhancement, Feature Extraction and Automatic Evaluation of Algorithms

    OpenAIRE

    Turroni, Francesco

    2012-01-01

    The identification of people by measuring some traits of individual anatomy or physiology has led to a specific research area called biometric recognition. This thesis is focused on improving fingerprint recognition systems considering three important problems: fingerprint enhancement, fingerprint orientation extraction and automatic evaluation of fingerprint algorithms. An effective extraction of salient fingerprint features depends on the quality of the input fingerprint. If the fingerp...

  3. ORIENTATION FIELD RECONSTRUCTION OF ALTERED FINGERPRINT USING ORTHOGONAL WAVELETS

    OpenAIRE

    Mini M.G; Anoop T.R.

    2016-01-01

    Ridge orientation field is an important feature for fingerprint matching and fingerprint reconstruction. Matching of the altered fingerprint against its unaltered mates can be done by extracting the available features in the altered fingerprint and using it along with approximated ridge orientation. This paper presents a method for approximating ridge orientation field of altered fingerprints. In the proposed method, sine and cosine of doubled orientation of the fingerprint is decomposed usin...

  4. Information theoretical analysis of identification based on active content fingerprinting

    OpenAIRE

    Farhadzadeh, F Farzad; Willems, FMJ Frans; Voloshynovskiy, S

    2014-01-01

    Content fingerprinting and digital watermarking are techniques that are used for content protection and distribution monitoring. Over the past few years, both techniques have been well studied and their shortcomings understood. Recently, a new content fingerprinting scheme called {\\em active content fingerprinting} was introduced to overcome these shortcomings. Active content fingerprinting aims to modify a content to extract robuster fingerprints than the conventional content fingerprinting....

  5. DNA-based cryptographic methods for data hiding in DNA media.

    Science.gov (United States)

    Marwan, Samiha; Shawish, Ahmed; Nagaty, Khaled

    2016-12-01

    Information security can be achieved using cryptography, steganography or a combination of them, where data is firstly encrypted using any of the available cryptography techniques and then hid into any hiding medium. Recently, the famous genomic DNA has been introduced as a hiding medium, known as DNA steganography, due to its notable ability to hide huge data sets with a high level of randomness and hence security. Despite the numerous cryptography techniques, to our knowledge only the vigenere cipher and the DNA-based playfair cipher have been combined with the DNA steganography, which keeps space for investigation of other techniques and coming up with new improvements. This paper presents a comprehensive analysis between the DNA-based playfair, vigenere, RSA and the AES ciphers, each combined with a DNA hiding technique. The conducted analysis reports the performance diversity of each combined technique in terms of security, speed, hiding capacity in addition to both key size and data size. Moreover, this paper proposes a modification of the current combined DNA-based playfair cipher technique, which makes it not only simple and fast but also provides a significantly higher hiding capacity and security. The conducted extensive experimental studies confirm such outstanding performance in comparison with all the discussed combined techniques. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

  6. Hiding effort to gain a competitive advantage: Evidence from China.

    Science.gov (United States)

    Zhao, Li; Heyman, Gail D

    2016-06-06

    Previous studies with Western populations have shown that adolescents' tendency to downplay their academic effort is affected by two kinds of motives: ability-related motives (e.g., to appear competent) and social approval motives (e.g., to be popular). In this research, we test for the presence of additional competition-related motives in China, a culture placing strong emphasis on academic competition. Study 1 (N = 150) showed that, in response to a scenario in which a hard-working high-school junior hid effort from classmates, the most highly endorsed explanation was "to influence others to work less hard to maintain a competitive advantage." Study 2 (N = 174) revealed that competition-related explanations were endorsed relatively more often when the speaker and audience had similar academic rankings. This tendency was most evident when both speaker and audience were top performers, and when this was the case, participants' desire to demonstrate superiority over others was a positive predictor of endorsement of competition-related motives. Study 3 (N = 137) verified that competition-related motives were more strongly endorsed among Chinese participants than U.S. These results suggest that at least in cultures that emphasize academic competition and in contexts where competition is salient, hiding effort is often about attempting to gain strategic advantage. © 2016 International Union of Psychological Science.

  7. Steganographic Approach for Data Hiding using LSB Techniques

    Directory of Open Access Journals (Sweden)

    Baluram Nagaria , Ashish Parikh ,Sandeep Mandliya ,Neeraj shrivastav

    2012-12-01

    Full Text Available Today’s all the multimedia work done via internet so it’s an urgent need to protect the data from malicious attacks. This lead to the research in the area of Digital watermarking and cryptography which intends to protect the copyright information of the intellectuals. In this paper a DCT based steganography scheme is proposed which provides higher resistance to image processing attacks such as JPEG compression, noise, rotation, translation etc Steganography has been implemented In MATLAB7.6 using basic image processing techniques. Steganography is the technique of hiding confidential information within any media. Steganography is often confused with cryptography because the two are similar in the way that they both are used to protect confidential information But we have design a simulator in which we have transmit our data via mail or LAN. For securing the data, this will be password protected. For design this simulator we have encrypted our data and after that without password we will not decrypted the data. Our all conclusion is that we will secure our information. The difference between the two is in the appearance in the processed output; the output of Steganography operation is not apparently visible but in cryptography the output is scrambled so that it can draw attention. In this paper, we have tried to elucidate the different approaches towards implementation of Steganography using ‘multimedia’ file (text, static image, audio and video and Network IP datagram as cover.

  8. Experimental Test of Quantum No-Hiding Theorem

    CERN Document Server

    Samal, Jharana Rani; Kumar, Anil

    2010-01-01

    Linearity and unitarity are two fundamental tenets of quantum theory. Any consequence that follows from these must be respected in the quantum world. The no-cloning theorem and the no-deleting theorem are the consequences of the linearity and the unitarity. Together with the stronger no-cloning theorem they provide permanence to quantum information, thus, suggesting that in the quantum world information can neither be created nor be destroyed. In this sense quantum information is robust, but at the same time it is also fragile because any interaction with the environment may lead to loss of information. Recently, another fundamental theorem was proved, namely, the no-hiding theorem that addresses precisely the issue of information loss. It says that if any physical process leads to bleaching of quantum information from the original system, then it must reside in the rest of the universe with no information being hidden in the correlation between these two subsystems. This has applications in quantum teleporta...

  9. Confidential Data Hiding Using Wavlet Based Ecg Stegnography

    Directory of Open Access Journals (Sweden)

    Malashree K S

    2014-05-01

    Full Text Available With the growing number of aging population and a significant portion of that suffering from cardiac diseases, it is conceivable that remote ECG patient monitoring systems are expected to be widely used as Point-of-Care (PoC applications in hospitals around the world. Therefore, huge amount of ECG signal collected by Body Sensor Networks (BSNs from remote patients at homes will be transmitted along with other physiological readings such as blood pressure, temperature, glucose level etc. and diagnosed by those remote patient monitoring systems. It is utterly important that patient confidentiality is protected while data is being transmitted over the public network as well as when they are stored in hospital servers used by remote monitoring systems. In this project, a wavelet based steganography technique has been introduced which combines encryption and scrambling technique to protect patient confidential data. The proposed method allows ECG signal to hide its corresponding patient confidential data and other physiological information thus guaranteeing the integration between ECG and the rest.

  10. Understanding the sufficiency of information for latent fingerprint value determinations.

    Science.gov (United States)

    Ulery, Bradford T; Hicklin, R Austin; Kiebuzinski, George I; Roberts, Maria Antonia; Buscaglia, Joann

    2013-07-10

    A latent print examiner's assessment of the value, or suitability, of a latent impression is the process of determining whether the impression has sufficient information to make a comparison. A "no value" determination preemptively states that no individualization or exclusion determination could be made using the impression, regardless of quality of the comparison prints. Factors contributing to a value determination include clarity and the types, quantity, and relationships of features. These assessments are made subjectively by individual examiners and may vary among examiners. We modeled the relationships between value determinations and feature annotations made by 21 certified latent print examiners on 1850 latent impressions. Minutia count was strongly associated with value determinations. None of the models resulted in a stronger intraexaminer association with "value for individualization" determinations than minutia count alone. The association between examiner annotation and value determinations is greatly limited by the lack of reproducibility of both annotation and value determinations.

  11. Fingerprint prediction using classifier ensembles

    CSIR Research Space (South Africa)

    Molale, P

    2011-11-01

    Full Text Available -based learning algorithms. Machine Learning, 6: pp: 37-66. Amit, Y., D. Geman, and K. Wilder, 1997. Joint Induction of Shape Features and Tree Classifiers. IEEE Transc. on Pattern Anal. and machine Intell., 19 (11), pp: 1300- 1305. Breiman, L., 1996. Bagging.... NIST Technical Report NISTIR 5163. Cappelli, R., A. Lumini, D. Maio., and D. Maltoni, 1999. Fingerprint Classification by Direct image Partitioning. IEEE Transc. On Pattern Anal. and Machine Intell., 21 (5), pp: 402-421. Cox, D.R., 1966. Some...

  12. Bactome, I: Python in DNA Fingerprinting

    Directory of Open Access Journals (Sweden)

    2010-09-01

    Full Text Available Bactome is a collection of Python functions to find primers suitable for DNA fingerprinting, determine restriction digestion profile, and analyse the resulting DNA fingerprint features as migration distance of the bands in gel electrophoresis. An actual use case will be presented as a case study. These codes are licensed under Lesser General Public Licence version 3.

  13. Anonymous Fingerprinting with Robust QIM Watermarking Techniques

    NARCIS (Netherlands)

    Prins, J.P.; Erkin, Z.; Lagendijk, R.L.

    2007-01-01

    Fingerprinting is an essential tool to shun legal buyers of digital content from illegal redistribution. In fingerprinting schemes, the merchant embeds the buyer's identity as a watermark into the content so that the merchant can retrieve the buyer's identity when he encounters a redistributed copy.

  14. DNA Fingerprinting in a Forensic Teaching Experiment

    Science.gov (United States)

    Wagoner, Stacy A.; Carlson, Kimberly A.

    2008-01-01

    This article presents an experiment designed to provide students, in a classroom laboratory setting, a hands-on demonstration of the steps used in DNA forensic analysis by performing DNA extraction, DNA fingerprinting, and statistical analysis of the data. This experiment demonstrates how DNA fingerprinting is performed and how long it takes. It…

  15. Fingerprint Image Enhancement:Segmentation to Thinning

    Directory of Open Access Journals (Sweden)

    Iwasokun Gabriel Babatunde

    2012-01-01

    Full Text Available Fingerprint has remained a very vital index for human recognition. In the field of security, series of Automatic Fingerprint Identification Systems (AFIS have been developed. One of the indices for evaluating the contributions of these systems to the enforcement of security is the degree with which they appropriately verify or identify input fingerprints. This degree is generally determined by the quality of the fingerprint images and the efficiency of the algorithm. In this paper, some of the sub-models of an existing mathematical algorithm for the fingerprint image enhancement were modified to obtain new and improved versions. The new versions consist of different mathematical models for fingerprint image segmentation, normalization, ridge orientation estimation, ridge frequency estimation, Gabor filtering, binarization and thinning. The implementation was carried out in an environment characterized by Window Vista Home Basic operating system as platform and Matrix Laboratory (MatLab as frontend engine. Synthetic images as well as real fingerprints obtained from the FVC2004 fingerprint database DB3 set A were used to test the adequacy of the modified sub-models and the resulting algorithm. The results show that the modified sub-models perform well with significant improvement over the original versions. The results also show the necessity of each level of the enhancement.

  16. Image enhancement method for fingerprint recognition system.

    Science.gov (United States)

    Li, Shunshan; Wei, Min; Tang, Haiying; Zhuang, Tiange; Buonocore, Michael

    2005-01-01

    Image enhancement plays an important role in Fingerprint Recognition System. In this paper fingerprint image enhancement method, a refined Gabor filter, is presented. This enhancement method can connect the ridge breaks, ensures the maximal gray values located at the ridge center and has the ability to compensate for the nonlinear deformations. The result shows it can improve the performance of image enhancement.

  17. Fingerprint segmentation based on hidden Markov models

    NARCIS (Netherlands)

    Klein, S.; Bazen, A.M.; Veldhuis, R.N.J.

    2002-01-01

    An important step in fingerprint recognition is segmentation. During segmentation the fingerprint image is decomposed into foreground, background and low-quality regions. The foreground is used in the recognition process, the background is ignored. The low-quality regions may or may not be used, dep

  18. Predicting the performance of fingerprint similarity searching.

    Science.gov (United States)

    Vogt, Martin; Bajorath, Jürgen

    2011-01-01

    Fingerprints are bit string representations of molecular structure that typically encode structural fragments, topological features, or pharmacophore patterns. Various fingerprint designs are utilized in virtual screening and their search performance essentially depends on three parameters: the nature of the fingerprint, the active compounds serving as reference molecules, and the composition of the screening database. It is of considerable interest and practical relevance to predict the performance of fingerprint similarity searching. A quantitative assessment of the potential that a fingerprint search might successfully retrieve active compounds, if available in the screening database, would substantially help to select the type of fingerprint most suitable for a given search problem. The method presented herein utilizes concepts from information theory to relate the fingerprint feature distributions of reference compounds to screening libraries. If these feature distributions do not sufficiently differ, active database compounds that are similar to reference molecules cannot be retrieved because they disappear in the "background." By quantifying the difference in feature distribution using the Kullback-Leibler divergence and relating the divergence to compound recovery rates obtained for different benchmark classes, fingerprint search performance can be quantitatively predicted.

  19. DNA Fingerprinting in a Forensic Teaching Experiment

    Science.gov (United States)

    Wagoner, Stacy A.; Carlson, Kimberly A.

    2008-01-01

    This article presents an experiment designed to provide students, in a classroom laboratory setting, a hands-on demonstration of the steps used in DNA forensic analysis by performing DNA extraction, DNA fingerprinting, and statistical analysis of the data. This experiment demonstrates how DNA fingerprinting is performed and how long it takes. It…

  20. Integrated fingerprinting in secure digital cinema projection

    Science.gov (United States)

    Delannay, Damien; Delaigle, Jean-Francois; Macq, Benoit M. M.; Quisquater, Jean-Jacques; Mas Ribes, Joan M.; Boucqueau, Jean M.; Nivart, Jean-Francois

    2001-12-01

    This paper describes the functional model of a combined conditional access and fingerprinting copyright (-or projectionright) protection system in a digital cinema framework. In the cinema industry, a large part of early movie piracy comes from copies made in the theater itself with a camera. The evolution towards digital cinema broadcast enables watermark based fingerprinting protection systems. Besides an appropriate fingerprinting technology, a number of well defined security/cryptographic tools are integrated in order to guaranty the integrity of the whole system. The requirements are two-fold: On one side, we must ensure that the media content is only accessible at exhibition time (under specific authorization obtained after an ad-hoc film rental agreement) and contains the related exhibition fingerprint. At the other end, we must prove our ability to retrieve the fingerprint information from an illegal copy of the media.

  1. Slowflow fingerprints of urban hydrology

    Science.gov (United States)

    Schwartz, Stuart S.; Smith, Brennan

    2014-07-01

    Urban streamflow is commonly characterized by increased peak discharges and runoff volumes. Slowflow integrates altered storage and transit times affecting urban recharge and drainage, resulting in a highly variable indeterminate urban slowflow response. This study introduces the use of multiple baseflow metrics to characterize and interpret the dominant processes driving urban slowflow response. Slowflow characteristics derived from USGS streamflow records are used to quantify the patterns of hydrologic alteration across the rural-to-urban landuse gradient in the Piedmont watersheds of the Baltimore Ecosystem Study (BES), an NSF Urban Long Term Ecological Research (LTER) site in the Baltimore Metropolitan area. We interpret multimetric slowflow response from a top-down perspective, learning from data, in order to draw dominant process inferences from observed slowflow. When characterized by a single slowflow metric such as the baseflow index, urban slowflow response can exhibit equifinality and is not reliably predicted a priori. Multimetric analysis quantifies distinct differences in urban slowflow response, framing testable hypotheses and refined experimental designs to elucidate the dominant processes driving urban slowflow. Multimetric fingerprinting offers a consistent framework for interpreting urban slowflow response, constrained by the equifinality of single slowflow metrics and the inherent limitations on process inferences that can be drawn from gauged streamflow alone. Heterogeneity of observed slowflow belies the simple paradigm of a single consistent type of urban slowflow response. In contrast, we suggest a conceptual typology of urban slowflow response, framing a conceptual mixing model of dominant process endpoints that shape the slowflow fingerprints of urban hydrology.

  2. Analysis and comparison of 2D fingerprints: insights into database screening performance using eight fingerprint methods.

    Science.gov (United States)

    Duan, Jianxin; Dixon, Steven L; Lowrie, Jeffrey F; Sherman, Woody

    2010-09-01

    Virtual screening is a widely used strategy in modern drug discovery and 2D fingerprint similarity is an important tool that has been successfully applied to retrieve active compounds from large datasets. However, it is not always straightforward to select an appropriate fingerprint method and associated settings for a given problem. Here, we applied eight different fingerprint methods, as implemented in the new cheminformatics package Canvas, on a well-validated dataset covering five targets. The fingerprint methods include Linear, Dendritic, Radial, MACCS, MOLPRINT2D, Pairwise, Triplet, and Torsion. We find that most fingerprints have similar retrieval rates on average; however, each has special characteristics that distinguish its performance on different query molecules and ligand sets. For example, some fingerprints exhibit a significant ligand size dependency whereas others are more robust with respect to variations in the query or active compounds. In cases where little information is known about the active ligands, MOLPRINT2D fingerprints produce the highest average retrieval actives. When multiple queries are available, we find that a fingerprint averaged over all query molecules is generally superior to fingerprints derived from single queries. Finally, a complementarity metric is proposed to determine which fingerprint methods can be combined to improve screening results.

  3. Information Hiding and Countermeasures%信息隐藏技术及其攻击方法

    Institute of Scientific and Technical Information of China (English)

    吴树峰; 黄刘生; 卢继军; 陈国良

    2003-01-01

    Information Hiding Technology has a long history. With the development of Digital Technology,it has become a newly evolved discipline and a hot research area. Since the first Information Hiding Workshop held in 1996 ,thetechnology has been widely applied to areas such as multimedia ,signal processing and protection of software Intellectual Property,but the research work in secure communication is relatively fewer. Based on success of developing asteganography tool for communication,this article summarizes the current progress in the research of InformationHiding Technology systematically, and analyzes possible countermeasures against various Information Hiding techniques.

  4. The Costs of Hiding and Faking Emotions: The Case of Extraverts and Introverts.

    Science.gov (United States)

    Seger-Guttmann, Tali; Medler-Liraz, Hana

    2016-01-01

    The present study examined the moderation effects of extraversion on the relationships between hiding and faking emotions, perceived satisfaction from intimate relationships, and reported physical health concerns. Four hundred and four Israeli participants, who were all involved in intimate relationships at the time of the study, responded to the Extraversion scale from the Big-Five Inventory, the DEELS to measure hiding and faking emotions, the SELF to assess physical health concerns, and the short version of the ENRICH to evaluate perceived satisfaction with intimate relationships. The mean age was 32.3 years (SD = 8.2); and the average length of time as a couple was 7.8 years (SD = 8.2). Of the participants, 198 were married (48.5%). The findings indicate that the effect of hiding negative emotions was stronger for perceived satisfaction with intimate relationships and physical health concerns than that for faking positive emotions. Extraverts who showed a higher frequency of hiding their negative emotions were significantly less satisfied with their relationships than introverts and they also tended to report more concerns with their physical health. These results were not found when extraverts reported a high frequency of faking positive emotions. These results are discussed in the context of the trait-behavior-concordance model and stress the importance of distinguishing faking from hiding.

  5. Association Rule Hiding Techniques for Privacy Preserving Data Mining: A Study

    Directory of Open Access Journals (Sweden)

    Gayathiri P

    2015-12-01

    Full Text Available Association rule mining is an efficient data mining technique that recognizes the frequent items and associative rule based on a market basket data analysis for large set of transactional databases. The probability of most frequent data item occurrence of the transactional data items are calculated to present the associative rule that represents the habits of buying products of the customers in demand. Identifying associative rules of a transactional database in data mining may expose the confidentiality and privacy of an organization and individual. Privacy Preserving Data Mining (PPDM is a solution for privacy threats in data mining. This issue is solved using Association Rule Hiding (ARH techniques in Privacy Preserving Data Mining (PPDM. This research work on Association Rule Hiding technique in data mining performs the generation of sensitive association rules by the way of hiding based on the transactional data items. The property of hiding rules not the data makes the sensitive rule hiding process is a minimal side effects and higher data utility technique.

  6. ORIENTATION FIELD RECONSTRUCTION OF ALTERED FINGERPRINT USING ORTHOGONAL WAVELETS

    Directory of Open Access Journals (Sweden)

    Mini M.G.

    2016-11-01

    Full Text Available Ridge orientation field is an important feature for fingerprint matching and fingerprint reconstruction. Matching of the altered fingerprint against its unaltered mates can be done by extracting the available features in the altered fingerprint and using it along with approximated ridge orientation. This paper presents a method for approximating ridge orientation field of altered fingerprints. In the proposed method, sine and cosine of doubled orientation of the fingerprint is decomposed using orthogonal wavelets and reconstructed back using only the approximation coefficients. No prior information about the singular points is needed for orientation approximation. The method is found suitable for orientation estimation of low quality fingerprint images also.

  7. FINGERPRINTING SCHEME FOR FILE SHARING IN TRANSFORM DOMAIN

    Directory of Open Access Journals (Sweden)

    S.Manikandaprabu

    2011-08-01

    Full Text Available Fingerprinting scheme plays an important role for file sharing. In this paper, a novel method is introduced for fingerprinting an image. The proposed method uses wavelet and Principal Component Analysis (PCA techniques for fingerprint generation. Fingerprinting is done two phases. During, first phase wavelet techniques are used to obtain low frequency representation of the test image. In second phase, PCA finds the features of the representation; set of fingerprint matrices can be created based on a proposed algorithm. Finally, each matrixcombined with the low frequency representation to become a unique fingerprinted matrix. Size of the fingerprinted image is very small but it has most important information. Without this information, quality of the reconstructed image is very poor. We use different wavelet for fingerprint generation. Based on the performance, it is found that the DB6 is the best choice for fingerprint generation. Fingerprinted file is more suitable for distribution of file in peer-2-peer (p2p networks.

  8. Sex Determination from Fingerprint Ridge Density

    Directory of Open Access Journals (Sweden)

    Dr. Sudesh Gungadin

    2007-07-01

    Full Text Available This study was conducted with an aim to establish a relationship between sex and fingerprint ridge density. The fingerprints were taken from 500 subjects (250 males and 250 females in the age group of 18-60 years. After taking fingerprints, the ridges were counted in the upper portion of the radial border of each print for all ten fingers and mean value was calculated. The results have shown that a finger print ridge of 14 ridges/25 mm2 is more likely of female origin. It has been successful to support the hypothesis that women tend to have a statistically significant greater ridge density than men.

  9. Mated Fingerprint Card Pairs 2 (MFCP2)

    Science.gov (United States)

    NIST Mated Fingerprint Card Pairs 2 (MFCP2) (PC database for purchase)   NIST Special Database 14 is being distributed for use in development and testing of automated fingerprint classification and matching systems on a set of images which approximate a natural horizontal distribution of the National Crime Information Center (NCIC) fingerprint classes. A newer version of the compression/decompression software on the CDROM can be found at the website http://www.nist.gov/itl/iad/ig/nigos.cfm as part of the NBIS package.

  10. Study Questions Reliability of Fingerprint Evidence

    Institute of Scientific and Technical Information of China (English)

    James; Randerson; 陈易

    2007-01-01

    The reliability of fingerprint has been called into question by a study that tested whether forensic experts make consistent judgments on print matches.Despite the perceived infallibility of fingerprint evidence, the study found that experts do not always make the same judgment on whether a print matches a mark at a crime scene when presented with the same evidence twice.The findings come in the wake of two high profile cases in which fingerprint matches were subsequently shown to be wrong. The Scottish ...

  11. Molecular fingerprint similarity search in virtual screening.

    Science.gov (United States)

    Cereto-Massagué, Adrià; Ojeda, María José; Valls, Cristina; Mulero, Miquel; Garcia-Vallvé, Santiago; Pujadas, Gerard

    2015-01-01

    Molecular fingerprints have been used for a long time now in drug discovery and virtual screening. Their ease of use (requiring little to no configuration) and the speed at which substructure and similarity searches can be performed with them - paired with a virtual screening performance similar to other more complex methods - is the reason for their popularity. However, there are many types of fingerprints, each representing a different aspect of the molecule, which can greatly affect search performance. This review focuses on commonly used fingerprint algorithms, their usage in virtual screening, and the software packages and online tools that provide these algorithms.

  12. Fingerprint re-alignment: a solution based on the true fingerprint center point

    CSIR Research Space (South Africa)

    Msiza, IS

    2011-02-01

    Full Text Available been captured, could compromise the functionality of the system?s matching module. This is because this module relies on the availability of a certain minimum number of features for its functionality, and this minimum number may not be met for a... fingerprint. For (a) (b) Figure 1. The same fingerprint (a) centrally positioned, and (b) translated downwards example, the upright fingerprint has both singular points [1] ? the core (circle) and the delta (triangle) ? captured, while the rotated...

  13. Errors in spectral fingerprints and their effects on climate fingerprinting accuracy in the solar spectrum

    Science.gov (United States)

    Jin, Zhonghai; Sun, Moguo

    2017-02-01

    Using the Earth's reflected solar spectrum for climate change fingerprinting is an emerging research area. The spectral fingerprinting approach directly retrieves the changes in climate variables from the mean spectral data averaged across large space and time scales. To investigate this fingerprinting concept, we use ten years of satellite data to simulate the monthly and annual mean reflected solar spectra and the associated spectral fingerprints for different regions over the ocean. The interannual variations in the spectral data are derived and attributed to the interannual variations in the relevant climate variables. The fingerprinting retrieved changes in climate variables are then compared with the actual underlying variable changes from the observational data to evaluate the fingerprinting retrieval accuracy. Two important errors related to the fingerprinting approach, the nonlinearity error and the averaging error in the mean fingerprints, and their impact on the retrieval accuracy, are investigated. It is found that the averaging error increases but the nonlinearity error decreases as the region size increases. The averaging error has minimal effect on the fingerprinting retrieval accuracy in small regions but has more of an impact in large regions. In comparison, the effect of nonlinearity error on the retrieval accuracy decreases as the region size increases. It is also found that the fingerprinting retrieval accuracy is more sensitive to the nonlinearity error than to the averaging error. In addition, we compare the fingerprinting accuracy between using the monthly mean data and the annual mean data. The results show that on average higher retrieval accuracy is achieved when the annual mean data are used for the fingerprinting retrieval.

  14. Development of a Fingerprint Gender Classification Algorithm Using Fingerprint Global Features

    OpenAIRE

    S. F. Abdullah; A.F.N.A. Rahman; Z.A.Abas; W.H.M Saad

    2016-01-01

    In forensic world, the process of identifying and calculating the fingerprint features is complex and take time when it is done manually using fingerprint laboratories magnifying glass. This study is meant to enhance the forensic manual method by proposing a new algorithm for fingerprint global feature extraction for gender classification. The result shows that the new algorithm gives higher acceptable readings which is above 70% of classification rate when it is compared to the manual method...

  15. Secure access control to hidden data by biometric features

    Science.gov (United States)

    Cancellaro, M.; Carli, M.; Egiazarian, K.; Neri, A.

    2007-04-01

    In this paper, a novel authentications system combining biometric cryptosystems with digital watermarking is presented. One of the main vulnerabilities of the existing data hiding systems is the public knowledge of the embedding domain. We propose the use of biometric data, minutiae fingerprint set, for generating the encryption key needed to decompose an image in the Tree structured Haar transform. The uniqueness of the biometrics key together with other, embedded, biometric information guarantee the authentication of the user. Experimental tests show the effectiveness of the proposed system.

  16. The detection of drugs of abuse in fingerprints using Raman spectroscopy I: latent fingerprints

    Science.gov (United States)

    Day, Joanna S.; Edwards, Howell G. M.; Dobrowski, Steven A.; Voice, Alison M.

    2004-02-01

    This paper describes the application of Raman spectroscopy to the detection of exogenous substances in latent fingerprints. The scenario considered was that of an individual handling a substance and subsequently depositing a contaminated fingerprint. Five drugs of abuse (codeine phosphate, cocaine hydrochloride, amphetamine sulphate, barbital and nitrazepam) and five non-controlled substances of similar appearance, which may be used in the adulteration of drugs of abuse (caffeine, aspirin, paracetamol, starch and talc), were studied in both sweat-rich and sebum-rich latent fingerprints. The substances studied could be clearly distinguished using their Raman spectra and were all successfully detected in latent fingerprints. Photobleaching was necessary to reduce the fluorescence background in the spectra of some substances. Raman spectra obtained from the substances in sweat-rich latent fingerprints were of a similar quality to spectra that obtained from the substances under normal sampling conditions. Interfering Raman bands arising from latent fingerprint material were present in the spectra obtained from the substances in sebum-rich fingerprints. These bands did not prevent identification of the substances and could be successfully removed by spectral subtraction. The most difficult aspect of the detection of these substances in latent fingerprints was visually locating the substance in the fingerprint in order to obtain a Raman spectrum.

  17. Managing Communication Latency-Hiding at Runtime for Parallel Programming Languages and Libraries

    CERN Document Server

    Kristensen, Mads Ruben Burgdorff

    2012-01-01

    This work introduces a runtime model for managing communication with support for latency-hiding. The model enables non-computer science researchers to exploit communication latency-hiding techniques seamlessly. For compiled languages, it is often possible to create efficient schedules for communication, but this is not the case for interpreted languages. By maintaining data dependencies between scheduled operations, it is possible to aggressively initiate communication and lazily evaluate tasks to allow maximal time for the communication to finish before entering a wait state. We implement a heuristic of this model in DistNumPy, an auto-parallelizing version of numerical Python that allows sequential NumPy programs to run on distributed memory architectures. Furthermore, we present performance comparisons for eight benchmarks with and without automatic latency-hiding. The results shows that our model reduces the time spent on waiting for communication as much as 27 times, from a maximum of 54% to only 2% of t...

  18. Hiding Sensitive Association Rules without Altering the Support of Sensitive Item(s)

    CERN Document Server

    Jain, Dhyanendra

    2012-01-01

    Association rule mining is an important data-mining technique that finds interesting association among a large set of data items. Since it may disclose patterns and various kinds of sensitive knowledge that are difficult to find otherwise, it may pose a threat to the privacy of discovered confidential information. Such information is to be protected against unauthorized access. Many strategies had been proposed to hide the information. Some use distributed databases over several sites, data perturbation, clustering, and data distortion techniques. Hiding sensitive rules problem, and still not sufficiently investigated, is the requirement to balance the confidentiality of the disclosed data with the legitimate needs of the user. The proposed approach uses the data distortion technique where the position of the sensitive items is altered but its support is never changed. The size of the database remains the same. It uses the idea of representative rules to prune the rules first and then hides the sensitive rule...

  19. A comparative study of fingerprint thinning algorithms

    CSIR Research Space (South Africa)

    Khanyile, NP

    2011-08-01

    Full Text Available , Optical Character Recognition (OCR), biological cell structures and fingerprint patterns. With so many thinning algorithms available, deciding which one is appropriate for a particular application has become very difficult. In an effort to assist...

  20. 75 FR 12803 - Fingerprint Submission Requirements Rule

    Science.gov (United States)

    2010-03-17

    ...Notice of the Compact Council's establishment of a process for initiating noncriminal justice criminal history record checks during times of emergencies and disasters under the authority of the Fingerprint Submission Requirements Rule, title 28 Code of Federal Regulations (CFR), part...

  1. Dual Resolution Images from Paired Fingerprint Cards

    Science.gov (United States)

    NIST Dual Resolution Images from Paired Fingerprint Cards (PC database for purchase)   NIST Special Database 30 is being distributed for use in development and testing of fingerprint compression and fingerprint matching systems. The database allows the user to develop and evaluate data compression algorithms for fingerprint images scanned at both 19.7 ppmm (500 dpi) and 39.4 ppmm (1000 dpi). The data consist of 36 ten-print paired cards with both the rolled and plain images scanned at 19.7 and 39.4 pixels per mm. A newer version of the compression/decompression software on the CDROM can be found at the website http://www.nist.gov/itl/iad/ig/nigos.cfm as part of the NBIS package.

  2. Indoor Positioning with Radio Location Fingerprinting

    CERN Document Server

    Kjærgaard, Mikkel Baun

    2010-01-01

    An increasingly important requirement for many novel applications is sensing the positions of people, equipment, etc. GPS technology has proven itself as a successfull technology for positioning in outdoor environments but indoor no technology has yet gained a similar wide-scale adoption. A promising indoor positioning technique is radio-based location fingerprinting, having the major advantage of exploiting already existing radio infrastructures, like IEEE 802.11, which avoids extra deployment costs and effort. The research goal of this thesis is to address the limitations of current indoor location fingerprinting systems. In particular the aim is to advance location fingerprinting techniques for the challenges of handling heterogeneous clients, scalability to many clients, and interference between communication and positioning. The wireless clients used for location fingerprinting are heterogeneous even when only considering clients for the same technology. Heterogeneity is a challenge for location fingerpr...

  3. Defining the Crystallographic Fingerprint of Extraterrestrial Treasures

    Science.gov (United States)

    Forman, L. V.; Bland, P. A.; Timms, N. E.; Daly, L.; Benedix, G. K.; Trimby, P. W.

    2016-08-01

    An approach to determine the crystallographic fingerprint of chondritic matrix grains, which is complimentary to the geochemical signature commonly identified to constrain some aspects of the petrogenesis of a sample.

  4. 地统计关联特征与多子集匹配的缺失指纹识别算法%Missing fingerprint identification based on linked features of geostatistics and subset matches

    Institute of Scientific and Technical Information of China (English)

    陈云志

    2014-01-01

    针对主流指纹识别算法对缺失指纹图像识别率非常低的问题,提出了一种地统计关联特征与多子集匹配的算法(GS-MS)。首先对指纹图像进行Gabor滤波增强以及二值化、细化预处理,然后将图像均匀划分为N个子集,分别提取各子集的地统计学关联特征与分叉点、端点等细节特征点,最后以待识别指纹图像子集为基准,与指纹库子集进行匹配识别。采用完整与缺失两种指纹数据集进行测试,GS-MS算法均取得了较优的识别精度,而且没有大幅度增加运行时间。%Most fingerprint identification algorithm has low accuracy for incomplete image, a novel miss fingerprint iden-tification based on linked features of geostatistics and subset matching is proposed in this paper. Image preprocessing is performed by Gabor filter, binary conversion and thinning. The image is partitioned into several sub-images without over-lapped image. The features of each sub-image are extracted such as the linked features of geostatistics, fingerprint minutiaes of fork point and endpoint. The performance of algorithm is test by simulation experiments. The result shows that the pro-posed method has achieved higher identification accuracy in missing images and has not increased consuming time.

  5. Automated FingerPrint Background removal: FPB

    OpenAIRE

    Morgante Michele; Scalabrin Simone; Policriti Alberto

    2009-01-01

    Abstract Background The construction of a whole-genome physical map has been an essential component of numerous genome projects initiated since the inception of the Human Genome Project. Its usefulness has been proved for whole-genome shotgun projects as a post-assembly validation and recently it has also been used in the assembly step to constrain on BACs positions. Fingerprinting is usually the method of choice for construction of physical maps. A clone fingerprint is composed of true peaks...

  6. On the statistics of the "genetic fingerprint".

    Science.gov (United States)

    Ritter, H

    1991-01-01

    In analogy to the polygene determined morphological features, the DNA-fingerprint is also not suitable for statistical processing. Statements about the individuality are merely speculative. Frequencies of genes cannot be found, since it is impossible to determine which combinations of bands belong to one gene locus. Hence the DNA fingerprint enables the recognition of exclusions from paternity; it does not, however, allow a statistical analysis, no matter which method be employed.

  7. The study results steganography hiding messages in image files as vehicle security software

    Directory of Open Access Journals (Sweden)

    D. O. Navrotskyi

    2012-11-01

    Full Text Available Synergetics of steganographic and cryptographic encryption algorithms, which provide a solid security foundation, is presented in this paper. Hiding messages systems in spatial and frequency domain image are compared and studied by the author. The following questions: Compression scheme JPEG , JPEG – transformation structure, Practical recommendations for hiding data to image files, The method of least significant bits (spatial domain and the DCT coefficients values relative replacement method (frequency domain, Packing and unpacking the hidden message, Visual distortion image changing system parameters are considered.

  8. A statistical hiding algorithm based on self-similar network traffic

    Institute of Scientific and Technical Information of China (English)

    SHA Xue-jun; XU Yu-bin; QIANG Wei

    2008-01-01

    Although the encryption of network packets significantly increases privacy, the density of the traffic can still provide useful information to the observer, and maybe results in the breach of confidentiality. In this paper, we address issues related to hiding information in self-similar network, which is proved to be similar with modem communication network. And a statistical hiding algorithm is proposed for traffic padding. The figures and the comparison of Hurst Parameters before and after traffic padding, show the effective performance of the algorithm.

  9. Reliable Transmission of Audio Streams in Lossy Channels Using Application Level Data Hiding

    Directory of Open Access Journals (Sweden)

    Parag Agarwal

    2008-12-01

    Full Text Available The paper improves the reliability of audio streams in a lossy channel. The mechanism groups audio data samples into source and carrier sets. The carrier set carry the information about the source set which is encoded using data hiding methodology - quantization index modulation. At the receiver side, a missing source data sample can be reconstructed using the carrier set and the remaining source set. Based on reliability constraints a hybrid design combining interleaving and data hiding is presented. Experiments show an improved reliability as compared to forward error correction and interleaving.

  10. Privacy protection schemes for fingerprint recognition systems

    Science.gov (United States)

    Marasco, Emanuela; Cukic, Bojan

    2015-05-01

    The deployment of fingerprint recognition systems has always raised concerns related to personal privacy. A fingerprint is permanently associated with an individual and, generally, it cannot be reset if compromised in one application. Given that fingerprints are not a secret, potential misuses besides personal recognition represent privacy threats and may lead to public distrust. Privacy mechanisms control access to personal information and limit the likelihood of intrusions. In this paper, image- and feature-level schemes for privacy protection in fingerprint recognition systems are reviewed. Storing only key features of a biometric signature can reduce the likelihood of biometric data being used for unintended purposes. In biometric cryptosystems and biometric-based key release, the biometric component verifies the identity of the user, while the cryptographic key protects the communication channel. Transformation-based approaches only a transformed version of the original biometric signature is stored. Different applications can use different transforms. Matching is performed in the transformed domain which enable the preservation of low error rates. Since such templates do not reveal information about individuals, they are referred to as cancelable templates. A compromised template can be re-issued using a different transform. At image-level, de-identification schemes can remove identifiers disclosed for objectives unrelated to the original purpose, while permitting other authorized uses of personal information. Fingerprint images can be de-identified by, for example, mixing fingerprints or removing gender signature. In both cases, degradation of matching performance is minimized.

  11. An Efficient Reconfigurable Architecture for Fingerprint Recognition

    Directory of Open Access Journals (Sweden)

    Satish S. Bhairannawar

    2016-01-01

    Full Text Available The fingerprint identification is an efficient biometric technique to authenticate human beings in real-time Big Data Analytics. In this paper, we propose an efficient Finite State Machine (FSM based reconfigurable architecture for fingerprint recognition. The fingerprint image is resized, and Compound Linear Binary Pattern (CLBP is applied on fingerprint, followed by histogram to obtain histogram CLBP features. Discrete Wavelet Transform (DWT Level 2 features are obtained by the same methodology. The novel matching score of CLBP is computed using histogram CLBP features of test image and fingerprint images in the database. Similarly, the DWT matching score is computed using DWT features of test image and fingerprint images in the database. Further, the matching scores of CLBP and DWT are fused with arithmetic equation using improvement factor. The performance parameters such as TSR (Total Success Rate, FAR (False Acceptance Rate, and FRR (False Rejection Rate are computed using fusion scores with correlation matching technique for FVC2004 DB3 Database. The proposed fusion based VLSI architecture is synthesized on Virtex xc5vlx30T-3 FPGA board using Finite State Machine resulting in optimized parameters.

  12. Linguistically informed digital fingerprints for text

    Science.gov (United States)

    Uzuner, Özlem

    2006-02-01

    Digital fingerprinting, watermarking, and tracking technologies have gained importance in the recent years in response to growing problems such as digital copyright infringement. While fingerprints and watermarks can be generated in many different ways, use of natural language processing for these purposes has so far been limited. Measuring similarity of literary works for automatic copyright infringement detection requires identifying and comparing creative expression of content in documents. In this paper, we present a linguistic approach to automatically fingerprinting novels based on their expression of content. We use natural language processing techniques to generate "expression fingerprints". These fingerprints consist of both syntactic and semantic elements of language, i.e., syntactic and semantic elements of expression. Our experiments indicate that syntactic and semantic elements of expression enable accurate identification of novels and their paraphrases, providing a significant improvement over techniques used in text classification literature for automatic copy recognition. We show that these elements of expression can be used to fingerprint, label, or watermark works; they represent features that are essential to the character of works and that remain fairly consistent in the works even when works are paraphrased. These features can be directly extracted from the contents of the works on demand and can be used to recognize works that would not be correctly identified either in the absence of pre-existing labels or by verbatim-copy detectors.

  13. INDICATOR AND PATHOGENIC MICROORGANISMS CONTAMINATION OF HIDE OF CATTLE PRESENTED TO FOR SLAUGHTER AND CONTAMINATION OF THE RESULTANT CARCASSES

    Directory of Open Access Journals (Sweden)

    G. Liuzzo

    2011-01-01

    Full Text Available Foodborne pathogens including Escherichia coli O157:H7, Salmonella spp. and Campylobacter spp., can enter the meat chain at multiple points. Animals with excessively dirty hides will represent a risk of cross-contaminations during transport, in the slaughtered house environment and during dressing procedures. The aim of this work was to investigate the relationship among hygiene indicator microorganisms (Enterobacteriaceae and Escherichia coli count, in hide and carcass of cattle presented for slaughter, and different hide cleanliness level in two abattoir (R and F and estimate the prevalence of pathogens Escherichia coli O157:H7, Salmonella spp and Campylobacter spp. in hide and carcass of dirty animals. The results showed that hide Escherichia coli and Enterobacteriaceae count were significantly higher in dirty animals than in clean animals (P<0,05, but carcass contamination were significantly higher in dirty animals than in clean animals only in R abattoir. Escherichia coli O 157:H7 was detected in 19 samples of hide (40,4%, and 2 samples of carcass. Campylobacter jejuni was isolated in 13 samples of hide (25,5% and one sample of carcass. Salmonella spp. were not found in all the samples of hide and carcass.

  14. Factors associated with latent fingerprint exclusion determinations.

    Science.gov (United States)

    Ulery, Bradford T; Hicklin, R Austin; Roberts, Maria Antonia; Buscaglia, JoAnn

    2017-02-22

    Exclusion is the determination by a latent print examiner that two friction ridge impressions did not originate from the same source. The concept and terminology of exclusion vary among agencies. Much of the literature on latent print examination focuses on individualization, and much less attention has been paid to exclusion. This experimental study assesses the associations between a variety of factors and exclusion determinations. Although erroneous exclusions are more likely to occur on some images and for some examiners, they were widely distributed among images and examiners. Measurable factors found to be associated with exclusion rates include the quality of the latent, value determinations, analysis minutia count, comparison difficulty, and the presence of cores or deltas. An understanding of these associations will help explain the circumstances under which errors are more likely to occur and when determinations are less likely to be reproduced by other examiners; the results should also lead to improved effectiveness and efficiency of training and casework quality assurance. This research is intended to assist examiners in improving the examination process and provide information to the broader community regarding the accuracy, reliability, and implications of exclusion decisions.

  15. The detection of drugs of abuse in fingerprints using Raman spectroscopy II: cyanoacrylate-fumed fingerprints

    Science.gov (United States)

    Day, Joanna S.; Edwards, Howell G. M.; Dobrowski, Steven A.; Voice, Alison M.

    2004-07-01

    This paper describes the application of Raman spectroscopy to the detection of exogenous substances in cyanoacrylate-fumed fingerprints. The scenario considered was that of an individual handling a substance and subsequently depositing a contaminated fingerprint. These fingerprints were enhanced by cyanoacrylate fuming, a process in which a layer of white cyanoacrylate polymer is deposited on the fingerprint material, enabling visual detection. Five drugs of abuse (codeine phosphate, cocaine hydrochloride, amphetamine sulphate, barbital and nitrazepam) and five non-controlled substances of similar appearance, which may be used in the adulteration of drugs of abuse (caffeine, aspirin, paracetamol, starch and talc), were used. The substances studied could be clearly distinguished using their Raman spectra and were all successfully detected in cyanoacrylate-fumed fingerprints. Photobleaching was necessary to reduce the fluorescence background in the spectra of some substances. Raman spectra obtained from the substances in cyanoacrylate-fumed fingerprints were of a similar quality to spectra obtained from the substances under normal sampling conditions, however, interfering Raman bands arising from the cyanoacrylate polymer were present in the spectra. In most cases the only interfering band was the CN stretching mode of the polymer, and there were no cases where the interfering bands prevented identification of the substances. If necessary, the interfering bands could be successfully removed by spectral subtraction. The most difficult aspect of the detection of these substances in cyanoacrylate-fumed fingerprints was visually locating the substance in the fingerprint beneath the polymer layer in order to obtain a Raman spectrum.

  16. Fingerprinting with Minimum Distance Decoding

    CERN Document Server

    Lin, Shih-Chun; Gamal, Hesham El

    2007-01-01

    This work adopts an information theoretic framework for the design of collusion-resistant coding/decoding schemes for digital fingerprinting. More specifically, the minimum distance decision rule is used to identify 1 out of t pirates. Achievable rates, under this detection rule, are characterized in two distinct scenarios. First, we consider the averaging attack where a random coding argument is used to show that the rate 1/2 is achievable with t=2 pirates. Our study is then extended to the general case of arbitrary $t$ highlighting the underlying complexity-performance tradeoff. Overall, these results establish the significant performance gains offered by minimum distance decoding as compared to other approaches based on orthogonal codes and correlation detectors. In the second scenario, we characterize the achievable rates, with minimum distance decoding, under any collusion attack that satisfies the marking assumption. For t=2 pirates, we show that the rate $1-H(0.25)\\approx 0.188$ is achievable using an ...

  17. Electrical fingerprint of pipeline defects

    Energy Technology Data Exchange (ETDEWEB)

    Mica, Isabella [STMicroelectronics Srl, via C.Olivetti 2, 20041 Agrate Brianza (Italy)]. E-mail: isabella.mica@st.com; Polignano, Maria Luisa [STMicroelectronics Srl, via C.Olivetti 2, 20041 Agrate Brianza (Italy); Marco, Cinzia De [STMicroelectronics Srl, via C.Olivetti 2, 20041 Agrate Brianza (Italy)

    2004-12-15

    Pipeline defects are dislocations that connect the source region of the transistor with the drain region. They were widely reported to occur in CMOS, BiCMOS devices and recently in SOI technologies. They can reduce device yield either by affecting the devices functionality or by increasing the current consumption under stand-by conditions. In this work the electrical fingerprint of these dislocations is studied, its purpose is to enable us to identify these defects as the ones responsible for device failure. It is shown that the pipeline defects are responsible for a leakage current from source to drain in the transistors. This leakage has a resistive characteristic and it is lightly modulated by the body bias. It is not sensitive to temperature; vice versa the off-current of a good transistor exhibits the well-known exponential dependence on 1/T. The emission spectrum of these defects was studied and compared with the spectrum of a good transistor. The paper aims to show that the spectrum of a defective transistor is quite peculiar; it shows well defined peaks, whereas the spectrum of a good transistor under saturation conditions is characterized by a broad spectral light emission distribution. Finally the deep-level transient spectroscopy (DLTS) is tried on defective diodes.

  18. Fingerprints of a Local Supernova

    CERN Document Server

    Manuel, Oliver

    2009-01-01

    The results of precise analysis of elements and isotopes in meteorites, comets, the Earth, the Moon, Mars, Jupiter, the solar wind, solar flares, and the solar photosphere since 1960 reveal fingerprints of a local supernova (SN), undiluted by interstellar material. Heterogeneous SN debris formed the planets. The Sun formed on the neutron (n) rich SN core. The ground-state masses of nuclei reveal repulsive n-n interactions that trigger n-emission and a series of nuclear reactions that generate solar luminosity, the solar wind, and the measured flux of solar neutrinos. The location of the Sun's high-density core shifts relative to the solar surface as gravitational forces exerted by the major planets cause the Sun to experience abrupt acceleration and deceleration, like a yoyo on a string, in its orbit about the ever-changing centre-of-mass of the solar system. Solar cycles (surface magnetic activity, solar eruptions, and sunspots) and major climate changes arise from changes in the depth of the energetic SN co...

  19. Social media fingerprints of unemployment.

    Directory of Open Access Journals (Sweden)

    Alejandro Llorente

    Full Text Available Recent widespread adoption of electronic and pervasive technologies has enabled the study of human behavior at an unprecedented level, uncovering universal patterns underlying human activity, mobility, and interpersonal communication. In the present work, we investigate whether deviations from these universal patterns may reveal information about the socio-economical status of geographical regions. We quantify the extent to which deviations in diurnal rhythm, mobility patterns, and communication styles across regions relate to their unemployment incidence. For this we examine a country-scale publicly articulated social media dataset, where we quantify individual behavioral features from over 19 million geo-located messages distributed among more than 340 different Spanish economic regions, inferred by computing communities of cohesive mobility fluxes. We find that regions exhibiting more diverse mobility fluxes, earlier diurnal rhythms, and more correct grammatical styles display lower unemployment rates. As a result, we provide a simple model able to produce accurate, easily interpretable reconstruction of regional unemployment incidence from their social-media digital fingerprints alone. Our results show that cost-effective economical indicators can be built based on publicly-available social media datasets.

  20. A new access control system by fingerprint for radioisotope facilities

    Energy Technology Data Exchange (ETDEWEB)

    Kawamura, Hiroko; Hirata, Yasuki [Kyushu Univ., Fukuoka (Japan). Radioisotope Center; Kondo, Takahiro; Takatsuki, Katsuhiro

    1998-04-01

    We applied a new fingerprint checker for complete access control to the radiation controlled area and to the radioisotope storage room, and prepared softwares for the best use of this checker. This system consists of a personal computer, access controllers, a fingerprint register, fingerprint checkers, a tenkey and mat sensors, permits ten thousand users to register their fingerprints and its hard disk to keep more than a million records of user`s access. Only 1% of users could not register their fingerprints worn-out, registered four numbers for a fingerprint. The softwares automatically provide varieties of reports, caused a large reduction in manual works. (author)

  1. A topology based approach to categorization of fingerprint images

    DEFF Research Database (Denmark)

    Aabrandt, A.; Olsen, M. A.; Busch, C.

    2012-01-01

    This paper discusses the use of betti numbers to characterize fingerprint and iris images. The goal is to automatically separate fingerprint images from non-fingerprint images; where non-fingerprint images of special interest are biometric samples which are not fingerprints. In this regard...... numbers of “n” prototype images in order to perform classification (“fingerprint” vs “non-fingerprint”). The proposed method is compared against SIVV (a tool provided by NIST). Experimental results on fingerprint and iris databases demonstrate the potential of the scheme....

  2. Hiding an Inconvenient Truth : Lies and Vagueness (Revision of DP 2008-107)

    NARCIS (Netherlands)

    Serra Garcia, M.; van Damme, E.E.C.; Potters, J.J.M.

    2010-01-01

    When truth conflicts with efficiency, can verbal communication destroy efficiency? Or are lies or vagueness used to hide inconvenient truths? We consider a sequential 2-player public good game in which the leader has private information about the value of the public good. This value can be low, high

  3. Efficiently Hiding Sensitive Itemsets with Transaction Deletion Based on Genetic Algorithms

    Directory of Open Access Journals (Sweden)

    Chun-Wei Lin

    2014-01-01

    Full Text Available Data mining is used to mine meaningful and useful information or knowledge from a very large database. Some secure or private information can be discovered by data mining techniques, thus resulting in an inherent risk of threats to privacy. Privacy-preserving data mining (PPDM has thus arisen in recent years to sanitize the original database for hiding sensitive information, which can be concerned as an NP-hard problem in sanitization process. In this paper, a compact prelarge GA-based (cpGA2DT algorithm to delete transactions for hiding sensitive itemsets is thus proposed. It solves the limitations of the evolutionary process by adopting both the compact GA-based (cGA mechanism and the prelarge concept. A flexible fitness function with three adjustable weights is thus designed to find the appropriate transactions to be deleted in order to hide sensitive itemsets with minimal side effects of hiding failure, missing cost, and artificial cost. Experiments are conducted to show the performance of the proposed cpGA2DT algorithm compared to the simple GA-based (sGA2DT algorithm and the greedy approach in terms of execution time and three side effects.

  4. Steganographic optical image encryption system based on reversible data hiding and double random phase encoding

    Science.gov (United States)

    Chuang, Cheng-Hung; Chen, Yen-Lin

    2013-02-01

    This study presents a steganographic optical image encryption system based on reversible data hiding and double random phase encoding (DRPE) techniques. Conventional optical image encryption systems can securely transmit valuable images using an encryption method for possible application in optical transmission systems. The steganographic optical image encryption system based on the DRPE technique has been investigated to hide secret data in encrypted images. However, the DRPE techniques vulnerable to attacks and many of the data hiding methods in the DRPE system can distort the decrypted images. The proposed system, based on reversible data hiding, uses a JBIG2 compression scheme to achieve lossless decrypted image quality and perform a prior encryption process. Thus, the DRPE technique enables a more secured optical encryption process. The proposed method extracts and compresses the bit planes of the original image using the lossless JBIG2 technique. The secret data are embedded in the remaining storage space. The RSA algorithm can cipher the compressed binary bits and secret data for advanced security. Experimental results show that the proposed system achieves a high data embedding capacity and lossless reconstruction of the original images.

  5. Random Traversing Based Reversible Data Hiding Technique Using PE and LSB

    Directory of Open Access Journals (Sweden)

    Rhythm Katira

    2013-04-01

    Full Text Available The rise in the use of internet, secure transmission of the data has become an utmost priority. Steganography makes the data invisible by hiding it in the multimedia such as image, audio or video file and thereby covering for its existence. In this project we use prediction error (PE technique steganography and Least Significant Bit (LSB substitution method to hide data in the image. As we do PE expansion method it can lead to expansion of pixels like it can lead to pixel value above 255. In order to solve this problem, we restricted the pixel values between 15 and 240.The PSNR was high at low threshold values. The hiding capacity increased with increase in threshold with a reasonable decrease in PSNR. There was 2dB difference then other methods because of high data hiding capacity. Also we have used knight’s tour for increasing the security of data hidden. In comparison to other methodology, this methodology proves to be better and more effective.

  6. A NOVEL APPROACH OF SECURE COMMUNICATION BASED ON THE TECHNIQUE OF SPEECH INFORMATION HIDING

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    The proposed secure communication approach adopts the proposed algorithm of Analysis-BySynthesis (ABS) speech information hiding to establish a Secret Speech Subliminal Channel (SSSC) for speech secure communication over PSTN (Public Switched Telephone Network), and employs the algorithm of ABS speech information extracting to recovery the secret information. This approach is more reliable, covert and securable than traditional and chaotic secure communication.

  7. Effect of hiding places, straw and territory on agression in group-housed rabbit does

    NARCIS (Netherlands)

    Rommers, J.M.; Reuvekamp, B.F.J.; Gunnink, H.; Jong, de I.C.

    2014-01-01

    Group-housing of rabbit does may be preferred from welfare point of view. However, group-housing causes agonistic behaviour which may cause severe injuries. Severe injuries may be prevented by offering hiding places for attacked does. Providing enrichment (straw) may reduce agonistic behaviour by at

  8. Efficient Filtering of Noisy Fingerprint Images

    Directory of Open Access Journals (Sweden)

    Maria Liliana Costin

    2016-01-01

    Full Text Available Fingerprint identification is an important field in the wide domain of biometrics with many applications, in different areas such: judicial, mobile phones, access systems, airports. There are many elaborated algorithms for fingerprint identification, but none of them can guarantee that the results of identification are always 100 % accurate. A first step in a fingerprint image analysing process consists in the pre-processing or filtering. If the result after this step is not by a good quality the upcoming identification process can fail. A major difficulty can appear in case of fingerprint identification if the images that should be identified from a fingerprint image database are noisy with different type of noise. The objectives of the paper are: the successful completion of the noisy digital image filtering, a novel more robust algorithm of identifying the best filtering algorithm and the classification and ranking of the images. The choice about the best filtered images of a set of 9 algorithms is made with a dual method of fuzzy and aggregation model. We are proposing through this paper a set of 9 filters with different novelty designed for processing the digital images using the following methods: quartiles, medians, average, thresholds and histogram equalization, applied all over the image or locally on small areas. Finally the statistics reveal the classification and ranking of the best algorithms.

  9. Comment on "Method of Fingerprint Identification"

    Directory of Open Access Journals (Sweden)

    Ford L. Gaol

    2011-01-01

    Full Text Available Problem statement: Paper that written by Surachai Panich reported matching two fingerprints taken from small database of fingerprints. Approach: In this study we used extensive literature review and research publication. We also compare with some best practices that applied in the business and industrial field for matching the fingerprints. Results: Surachai Panich used his method only for around one hundred data. However, we found that in the recent research most of the fingerprint problems are explore in million of data. I found some of the literature review are quiet old. Since the advancement of Fingerprint matching is increase very rapidly so the comparison with the recent publication is a must. The comparison has to be in the experimental using million of data as the input. We do not find such experimental result on this paper. Conclusion/Recommendations: The paper should explore more in biometrics feature extraction for matching process. The biometrics have analogy to the use of physiological or biological characteristics to measure the identity of an individual. These features are assuming unique to each individual and remain unaltered during a person’s lifetime. These features make biometrics a promising solution to the society.

  10. Efficient Filtering of Noisy Fingerprint Images

    Directory of Open Access Journals (Sweden)

    Maria Liliana Costin

    2016-01-01

    Full Text Available Fingerprint identification is an important field in the wide domain of biometrics with many applications, in different areas such: judicial, mobile phones, access systems, airports. There are many elaborated algorithms for fingerprint identification, but none of them can guarantee that the results of identification are always 100 % accurate. A first step in a fingerprint image analysing process consists in the pre-processing or filtering. If the result after this step is not by a good quality the upcoming identification process can fail. A major difficulty can appear in case of fingerprint identification if the images that should be identified from a fingerprint image database are noisy with different type of noise. The objectives of the paper are: the successful completion of the noisy digital image filtering, a novel more robust algorithm of identifying the best filtering algorithm and the classification and ranking of the images. The choice about the best filtered images of a set of 9 algorithms is made with a dual method of fuzzy and aggregation model. We are proposing through this paper a set of 9 filters with different novelty designed for processing the digital images using the following methods: quartiles, medians, average, thresholds and histogram equalization, applied all over the image or locally on small areas. Finally the statistics reveal the classification and ranking of the best algorithms.

  11. Automated spoof-detection for fingerprints using optical coherence tomography

    CSIR Research Space (South Africa)

    Darlow, LN

    2016-05-01

    Full Text Available Fingerprint recognition systems are prevalent in high-security applications. As a result, the act of spoofing these systems with artificial fingerprints is of increasing concern. This research presents an automatic means for spoof-detection using...

  12. Solving the Mystery of Fading Fingerprints with London Dispersion Forces.

    Science.gov (United States)

    Kimbrough, Doris R.; DeLorenzo, Ronald

    1998-01-01

    Focuses on the kidnapping of a child whose fingerprints were not found inside the crime vehicle. Discusses the investigation that followed and led to knowledge of the differences between the fingerprints of children and adults. (DDR)

  13. Fingerprint recovery from human skin surfaces.

    Science.gov (United States)

    Trapecar, Matej; Balazic, Joze

    2007-11-01

    A study was conducted to investigate whether certain dactyloscopic powders and reagents can recover latent fingerprints on human skin surfaces. Four fingerprint powders, Magnetic Jet Black, Magnetic Silver, Silver Special, Swedish Black, and two other methods, cyanoacrylate fuming (CA) and Ruthenium tetroxide (RTX), were used. Having examined skin surfaces with a forensic light source, we observed that the fingerprint impressions remained visible up to 15 min after intentionally placing them on the skin surface of living subjects and dead bodies. Finger marks were recovered and positive results were achieved with Magnetic Black and Swedish Black powder on living subjects. On dead bodies finger marks treated with cyanoacrylate were visible but those treated with RTX, Swedish Black and Magnetic Jet Black powder were useful for potential comparison. On dead bodies best results were obtained with RTX method.

  14. Fingerprinting Mobile Devices Using Personalized Configurations

    Directory of Open Access Journals (Sweden)

    Kurtz Andreas

    2016-01-01

    Full Text Available Recently, Apple removed access to various device hardware identifiers that were frequently misused by iOS third-party apps to track users. We are, therefore, now studying the extent to which users of smartphones can still be uniquely identified simply through their personalized device configurations. Using Apple’s iOS as an example, we show how a device fingerprint can be computed using 29 different configuration features. These features can be queried from arbitrary thirdparty apps via the official SDK. Experimental evaluations based on almost 13,000 fingerprints from approximately 8,000 different real-world devices show that (1 all fingerprints are unique and distinguishable; and (2 utilizing a supervised learning approach allows returning users or their devices to be recognized with a total accuracy of 97% over time

  15. Fingerprinting Communication and Computation on HPC Machines

    Energy Technology Data Exchange (ETDEWEB)

    Peisert, Sean

    2010-06-02

    How do we identify what is actually running on high-performance computing systems? Names of binaries, dynamic libraries loaded, or other elements in a submission to a batch queue can give clues, but binary names can be changed, and libraries provide limited insight and resolution on the code being run. In this paper, we present a method for"fingerprinting" code running on HPC machines using elements of communication and computation. We then discuss how that fingerprint can be used to determine if the code is consistent with certain other types of codes, what a user usually runs, or what the user requested an allocation to do. In some cases, our techniques enable us to fingerprint HPC codes using runtime MPI data with a high degree of accuracy.

  16. Measuring Fingerprint Image Quality Using the Fourier Spectrum

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    The fingerprint image quality has a significant effect on the performance of automatic fingerprint identification system. A method for measure of fingerprint image quality based on Fourier spectrum is proposed. First the band frequency which corresponds to the global average period of ridge is searched. Then the quality score of the fingerprint image is computed by measuring relative magnitude of the band frequency components. The method is verified to have good performance by experiments.

  17. Waveform Fingerprinting for Efficient Seismic Signal Detection

    Science.gov (United States)

    Yoon, C. E.; OReilly, O. J.; Beroza, G. C.

    2013-12-01

    Cross-correlating an earthquake waveform template with continuous waveform data has proven a powerful approach for detecting events missing from earthquake catalogs. If templates do not exist, it is possible to divide the waveform data into short overlapping time windows, then identify window pairs with similar waveforms. Applying these approaches to earthquake monitoring in seismic networks has tremendous potential to improve the completeness of earthquake catalogs, but because effort scales quadratically with time, it rapidly becomes computationally infeasible. We develop a fingerprinting technique to identify similar waveforms, using only a few compact features of the original data. The concept is similar to human fingerprints, which utilize key diagnostic features to identify people uniquely. Analogous audio-fingerprinting approaches have accurately and efficiently found similar audio clips within large databases; example applications include identifying songs and finding copyrighted content within YouTube videos. In order to fingerprint waveforms, we compute a spectrogram of the time series, and segment it into multiple overlapping windows (spectral images). For each spectral image, we apply a wavelet transform, and retain only the sign of the maximum magnitude wavelet coefficients. This procedure retains just the large-scale structure of the data, providing both robustness to noise and significant dimensionality reduction. Each fingerprint is a high-dimensional, sparse, binary data object that can be stored in a database without significant storage costs. Similar fingerprints within the database are efficiently searched using locality-sensitive hashing. We test this technique on waveform data from the Northern California Seismic Network that contains events not detected in the catalog. We show that this algorithm successfully identifies similar waveforms and detects uncataloged low magnitude events in addition to cataloged events, while running to completion

  18. Research on the methods of optical image hiding based on double random phase encoding and digital holography

    Science.gov (United States)

    Xu, Hongsheng; Sang, Nong

    2011-12-01

    Optical information hiding system has many features such as high processing speed, high parallel, high encryption dimension and high speed of optical transformation and related operations, more advantages than digital method in some way. But it has not adequate security, and enough combination with techniques of digital image processing. So on basis of analyzing existing image hiding and analyzing techniques, we give out the idea. We should adopt idea of virtual optics on the way of all-digital simulation to do research of optical image hiding and analyzing methods based on optical image processing technique especially technique of double random phase encoding and digital holography.

  19. Fingerprint image enhancement by differential hysteresis processing.

    Science.gov (United States)

    Blotta, Eduardo; Moler, Emilce

    2004-05-10

    A new method to enhance defective fingerprints images through image digital processing tools is presented in this work. When the fingerprints have been taken without any care, blurred and in some cases mostly illegible, as in the case presented here, their classification and comparison becomes nearly impossible. A combination of spatial domain filters, including a technique called differential hysteresis processing (DHP), is applied to improve these kind of images. This set of filtering methods proved to be satisfactory in a wide range of cases by uncovering hidden details that helped to identify persons. Dactyloscopy experts from Policia Federal Argentina and the EAAF have validated these results.

  20. Indoor Localization Accuracy Estimation from Fingerprint Data

    DEFF Research Database (Denmark)

    Nikitin, Artyom; Laoudias, Christos; Chatzimilioudis, Georgios

    2017-01-01

    The demand for indoor localization services has led to the development of techniques that create a Fingerprint Map (FM) of sensor signals (e.g., magnetic, Wi-Fi, bluetooth) at designated positions in an indoor space and then use FM as a reference for subsequent localization tasks...... on arbitrary FMs coined ACCES. Our framework comprises a generic interpolation method using Gaussian Processes (GP), upon which a navigability score at any location is derived using the Cramer-Rao Lower Bound (CRLB). Our approach does not rely on the underlying physical model of the fingerprint data. Our...

  1. The nature of expertise in fingerprint examiners.

    Science.gov (United States)

    Busey, Thomas A; Parada, Francisco J

    2010-04-01

    Latent print examinations involve a complex set of psychological and cognitive processes. This article summarizes existing work that has addressed how training and experience creates changes in latent print examiners. Experience appears to improve overall accuracy, increase visual working memory, and lead to configural processing of upright fingerprints. Experts also demonstrate a narrower visual filter and, as a group, tend to show greater consistency when viewing ink prints. These findings address recent criticisms of latent print evidence, but many open questions still exist. Cognitive scientists are well positioned to conduct studies that will improve the training and practices of latent print examiners, and suggestions for becoming involved in fingerprint research are provided.

  2. Anonymous Fingerprinting Based on Electronic Cash

    Institute of Scientific and Technical Information of China (English)

    CHENXiaofeng; ZHANGFangguo; WANGJilin; WANGYumin

    2003-01-01

    A new anonymous fingerprinting protocol based on the principle of electronic cash is proposed in this paper.Redistributing a data item is equal to doublespending electronic cash.Contrasting with the previous coin-based anonymous fingerprinting protocol,we use the real electronic cash to trace traitors instead of the "coins" which serve only as a cryptographic primitive and have no monetary value,so it is easily understood and the bank does not need key-distribution and registration to prepare the "coina".

  3. Metabolic Foot- and Fingerprinting of Lactobacillus paracasei

    DEFF Research Database (Denmark)

    Jäpelt, Kristina Bak

    in the metabolome, and an increased understanding of bile response mechanisms could be obtained by analysis of the response by tools within metabolomics. Therefore, the aim of this PhD thesis was to develop a platform for metabolic foot- and fingerprinting of L. paracasei subsp. paracasei strain (L. casei CRL-431......, it was demonstrated that the subsequent method used to extract intracellular metabolites from the L. paracasei cells altered the metabolic fingerprint. A comparative study was performed to characterise the effect of the genetic alterations in a set of mutants with enhanced bile tolerance from the parental strain of L...

  4. Chemical Fingerprinting of Materials Developed Due To Environmental Issues

    Science.gov (United States)

    Smith, Doris A.; McCool, A. (Technical Monitor)

    2000-01-01

    This paper presents viewgraphs on chemical fingerprinting of materials developed due to environmental issues. Some of the topics include: 1) Aerospace Materials; 2) Building Blocks of Capabilities; 3) Spectroscopic Techniques; 4) Chromatographic Techniques; 5) Factors that Determine Fingerprinting Approach; and 6) Fingerprinting: Combination of instrumental analysis methods that diagnostically characterize a material.

  5. Digital Video of Live-Scan Fingerprint Data

    Science.gov (United States)

    NIST Digital Video of Live-Scan Fingerprint Data (PC database for purchase)   NIST Special Database 24 contains MPEG-2 (Moving Picture Experts Group) compressed digital video of live-scan fingerprint data. The database is being distributed for use in developing and testing of fingerprint verification systems.

  6. The potency of plant extracts as antimicrobials for the skin or hide preservation

    Science.gov (United States)

    Suparno, Ono; Afifah, Amalia; Panandita, Tania; Marimin, Purnawati, Rini

    2017-03-01

    Preservation of skin or hide uses antimicrobial that will be disposed in wastewater in the skin or hide processing resulting in the environmental pollution. Extracts of some types of plants contain some antimicrobial substances which are potential to be used as biocides for the preservation of skin or hide and are more environmentally friendly. The objectives of this study were to determine the phytochemical contents of moringa, cucumber tree or wuluh starfruit, cherry, and white leadtree or lamtoro leaves and to analyse the antibacterial activities of the plant extracts against microorganisms that cause spoilage of skin or hide. Phytochemical constituents of the dried plant leaves were extracted by 70% ethanol. The resulting extracts were analysed their phytochemical contents and antimicrobial activities against gram negative and gram positive bacteria (inhibition zone test) by well diffusion method, the minimum inhibitory concentration (MIC), and the minimum bactericidal concentration (MBC). Phytochemical test showed that the four leaf extracts contained alkaloids, saponins, tannins, flavonoids, steroids, and glycosides. The inhibition zones of the extracts against Escherichia coli were 5 mm for moringa leaf, 6 mm for cucumber tree leaf, 12 mm for cherry leaf, and 17 mm for white leadtree leaf. Inhibition zone of the extracts against Staphylococcus aureus were 2.5 mm for moringa leaf, 7 mm for cucumber tree leaf, 7.3 mm for cherry leaf, and 13 mm for white leadtree leaf. Inhibition zones of the extracts against Bacillus subtilis were 8 mm for moringa leaf, 9 mm for cucumber tree starfruit leaf, 14 mm for cherry leaf, and 15 mm for white leadtree leaf. The best MIC and MBC tests were demonstrated by white leadtree leaf extract against E. coli found at concentration of 1500 µg/ml, against S. aureus at concentration of 3000 µg/ml, and against B. subtilis at concentration of 3000 µg/ml. The ethanol extract of white leadtree leaf had the best antibacterial activity

  7. Comparison of methods for the enumeration of enterohemorrhagic Escherichia coli from veal hides and carcasses

    Directory of Open Access Journals (Sweden)

    Brandon E Luedtke

    2015-09-01

    Full Text Available The increased association of enterohemorrhagic Escherichia coli (EHEC with veal calves has led the United States Department of Agriculture Food Safety and Inspection Service to report results of veal meat contaminated with the Top 7 serogroups separately from beef cattle. However, detection methods that can also provide concentration for determining the prevalence and abundance of EHEC associated with veal are lacking. Here we compared the ability of qPCR and a molecular based most probable number assay (MPN to detect and enumerate EHEC from veal hides at the abattoir and the resulting pre-intervention carcasses. In addition, digital PCR (dPCR was used to analyze select samples. The qPCR assay was able to enumerate total EHEC in 32% of the hide samples with a range of approximately 34 to 91,412 CFUs/100 cm2 (95% CI 4-113,460 CFUs/100 cm2. Using the MPN assay, total EHEC was enumerable in 48% of the hide samples and ranged from approximately 1 to greater than 17,022 CFUs/100 cm2 (95% CI 0.4-72,000 CFUs/100 cm2. The carcass samples had lower amounts of EHEC with a range of approximately 4 to 275 CFUs/100 cm2 (95% CI 3-953 CFUs/100 cm2 from 17% of samples with an enumerable amount of EHEC by qPCR. For the MPN assay, the carcass samples ranged from 0.1 to 1 CFUs/100 cm2 (95% CI 0.02-4 CFUs/100 cm2 from 29% of the samples. The correlation coefficient between the qPCR and MPN enumeration methods indicated a moderate relation (R2=0.39 for the hide samples while the carcass samples had no relation (R2=0.002, which was likely due to most samples having an amount of total EHEC below the reliable limit of quantification for qPCR. Interestingly, after enrichment, 81% of the hide samples and 94% of the carcass samples had a detectable amount of total EHEC by qPCR. From our analysis, the MPN assay provided a higher percentage of enumerable hide and carcass samples, however determining an appropriate dilution range and the limited throughput offer additional

  8. BİYOMETRIC FINGER PRINT USED AND APPLIED ON SMART CARD

    Directory of Open Access Journals (Sweden)

    Makbule KARAKÜLAH

    2004-04-01

    Full Text Available During the last years, the authors are trying to integrate biometrics, inside a smart card. In this study the first step, as in every biometric system is to obtain an image of the user's fingerprint. After this, a preprocessing algorithm is applied, which enables feature extraction to obtain the location and type of all minutiae. The minutiae are ridges and valleys of the fingerprint. We researched these minutiae which are used with smart cards. A lot of smart card readers /writers were used for data writing and reading. Fingerprint minutiae and identify information were wrote on smart cards successfully using development kits (smart cards of fingerprint and so were identified.

  9. Studies on Chromatographic Fingerprint and Fingerprinting Profile-Efficacy Relationship of Saxifraga stolonifera Meerb.

    OpenAIRE

    Xing-Dong Wu; Hua-Guo Chen; Xin Zhou; Ya Huang; En-Ming Hu; Zheng-Meng Jiang; Chao Zhao; Xiao-Jian Gong; Qing-Fang Deng

    2015-01-01

    This work investigated the spectrum-effect relationships between high performance liquid chromatography (HPLC) fingerprints and the anti-benign prostatic hyperplasia activities of aqueous extracts from Saxifraga stolonifera. The fingerprints of S. stolonifera from various sources were established by HPLC and evaluated by similarity analysis (SA), hierarchical clustering analysis (HCA) and principal component analysis (PCA). Nine samples were obtained from these 24 batches of different origins...

  10. Fingerprint and Face Identification for Large User Population

    Directory of Open Access Journals (Sweden)

    Teddy Ko

    2003-06-01

    Full Text Available The main objective of this paper is to present the state-of-the-art of the current biometric (fingerprint and face technology, lessons learned during the investigative analysis performed to ascertain the benefits of using combined fingerprint and facial technologies, and recommendations for the use of current available fingerprint and face identification technologies for optimum identification performance for applications using large user population. Prior fingerprint and face identification test study results have shown that their identification accuracies are strongly dependent on the image quality of the biometric inputs. Recommended methodologies for ensuring the capture of acceptable quality fingerprint and facial images of subjects are also presented in this paper.

  11. A cancellable and fuzzy fingerprint scheme for mobile computing security

    Science.gov (United States)

    Yang, Wencheng; Xi, Kai; Li, Cai

    2012-09-01

    Fingerprint recognition provides an effective user authentication solution for mobile computing systems. However, as a fingerprint template protection scheme, fingerprint fuzzy vault is subject to cross-matching attacks, since the same finger might be registered for various applications. In this paper, we propose a fingerprint-based biometric security scheme named the cancellable and fuzzy fingerprint scheme, which combines a cancellable non-linear transformation with the client/server version of fuzzy vault, to address the cross-matching attack in a mobile computing system. Experimental results demonstrate that our scheme can provide reliable and secure protection to the mobile computing system while achieving an acceptable matching performance.

  12. A Taxonomy for Radio Location Fingerprinting

    DEFF Research Database (Denmark)

    Kjærgaard, Mikkel Baun

    2007-01-01

    Location Fingerprinting (LF) is a promising location technique for many awareness applications in pervasive computing. However, as research on LF systems goes beyond basic methods there is an increasing need for better comparison of proposed LF systems. Developers of LF systems are also lacking g...

  13. Ultrasonic fingerprinting by phased array transducer

    Science.gov (United States)

    Sednev, D.; Kataeva, O.; Abramets, V.; Pushenko, P.; Tverdokhlebova, T.

    2016-06-01

    Increasing quantity of spent nuclear fuel that must be under national and international control requires a novel approach to safeguard techniques and equipment. One of the proposed approaches is utilize intrinsic features of casks with spent fuel. In this article an application of a phased array ultrasonic method is considered. This study describes an experimental results on ultrasonic fingerprinting of austenitic steel seam weld.

  14. Ultrasonic fingerprinting by phased array transducer

    OpenAIRE

    Sednev, Dmitry Andreevich; Kataeva, O.; Abramets, V.; Pushenko, P.; Tverdokhlebova, T.

    2016-01-01

    Increasing quantity of spent nuclear fuel that must be under national and international control requires a novel approach to safeguard techniques and equipment. One of the proposed approaches is utilize intrinsic features of casks with spent fuel. In this article an application of a phased array ultrasonic method is considered. This study describes an experimental results on ultrasonic fingerprinting of austenitic steel seam weld.

  15. Peptide Mass Fingerprinting of Egg White Proteins

    Science.gov (United States)

    Alty, Lisa T.; LaRiviere, Frederick J.

    2016-01-01

    Use of advanced mass spectrometry techniques in the undergraduate setting has burgeoned in the past decade. However, relatively few undergraduate experiments examine the proteomics tools of protein digestion, peptide accurate mass determination, and database searching, also known as peptide mass fingerprinting. In this experiment, biochemistry…

  16. Forensic use of fingermarks and fingerprints

    NARCIS (Netherlands)

    Meuwly, Didier; Li, Stan Z.; Jain, Anil K.

    2014-01-01

    The aim of this entry is to describe and explain the main forensic uses of fingermarks and fingerprints. It defines the concepts and provides the nomenclature related to forensic dactyloscopy. It describes the structure of the papillary ridges, the organization of the information in three levels, an

  17. Pseudo Identities Based on Fingerprint Characteristics

    NARCIS (Netherlands)

    Delvaux, Nicolas; Chabanne, Herve; Bringer, Julien; Kindarji, Bruno; Lindeberg, Patrik; Midgren, Johannes; Breebaart, Jeroen; Akkermans, Ton; Veen, van der M.; Veldhuis, R.; Kindt, Els; Simoens, Koen; Busch, Christoph; Bours, Patrick; Gafurov, Davrondzhon; Yang, Bian; Stern, Julien; Rust, Carsten; Cucinelli, Bruno; Skepastianos, Dimitrios

    2008-01-01

    This paper presents the integrated project TURBINE which is funded under the EU 7th research framework programme. This research is a multi-disciplinary effort on privacy enhancing technology, combining innovative developments in cryptography and fingerprint recognition. The objective of this project

  18. Protein identification by peptide mass fingerprinting

    DEFF Research Database (Denmark)

    Hjernø, Karin

    2007-01-01

      Peptide mass fingerprinting is an effective way of identifying, e.g., gel-separated proteins, by matching experimentally obtained peptide mass data against large databases. However, several factors are known to influence the quality of the resulting matches, such as proteins contaminating...

  19. 数字指纹%Digital Fingerprinting

    Institute of Scientific and Technical Information of China (English)

    张奇; 徐芳; 桑林海

    2013-01-01

    Digital fingerprinting is widely used in the field of copyright protection, the paper first introduces the relationship be-tween the digital fingerprints and digital watermarking, and then establishs a digital fingerprinting system based on cox, which completes the embedding and detection,then compares it with the block DCT transform, the conclusion is the block DCT make improvements to digital fingerprint system . Finally, the paper indicate the developmental of watermark application.%数字指纹广泛应用在版权保护等领域中,该文首先介绍了数字指纹与数字水印之间的关系,然后以cox为模型建立数字指纹系统,实现了指纹的嵌入和检测,再与块DCT变换作比较,得出结论:块DCT变换可以对数字指纹系统做出改进;最后对数字指纹的现状进行分析和展望。

  20. Protein identification by peptide mass fingerprinting

    DEFF Research Database (Denmark)

    Hjernø, Karin

    2007-01-01

      Peptide mass fingerprinting is an effective way of identifying, e.g., gel-separated proteins, by matching experimentally obtained peptide mass data against large databases. However, several factors are known to influence the quality of the resulting matches, such as proteins contaminating the s...

  1. Indoor Location Fingerprinting with Heterogeneous Clients

    DEFF Research Database (Denmark)

    Kjærgaard, Mikkel Baun

    2011-01-01

    Heterogeneous wireless clients measure signal strength differently. This is a fundamental problem for indoor location fingerprinting, and it has a high impact on the positioning accuracy. Mapping-based solutions have been presented that require manual and error-prone calibration for each new client...

  2. Recursive histogram modification: establishing equivalency between reversible data hiding and lossless data compression.

    Science.gov (United States)

    Zhang, Weiming; Hu, Xiaocheng; Li, Xiaolong; Yu, Nenghai

    2013-07-01

    State-of-the-art schemes for reversible data hiding (RDH) usually consist of two steps: first construct a host sequence with a sharp histogram via prediction errors, and then embed messages by modifying the histogram with methods, such as difference expansion and histogram shift. In this paper, we focus on the second stage, and propose a histogram modification method for RDH, which embeds the message by recursively utilizing the decompression and compression processes of an entropy coder. We prove that, for independent identically distributed (i.i.d.) gray-scale host signals, the proposed method asymptotically approaches the rate-distortion bound of RDH as long as perfect compression can be realized, i.e., the entropy coder can approach entropy. Therefore, this method establishes the equivalency between reversible data hiding and lossless data compression. Experiments show that this coding method can be used to improve the performance of previous RDH schemes and the improvements are more significant for larger images.

  3. Data Hiding by LSB Substitution Using Genetic Optimal Key-Permutation

    Directory of Open Access Journals (Sweden)

    Marghny Mohamed

    2011-01-01

    Full Text Available The least significant bit (LSB embedding method is one of the most commonly used techniques; it targets the LSB'sof the host image to hide the data. This paper deals with three main steganography challenges (i.e. capacity, imperceptibility,and security. This is achieved by hybrid data hiding scheme incorporates LSB technique with a key-permutation method. Thepaper also proposes an optimal key permutation method using genetic algorithms for best key selection. Both normal andoptimized methods are tested with standard images, varying both data size as well as key space. Final experimental resultsshow decrement in computation time when increasing number of keys, at the same time system security improves.

  4. Parallel steganography framework for hiding a color image inside stereo images

    Science.gov (United States)

    Munoz-Ramirez, David O.; Ponomaryov, Volodymyr I.; Reyes-Reyes, Rogelio; Cruz-Ramos, Clara

    2017-05-01

    In this work, a robust steganography framework to hide a color image into a stereo images is proposed. The embedding algorithm is performed via Discrete Cosine Transform (DCT) and Quantization Index Modulation-Dither Modulation (QIM-DM) hiding the secret data. Additionally, the Arnold's Cat Map Transform is applied in order to scramble the secret color image, guaranteeing better security and robustness of the proposed system. Novel framework has demonstrated better performance against JPEG compression attacks among other existing approaches. Besides, the proposed algorithm is developed taking into account the parallel paradigm in order to be implemented in multi-core CPU increasing the processing speed. The results obtained by the proposed framework show high values of PSNR and SSIM, which demonstrate imperceptibility and sufficient robustness against JPEG compression attacks.

  5. Stegano-Crypto Hiding Encrypted Data in Encrypted Image Using Advanced Encryption Standard and Lossy Algorithm

    Directory of Open Access Journals (Sweden)

    Ari Shawakat Tahir

    2015-12-01

    Full Text Available The Steganography is an art and science of hiding information by embedding messages within other, seemingly harmless messages and lots of researches are working in it. Proposed system is using AES Algorithm and Lossy technique to overcome the limitation of previous work and increasing the process’s speed. The sender uses AES Algorithm to encrypt message and image, then using LSB technique to hide encrypted data in encrypted message. The receive get the original data using the keys that had been used in encryption process. The proposed system has been implemented in NetBeans 7.3 software uses image and data in different size to find the system’s speed.

  6. An Attribute-Based Signcryption Scheme and Its Application in Information Hiding

    Institute of Scientific and Technical Information of China (English)

    PENG Changgen; WANG Weiru; TIAN Youliang; YUAN Zhilong

    2016-01-01

    In order to provide a secure, reliable and flexible way to hide information, a new attribute-based signcryption scheme based on ciphertext-policy and its se-curity proof are presented. This scheme not only can simul-taneously fulfil both authentication and confidentiality in an efficient way, but also implements a hierarchical decryp-tion in one group and also between different groups accord-ing to user’s authority (different users satisfying the same access structure can be considered as a group). We provide a solution to information hiding using our proposed scheme which can embed ciphertext into a carrier. Because the hi-erarchical decryption property, different users will obtain different message from the same carrier. Illegal user can not get any information without private key because mes-sage existed in the carrier is ciphertext. Such solution can be applied in sharing important message under the public network.

  7. A data hiding approach for the self-security of iris recognition

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    Attacks to biometric data are the primary danger to the self-security of biometrics.To improve the iris feature template data security,a data hiding approach based on bit streams is proposed,in which an iris feature template is embedded into a face image. The proposed approach is applicable to present dominant techniques of iris recognition.With the low computation cost and the zero decoding-error-rate,this data hiding approach,embedding target biometric data into other biometric data for improving the security of target data in identity recognition,data storage and transmission,can deceive attackers more effectively.Furthermore,it does not degrade the iris recognition performances.Experimental results prove that the proposed approach can be used to protect iris feature templates and enhance the security of the iris recognition system itself.

  8. New Classification Methods for Hiding Information into Two Parts: Multimedia Files and Non Multimedia Files

    CERN Document Server

    Alanazi, Hamdan O; Zaidan, B B; Jalab, Hamid A; AL-Ani, Zaidoon Kh

    2010-01-01

    With the rapid development of various multimedia technologies, more and more multimedia data are generated and transmitted in the medical, commercial, and military fields, which may include some sensitive information which should not be accessed by or can only be partially exposed to the general users. Therefore, security and privacy has become an important, Another problem with digital document and video is that undetectable modifications can be made with very simple and widely available equipment, which put the digital material for evidential purposes under question .With the large flood of information and the development of the digital format Information hiding considers one of the techniques which used to protect the important information. The main goals for this paper, provides a general overview of the New Classification Methods for Hiding Information into Two Parts: Multimedia Files and Non Multimedia Files.

  9. 12th International Conference on Intelligent Information Hiding and Multimedia Signal Processing

    CERN Document Server

    Tsai, Pei-Wei; Huang, Hsiang-Cheh

    2017-01-01

    This volume of Smart Innovation, Systems and Technologies contains accepted papers presented in IIH-MSP-2016, the 12th International Conference on Intelligent Information Hiding and Multimedia Signal Processing. The conference this year was technically co-sponsored by Tainan Chapter of IEEE Signal Processing Society, Fujian University of Technology, Chaoyang University of Technology, Taiwan Association for Web Intelligence Consortium, Fujian Provincial Key Laboratory of Big Data Mining and Applications (Fujian University of Technology), and Harbin Institute of Technology Shenzhen Graduate School. IIH-MSP 2016 is held in 21-23, November, 2016 in Kaohsiung, Taiwan. The conference is an international forum for the researchers and professionals in all areas of information hiding and multimedia signal processing. .

  10. A new method for high-capacity information hiding in video robust against temporal desynchronization

    Science.gov (United States)

    Mitekin, Vitaly; Fedoseev, Victor A.

    2015-02-01

    This paper presents a new method for high-capacity information hiding in digital video and algorithms of embedding and extraction of hidden information based on this method. These algorithms do not require temporal synchronization to provide robustness against both malicious and non-malicious frame dropping (temporal desynchronization). At the same time, due to randomized distribution of hidden information bits across the video frames, the proposed method allows to increase the hiding capacity proportionally to the number of frames used for information embedding. The proposed method is also robust against "watermark estimation" attack aimed at estimation of hidden information without knowing the embedding key or non-watermarked video. Presented experimental results demonstrate declared features of this method.

  11. Reversible Data Hiding Based on Two-level HDWT Coefficient Histograms

    Directory of Open Access Journals (Sweden)

    Xu-Ren Luo

    2011-05-01

    Full Text Available In recent years, reversible data hiding has attracted much more attention than before. Reversibilitysignifies that the original media can be recovered without any loss from the marked media afterextracting the embedded message. This paper presents a new method that adopts two-level wavelettransform and exploits the feature of large wavelet coefficient variance to achieve the goal of highcapacity with imperceptibility. Our method differs from those of previous ones in which the waveletcoefficients histogram not gray-level histogram is manipulated. Besides, clever shifting rules areintroduced into histogram to avoid the decimal problem in pixel values after recovery to achievereversibility. With small alteration of the wavelet coefficients in the embedding process, and therefore lowvisual distortion is obtained in the marked image. In addition, an important feature of our design is thatthe use of threshold is much different from previous studies. The results indicate that our design issuperior to many other state-of-the-art reversible data hiding schemes.

  12. Piezoelectric micromachined ultrasonic transducers for fingerprint sensing

    Science.gov (United States)

    Lu, Yipeng

    Fingerprint identification is the most prevalent biometric technology due to its uniqueness, universality and convenience. Over the past two decades, a variety of physical mechanisms have been exploited to capture an electronic image of a human fingerprint. Among these, capacitive fingerprint sensors are the ones most widely used in consumer electronics because they are fabricated using conventional complementary metal oxide semiconductor (CMOS) integrated circuit technology. However, capacitive fingerprint sensors are extremely sensitive to finger contamination and moisture. This thesis will introduce an ultrasonic fingerprint sensor using a PMUT array, which offers a potential solution to this problem. In addition, it has the potential to increase security, as it allows images to be collected at various depths beneath the epidermis, providing images of the sub-surface dermis layer and blood vessels. Firstly, PMUT sensitivity is maximized by optimizing the layer stack and electrode design, and the coupling coefficient is doubled via series transduction. Moreover, a broadband PMUT with 97% fractional bandwidth is achieved by utilizing a thinner structure excited at two adjacent mechanical vibration modes with overlapping bandwidth. In addition, we proposed waveguide PMUTs, which function to direct acoustic waves, confine acoustic energy, and provide mechanical protection for the PMUT array. Furthermore, PMUT arrays were fabricated with different processes to form the membrane, including front-side etching with a patterned sacrificial layer, front-side etching with additional anchor, cavity SOI wafers and eutectic bonding. Additionally, eutectic bonding allows the PMUT to be integrated with CMOS circuits. PMUTs were characterized in the mechanical, electrical and acoustic domains. Using transmit beamforming, a narrow acoustic beam was achieved, and high-resolution (sub-100 microm) and short-range (~1 mm) pulse-echo ultrasonic imaging was demonstrated using a steel

  13. Application of Modified Digital Halftoning Techniques to Data Hiding in Personalized Stamps

    Institute of Scientific and Technical Information of China (English)

    Hsi-Chun Wang; Chi-Ming Lian; Pei-Chi Hsiao

    2004-01-01

    The objective of this research is to embed information in personalized stamps by modified digital halftoning techniques. The displaced and deformed halftone dots are used to encode data in the personalized stamps. Hidden information can be retrieved by either an optical decoder or digital image processing techniques.The results show that personalized stamps with value-added features like data hiding or digital watermarking can be successfully implemented.

  14. Suitability of the RGB Channels for a Pixel Manipulation in a Spatial Domain Data Hiding Techniques

    Directory of Open Access Journals (Sweden)

    Ante Poljicak

    2010-06-01

    Full Text Available The aim of this research was to determine which channel in rgb color space is the most suitable (regarding perceptibility for a pixel manipulation in a spatial domain data  hiding techniques. For this purpose three custom test targets were generated. The research also shows the behavior of two closely related colors in the ps (Print-Scan process. The results are interpreted using both a quantitative method (statistical comparison and a qualitative method (visual comparison.

  15. C#实现窗口自动隐藏%Form Automatically Hide with C#

    Institute of Scientific and Technical Information of China (English)

    涂显政

    2012-01-01

      该文介绍了如何利用C#语言,实现靠屏边窗口自动隐藏及鼠标指向后自动弹出。%  Mark a form with C#, the form can automatically hide when it close the edge of screen and it can recover to nor⁃mal when mouse point on it.

  16. Hiding Two Binary Images in Grayscale BMP Image via Five Modulus Method

    Directory of Open Access Journals (Sweden)

    Firas A. Jassim

    2014-05-01

    Full Text Available The aim of this study is to hide two binary BMP images in a single BMP grayscale image. The widespread technique in image steganography is to hide one image (stego image into another (cover image. The proposed novel method is to hide two binary images into one grayscale bitmap cover image. First of all, the proposed technique starts with transforming all grayscale cover image pixels into multiples of five using Five Modulus Method (FMM. Clearly, any modulus of five is either 0, 1, 2, 3, or 4. The transformed FMM cover image could be treated as a good host for carrying data. Obviously, it is known that the pixel value for the binary image is either 0 or 1. Therefore, by concatenating the two binary images, the composite results are 00, 01, 10 and 11. In fact, these concatenated values could be mapped using simple mapping that assigns a positive integer value such as 1 for 00, 2 for 01, 3 for 10 and 4 for 11. Consequently, a new matrix will be constructed that contains a number varying from 1 to 4 only. Fortunately, the four integer values are the same as the previously mentioned reminders of division by 5, hence, adding these four integers to the transformed FMM cover image. On the recipient side, a reverse process will be implemented to extract the two binary images. In terms of PSNR values, the cover image and the two extracted stego images have acceptable PSNR values, which yields that the proposed method is very efficient in information hiding.

  17. Suitability of the rgb Channels for a Pixel Manipulation in a Spatial Domain Data Hiding Techniques

    Directory of Open Access Journals (Sweden)

    Lidija Mandić

    2010-01-01

    Full Text Available The aim of this research was to determine which channel in rgb color space is the most suitable (regarding perceptibility for a pixel manipulation in a spatial domain data hiding techniques. For this purpose three custom test targets were generated. The research also shows the behavior of two closely related colors in the ps (Print-Scan process. The results are interpreted using both a quantitative method (statistical comparison and a qualitative method (visual comparison.

  18. Uniqueness: skews bit occurrence frequencies in randomly generated fingerprint libraries.

    Science.gov (United States)

    Chen, Nelson G

    2016-08-01

    Requiring that randomly generated chemical fingerprint libraries have unique fingerprints such that no two fingerprints are identical causes a systematic skew in bit occurrence frequencies, the proportion at which specified bits are set. Observed frequencies (O) at which each bit is set within the resulting libraries systematically differ from frequencies at which bits are set at fingerprint generation (E). Observed frequencies systematically skew toward 0.5, with the effect being more pronounced as library size approaches the compound space, which is the total number of unique possible fingerprints given the number of bit positions each fingerprint contains. The effect is quantified for varying library sizes as a fraction of the overall compound space, and for changes in the specified frequency E. The cause and implications for this systematic skew are subsequently discussed. When generating random libraries of chemical fingerprints, the imposition of a uniqueness requirement should either be avoided or taken into account.

  19. Fingerprint Image Segmentation Algorithm Based on Contourlet Transform Technology

    Directory of Open Access Journals (Sweden)

    Guanghua Zhang

    2016-09-01

    Full Text Available This paper briefly introduces two classic algorithms for fingerprint image processing, which include the soft threshold denoise algorithm of wavelet domain based on wavelet domain and the fingerprint image enhancement algorithm based on Gabor function. Contourlet transform has good texture sensitivity and can be used for the segmentation enforcement of the fingerprint image. The method proposed in this paper has attained the final fingerprint segmentation image through utilizing a modified denoising for a high-frequency coefficient after Contourlet decomposition, highlighting the fingerprint ridge line through modulus maxima detection and finally connecting the broken fingerprint line using a value filter in direction. It can attain richer direction information than the method based on wavelet transform and Gabor function and can make the positioning of detailed features more accurate. However, its ridge should be more coherent. Experiments have shown that this algorithm is obviously superior in fingerprint features detection.

  20. An Asymmetric Fingerprinting Scheme based on Tardos Codes

    CERN Document Server

    Charpentier, Ana; Furon, Teddy; Cox, Ingemar

    2010-01-01

    Tardos codes are currently the state-of-the-art in the design of practical collusion-resistant fingerprinting codes. Tardos codes rely on a secret vector drawn from a publicly known probability distribution in order to generate each Buyer's fingerprint. For security purposes, this secret vector must not be revealed to the Buyers. To prevent an untrustworthy Provider forging a copy of a Work with an innocent Buyer's fingerprint, previous asymmetric fingerprinting algorithms enforce the idea of the Buyers generating their own fingerprint. Applying this concept to Tardos codes is challenging since the fingerprint must be based on this vector secret. This paper provides the first solution for an asymmetric fingerprinting protocol dedicated to Tardos codes. The motivations come from a new attack, in which an untrustworthy Provider by modifying his secret vector frames an innocent Buyer.

  1. Steganography and Hiding Data with Indicators-based LSB Using a Secret Key

    Directory of Open Access Journals (Sweden)

    W. Saqer

    2016-06-01

    Full Text Available Steganography is the field of science concerned with hiding secret data inside other innocent-looking data, called the container, carrier or cover, in a way that no one apart from the meant parties can suspect the existence of the secret data. There are many algorithms and techniques of concealing data. Each of which has its own way of hiding and its own advantages and limitations. In our research we introduce a new algorithm of hiding data. The algorithm uses the same technique used by the Least Significant Bit (LSB algorithm which is embedding secret data in the least significant bit(s of the bytes of the carrier. It differs from the LSB algorithm in that it does not embed the bytes of the cover data sequentially but it embeds into one bit or two bits at once. Actually it depends on indicators to determine where and how many bits to embed at a time. These indicators are two bits of each cover byte after the least two significant bits. The advantage of this algorithm over the LSB algorithm is the randomness used to confuse intruders as it does not use fixed sequential bytes and it does not always embed one bit at a time. This aims to increase the security of the technique. Also, the amount of cover data consumed is less because it sometimes embeds two bits at once.

  2. Spread spectrum image data hiding in the encrypted discrete cosine transform coefficients

    Science.gov (United States)

    Zhang, Xiaoqiang; Wang, Z. Jane

    2013-10-01

    Digital watermarking and data hiding are important tools for digital rights protection of media data. Spread spectrum (SS)-based watermarking and data-hiding approaches are popular due to their outstanding robustness, but their security might not be sufficient. To improve the security of SS, a SS-based image data-hiding approach is proposed by encrypting the discrete cosine transform coefficients of the host image with the piecewise linear chaotic map, before the operation of watermark embedding. To evaluate the performance of the proposed approach, simulations and analyses of its robustness and security are carried out. The average bit-error-rate values on 100 real images from the Berkeley segmentation dataset under the JPEG compression, additive Gaussian noise, salt and pepper noise, and cropping attacks are reported. Experimental results show that the proposed approach can maintain the high robustness of traditional SS schemes and, meanwhile, also improve the security. The proposed approach can extend the key space of traditional SS schemes from 10 to 10 and thus can resist brute-force attack and unauthorized detection watermark attack.

  3. A High-Capacity Image Data Hiding Scheme Using Adaptive LSB Substitution

    Directory of Open Access Journals (Sweden)

    H. Yang

    2009-12-01

    Full Text Available Many existing steganographic methods hide more secret data into edged areas than smooth areas in the host image, which does not differentiate textures from edges and causes serious degradation in actual edge areas. To avoid abrupt changes in image edge areas, as well as to achieve better quality of the stego-image, a novel image data hiding technique by adaptive Least Significant Bits (LSBs substitution is proposed in this paper. The scheme exploits the brightness, edges, and texture masking of the host image to estimate the number k of LSBs for data hiding. Pixels in the noise non-sensitive regions are embedded by a k-bit LSB substitution with a lager value of k than that of the pixels in noise sensitive regions. Moreover, an optimal pixel adjustment process is used to enhance stego-image visual quality obtained by simple LSB substitution method. To ensure that the adaptive number k of LSBs remains unchanged after pixel modification, the LSBs number is computed by the high-order bits rather than all the bits of the image pixel value. The theoretical analyses and experiment results show that the proposed method achieves higher embedding capacity and better stegoimage quality compared with some existing LSB methods.

  4. Pengaruh hide poison dan formalin terhadap sifat kulit dalam pengawet kulit kambing secara dikeringkan

    Directory of Open Access Journals (Sweden)

    Ignatius Sunaryo

    1991-06-01

    Full Text Available The objective of this study is know the effect of ide poison and formaline in the dried curing of goat skin. This study used 199 goat skins that were devided into seven groups od curing. Each group consisted of 17 goat skins. Those groups were : 3 groups of dried curing by hide poison of 0,1%, 0,3% and 0,5%; 3 groups of dried curing by formaline of 1%, 3% and 5%; and 1 groups of dried curing without any preserevation agent as control. After having stored for about 4 months, those skins then to be analized. Physical and chemical analysis werw carried out to evaluate the quality of the skin. Completely randomized design by Duncan’s test was used to analyze the dta. Based on this statistical analysis we can know that: the effect of hide poson in the dried curing of goat skins was the best. The quality of goat skins that were cured by hide poison was as follows : - the average tensile strength was the highest (886,30 kg/CM2, - the average of stretch was the lowest (14,50%, - the average iof hardness was the highest (201,90 kg/2,54 Cm, - the water content was the lowest (20%, and the damage was the smallest (10%.

  5. Design a Weight Based sorting distortion algorithm using Association rule Hiding for Privacy Preserving Data mining

    Directory of Open Access Journals (Sweden)

    R.Sugumar

    2011-12-01

    Full Text Available The security of the large database that contains certain crucial information, it will become a serious issue when sharing data to the network against unauthorized access. Privacy preserving data mining is a new research trend in privacy data for data mining and statistical database. Association analysis is a powerful tool for discovering relationships which are hidden in large database. Association rules hiding algorithms get strong an efficient performance for protecting confidential and crucial data. Data modification and rule hiding is one of the most important approaches for secure data. The objective of the proposed Weight Based Sorting Distortion (WBSD algorithm is to distort certain data which satisfies a particular sensitive rule. Then hide those transactions which support a sensitive rule and assigns them a priority and sorts them in ascending order according to the priority value of each rule. Then it uses these weights to compute the priority value for each transaction according to how weak the rule is that a transaction supports. Data distortion is one of the important methods to avoid this kind of scalability issues

  6. Information Hiding Method Using Best DCT and Wavelet Coefficients and ItsWatermark Competition

    Directory of Open Access Journals (Sweden)

    Hyunho Kang

    2015-03-01

    Full Text Available In recent years, information hiding and its evaluation criteria have been developed by the IHC (Information Hiding and its Criteria Committee of Japan. This committee was established in 2011 with the aim of establishing standard evaluation criteria for robust watermarks. In this study, we developed an information hiding method that satisfies the IHC evaluation criteria. The proposed method uses the difference of the frequency coefficients derived from a discrete cosine transform or a discrete wavelet transform. The algorithm employs a statistical analysis to find the best positions in the frequency domains for watermark insertion. In particular, we use the BCH (Bose-Chaudhuri-Hocquenghem (511,31,109 code to error correct the watermark bits and the BCH (63,16,11 code as the sync signal to withstand JPEG (Joint Photographic Experts Group compression and cropping attacks. Our experimental results showed that there were no errors in 10 HDTV-size areas after the second decompression. It should be noted that after the second compression, the file size should be less than 1 25 of the original size to satisfy the IHC evaluation criteria.

  7. Authentication and data hiding using a hybrid ROI-based watermarking scheme for DICOM images.

    Science.gov (United States)

    Al-Qershi, Osamah M; Khoo, Bee Ee

    2011-02-01

    Authenticating medical images using watermarking techniques has become a very popular area of research, and some works in this area have been reported worldwide recently. Besides authentication, many data-hiding techniques have been proposed to conceal patient's data into medical images aiming to reduce the cost needed to store data and the time needed to transmit data when required. In this paper, we present a new hybrid watermarking scheme for DICOM images. In our scheme, two well-known techniques are combined to gain the advantages of both and fulfill the requirements of authentication and data hiding. The scheme divides the images into two parts, the region of interest (ROI) and the region of non-interest (RONI). Patient's data are embedded into ROI using a reversible technique based on difference expansion, while tamper detection and recovery data are embedded into RONI using a robust technique based on discrete wavelet transform. The experimental results show the ability of hiding patient's data with a very good visual quality, while ROI, the most important area for diagnosis, is retrieved exactly at the receiver side. The scheme also shows some robustness against certain levels of salt and pepper and cropping noise.

  8. Efficient blind decoders for additive spread spectrum embedding based data hiding

    Science.gov (United States)

    Valizadeh, Amir; Wang, Z. Jane

    2012-12-01

    This article investigates efficient blind watermark decoding approaches for hidden messages embedded into host images, within the framework of additive spread spectrum (SS) embedding based for data hiding. We study SS embedding in both the discrete cosine transform and the discrete Fourier transform (DFT) domains. The contributions of this article are multiple-fold: first, we show that the conventional SS scheme could not be applied directly into the magnitudes of the DFT, and thus we present a modified SS scheme and the optimal maximum likelihood (ML) decoder based on the Weibull distribution is derived. Secondly, we investigate the improved spread spectrum (ISS) embedding, an improved technique of the traditional additive SS, and propose the modified ISS scheme for information hiding in the magnitudes of the DFT coefficients and the optimal ML decoders for ISS embedding are derived. We also provide thorough theoretical error probability analysis for the aforementioned decoders. Thirdly, sub-optimal decoders, including local optimum decoder (LOD), generalized maximum likelihood (GML) decoder, and linear minimum mean square error (LMMSE) decoder, are investigated to reduce the required prior information at the receiver side, and their theoretical decoding performances are derived. Based on decoding performances and the required prior information for decoding, we discuss the preferred host domain and the preferred decoder for additive SS-based data hiding under different situations. Extensive simulations are conducted to illustrate the decoding performances of the presented decoders.

  9. How do 2D fingerprints detect structurally diverse active compounds? Revealing compound subset-specific fingerprint features through systematic selection.

    Science.gov (United States)

    Heikamp, Kathrin; Bajorath, Jürgen

    2011-09-26

    In independent studies it has previously been demonstrated that two-dimensional (2D) fingerprints have scaffold hopping ability in virtual screening, although these descriptors primarily emphasize structural and/or topological resemblance of reference and database compounds. However, the mechanism by which such fingerprints enrich structurally diverse molecules in database selection sets is currently little understood. In order to address this question, similarity search calculations on 120 compound activity classes of varying structural diversity were carried out using atom environment fingerprints. Two feature selection methods, Kullback-Leibler divergence and gain ratio analysis, were applied to systematically reduce these fingerprints and generate alternative versions for searching. Gain ratio is a feature selection method from information theory that has thus far not been considered in fingerprint analysis. However, it is shown here to be an effective fingerprint feature selection approach. Following comparative feature selection and similarity searching, the compound recall characteristics of original and reduced fingerprint versions were analyzed in detail. Small sets of fingerprint features were found to distinguish subsets of active compounds from other database molecules. The compound recall of fingerprint similarity searching often resulted from a cumulative detection of distinct compound subsets by different fingerprint features, which provided a rationale for the scaffold hopping potential of these 2D fingerprints.

  10. 基于流水线实现的加密电路指纹认证方案%Pipeline Based Implementationfor Fingerprint Authentication Scheme Using Garbled Circuit

    Institute of Scientific and Technical Information of China (English)

    赵建; 冯全; 杨梅; 贺康; 刘娟

    2013-01-01

    针对计算资源受限设备在开放网络中指纹认证的隐私保护问题,采用了基于双调排序网络的指纹细节点匹配方案,该方案使用加密电路实现双方交集计算,具有高的计算和通信效率;在此基础上,设计了流水线的实现方式避免设备存储整个加密电路,使计算资源受限设备能够安全、有效地进行现场指纹细节点集合与注册模板集合的匹配程度进行比较。分析表明,该方案适合在低内存的移动、嵌入式设备上运行。%In order to protect privacy of fingerprint when remote authentication is carried out by using equipment with limited computing resource, a scheme which performs the minutiae matching based on bitonic sorting network is adopted. The protocol achieves high efficiency on computation and communication by computing private two-party set intersection problem with garbled circuit. The processing of the garbled gates is pipelined to avoid the need to store the entire circuit and to improve the running time. The proposed scheme is capable of implementing remote authentication on mobile phone or embedded equipment with less memory.

  11. HIDE & SEEK: End-to-end packages to simulate and process radio survey data

    Science.gov (United States)

    Akeret, J.; Seehars, S.; Chang, C.; Monstein, C.; Amara, A.; Refregier, A.

    2017-01-01

    As several large single-dish radio surveys begin operation within the coming decade, a wealth of radio data will become available and provide a new window to the Universe. In order to fully exploit the potential of these datasets, it is important to understand the systematic effects associated with the instrument and the analysis pipeline. A common approach to tackle this is to forward-model the entire system-from the hardware to the analysis of the data products. For this purpose, we introduce two newly developed, open-source Python packages: the HI Data Emulator (HIDE) and the Signal Extraction and Emission Kartographer (SEEK) for simulating and processing single-dish radio survey data. HIDE forward-models the process of collecting astronomical radio signals in a single-dish radio telescope instrument and outputs pixel-level time-ordered-data. SEEK processes the time-ordered-data, removes artifacts from Radio Frequency Interference (RFI), automatically applies flux calibration, and aims to recover the astronomical radio signal. The two packages can be used separately or together depending on the application. Their modular and flexible nature allows easy adaptation to other instruments and datasets. We describe the basic architecture of the two packages and examine in detail the noise and RFI modeling in HIDE, as well as the implementation of gain calibration and RFI mitigation in SEEK. We then apply HIDE &SEEK to forward-model a Galactic survey in the frequency range 990-1260 MHz based on data taken at the Bleien Observatory. For this survey, we expect to cover 70% of the full sky and achieve a median signal-to-noise ratio of approximately 5-6 in the cleanest channels including systematic uncertainties. However, we also point out the potential challenges of high RFI contamination and baseline removal when examining the early data from the Bleien Observatory. The fully documented HIDE &SEEK packages are available at http://hideseek.phys.ethz.ch/ and are published

  12. Chromatographic fingerprint analysis of Pycnogenol dietary supplements.

    Science.gov (United States)

    Chen, Pei; Song, Fenhong; Lin, Long-Ze

    2009-01-01

    The bark of maritime pine (Pinus pinaster Aiton) has been widely used as a remedy for various degenerative diseases. A standard high-performance liquid chromatographic (HPLC) procedure for Pycnogenol analysis is a method specified in the United States Pharmacopeia (USP) monograph, which requires measurement of peak areas and identification of four components of the extract: caffeic acid, catechin, ferulic acid, and taxifolin. In this study, a fingerprint analysis using an HPLC method based on the USP monograph has been developed to provide additional qualitative information for the analysis of Pycnogenol-containing dietary supplements (PDS). Twelve commercially available PDS samples were purchased and analyzed along with a standard Pycnogenol extract. Their chromatographic fingerprints were analyzed using principal component analysis. The results showed that two of the samples were not consistent with the standard reference Pycnogenol extract. One contained other active ingredients in addition to Pycnogenol, and the other may have resulted from a quality control issue in manufacturing.

  13. Reference Device-Assisted Adaptive Location Fingerprinting

    Directory of Open Access Journals (Sweden)

    Dongjin Wu

    2016-06-01

    Full Text Available Location fingerprinting suffers in dynamic environments and needs recalibration from time to time to maintain system performance. This paper proposes an adaptive approach for location fingerprinting. Based on real-time received signal strength indicator (RSSI samples measured by a group of reference devices, the approach applies a modified Universal Kriging (UK interpolant to estimate adaptive temporal and environmental radio maps. The modified UK can take the spatial distribution characteristics of RSSI into account. In addition, the issue of device heterogeneity caused by multiple reference devices is further addressed. To compensate the measuring differences of heterogeneous reference devices, differential RSSI metric is employed. Extensive experiments were conducted in an indoor field and the results demonstrate that the proposed approach not only adapts to dynamic environments and the situation of changing APs’ positions, but it is also robust toward measuring differences of heterogeneous reference devices.

  14. Towards joint decoding of Tardos fingerprinting codes

    CERN Document Server

    Meerwald, Peter

    2011-01-01

    The class of joint decoder of probabilistic fingerprinting codes is of utmost importance in theoretical papers to establish the concept of fingerprint capacity. However, no implementation supporting a large user base is known to date. This paper presents an iterative decoder which is, as far as we are aware of, the first practical attempt towards joint decoding. The discriminative feature of the scores benefits on one hand from the side-information of previously accused users, and on the other hand, from recently introduced universal linear decoders for compound channels. Neither the code construction nor the decoder make precise assumptions about the collusion (size or strategy). The extension to incorporate soft outputs from the watermarking layer is straightforward. An intensive experimental work benchmarks the very good performances and offers a clear comparison with previous state-of-the-art decoders.

  15. Curved Gabor Filters for Fingerprint Image Enhancement

    CERN Document Server

    Gottschlich, Carsten

    2011-01-01

    Gabor filters play an important role in many application areas for the enhancement of various types of images and the extraction of Gabor features. For the purpose of enhancing curved structures in noisy images, we introduce curved Gabor filters which locally adapt their shape to the direction of flow. These curved Gabor filters enable the choice of filter parameters which increase the smoothing power without creating artifacts in the enhanced image. In this paper, curved Gabor filters are applied to the curved ridge and valley structure of low-quality fingerprint images. First, we combine two orientation field estimation methods in order to obtain a more robust estimation for very noisy images. Next, curved regions are constructed by following the respective local orientation and they are used for estimating the local ridge frequency. Lastly, curved Gabor filters are defined based on curved regions and they are applied for the enhancement of low-quality fingerprint images. Experimental results on the FVC2004...

  16. A ROBUST METHOD FOR FINGERPRINTING DIGITAL IMAGES

    Institute of Scientific and Technical Information of China (English)

    Saad Amer; Yi xian Yang

    2001-01-01

    In this paper, a method to fingerprint digital images is proposed, and different watermarked copies with different identification string are made. After determining the number of the customers and the length of the watermark string, this method chooses some values inside the digital image using a characteristic function, and adds watermarks to these values in a way that can protect the product against the attacks happened by comparing two fingerprinted copies.The watermarks are a string of binary numbers -1s and 1s. Every customer will be distinguished by a series of 1s and -1s generated by a pseudo-random generator. The owner of the image can determine the number of customers and the length of the string as well as this method will add another watermarking values to watermark string to protect the product.

  17. Segmentation of Fingerprint Images Using Linear Classifier

    Directory of Open Access Journals (Sweden)

    Xinjian Chen

    2004-04-01

    Full Text Available An algorithm for the segmentation of fingerprints and a criterion for evaluating the block feature are presented. The segmentation uses three block features: the block clusters degree, the block mean information, and the block variance. An optimal linear classifier has been trained for the classification per block and the criteria of minimal number of misclassified samples are used. Morphology has been applied as postprocessing to reduce the number of classification errors. The algorithm is tested on FVC2002 database, only 2.45% of the blocks are misclassified, while the postprocessing further reduces this ratio. Experiments have shown that the proposed segmentation method performs very well in rejecting false fingerprint features from the noisy background.

  18. Transmission fingerprints in quasiperiodic dielectric multilayers

    Science.gov (United States)

    Vasconcelos, M. S.; Albuquerque, E. L.

    1999-05-01

    We investigate the optical transmission fingerprints in structures that exhibit deterministic disorders. A class of models that has attracted particular attention in this context are the quasiperiodic dielectric multilayers that obey a substitutional sequence. These substitutional sequence are characterized by the nature of their Fourier spectrum, which can be dense pure point (Fibonacci sequences), singular continuous (Thue-Morse and double-period sequences), and absolutely continuous (Rudin-Shapiro sequence). We use a transfer-matrix approach to derive the optical transmission coefficients. Numerical results are presented to illustrate the self-similar aspect of the spectra, as well as to show the optical fingerprint through a return map of the transmission coefficients.

  19. Historeceptomic fingerprints for drug-like compounds

    Directory of Open Access Journals (Sweden)

    Evgeny eShmelkov

    2015-12-01

    Full Text Available Most drugs exert their beneficial and adverse effects through their combined action on several different molecular targets (polypharmacology. The true molecular fingerprint of the direct action of a drug has two components: the ensemble of all the receptors upon which a drug acts and their level of expression in organs/tissues. Conversely, the fingerprint of the adverse effects of a drug may derive from its action in bystander tissues. The ensemble of targets is almost always only partially known. Here we describe an approach improving upon and integrating both components: in silico identification of a more comprehensive ensemble of targets for any drug weighted by the expression of those receptors in relevant tissues. Our system combines more than 300K experimentally determined bioactivity values from the ChEMBL database and 4.2 billion generated molecular docking scores. We integrated these scores with gene expression data for human receptors across a panel of human tissues to produce drug-specific tissue-receptor (historeceptomics scores. A statistical model was designed to identify significant scores, which define an improved fingerprint representing the unique activity of any drug. These multi-dimensional historeceptomic fingerprints describe, in a novel, intuitive, and easy to interpret style, the holistic picture of the mechanism of any drug’s action. Valuable applications in drug discovery and personalized medicine, including the identification of molecular signatures for drugs with polypharmacologic modes of action, detection of tissue-specific adverse effects of drugs, matching molecular signatures of a disease to drugs, target identification for bioactive compounds with unknown receptors, and hypothesis generation for drug/compound phenotypes may be enabled by this approach. The system has been deployed at drugable.org for access through a user-friendly web site.

  20. Inimitability of Fingerprint for Establishment of Identity

    OpenAIRE

    Samayita Bhattacharya; Kuntal Barua; Kalyani Mali

    2012-01-01

    To uniquely identify a single person, different types of information can be used with other sources. This concept is ancient, and it has become much more important as information technology and the Internet have made it easier to collect identifiable documents. In this paper we have discussed different types of identify documents and their merits and dis-merits eventually proving that fingerprint is unique, inimitable and easier to access.