A Non-Parametric Scheme for Identifying Data Characteristic Based on Curve Similarity Matching

For accurately identifying the distribution charac-teristic of Gaussian-like noises in unmanned aerial vehicle(UAV)state estimation,this paper proposes a non-parametric scheme based on curve similarity matching.In the framework of the pro-posed scheme,a Parzen window(kernel density estimation,KDE)method on sliding window technology is applied for roughly esti-mating the sample probability density,a precise data probability density function(PDF)model is constructed with the least square method on K-fold cross validation,and the testing result based on evaluation method is obtained based on some data characteristic analyses of curve shape,abruptness and symmetry.Some com-parison simulations with classical methods and UAV flight exper-iment shows that the proposed scheme has higher recognition accuracy than classical methods for some kinds of Gaussian-like data,which provides better reference for the design of Kalman filter(KF)in complex water environment.

Similarity matching method of power distribution system operating data based on neural information retrieval

Operation control of power systems has become challenging with an increase in the scale and complexity of power distribution systems and extensive access to renewable energy.Therefore,improvement of the ability of data-driven operation management,intelligent analysis,and mining is urgently required.To investigate and explore similar regularities of the historical operating section of the power distribution system and assist the power grid in obtaining high-value historical operation,maintenance experience,and knowledge by rule and line,a neural information retrieval model with an attention mechanism is proposed based on graph data computing technology.Based on the processing flow of the operating data of the power distribution system,a technical framework of neural information retrieval is established.Combined with the natural graph characteristics of the power distribution system,a unified graph data structure and a data fusion method of data access,data complement,and multi-source data are constructed.Further,a graph node feature-embedding representation learning algorithm and a neural information retrieval algorithm model are constructed.The neural information retrieval algorithm model is trained and tested using the generated graph node feature representation vector set.The model is verified on the operating section of the power distribution system of a provincial grid area.The results show that the proposed method demonstrates high accuracy in the similarity matching of historical operation characteristics and effectively supports intelligent fault diagnosis and elimination in power distribution systems.

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.

Outliers rejection in similar image matching

Background Image matching is crucial in numerous computer vision tasks such as 3D reconstruction and simultaneous visual localization and mapping.The accuracy of the matching significantly impacted subsequent studies.Because of their local similarity,when image pairs contain comparable patterns but feature pairs are positioned differently,incorrect recognition can occur as global motion consistency is disregarded.Methods This study proposes an image-matching filtering algorithm based on global motion consistency.It can be used as a subsequent matching filter for the initial matching results generated by other matching algorithms based on the principle of motion smoothness.A particular matching algorithm can first be used to perform the initial matching;then,the rotation and movement information of the global feature vectors are combined to effectively identify outlier matches.The principle is that if the matching result is accurate,the feature vectors formed by any matched point should have similar rotation angles and moving distances.Thus,global motion direction and global motion distance consistencies were used to reject outliers caused by similar patterns in different locations.Results Four datasets were used to test the effectiveness of the proposed method.Three datasets with similar patterns in different locations were used to test the results for similar images that could easily be incorrectly matched by other algorithms,and one commonly used dataset was used to test the results for the general image-matching problem.The experimental results suggest that the proposed method is more accurate than other state-of-the-art algorithms in identifying mismatches in the initial matching set.Conclusions The proposed outlier rejection matching method can significantly improve the matching accuracy for similar images with locally similar feature pairs in different locations and can provide more accurate matching results for subsequent computer vision tasks.

A Novel Mathematical Model for Similarity Search in Pattern Matching Algorithms

Modern applications require large databases to be searched for regions that are similar to a given pattern. The DNA sequence analysis, speech and text recognition, artificial intelligence, Internet of Things, and many other applications highly depend on pattern matching or similarity searches. In this paper, we discuss some of the string matching solutions developed in the past. Then, we present a novel mathematical model to search for a given pattern and it’s near approximates in the text.

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.

Robust multi-sensor image matching based on normalized self-similarity region descriptor

