Improving Iris Recognition through Quality and Interoperability Metrics

The ability to identify individuals based on their iris is known as iris recognition. Over the past decade iris recognition has garnered much attention because of its strong performance in comparison with other mainstream biometrics such as fingerprint and face recognition. Performance of iris recognition systems is driven by application scenario requirements. Standoff distance, subject cooperation, underlying optics, and illumination are a few examples of these requirements which dictate the nature of images an iris recognition system has to process. Traditional iris recognition systems, dubbed stop and stare , operate under highly constrained conditions. This ensures that the captured image is of sufficient quality so that the success of subsequent processing stages, segmentation, encoding, and matching are not compromised. When acquisition constraints are relaxed, such as for surveillance or iris on the move, the fidelity of subsequent processing steps lessens.;In this dissertation we propose a multi-faceted framework for mitigating the difficulties associated with non-ideal iris. We develop and investigate a comprehensive iris image quality metric that is predictive of iris matching performance. The metric is composed of photometric measures such as defocus, motion blur, and illumination, but also contains domain specific measures such as occlusion, and gaze angle. These measures are then combined through a fusion rule based on Dempster-Shafer theory. Related to iris segmentation, which is arguably one of the most important tasks in iris recognition, we develop metrics which are used to evaluate the precision of the pupil and iris boundaries. Furthermore, we illustrate three methods which take advantage of the proposed segmentation metrics for rectifying incorrect segmentation boundaries. Finally, we look at the issue of iris image interoperability and demonstrate that techniques from the field of hardware fingerprinting can be utilized to improve iris matching performance when images captured from distinct sensors are involved

Novel Restoration Techniques for Images Corrupted with High Density Impulsive Noise

