Deep image retrieval using artificial neural network interpolation and indexing based on similarity measurement

In content-based image retrieval(CBIR),primitive image signatures are critical because they represent the visual characteristics.Image signatures,which are algorithmically descriptive and accurately recognized visual components,are used to appropriately index and retrieve comparable results.To differentiate an image in the category of qualifying contender,feature vectors must have image information's like colour,objects,shape,spatial viewpoints.Previous methods such as sketch-based image retrieval by salient contour(SBIR)and greedy learning of deep Boltzmann machine(GDBM)used spatial information to distinguish between image categories.This requires interest points and also feature analysis emerged image detection problems.Thus,a proposed model to overcome this issue and predict the repeating pattern as well as series of pixels that conclude similarity has been necessary.In this study,a technique called CBIR-similarity measure via artificial neural network interpolation(CBIR-SMANN)has been presented.By collecting datasets,the images are resized then subject to Gaussian filtering in the pre-processing stage,then by permitting them to the Hessian detector,the interesting points are gathered.Based on Skewness,mean,kurtosis and standard deviation features were extracted then given to ANN for interpolation.Interpolated results are stored in a database for retrieval.In the testing stage,the query image was inputted that is subjected to pre-processing,and feature extraction was then fed to the similarity measurement function.Thus,ANN helps to get similar images from the database.CBIR-SMANN have been implemented in the python tool and then evaluated for its performance.Results show that CBIR-SMANN exhibited a high recall value of 78%with a minimum retrieval time of 980 ms.This showed the supremacy of the proposed model was comparatively greater than the previous ones.

JacUOD:A New Similarity Measurement for Collaborative Filtering

Collaborative filtering （CF） has been widely applied to recommender systems, since it can assist users to discover their favorite items. Similarity measurement that measures the similarity between two users or items is critical to CF. However, traditional similarity measurement approaches for memory-based CF can be strongly improved. In this paper, we propose a novel similarity measurement, named Jaccard Uniform Operator Distance （JacUOD）, to effectively measure the similarity. Our JacUOD approach aims at unifying similarity comparison for vectors in different multidimensional vector spaces. Compared with traditional similarity measurement approaches, JacUOD properly handles dimension-number difference for different vector spaces. We conduct experiments based on the well-known MovieLens datasets, and take user-based CF as an example to show the effectiveness of our approach. The experimental results show that our JacUOD approach achieves better prediction accuracy than traditional similarity measurement approaches.

An improved morphological weighted dynamic similarity measurement algorithm for time series data

Purpose–The similarity measurement of time series is an important research in time series detection,which is a basic work of time series clustering,anomaly discovery,prediction and many other data mining problems.The purpose of this paper is to design a new similarity measurement algorithm to improve the performance of the original similarity measurement algorithm.The subsequence morphological information is taken into account by the proposed algorithm,and time series is represented by a pattern,so the similarity measurement algorithm is more accurate.Design/methodology/approach–Following some previous researches on similarity measurement,an improved method is presented.This new method combines morphological representation and dynamic time warping(DTW)technique to measure the similarities of time series.After the segmentation of time series data into segments,three parameter values of median,point number and slope are introduced into the improved distance measurement formula.The effectiveness of the morphological weighted DTW algorithm(MW-DTW)is demonstrated by the example of momentum wheel data of an aircraft attitude control system.Findings–The improved method is insensitive to the distortion and expansion of time axis and can be used to detect the morphological changes of time series data.Simulation results confirm that this method proposed in this paper has a high accuracy of similarity measurement.Practical implications–This improved method has been used to solve the problem of similarity measurement in time series,which is widely emerged in different fields of science and engineering,such as the field of control,measurement,monitoring,process signal processing and economic analysis.Originality/value–In the similarity measurement of time series,the distance between sequences is often used as the only detection index.The results of similarity measurement should not be affected by the longitudinal or transverse stretching and translation changes of the sequence,so it is necessary to incorporate themorphological changes of the sequence into similarity measurement.The MW-DTW is more suitable for the actual situation.At the same time,the MW-DTW algorithm reduces the computational complexity by transforming the computational object to subsequences.

A Quantum Tanimoto Coefficient Fidelity for Entanglement Measurement