Multi-modal image matching is crucial in aerospace applications because it can fully exploit the complementary and valuable information contained in the amount and diversity of remote sensing images.However,it remains a challenging task due to significant non-linear radiometric,geometric differences,and noise across different sensors.To improve the performance of heterologous image matching,this paper proposes a normalized self-similarity region descriptor to extract consistent structural information.We first construct the pointwise self-similarity region descriptor based on the Euclidean distance between adjacent image blocks to reflect the structural properties of multi-modal images.Then,a linear normalization approach is used to form Modality Independent Region Descriptor(MIRD),which can effectively distinguish structural features such as points,lines,corners,and flat between multi-modal images.To further improve the matching accuracy,the included angle cosine similarity metric is adopted to exploit the directional vector information of multi-dimensional feature descriptors.The experimental results show that the proposed MIRD has better matching accuracy and robustness for various multi-modal image matching than the state-of-the-art methods.MIRD can effectively extract consistent geometric structure features and suppress the influence of SAR speckle noise using non-local neighboring image blocks operation,effectively applied to various multi-modal image matching.

AN IMPROVED HYBRID SEMANTIC MATCHING ALGORITHM WITH LEXICAL SIMILARITY

In this paper, we proposed an improved hybrid semantic matching algorithm combining Input/Output (I/O) semantic matching with text lexical similarity to overcome the disadvantage that the existing semantic matching algorithms were unable to distinguish those services with the same I/O by only performing I/O based service signature matching in semantic web service discovery techniques. The improved algorithm consists of two steps, the first is logic based I/O concept ontology matching, through which the candidate service set is obtained and the second is the service name matching with lexical similarity against the candidate service set, through which the final precise matching result is concluded. Using Ontology Web Language for Services (OWL-S) test collection, we tested our hybrid algorithm and compared it with OWL-S Matchmaker-X (OWLS-MX), the experimental results have shown that the proposed algorithm could pick out the most suitable advertised service corresponding to user's request from very similar ones and provide better matching precision and efficiency than OWLS-MX.

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.

Vehicle Matching Based on Similarity Metric Learning

With the development of new media technology,vehicle matching plays a further significant role in video surveillance systems.Recent methods explored the vehicle matching based on the feature extraction.Meanwhile,similarity metric learning also has achieved enormous progress in vehicle matching.But most of these methods are less effective in some realistic scenarios where vehicles usually be captured in different times.To address this cross-domain problem,we propose a cross-domain similarity metric learning method that utilizes theGANto generate vehicle imageswith another domain and propose the two-channel Siamese network to learn a similarity metric from both domains(i.e.,Day pattern or Night pattern)for vehicle matching.To exploit properties and relationships among vehicle datasets,we first apply the domain transformer to translate the domain of vehicle images,and then utilize the two-channel Siamese network to extract features from both domains for better feature similarity learning.Experimental results illustrate that our models achieve improvements over state-of-the-arts.

Research on Vector Road Data Matching Method Based on Deep Learning

Most of the existing vector data matching methods use traditional feature geometry attribute features to match, however, many of the similarity indicators are not suitable for cross-scale data, resulting in less accuracy in identifying objects. In order to solve this problem effectively, a deep learning model for vector road data matching is proposed based on siamese neural network and VGG16 convolutional neural network, and matching experiments are carried out. Experimental results show that the proposed vector road data matching model can achieve an accuracy of more than 90% under certain data support and threshold conditions.

Two-Sided Matching Decision Making with Multi-Attribute Probabilistic Hesitant Fuzzy Sets

In previous research on two-sided matching(TSM)decision,agents’preferences were often given in the form of exact values of ordinal numbers and linguistic phrase term sets.Nowdays,the matching agent cannot perform the exact evaluation in the TSM situations due to the great fuzziness of human thought and the complexity of reality.Probability hesitant fuzzy sets,however,have grown in popularity due to their advantages in communicating complex information.Therefore,this paper develops a TSM decision-making approach with multi-attribute probability hesitant fuzzy sets and unknown attribute weight information.The agent attribute weight vector should be obtained by using the maximum deviation method and Hamming distance.The probabilistic hesitancy fuzzy information matrix of each agent is then arranged to determine the comprehensive evaluation of two matching agent sets.The agent satisfaction degree is calculated using the technique for order preference by similarity to ideal solution(TOPSIS).Additionally,the multi-object programming technique is used to establish a TSM method with the objective of maximizing the agent satisfaction of two-sided agents,and the matching schemes are then established by solving the built model.The study concludes by providing a real-world supply-demand scenario to illustrate the effectiveness of the proposed method.The proposed method is more flexible than prior research since it expresses evaluation information using probability hesitating fuzzy sets and can be used in scenarios when attribute weight information is unclear.

Similar physical entity matching strategy for mobile edge search