Impulse noise is a most common noise which affects the image quality during acquisition or transmission, reception or storage and retrieval process. Impulse noise comes under two categories: (1) fixed-valued impulse noise, also known as salt-and-pepper noise (SPN) due to its appearance, where the noise value may be either the minimum or maximum value of the dynamic gray-scale range of image and (2) random-valued impulse noise (RVIN), where the noisy pixel value is bounded by the range of the dynamic gray-scale of the image. In literature, many efficient filters are proposed to suppress the impulse noise. But their performance is not good under moderate and high noise conditions. Hence, there is sufficient scope to explore and develop efficient filters for suppressing the impulse noise at high noise densities. In the present research work, efforts are made to propose efficient filters that suppress the impulse noise and preserve the edges and fine details of an image in wide range of noise densities. It is clear from the literature that detection followed by filtering achieves better performance than filtering without detection. Hence, the proposed filters in this thesis are based on detection followed by filtering techniques. The filters which are proposed to suppress the SPN in this thesis are: Adaptive Noise Detection and Suppression (ANDS) Filter Robust Estimator based Impulse-Noise Reduction (REIR) Algorithm Impulse Denoising Using Improved Progressive Switching Median Filter (IDPSM) Impulse-Noise Removal by Impulse Classification (IRIC) A Novel Adaptive Switching Filter-I (ASF-I) for Suppression of High Density SPN A Novel Adaptive Switching Filter-II (ASF-II) for Suppression of High Density SPN Impulse Denoising Using Iterative Adaptive Switching Filter (IASF) In the first method, ANDS, neighborhood difference is employed for pixel classification. Controlled by binary image, the noise is filtered by estimating the value of a pixel with an adaptive switching based median filter applied exclusively to neighborhood pixels that are labeled noise-free. The proposed filter performs better in retaining edges and fine details of an image at low-to-medium densities of fixed-valued impulse noise.The REIR method is based on robust statistic technique, where adaptive window is used for pixel classification. The noisy pixel is replaced with Lorentzian estimator or average of the previously processed pixels. Because of adaptive windowing technique, the filter is able to suppress the noise at a density as high as 90%. In the proposed method, IDPSM, the noisy pixel is replaced with median of uncorrupted pixels in an adaptive filtering window. The iterative nature of the filter makes it more efficient in noise detection and adaptive filtering window technique makes it robust enough to preserve edges and fine details of an image in wide range of noise densities. The forth proposed method is IRIC. The noisy pixel is replaced with median of processed pixels in the filtering window. At high noise densities, the median filtering may not be able to reject outliers always. Under such circumstances, the processed left neighboring pixel is considered as the estimated output. The computational complexity of this method is equivalent to that of a median filter having a 3×3 window. The proposed algorithm requires simple physical realization structures. Therefore, this algorithm may be quite useful for online and real-time applications. Two different adaptive switching filters: ASF-I and ASF-II are developed for suppressing SPN at high noise density. The noisy pixel is replaced with alpha-trimmed mean value of uncorrupted pixels in the adaptive filtering window. Depending on noise estimation, a small filtering window size is initially selected and then the scheme adaptively changes the window size based on the number of noise-free pixels. Therefore, the proposed method removes the noise much more effectively even at noise density as high as 90% and yields high image quality. In the proposed method IASF, noisy pixel is replaced with alpha-trimmed mean value of uncorrupted pixels in the adaptive filtering window. Due to its iterative structure, the performance of this filter is better than existing order-statistic filters. Further, the adaptive filtering window makes it robust enough to preserve the edges and fine details of an image. Novel Restoration Techniques for Images Corrupted with High Density Impulsive Noise x The filters which are proposed for suppressing random-valued impulse noise (RVIN) are: Adaptive Window based Pixel-Wise MAD (AW-PWMAD) Algorithm Adaptive Local Thresholding with MAD (ALT-MAD) Algorithm The proposed method, Adaptive Window based Pixel-Wise MAD (AW-PWMAD) Algorithm is a modified MAD (Median of the Absolute Deviations from the median) scheme alongwith a threshold employed for pixel-classification. The noisy pixel is replaced with median of uncorrupted pixels in adaptive filtering window. Another proposed method for denoising the random-valued and fixed-valued impulse noise is ALT-MAD. A modified MAD based algorithm alongwith a local adaptive threshold is utilized for pixel-classification. The noisy pixel is replaced with median of uncorrupted pixels in the filtering window of adaptively varied size. Three threshold functions are suggested and employed in this algorithm. Thus, three different versions, namely, ALT-MAD-1, ALT-MAD-2 and ALT-MAD-3 are developed. They are observed to be quite efficient in noise detection and filtering. In the last part of the thesis, some efforts are made to develop filters for color image denoising. The filters which perform better in denoising gray-scale images are developed for suppression of impulsive noise from color images. Since the performance of denoising filters degrades in other color spaces, efforts are made to develop color image denoising filters in RGB color space only in this research work. The developed filters are: Multi-Channel Robust Estimator based Impulse-Noise Reduction (MC-REIR) Algorithm Multi-Channel Impulse-Noise Removal by Impulse Classification (MC-IRIC) Multi-Channel Iterative Adaptive Switching Filter (MC-IASF) Multi-Channel Adaptive Local Thresholding with MAD (MC-ALT-MAD) Algorithm It is observed from the simulation results that the proposed filters perform better than the existing methods. The proposed methods: ASF-1 and IASF exhibit quite superior performance in suppressing SPN in high noise densities compared to other methods. Similarly ALT-MAD-3 exhibits much better performance in suppressing RVIN of low to medium noise densities.The REIR method is based on robust statistic technique, where adaptive window is used for pixel classification. The noisy pixel is replaced with Lorentzian estimator or average of the previously processed pixels. Because of adaptive windowing technique, the filter is able to suppress the noise at a density as high as 90%. In the proposed method, IDPSM, the noisy pixel is replaced with median of uncorrupted pixels in an adaptive filtering window. The iterative nature of the filter makes it more efficient in noise detection and adaptive filtering window technique makes it robust enough to preserve edges and fine details of an image in wide range of noise densities. The forth proposed method is IRIC. The noisy pixel is replaced with median of processed pixels in the filtering window. At high noise densities, the median filtering may not be able to reject outliers always. Under such circumstances, the processed left neighboring pixel is considered as the estimated output. The computational complexity of this method is equivalent to that of a median filter having a 3×3 window. The proposed algorithm requires simple physical realization structures. Therefore, this algorithm may be quite useful for online and real-time applications. Two different adaptive switching filters: ASF-I and ASF-II are developed for suppressing SPN at high noise density. The noisy pixel is replaced with alpha-trimmed mean value of uncorrupted pixels in the adaptive filtering window. Depending on noise estimation, a small filtering window size is initially selected and then the scheme adaptively changes the window size based on the number of noise-free pixels. Therefore, the proposed method removes the noise much more effectively even at noise density as high as 90% and yields high image quality. In the proposed method IASF, noisy pixel is replaced with alpha-trimmed mean value of uncorrupted pixels in the adaptive filtering window. Due to its iterative structure, the performance of this filter is better than existing order-statistic filters. Further, the adaptive filtering window makes it robust enough to preserve the edges and fine details of an image. Novel Restoration Techniques for Images Corrupted with High Density Impulsive Noise x The filters which are proposed for suppressing random-valued impulse noise (RVIN) are: Adaptive Window based Pixel-Wise MAD (AW-PWMAD) Algorithm Adaptive Local Thresholding with MAD (ALT-MAD) Algorithm The proposed method, Adaptive Window based Pixel-Wise MAD (AW-PWMAD) Algorithm is a modified MAD (Median of the Absolute Deviations from the median) scheme alongwith a threshold employed for pixel-classification. The noisy pixel is replaced with median of uncorrupted pixels in adaptive filtering window. Another proposed method for denoising the random-valued and fixed-valued impulse noise is ALT-MAD. A modified MAD based algorithm alongwith a local adaptive threshold is utilized for pixel-classification. The noisy pixel is replaced with median of uncorrupted pixels in the filtering window of adaptively varied size. Three threshold functions are suggested and employed in this algorithm. Thus, three different versions, namely, ALT-MAD-1, ALT-MAD-2 and ALT-MAD-3 are developed. They are observed to be quite efficient in noise detection and filtering. In the last part of the thesis, some efforts are made to develop filters for color image denoising. The filters which perform better in denoising gray-scale images are developed for suppression of impulsive noise from color images. Since the performance of denoising filters degrades in other color spaces, efforts are made to develop color image denoising filters in RGB color space only in this research work. The developed filters are: Multi-Channel Robust Estimator based Impulse-Noise Reduction (MC-REIR) Algorithm Multi-Channel Impulse-Noise Removal by Impulse Classification (MC-IRIC) Multi-Channel Iterative Adaptive Switching Filter (MC-IASF) Multi-Channel Adaptive Local Thresholding with MAD (MC-ALT-MAD) Algorithm It is observed from the simulation results that the proposed filters perform better than the existing methods. The proposed methods: ASF-1 and IASF exhibit quite superior performance in suppressing SPN in high noise densities compared to other methods. Similarly ALT-MAD-3 exhibits much better performance in suppressing RVIN of low to medium noise densities.The REIR method is based on robust statistic technique, where adaptive window is used for pixel classification. The noisy pixel is replaced with Lorentzian estimator or average of the previously processed pixels. Because of adaptive windowing technique, the filter is able to suppress the noise at a density as high as 90%. In the proposed method, IDPSM, the noisy pixel is replaced with median of uncorrupted pixels in an adaptive filtering window. The iterative nature of the filter makes it more efficient in noise detection and adaptive filtering window technique makes it robust enough to preserve edges and fine details of an image in wide range of noise densities. The forth proposed method is IRIC. The noisy pixel is replaced with median of processed pixels in the filtering window. At high noise densities, the median filtering may not be able to reject outliers always. Under such circumstances, the processed left neighboring pixel is considered as the estimated output. The computational complexity of this method is equivalent to that of a median filter having a 3×3 window. The proposed algorithm requires simple physical realization structures. Therefore, this algorithm may be quite useful for online and real-time applications. Two different adaptive switching filters: ASF-I and ASF-II are developed for suppressing SPN at high noise density. The noisy pixel is replaced with alpha-trimmed mean value of uncorrupted pixels in the adaptive filtering window. Depending on noise estimation, a small filtering window size is initially selected and then the scheme adaptively changes the window size based on the number of noise-free pixels. Therefore, the proposed method removes the noise much more effectively even at noise density as high as 90% and yields high image quality. In the proposed method IASF, noisy pixel is replaced with alpha-trimmed mean value of uncorrupted pixels in the adaptive filtering window. Due to its iterative structure, the performance of this filter is better than existing order-statistic filters. Further, the adaptive filtering window makes it robust enough to preserve the edges and fine details of an image. Novel Restoration Techniques for Images Corrupted with High Density Impulsive Noise x The filters which are proposed for suppressing random-valued impulse noise (RVIN) are: Adaptive Window based Pixel-Wise MAD (AW-PWMAD) Algorithm Adaptive Local Thresholding with MAD (ALT-MAD) Algorithm The proposed method, Adaptive Window based Pixel-Wise MAD (AW-PWMAD) Algorithm is a modified MAD (Median of the Absolute Deviations from the median) scheme alongwith a threshold employed for pixel-classification. The noisy pixel is replaced with median of uncorrupted pixels in adaptive filtering window. Another proposed method for denoising the random-valued and fixed-valued impulse noise is ALT-MAD. A modified MAD based algorithm alongwith a local adaptive threshold is utilized for pixel-classification. The noisy pixel is replaced with median of uncorrupted pixels in the filtering window of adaptively varied size. Three threshold functions are suggested and employed in this algorithm. Thus, three different versions, namely, ALT-MAD-1, ALT-MAD-2 and ALT-MAD-3 are developed. They are observed to be quite efficient in noise detection and filtering. In the last part of the thesis, some efforts are made to develop filters for color image denoising. The filters which perform better in denoising gray-scale images are developed for suppression of impulsive noise from color images. Since the performance of denoising filters degrades in other color spaces, efforts are made to develop color image denoising filters in RGB color space only in this research work. The developed filters are: Multi-Channel Robust Estimator based Impulse-Noise Reduction (MC-REIR) Algorithm Multi-Channel Impulse-Noise Removal by Impulse Classification (MC-IRIC) Multi-Channel Iterative Adaptive Switching Filter (MC-IASF) Multi-Channel Adaptive Local Thresholding with MAD (MC-ALT-MAD) Algorithm It is observed from the simulation results that the proposed filters perform better than the existing methods. The proposed methods: ASF-1 and IASF exhibit quite superior performance in suppressing SPN in high noise densities compared to other methods. Similarly ALT-MAD-3 exhibits much better performance in suppressing RVIN of low to medium noise densities

