206622046
Fingerprint Alignment Using Similarity Histogram
The performance of fingerprint matching algorithm relies heavily on the accuracy of fingerprint alignment. Falsely aligning two feature sets extracted from two finger images of a fingerprint will increase the false rejection rate (FRR). In order to improve the performance of fingerprint matching algorithm, we present a new fingerprint alignment algorithm called similarity histogram approach (SHA). First, we calculate the local similarity matrix based on minutiae and associate ridges between two fingerprints. Then, similarity histograms of transformation parameters are constructed from local similarity matrix. In the end, the optimal transformation parameters are obtained using a statistical method. Experimental results on FVC databases show that our method is effective and reliable.
30175148
Fingerprint enhancement with dyadic scale-space
Fingerprint enhancement is a critical step in fingerprint identification. Most of the existing enhancement uses a set of contextual fillers to enhance fingerprint. The main drawback of these methods is these contextual filters based on the local information of the fingerprint, such as ridge width, orientation, curvature et al. These information are unreliable in the areas corrupted by the noise. This paper introduces the scale space theory in the computer vision to enhance the fingerprint. In the enhancement process, decompose fingerprint into a series of images and organize the images by finer to coarser scheme. Thus a globe and integrate interpretation is available and it enable us to get rid of the influence of noise to the largest extent. Experiments show our algorithm is fast and has excellent performance.
46662719
A minutiae matching algorithm in fingerprint verification
Fingerprint matching is one of the most important problems in AFIS. In general, we use minutiae such as ridge endings and ridge bifurcation to represent a fingerprint and do fingerprint matching through minutiae matching. We propose a minutiae matching algorithm which modified Jain et al.'s algorithm (1997). Our algorithm can better distinguish two images from different fingers and is more robust to nonlinear deformation. Experiments done on a set of fingerprint images captured with an inkless scanner shows that our algorithm is fast and has high accuracy.
34795143
Automatic Fingerprint Identification Using Cluster Algorithm
18528442
Better Reliability Assessment and Prediction through Data Clustering
This paper presents a new approach to software reliability modeling by grouping data into clusters of homogeneous failure intensities. This series of data clusters associated with different time segments can be directly used as a piecewise linear model for reliability assessment and problem identification, which can produce meaningful results early in the testing process. The dual model fits traditional software reliability growth models (SRGMs) to these grouped data to provide long-term reliability assessments and predictions. These models were evaluated in the testing of two large software systems from IBM. Compared with existing SRGMs fitted to raw data, our models are generally more stable over time and produce more consistent and accurate reliability assessments and predictions.
16178189
Super-resolution Imaging Using Grid Computing
The super-resolution (SR) imaging is to overcome the inherent limitations of the image acquisition systems to produce high-resolution images from their low-resolution counterparts. In our recent work, the Markov chain Monte Carlo (MCMC) technique has been successfully developed and shown as a promising stochastic approach for addressing the SR problem. However, the MCMC SR approach requires substantial amounts of computational resources, for it not only needs to generate a huge number of samples, but also requires an exhaustive search for obtaining an optimal prior image model. To tackle the above computation challenge, Grid computing is introduced for tackling the SR problem in this paper. The computationally- intensive MCMC SR task is broke down into a set of independent and small sub-tasks, which are further distributed and implemented in the grid computing environment. Their respective results are finally assembled to produce a high-resolution image as the final result of the entire MCMC SR task. Experiments are conducted to show that grid computing can effectively accelerating the execution time of the MCMC SR algorithm.
9933284
A MCMC approach for Bayesian super-resolution image reconstruction
In this paper, we consider the super-resolution image reconstruction problem. We propose a Markov chain Monte Carlo (MCMC) approach to find the maximum a posterior probability (MAP) estimation of the unknown high-resolution image. Firstly, Gaussian Markov random field (GMRF) is exploited for modeling the prior probability distribution of the unknown high-resolution image. Then, a MCMC technique (in particular, the Gibbs sampler) is introduced to generate samples from the posterior probability distribution to compute the MAP estimation of the unknown high-resolution image, which is obtained as the mean of the samples. Moreover, we derive a bound on the convergence time of the proposed MCMC approach. Finally, the experimental results are presented to verify the superior performance of the proposed approach and the validity of the proposed bound.
14734990
Reversible data-embedding with a hierarchical structure
Reversible data-embedding embeds data into a digital content (such as digital image, audio or video) such that an authorized party could decode the embedded data and completely restore the original content. In this paper, we present a hierarchically structured, multi-layer algorithm for digital images. Its basic component is an invertible sharpen filter called the difference expansion. The embedding capacity of this algorithm is substantially higher than results reported in previous reversible data-embedding algorithms. The visual quality of images after data-embedding is also among the best in the literature.
206461019
Usage measurement for statistical Web testing and reliability analysis
We have gathered Web usage and related failure information by analyzing various Web logs commonly kept for system administration purposes. The usage information can be used to build models for statistical Web testing. The related failure information can be used to measure the reliability of Web applications. In addition, these data can be used to measure the potential effectiveness of statistical Web testing. We applied this approach to analyze the Web logs of the School of Engineering and Applied Science at Southern Methodist University. The results demonstrated the viability and effectiveness of our approach.