In recent years,a large number of intelligent sensing devices have been deployed in the physical world,which brings great difficulties to the existing entity search.With the increase of the number of intelligent sensing devices,the accuracy of the search system in querying the entities to match the user’s request is reduced,and the delay of entity search is increased.We use the mobile edge technology to alleviate this problem by processing user requests on the edge side and propose a similar physical entity matching strategy for the mobile edge search.First,the raw data collected by the sensor is lightly weighted and expressed to reduce the storage overhead of the observed data.Furthermore,a physical entity matching degree estimation method is proposed,in which the similarity between the sensor and the given sensor in the network is estimated,and the matching search of the user request is performed according to the similarity.Simulation results show that the proposed method can effectively reduce the data storage overhead and improve the precision of the sensor search system.

An Approach to Unsupervised Character Classification Based on Similarity Measure in Fuzzy Model

This paper presents a fuzzy logic approach to efficiently perform unsupervised character classification for improvement in robustness, correctness and speed of a character recognition system. The characters are first split into eight typographical categories. The classification scheme uses pattern matching to classify the characters in each category into a set of fuzzy prototypes based on a nonlinear weighted similarity function. The fuzzy unsupervised character classification, which is natural in the repre...

REVERSE DESIGN APPROACH FOR MECHANISM TRAJECTORY BASED ON CODE-CHAINS MATCHING

Aiming at the problem of reverse-design of mechanism, a method based on the matching of trajectory code-chains is presented. The motion trajectory of mechanism is described with code-chain, which is normalized to simplify the operation of geometric transformation. The geometric transforma-tion formulas of scale, mirror and rotation for trajectory code-chain are defined, and the reverse de-sign for mechanism trajectory is realized through the analysis and solution of similarity matching between the desired trajectory and the predefined trajectory. The algorithm program and prototype system of reverse design for mechanism trajectory are developed. Application samples show that the method can break the restriction of trajectory patterns in matching, meet the demand of partial match-ing, and overcome the influence of geometric transformation of trajectory on the reverse design for mechanism.

Research on Computing Models of CBR Similarity

Several models of measuring case similarity in CBR systems are deeply explored. We also discuss the case matching process, and present three matching functions. Finally, we illustrate the significance of the models in CBR(Case Based Reasoning) systems implementation. Key words CBR - similarity - matching CLC number TP 182 Foundation item: Supported by the Natural Science Foundation of Hubei Province (2001ABB058) and the Project Sponsored by the Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education MinistryBiography: NIU Xiao-tai (1971-), male, Ph. D candidate, Research direction: decision support system

Research and Implementation of Text Similarity System Based on Power Spectrum Analysis

The paper proposed the research and implement of text similarity system based on power spectrum analysis. It is not difficult to imagine that the signals of brain are closely linked with writing process. So we build text modeling and set pulse signal function to get the power spectrum of the text. The specific detail is getting power spectrum from economic field to build spectral library, and then using the method of power spectrum matching algorithm to judge whether the test text belonged to the economic field. The method made text similarity system finish the function of text intelligent classification efficiently and accurately.

Shape Similarity Measures of Linear Entities

The essential of feature matching technology lies in how to measure the similarity of spatial entities.Among all the possible similarity measures,the shape similarity measure is one of the most important measures because it is easy to collect the necessary parameters and it is also well matched with the human intuition.In this paper a new shape similarity measure of linear entities based on the differences of direction change along each line is presented and its effectiveness is illustrated.

A Retrieval Matching Method Based Case Learning for 3D Model

The similarity metric in traditional content based 3D model retrieval method mainly refers the distance metric algorithm used in 2D image retrieval. But this method will limit the matching breadth. This paper proposes a new retrieval matching method based on case learning to enlarge the retrieval matching scope. In this method, the shortest path in Graph theory is used to analyze the similarity how the nodes on the path between query model and matched model effect. Then, the label propagation method and k nearest-neighbor method based on case learning is studied and used to improve the retrieval efficiency based on the existing feature extraction.

SYMBOL-RATE ESTIMATION BASED ON TEMPLATE MATCHING RULES

For non-cooperative communication, the symbol-rate estimation of digital communication signal is an important problem to be solved. In this letter, A new algorithm for the symbol-rate estimation of single-tone digitally modulated signal (i.e. MPSK/QAM) is proposed. Firstly a section from the received signal is cut as the template, and then the signal is matched sectionwise by making use of the signal selfsimilarity. So a signal con- taining the information of symbol jumping is got, and the symbol-rate can be estimated by DFT (Discrete Fou- rier Transformation). The validity of the new method has been verified by experiments.