Data fusion using expected output membership functions

Multi-sensor systems can improve accuracy, increase detection range, and enhance reliability compared to single sensor systems. The main problems in multi-sensor systems are how to select sensors, model the sensors, and combine the data;This dissertation proposes a new data fusion method based on fuzzy set methods. The expected output membership function (EOMF) method uses the fuzzy input set and the expected fuzzy output. This method uses the intersections of the fuzzy inputs with the expected fuzzy output in order to find relationships between the given inputs and the estimate of the output. The EOMF method creates a fuzzy confidence distance measurement by assessing the fusability of the data. The fusability measure is used for finding the best position of the EOMF and the best estimate of the system output. Adaptive methods can help deal with occasional bad measurements and set the EOMF to the proper width. The EOMF method can be used for both homogeneous and heterogeneous sensors, which give redundant, cooperative or complementary information. In addition, the EOMF method is robust in the sense that it can eliminate sensor measurements that are outliers. The EOMF method compares favorably with other methods of data fusion such as the weighted average method. An example from the control of automated vehicles shows the effectiveness of the adaptive EOMF method, compared to the fixed EOMF method and the weighted average method in the presence of Gaussian and impulsive noise. This method can also be applied to nondestructive evaluation (NDE) images from heterogeneous sensors

Connected Attribute Filtering Based on Contour Smoothness

