A convolution-based distance measure for fuzzy singletons and its application in a pattern recognition problem

A new method to measure the distance between fuzzy singletons (FSNs) is presented. It first fuzzifies a crisp number to a generalized trapezoidal fuzzy number (GTFN) using the Mamdani fuzzification method. It then treats an FSN as an impulse signal and transforms the FSN into a new GTFN by convoluting it with the original GTFN. In so doing, an existing distance measure for GTFNs can be used to measure distance between FSNs. It is shown that the new measure offers a desirable behavior over the Euclidean and weighted distance measures in the following sense: Under the new measure, the distance between two FSNs is larger when they are in different GTFNs, and smaller when they are in the same GTFN. The advantage of the new measure is demonstrated on a fuzzy forecasting trading system over two different real stock markets, which provides better predictions with larger profits than those obtained using the Euclidean distance measure for the same system.

The quaternion-based spatial-coordinate and orientation-frame alignment problems

The general problem of finding a global rotation that transforms a given set of spatial coordinates and/or orientation frames (the `test' data) into the best possible alignment with a corresponding set (the `reference' data) is reviewed. For 3D point data, this `orthogonal Procrustes problem' is often phrased in terms of minimizing a root-mean-square deviation (RMSD) corresponding to a Euclidean distance measure relating the two sets of matched coordinates. This article focuses on quaternion eigensystem methods that have been exploited to solve this problem for at least five decades in several different bodies of scientific literature, where they were discovered independently. While numerical methods for the eigenvalue solutions dominate much of this literature, it has long been realized that the quaternion-based RMSD optimization problem can also be solved using exact algebraic expressions based on the form of the quartic equation solution published by Cardano in 1545; focusing on these exact solutions exposes the structure of the entire eigensystem for the traditional 3D spatial-alignment problem. The structure of the less-studied orientation-data context is then explored, investigating how quaternion methods can be extended to solve the corresponding 3D quaternion orientation-frame alignment (QFA) problem, noting the interesting equivalence of this problem to the rotation-averaging problem, which also has been the subject of independent literature threads. The article concludes with a brief discussion of the combined 3D translation–orientation data alignment problem. Appendices are devoted to a tutorial on quaternion frames, a related quaternion technique for extracting quaternions from rotation matrices and a review of quaternion rotation-averaging methods relevant to the orientation-frame alignment problem. The supporting information covers novel extensions of quaternion methods to the 4D Euclidean spatial-coordinate alignment and 4D orientation-frame alignment problems, some miscellaneous topics, and additional details of the quartic algebraic eigenvalue problem.

Image Analysis using Non Negative Matrix Factorization

Image analysis extracts the meaningful information from the images. This information is very much helpful to recognition and authentication. There are number of techniques available for image analysis. Image analysis can be used in analysis of the scene, image understanding and computer vision. Image analysis can be used in Medical image processing, Geology, optical character recognition and forensics. There are mainly four steps in the image analysis 1.image pre processing 2. Segmentation 3.feature extraction and 4. Classification and interpretation. Feature extraction is the main part for any image analysis. In this paper Multi modal biometric authentication system can be defined for security. In this process Non Negative Matrix Factorization (NMF) technique is used for feature extraction and for fusion Principle component analysis is used. After getting the features these can be encoding using Kronecker product. At the end Euclidean distance measure is used for authentication.

A Fast Multiobjective Fuzzy Clustering with Multimeasures Combination

Most of the existing clustering algorithms are often based on Euclidean distance measure. However, only using Euclidean distance measure may not be sufficient enough to partition a dataset with different structures. Thus, it is necessary to combine multiple distance measures into clustering. However, the weights for different distance measures are hard to set. Accordingly, it appears natural to keep multiple distance measures separately and to optimize them simultaneously by applying a multiobjective optimization technique. Recently a new clustering algorithm called ‘multiobjective evolutionary clustering based on combining multiple distance measures’ (MOECDM) was proposed to integrate Euclidean and Path distance measures together for partitioning the dataset with different structures. However, it is time-consuming due to the large-sized genes. This paper proposes a fast multiobjective fuzzy clustering algorithm for partitioning the dataset with different structures. In this algorithm, a real encoding scheme is adopted to represent the individual. Two fuzzy clustering objective functions are designed based on Euclidean and Path distance measures, respectively, to evaluate the goodness of each individual. An improved evolutionary operator is also introduced accordingly to increase the convergence speed and the diversity of the population. In the final generation, a set of nondominated solutions can be obtained. The best solution and the best distance measure are selected by using a semisupervised method. Afterwards, an updated algorithm is also designed to detect the optimal cluster number automatically. The proposed algorithms are applied to many datasets with different structures, and the results of eight artificial and six real-life datasets are shown in experiments. Experimental results have shown that the proposed algorithms can not only successfully partition the dataset with different structures, but also reduce the computational cost.

Some Similarity Measures of Neutrosophic Sets Based on the Euclidean Distance and Their Application in Medical Diagnosis

Similarity measure is an important tool in multiple criteria decision-making problems, which can be used to measure the difference between the alternatives. In this paper, some new similarity measures of single-valued neutrosophic sets (SVNSs) and interval-valued neutrosophic sets (IVNSs) are defined based on the Euclidean distance measure, respectively, and the proposed similarity measures satisfy the axiom of the similarity measure. Furthermore, we apply the proposed similarity measures to medical diagnosis decision problem; the numerical example is used to illustrate the feasibility and effectiveness of the proposed similarity measures of SVNSs and IVNSs, which are then compared to other existing similarity measures.

The New Similarity Measure and Distance Measure of a Hesitant Fuzzy Linguistic Term Set Based on a Linguistic Scale Function

The existing cosine similarity measure for hesitant fuzzy linguistic term sets (HFLTSs) has an impediment as it does not satisfy the axiom of similarity measure. Due to this disadvantage, a new similarity measure combining the existing cosine similarity measure and the Euclidean distance measure of HFLTSs is proposed, which is constructed based on a linguistic scale function; the related properties are also given. According to the relationship between the distance measure and the similarity measure, a corresponding distance measure between HFLTSs is obtained. Furthermore, we generalize the technique for order preference by similarity to an ideal solution (TOPSIS) method to the obtained distance measure of the HFLTSs. The principal advantages of the proposed method are that it cannot only effectively transform linguistic information in different semantic environments, but it can also avoid the shortcomings of existing the cosine similarity measure. Finally, a case study is conducted to illustrate the feasibility and effectiveness of the proposed method, which is compared to the existing methods.