Fidelity plays an important role in quantum information processing,which provides a basic scale for comparing two quantum states.At present,one of the most commonly used fidelities is Uhlmann-Jozsa(U-J)fidelity.However,U-J fidelity needs to calculate the square root of the matrix,which is not trivial in the case of large or infinite density matrices.Moreover,U-J fidelity is a measure of overlap,which has limitations in some cases and cannot reflect the similarity between quantum states well.Therefore,a novel quantum fidelity measure called quantum Tanimoto coefficient(QTC)fidelity is proposed in this paper.Unlike other existing fidelities,QTC fidelity not only considers the overlap between quantum states,but also takes into account the separation between quantum states for the first time,which leads to a better performance of measure.Specifically,we discuss the properties of the proposed QTC fidelity.QTC fidelity is compared with some existing fidelities through specific examples,which reflects the effectiveness and advantages of QTC fidelity.In addition,based on the QTC fidelity,three discrimination coefficients d_(1)^(QTC),d_(2)^(QTC),and d_^(3)^(QTC)are defined to measure the difference between quantum states.It is proved that the discrimination coefficient d_(3)^(QTC)is a true metric.Finally,we apply the proposed QTC fidelity-based discrimination coefficients to measure the entanglement of quantum states to show their practicability.

A Content-Based Medical Image Retrieval Method Using Relative Difference-Based Similarity Measure

Content-based medical image retrieval(CBMIR)is a technique for retrieving medical images based on automatically derived image features.There are many applications of CBMIR,such as teaching,research,diagnosis and electronic patient records.Several methods are applied to enhance the retrieval performance of CBMIR systems.Developing new and effective similarity measure and features fusion methods are two of the most powerful and effective strategies for improving these systems.This study proposes the relative difference-based similarity measure(RDBSM)for CBMIR.The new measure was first used in the similarity calculation stage for the CBMIR using an unweighted fusion method of traditional color and texture features.Furthermore,the study also proposes a weighted fusion method for medical image features extracted using pre-trained convolutional neural networks(CNNs)models.Our proposed RDBSM has outperformed the standard well-known similarity and distance measures using two popular medical image datasets,Kvasir and PH2,in terms of recall and precision retrieval measures.The effectiveness and quality of our proposed similarity measure are also proved using a significant test and statistical confidence bound.

An Information Content and Set of Common Superconcepts-Based Algorithm to Estimate Similarity between Concepts of Ontologies

Ontologies have been used for several years in life sciences to formally represent concepts and reason about knowledge bases in domains such as the semantic web, information retrieval and artificial intelligence. The exploration of these domains for the correspondence of semantic content requires calculation of the measure of semantic similarity between concepts. Semantic similarity is a measure on a set of documents, based on the similarity of their meanings, which refers to the similarity between two concepts belonging to one or more ontologies. The similarity between concepts is also a quantitative measure of information, calculated based on the properties of concepts and their relationships. This study proposes a method for finding similarity between concepts in two different ontologies based on feature, information content and structure. More specifically, this means proposing a hybrid method using two existing measures to find the similarity between two concepts from different ontologies based on information content and the set of common superconcepts, which represents the set of common parent concepts. We simulated our method on datasets. The results show that our measure provides similarity values that are better than those reported in the literature.

A Portfolio Selection Method Based on Pattern Matching with Dual Information of Direction and Distance

Pattern matching method is one of the classic classifications of existing online portfolio selection strategies. This article aims to study the key aspects of this method—measurement of similarity and selection of similarity sets, and proposes a Portfolio Selection Method based on Pattern Matching with Dual Information of Direction and Distance (PMDI). By studying different combination methods of indicators such as Euclidean distance, Chebyshev distance, and correlation coefficient, important information such as direction and distance in stock historical price information is extracted, thereby filtering out the similarity set required for pattern matching based investment portfolio selection algorithms. A large number of experiments conducted on two datasets of real stock markets have shown that PMDI outperforms other algorithms in balancing income and risk. Therefore, it is suitable for the financial environment in the real world.

An intelligent automatic correlation method of oilbearing strata based on pattern constraints:An example of accretionary stratigraphy of Shishen 100 block in Shinan Oilfield of Bohai Bay Basin,East China

