Informatica

As an extension of intuitionistic fuzzy sets, picture fuzzy sets can deal with vague, uncertain, incomplete and inconsistent information. The similarity measure is an important technique to distinguish two objects. In this study, a similarity measure between picture fuzzy sets based on relationship matrix is proposed. The new similarity measure satisfies the axiomatic definition of similarity measure. It can be testified from a numerical experiment that the new similarity measure is more effective. Finally, we apply the proposed similarity measure to multiple-attribute decision making.

In this paper, at first, we develop some new geometric distance measures for interval-valued intuitionistic fuzzy information, including the interval-valued intuitionistic fuzzy weighted geometric distance (IVIFWGD) measure, the interval-valued intuitionistic fuzzy ordered weighted geometric distance (IVIFOWGD) measure and the interval-valued intuitionistic fuzzy hybrid weighted geometric distance (IVIFHWGD) measure. Also, several desirable properties of these new distance measures are studied and a numerical example is given to show application of the distance measure to pattern recognition problems. And then, based on the developed distance measures a consensus reaching process with interval-valued intuitionistic fuzzy preference information for group decision making is proposed. Finally, an illustrative example with interval-valued intuitionistic fuzzy information is given.

In this paper we develop a new method for 2-tuple linguistic multiple attribute decision making, namely the 2-tuple linguistic generalized ordered weighted averaging distance (2LGOWAD) operator. This operator is an extension of the OWA operator that utilizes generalized means, distance measures and uncertain information represented as 2-tuple linguistic variables. By using 2LGOWAD, it is possible to obtain a wide range of 2-tuple linguistic aggregation distance operators such as the 2-tuple linguistic maximum distance, the 2-tuple linguistic minimum distance, the 2-tuple linguistic normalized Hamming distance (2LNHD), the 2-tuple linguistic weighted Hamming distance (2LWHD), the 2-tuple linguistic normalized Euclidean distance (2LNED), the 2-tuple linguistic weighted Euclidean distance (2LWED), the 2-tuple linguistic ordered weighted averaging distance (2LOWAD) operator and the 2-tuple linguistic Euclidean ordered weighted averaging distance (2LEOWAD) operator. We study some of its main properties, and we further generalize the 2LGOWAD operator using quasi-arithmetic means. The result is the Quasi-2LOWAD operator. Finally we present an application of the developed operators to decision-making regarding the selection of investment strategies.

This paper builds on a novel, fast algorithm for generating the convex layers on grid points with linear time complexity. Convex layers are extracted from the binary image. The obtained convex hulls are characterized by the number of their vertices and used as representative image features. A computational geometric approach to near-duplicate image detection stems from these features. Similarity of feature vectors of given images is assessed by correlation coefficient. This way, all images with closely related structure and contents can be retrieved from large databases of images quickly and efficiently. The algorithm can be used in various applications such as video surveillance, image and video duplication search, or image alignment. Our approach is rather robust up to moderate signal-to-noise ratios, tolerates lossy image compression, and copes with translated, rotated and scaled image contents.

Speaker identification problem is investigated. The identification is carried out comparing feature vectors (parameters of LPC model) of the “criminal” and “suspicious” speakers. Both likelihood ratio and cepstral distances are used for comparing feature vectors. The feature vectors are extracted from pseudostationary parts of speech utterances. The identification approach is suitable for text-dependent and text-independent identification. Experimental results illustrate the performance of the algorithm.