A new attribute measuring the contour smoothness of 2-D objects is presented in the context of morphological attribute filtering. The attribute is based on the ratio of the circularity and non-compactness, and has a maximum of 1 for a perfect circle. It decreases as the object boundary becomes irregular. Computation on hierarchical image representation structures relies on five auxiliary data members and is rapid. Contour smoothness is a suitable descriptor for detecting and discriminating man-made structures from other image features. An example is demonstrated on a very-high-resolution satellite image using connected pattern spectra and the switchboard platform

Advances and Applications of DSmT for Information Fusion. Collected Works, Volume 5

This fifth volume on Advances and Applications of DSmT for Information Fusion collects theoretical and applied contributions of researchers working in different fields of applications and in mathematics, and is available in open-access. The collected contributions of this volume have either been published or presented after disseminating the fourth volume in 2015 in international conferences, seminars, workshops and journals, or they are new. The contributions of each part of this volume are chronologically ordered. First Part of this book presents some theoretical advances on DSmT, dealing mainly with modified Proportional Conflict Redistribution Rules (PCR) of combination with degree of intersection, coarsening techniques, interval calculus for PCR thanks to set inversion via interval analysis (SIVIA), rough set classifiers, canonical decomposition of dichotomous belief functions, fast PCR fusion, fast inter-criteria analysis with PCR, and improved PCR5 and PCR6 rules preserving the (quasi-)neutrality of (quasi-)vacuous belief assignment in the fusion of sources of evidence with their Matlab codes. Because more applications of DSmT have emerged in the past years since the apparition of the fourth book of DSmT in 2015, the second part of this volume is about selected applications of DSmT mainly in building change detection, object recognition, quality of data association in tracking, perception in robotics, risk assessment for torrent protection and multi-criteria decision-making, multi-modal image fusion, coarsening techniques, recommender system, levee characterization and assessment, human heading perception, trust assessment, robotics, biometrics, failure detection, GPS systems, inter-criteria analysis, group decision, human activity recognition, storm prediction, data association for autonomous vehicles, identification of maritime vessels, fusion of support vector machines (SVM), Silx-Furtif RUST code library for information fusion including PCR rules, and network for ship classification. Finally, the third part presents interesting contributions related to belief functions in general published or presented along the years since 2015. These contributions are related with decision-making under uncertainty, belief approximations, probability transformations, new distances between belief functions, non-classical multi-criteria decision-making problems with belief functions, generalization of Bayes theorem, image processing, data association, entropy and cross-entropy measures, fuzzy evidence numbers, negator of belief mass, human activity recognition, information fusion for breast cancer therapy, imbalanced data classification, and hybrid techniques mixing deep learning with belief functions as well

