A Novel Image Similarity Measure Based on Greatest and Smallest Eigen Fuzzy Sets

A novel image similarity index based on the greatest and smallest fuzzy set solutions of the max–min and min–max compositions of fuzzy relations, respectively, is proposed. The greatest and smallest fuzzy sets are found symmetrically as the min–max and max–min solutions, respectively, to a fuzzy relation equation. The original image is partitioned into squared blocks and the pixels in each block are normalized to [0, 1] in order to have a fuzzy relation. The greatest and smallest fuzzy sets, found for each block, are used to measure the similarity between the original image and the image reconstructed by joining the squared blocks. Comparison tests with other well-known image metrics are then carried out where source images are noised by applying Gaussian filters. The results show that the proposed image similarity measure is more effective and robust to noise than the PSNR and SSIM-based measures

Studi Analisis Eigenface Dan Eigen Fuzzy Set Untuk Ekstraksi Ciri Bibir Pada Sistem Identifikasi Wajah

This paper compares the performance of eigenface and eigen fuzzy set to extract lip traits. Testing is conducted by implementing the two methods in a face identification system based on lip traits. The database used is primary data that consists of front-face image and lip image. The test result shows that eigenface is more effective with average precisionrecall value 0.22% higher. However, statistical tests show that there are no significant differences between the two methods. An optimal extraction method will be used to develop face identification system based on facial components

A Novel Approach to Face Recognition using Image Segmentation based on SPCA-KNN Method

In this paper we propose a novel method for face recognition using hybrid SPCA-KNN (SIFT-PCA-KNN) approach. The proposed method consists of three parts. The first part is based on preprocessing face images using Graph Based algorithm and SIFT (Scale Invariant Feature Transform) descriptor. Graph Based topology is used for matching two face images. In the second part eigen values and eigen vectors are extracted from each input face images. The goal is to extract the important information from the face data, to represent it as a set of new orthogonal variables called principal components. In the final part a nearest neighbor classifier is designed for classifying the face images based on the SPCA-KNN algorithm. The algorithm has been tested on 100 different subjects (15 images for each class). The experimental result shows that the proposed method has a positive effect on overall face recognition performance and outperforms other examined methods

Hyperspectral Unmixing Overview: Geometrical, Statistical, and Sparse Regression-Based Approaches

Imaging spectrometers measure electromagnetic energy scattered in their instantaneous field view in hundreds or thousands of spectral channels with higher spectral resolution than multispectral cameras. Imaging spectrometers are therefore often referred to as hyperspectral cameras (HSCs). Higher spectral resolution enables material identification via spectroscopic analysis, which facilitates countless applications that require identifying materials in scenarios unsuitable for classical spectroscopic analysis. Due to low spatial resolution of HSCs, microscopic material mixing, and multiple scattering, spectra measured by HSCs are mixtures of spectra of materials in a scene. Thus, accurate estimation requires unmixing. Pixels are assumed to be mixtures of a few materials, called endmembers. Unmixing involves estimating all or some of: the number of endmembers, their spectral signatures, and their abundances at each pixel. Unmixing is a challenging, ill-posed inverse problem because of model inaccuracies, observation noise, environmental conditions, endmember variability, and data set size. Researchers have devised and investigated many models searching for robust, stable, tractable, and accurate unmixing algorithms. This paper presents an overview of unmixing methods from the time of Keshava and Mustard's unmixing tutorial [1] to the present. Mixing models are first discussed. Signal-subspace, geometrical, statistical, sparsity-based, and spatial-contextual unmixing algorithms are described. Mathematical problems and potential solutions are described. Algorithm characteristics are illustrated experimentally.Comment: This work has been accepted for publication in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensin

Neuro-fuzzy inference system based face recognition using feature extraction

Human face recognition (HFR) is the method of recognizing people in images or videos. There are different HFR methods such as feature-based, eigen-faces, hidden markov model and neural network (NN) based methods. Feature extraction or preprocessing used in first three mentioned methods that associated with the category of the image to recognize. While in the NN method, any type of image can be useful without the requirement to particular data about the type of image, and simultaneously provides superior accuracy. In this paper, HFR system based on neural-fuzzy (NF) has been introduced. In the NN system, backpropagation (BP) algorithm is used to update the weights of the neurons through supervised learning. Two sets of the image have been used for training and testing the network to identify the person. If the test image matches to one of the trained sets of the image, then the system will return recognized. And if the test image does not match to one of the trained sets of the image, then the system will return not recognized. The feature extraction methods used in this paper is Geometric moments and Color feature extraction. The recognition rate of 95.556 % has been achieved. The experimental result illustrations that the association of two techniques that provide better accuracy

A survey of kernel and spectral methods for clustering

Clustering algorithms are a useful tool to explore data structures and have been employed in many disciplines. The focus of this paper is the partitioning clustering problem with a special interest in two recent approaches: kernel and spectral methods. The aim of this paper is to present a survey of kernel and spectral clustering methods, two approaches able to produce nonlinear separating hypersurfaces between clusters. The presented kernel clustering methods are the kernel version of many classical clustering algorithms, e.g., K-means, SOM and neural gas. Spectral clustering arise from concepts in spectral graph theory and the clustering problem is configured as a graph cut problem where an appropriate objective function has to be optimized. An explicit proof of the fact that these two paradigms have the same objective is reported since it has been proven that these two seemingly different approaches have the same mathematical foundation. Besides, fuzzy kernel clustering methods are presented as extensions of kernel K-means clustering algorithm. (C) 2007 Pattem Recognition Society. Published by Elsevier Ltd. All rights reserved