Search

The present communication aims to study the Triangular Intuitionistic Fuzzy Multiple Criteria Decision Making (TIF-MCDM) problem for finding the best option where the phonetic factors for the criteria are pre-characterized. In perspective of this, a new parametric entropy under α-cut/(α,/β)- cut based distance measures has been proposed and implemented for various conceivable estimations of parameters. A survey structure based on a questionnaire for the purchase of a car has also been studied and devised the ranking procedure for the evaluation criteria. Further, a ranking algorithm for TIF-MCDM issue for the accessible options by processing the various distances between the perfect option and all the accessible options has been proposed. An illustrative example to rank the alternatives in view of different opinions has also been included.

In the present communication, we propose a new approach for detecting copy-move forgery in digital images using statistical moments and two dimensional discrete cosine transform. We first slide a window centered around every pixel of the suspicious image, then each window is passed through two dimensional discrete cosine transform (2 D – DCT) to obtain the quantized coefficient matrix. The low dimensional statistical feature vector of each quantized coefficient matrix is obtained and arranged in a feature matrix F . The columns of F contain 4 - statistical features, i.e., mean Me , variance Var , third order moment skewness S k and fourth order moment kurtosis Kr obtained from the quantized coefficient matrix. In order to make similar windows adjacent, the feature matrix F is lexicographically sorted using radix sort. Finally, a copy-move forgery detection is performed using the adjacent pairs of feature vectors. It has also been observed that the proposed method has the lower dimension feature vector with lower computational complexity.

The shortest path problem is a classical network optimization problem which has a wide range of applications in various fields of science and engineering. In the present communication, an algorithm to find the shortest path and shortest distance in an interval-valued intuitionistic fuzzy graph with nodes and links being crisp but the edge weights will be Interval-valued Intuitionistic Trapezoidal Fuzzy Numbers (IITFNs). Finally, a numerical example has been provided for illustrating the proposed approach.

In the present communication, we propose an exponential entropy of order β for an intuitionistic fuzzy set and a new intuitionistic fuzzy divergence measure for the intuitionistic fuzzy sets along with their proof of validity. Further, a new algorithm for image edge detection has been framed on the basis of the proposed intuitionistic information measures. The implementation and applicability of the proposed algorithm have been illustrated by taking different sample images. The obtained results have been finally analyzed and found to be better than the existing ones.