Aiming at the problem that the data-driven automatic correlation methods which are difficult to adapt to the automatic correlation of oil-bearing strata with large changes in lateral sedimentary facies and strata thickness,an intelligent automatic correlation method of oil-bearing strata based on pattern constraints is formed.We propose to introduce knowledge-driven in automatic correlation of oil-bearing strata,constraining the correlation process by stratigraphic sedimentary patterns and improving the similarity measuring machine and conditional constraint dynamic time warping algorithm to automate the correlation of marker layers and the interfaces of each stratum.The application in Shishen 100 block in the Shinan Oilfield of the Bohai Bay Basin shows that the coincidence rate of the marker layers identified by this method is over 95.00%,and the average coincidence rate of identified oil-bearing strata reaches 90.02% compared to artificial correlation results,which is about 17 percentage points higher than that of the existing automatic correlation methods.The accuracy of the automatic correlation of oil-bearing strata has been effectively improved.

A Multisource Contour Matching Method Considering the Similarity of Geometric Features

The existing multi-source contour matching studies have focused on the matching methods with consideration of topological relations and similarity measurement based on spatial Euclidean distance,while it is lack of taking the contour geometric features into account,which may lead to mismatching in map boundaries and areas with intensive contours or extreme terrain changes.In light of this,it is put forward that a matching strategy from coarse to precious based on the contour geometric features.The proposed matching strategy can be described as follows.Firstly,the point sequence is converted to feature sequence according to a feature descriptive function based on curvature and angle of normal vector.Then the level of similarity among multi-source contours is calculated by using the longest common subsequence solution.Accordingly,the identical contours could be matched based on the above calculated results.In the experiment for the proposed method,the reliability and efficiency of the matching method are verified using simulative datasets and real datasets respectively.It has been proved that the proposed contour matching strategy has a high matching precision and good applicability.

Power Aggregation Operators and Similarity Measures Based on Improved Intuitionistic Hesitant Fuzzy Sets and their Applications to Multiple Attribute Decision Making

Intuitionistic hesitant fuzzy set(IHFS)is amixture of two separated notions called intuitionistic fuzzy set(IFS)and hesitant fuzzy set(HFS),as an important technique to cope with uncertain and awkward information in realistic decision issues.IHFS contains the grades of truth and falsity in the formof the subset of the unit interval.The notion of IHFS was defined by many scholars with different conditions,which contain several weaknesses.Here,keeping in view the problems of already defined IHFSs,we will define IHFS in another way so that it becomes compatible with other existing notions.To examine the interrelationship between any numbers of IHFSs,we combined the notions of power averaging(PA)operators and power geometric(PG)operators with IHFSs to present the idea of intuitionistic hesitant fuzzy PA(IHFPA)operators,intuitionistic hesitant fuzzy PG(IHFPG)operators,intuitionistic hesitant fuzzy power weighted average(IHFPWA)operators,intuitionistic hesitant fuzzy power ordered weighted average(IHFPOWA)operators,intuitionistic hesitant fuzzy power ordered weighted geometric(IHFPOWG)operators,intuitionistic hesitant fuzzy power hybrid average(IHFPHA)operators,intuitionistic hesitant fuzzy power hybrid geometric(IHFPHG)operators and examined as well their fundamental properties.Some special cases of the explored work are also discovered.Additionally,the similarity measures based on IHFSs are presented and their advantages are discussed along examples.Furthermore,we initiated a new approach to multiple attribute decision making(MADM)problem applying suggested operators and a mathematical model is solved to develop an approach and to establish its common sense and adequacy.Advantages,comparative analysis,and graphical representation of the presented work are elaborated to show the reliability and effectiveness of the presented works.

Audio Segmentation via the Similarity Measure of Audio Feature Vectors