A robust framework for medical image segmentation through adaptable class-specific representation

Medical image segmentation is an increasingly important component in virtual pathology, diagnostic imaging and computer-assisted surgery. Better hardware for image acquisition and a variety of advanced visualisation methods have paved the way for the development of computer based tools for medical image analysis and interpretation. The routine use of medical imaging scans of multiple modalities has been growing over the last decades and data sets such as the Visible Human Project have introduced a new modality in the form of colour cryo section data. These developments have given rise to an increasing need for better automatic and semiautomatic segmentation methods. The work presented in this thesis concerns the development of a new framework for robust semi-automatic segmentation of medical imaging data of multiple modalities. Following the specification of a set of conceptual and technical requirements, the framework known as ACSR (Adaptable Class-Specific Representation) is developed in the first case for 2D colour cryo section segmentation. This is achieved through the development of a novel algorithm for adaptable class-specific sampling of point neighbourhoods, known as the PGA (Path Growing Algorithm), combined with Learning Vector Quantization. The framework is extended to accommodate 3D volume segmentation of cryo section data and subsequently segmentation of single and multi-channel greyscale MRl data. For the latter the issues of inhomogeneity and noise are specifically addressed. Evaluation is based on comparison with previously published results on standard simulated and real data sets, using visual presentation, ground truth comparison and human observer experiments. ACSR provides the user with a simple and intuitive visual initialisation process followed by a fully automatic segmentation. Results on both cryo section and MRI data compare favourably to existing methods, demonstrating robustness both to common artefacts and multiple user initialisations. Further developments into specific clinical applications are discussed in the future work section

Entropy in Image Analysis II

Image analysis is a fundamental task for any application where extracting information from images is required. The analysis requires highly sophisticated numerical and analytical methods, particularly for those applications in medicine, security, and other fields where the results of the processing consist of data of vital importance. This fact is evident from all the articles composing the Special Issue "Entropy in Image Analysis II", in which the authors used widely tested methods to verify their results. In the process of reading the present volume, the reader will appreciate the richness of their methods and applications, in particular for medical imaging and image security, and a remarkable cross-fertilization among the proposed research areas