Volume 2, Issue 5, May 2012

Increased Iris Recognition Rate by Observing Wavelet Decomposition Levels and Number of Images Stored [Download Paper]

R. Rizal Isnanto, Thomas Sri Widodo, Suhardjo and Adhi Susanto

Abstract— Iris texture is complex, unique, and very stable throughout life. Iris patterns are unique because they have a high randomness in their structure. The iris is a protected internal organ and can be used as an identity document or a password of- fering a very high degree of identity assurance. Human iris is also immutable over time. From one year of age until death, the patterns of the iris are relatively constant as long as there are no accidents, surgeries or diseases. Because of uniqueness and immutability, iris recognition can be used as an accurate and reliable human identification technique. In this research, iris recognition based on Haar wavelet transform was developed. First, the image of iris is segmented by removing some unused parts in eye image, especially sclera and pupil. To detect the boundary of pupil and iris circles, Circular Hough Transform is used. After segmented, iris is processed into polar coordinate form. The features extracted are energy values of Haar wavelet coefficients. The next step is recognition using normalized Euclidean distance. Some observations are conducted in the re- search, those are influences of wavelet decomposition levels and number of data stored against increased iris recognition rate. This iris recognition system is implemented using Matlab version 7.6.0 (R2008a). As the result, the best recognition rate 100% is achieved when Haar wavelet is implemented in decomposition level 3 and the number of data stored is 5. On the third level of decomposition, the recognition rate increases with increasing number of images on the database from 1 to 5. Meanwhile, the recognition rate decreased after the implementation of the number of images stored in the database 6. 

  --------------------------------------------------------------------------------------------------------------------------------------------------------------------

An efficient approach for partial fingerprint matching based on SIFT and Pore Features [Download Paper]

 S.Malathi and Dr.C.Meena

Abstract—Automatic Fingerprint recognition as one of the most-widely used biometric technology has been extensively studied in the past half of a century. Although it can achieve very high accuracy given fingerprint images are same size or covering sufficiently large fingerprint areas, its accuracy is still far from being satisfactory when partial fingerprint images are available. While the introduction of compact silicon chip-based sensors that capture only part of the fingerprint has made this problem important from a commercial perspective, there is also considerable interest in processing partial and latent fingerprints obtained at crime scenes. When the partial print does not include structures such as core and delta, common matching methods based on alignment of singular structures fail. In order to further improve the accuracy of Partial fingerprint matching, people are now exploring more features apart from minutiae on partial fingerprints. In this paper we propose a novel method for partial fingerprint matching based on non minutiae features such as pore and SIFT (Scale Invariant Feature Transform) features using fusion technique. The experimental results are demonstrated on NIST SD30 database and matching between the feature vectors of a partial fingerprint and those of a template fingerprint in the database is matched by BPNN and its performance is compared with score level matching method. The experimental results show that the proposed method with BPNN matching has a higher accuracy 

  --------------------------------------------------------------------------------------------------------------------------------------------------------------------

“T-SIM” High Fidelity TCP Simulator For Educational Environment [Download Paper]

Tahira Mahboob 

Abstract— Transmission of data reliably and efficiently from the source to the destination is a necessary functionality provided by the data networks. The internet provides a range of protocols for data delivery reliably over the communication networks depending upon the nature of the information being exchanged. Transmission Control Protocol (TCP) is connection-oriented protocol that is being used for reliable process-to-process delivery on the internet today. TCP used flow control algorithm (techniques such as data packet Round Trip Time and packet loss) to prevent overwhelming the receiver which is the main feature of the protocol reliability. Understanding the functionality needs support of some mechanism such as a simulator. Hence, “T-SIM Simulator” provides a user friendly environment enabling experimentation with the flow control functionality under diverse traffic and congestion situations in contrast with previous simulators that are network simulators and are complex in functionality.

  --------------------------------------------------------------------------------------------------------------------------------------------------------------------

An Approach to Build Ontology in Semi-Automated way [Download Paper]

Jaytrilok Choudhary and Devshri Roy

Abstract—Ontology is used for representing the knowledge of a domain in a formal and machine understandable form in areas like intelligent information processing. Thus it provides the platform for effective extraction of information and many other applications. Generally, ontologies are developed manually. Manual ontology building requires lots of efforts by domain experts and hence time consuming and costly. To reduce the effort of manual ontology building, we have explored the feasibility of automatic ontology building. In this paper, we propose a methodology for building ontology in semi-automatic manner. Algorithms are developed for automatic extraction of concepts. Relationships among the concepts are assigned in semi- automated manner. The experimental result shows a fair degree of accuracy which may be improved in future with more sophisticated algorithms. 

  --------------------------------------------------------------------------------------------------------------------------------------------------------------------

Support Vector Machines based Model for Predicting Software Maintainability of Object-Oriented Software Systems [Download Paper]


S. O. Olatunji and Hossain Arif


Abstract—This paper presents a maintainability prediction model for an object-oriented (OO) software system based on support vector machines. As the number of object-oriented software systems increases, it becomes more important for organizations to maintain those systems effectively. However, currently only a small number of maintainability prediction models are available for object oriented systems. In this work, we develop a support vector regression maintainability prediction model for an object-oriented software system. The model was constructed using earlier published object-oriented metric datasets, collected from different object-oriented systems. Prediction accuracy of the model was evaluated and compared with other commonly used regression- based models and also with Bayesian network based model which was earlier developed using the same datasets. Empirical results from experiments carried out indicates that the proposed SVM model produced better and promising results in terms of prediction accuracy measures authorized in OO software maintainability literatures, compared to other earlier implemented models on the same datasets.


  --------------------------------------------------------------------------------------------------------------------------------------------------------------------

Fingerprint Matching Approach Based on Bifurcation Minutiae [Download Paper]


Dr. Manal Abdullah, Mona Alkhozae and Mashaiel Alsowaiel  


Abstract— Fingerprints are the most widely used biometric feature for user identification and verification in the field of biometric identification and security. Minutiae based approach involves extraction of minutiae points from the sample fingerprint images and performing fingerprint matching based on the number of minutiae pairings among two fingerprints in question and generates a matching percentage. Matching techniques still suffer from distortion problems due to poor quality impressions which lead to difficulties in forming a match among multiple impressions acquired from same fingertip. The minutiae from the ridge ending are mostly unreliable due to the poor quality impressions. In this paper we use only the bifurcation minutiae points in the alignment matching stage instead of using it with ending minutiae points. Also we use the bifurcation minutiae points with the ending minutiae points in the match stage. We test the effect of increasing the number of training sets on the performance of our matching technique where it highly reduces FRR when using two templates. The experiment results ensure performance improvements of the enhanced minutiae based approach by taking only the bifurcation minutiae points in the alignment stage sets. The research is coded using MATLAB.