A formula to compute the similarity between two audio feature vectors is proposed, which can map arbitrary pair of vectors with equivalent dimension to [0,1）. To fulfill the task of audio segmentation, a self-similarity matrix is computed to reveal the inner structure of an audio clip to be segmented. As the final result must be consistent with the subjective evaluation and be adaptive to some special applications, a set of weights is adopted, which can be modified through relevance feedback techniques. Experiments show that satisfactory result can be achieved via the algorithm proposed in this paper.

P-Indeterminate Vector Similarity Measures of Orthopair Neutrosophic Number Sets and Their Decision-MakingMethod with Indeterminate Degrees

In the complexity and indeterminacy of decision making(DM)environments,orthopair neutrosophic number set(ONNS)presented by Ye et al.can be described by the truth and falsity indeterminacy degrees.Then,ONNS demonstrates its advantages in the indeterminate information expression,aggregations,and DM problems with some indeterminate ranges.However,the existing research lacks some similarity measures between ONNSs.They are indispensable mathematical tools and play a crucial role in DM,pattern recognition,and clustering analysis.Thus,it is necessary to propose some similaritymeasures betweenONNSs to supplement the gap.To solve the issue,this study firstly proposes the p-indeterminate cosine measure,p-indeterminate Dice measure,p-indeterminate Jaccard measure of ONNSs(i.e.,the three parameterized indeterminate vector similarity measures of ONNSs)in vector space.Then,a DMmethod based on the parameterized indeterminate vector similarity measures of ONNSs is developed to solve indeterminate multiple attribute DM problems by choosing different indeterminate degrees of the parameter p,such as the small indeterminate degree(p=0)or the moderate indeterminate degree(p=0.5)or the big indeterminate degree(p=1).Lastly,an actual DM example on choosing a suitable logistics supplier is provided to demonstrate the flexibility and practicability of the developed DM approach in indeterminate DM problems.By comparison with existing relative DM methods,the superiority of this study is that the established DMapproach indicates its flexibility and suitability depending on decision makers’indeterminate degrees(decision risks)in ONNS setting.

Cotangent Similarity Measure of Consistent Neutrosophic Sets and Application to Multiple Attribute Decision-Making Problems in Neutrosophic Multi-Valued Setting

A neutrosophic multi-valued set(NMVS)is a crucial representation for true,false,and indeterminate multivalued information.Then,a consistent single-valued neutrosophic set(CSVNS)can effectively reflect the mean and consistency degree of true,false,and indeterminate multi-valued sequences and solve the operational issues between different multi-valued sequence lengths in NMVS.However,there has been no research on consistent single-valued neutrosophic similarity measures in the existing literature.This paper proposes cotangent similarity measures and weighted cotangent similarity measures between CSVNSs based on cotangent function in the neutrosophic multi-valued setting.The cosine similarity measures showthe cosine of the angle between two vectors projected into amultidimensional space,rather than their distance.The cotangent similaritymeasures in this study can alleviate several shortcomings of cosine similarity measures in vector space to a certain extent.Then,a decisionmaking approach is presented in viewof the established cotangent similarity measures in the case of NMVSs.Finally,the developed decision-making approach is applied to selection problems of potential cars.The proposed approach has obtained two different results,which have the same sort sequence as the compared literature.The decision results prove its validity and effectiveness.Meantime,it also provides a new manner for neutrosophic multi-valued decision-making issues.

Measuring Musical Rhythm Similarity: Further Experiments with the Many-to-Many Minimum-Weight Matching Distance

Musical rhythms are represented as sequences of symbols. The sequences may be composed of binary symbols denoting either silent or monophonic sounded pulses, or ternary symbols denoting silent pulses and two types of sounded pulses made up of low-pitched (dum) and high-pitched (tak) sounds. Experiments are described that compare the effectiveness of the many-to-many minimum-weight matching between two sequences to serve as a measure of similarity that correlates well with human judgements of rhythm similarity. This measure is also compared to the often used edit distance and to the one-to-one minimum-weight matching. New results are reported from experiments performed with three widely different datasets of real- world and artificially generated musical rhythms (including Afro-Cuban rhythms), and compared with results previously reported with a dataset of Middle Eastern dum-tak rhythms.

A Service Discovery Approach Based on a Quantitative Similarity Measure for M-Tourism Platforms

This paper presents a localization architecture for an m-tourism services delivery platform. The aim of the system is to deliver services for nomads (e-tourists) according to their localization and according to the results given by the search engine. This engine is based on a quantitative similarity measure. The discovered services are presented via a Web Map Service. Moreover, the platform integrates an adaptation sub-system for heterogeneous environments and an e-negotiation module.

A Spacecra Equipment Layout Optimization Method for Diverse and Competitive Design

The spacecraequipment layout optimization design(SELOD)problems with complicated performance con-straints and diversity are studied in this paper.The previous literature uses the gradient-based algorithm to obtain optimized non-overlap layout schemes from randomly initialized cases eectively.However,these local optimal solutions are too dicult to jump out of their current relative geometry relationships,signi􀀀cantly limiting their further improvement in performance indicators.Therefore,considering the geometric diversity of layout schemes is put forward to alleviate this limitation.First,similarity measures,including modi􀀀ed cosine similarity and gaussian kernel function similarity,are introduced into the layout optimization process.Then the optimization produces a set of feasible layout candidates with the most remarkable dierence in geometric distribution and the most representative schemes are sampled.Finally,these feasible geometric solutions are used as initial solutions to optimize the physical performance indicators of the spacecra,and diversi􀀀ed layout schemes of spacecraequipment are generated for the engineering practice.The validity and eectiveness of the proposed methodology are demonstrated by two SELOD applications.

Analysis of TOPSIS techniques based on bipolar complex fuzzy N-soft setting and their applications in decision-making problems

A novel model termed a bipolar complex fuzzy N-soft set(BCFN-SS)is initiated for tackling information that involves positive and negative aspects,the second dimension,and parameterised grading simultaneously.The theory of BCFN-SS is the generalisation of two various theories,that is,bipolar complex fuzzy(BCF)and N-SS.The invented model of BCFN-SS helps decision-makers to cope with the genuine-life dilemmas containing BCF information along with parameterised grading at the same time.Further,various algebraic operations,including the usual type of union,intersection,complements,and a few others types,are invented.Certain primary operational laws for BCFNSS are also invented.Moreover,a technique for order preference by similarity to the ideal solution(TOPSIS)approach is devised in the setting of BCFN-SS for managing strategic decision-making(DM)dilemmas containing BCFN-SS information.Keeping in mind the usefulness and benefits of the TOPSIS approach,two various types of TOPSIS approaches in the environment of BCFN-SS are devised and then a numerical example for exposing the usefulness of the devised TOPSIS approach is interpreted.To disclose the prominence and benefits of the devised work,the devised approaches with numerous prevailing work are compared.

Case-based retrieval approach for machining fixture design utilizingontology

In order to develop an intelligent case-based reasoning （CBR） system to reuse fixture de- sign knowledge, ontology technology was integrated in CBR system by semantic annotation of fixture design case. Domain ontology of fixture design was constructed; concepts and relations were de- fined and represented. The 2-level similarity evaluation approach of domain ontology was presented. The concept similarity of cases was calculated as the first grade case retrieval. Numerical measure- ment was the second grade case retrieval, which adopted various methods to calculate different types of attribute values. The problem of similarity measurement of fixture design case was resolved. Pro- totype system based on the proposed method was illustrated and the retrieval approach was proved to be efficient.

Unintentional modulation microstructure enlargement

Radio frequency fingerprinting(RFF)is a technology that identifies the specific emitter of a received electromagnetic signal by external measurement of the minuscule hardware-level,device-specific imperfections.The RFF-related information is mainly in the form of unintentional modulation(UIM),which is subtle enough to be effectively imperceptible and is submerged in the intentional modulation(IM).It is necessary to minimize the influence of the IM and expand the slight differences between emitters for successful RFF.This paper proposes a UIM microstructure enlargement(UMME)method based on feature-level adaptive signal decomposition(ASD),accompanied by autocorrelation and cross-correlation analysis.The common IM part is evaluated by analyzing a newly-defined benchmark feature.Three different indexes are used to quantify the similarity,distance,and dependency of the RFF features from different devices.Experiments are conducted based on the real-world signals transmitted from 20 of the same type of radar in the same working mode.The visual image qualitatively shows the magnification of feature differences;different indicators quantitatively describe the changes in features.Compared with the original RFF feature,recognition results based on the Gaussian mixture model(GMM)classifier further validate the effectiveness of the proposed algorithm.

A graph autoencoder network to measure the geometric similarity of drainage networks in scaling transformation

Similarity measurement has been a prevailing research topic geographic information science.Geometric similarity measurement inin scaling transformation(GSM_ST)is critical to ensure spatial data quality while balancing detailed information with distinctive features.However,GSM_ST is an uncertain problem due to subjective spatial cognition,global and local concerns,and geometric complexity.Traditional rule-based methods considering multiple consistent conditions require subjective adjustments to characteristics and weights,leading to poor robustness in addressing GSM_ST.This study proposes an unsupervised representation learning framework for automated GSM_ST,using a Graph Autoencoder Network(GAE)and drainage networks as an example.The framework involves constructing a drainage graph,designing the GAE architecture for GSM_ST,and using Cosine similarity to measure similarity based on the GAE-derived drainage embeddings in different scales.We perform extensive experiments and compare methods across 71 drainage networks duringfive scaling transformations.The results show that the proposed GAE method outperforms other methods with a satisfaction ratio of around 88%and has strong robustness.Moreover,our proposed method also can be applied to other scenarios,such as measuring similarity between geographical entities at different times and data from different datasets.