A Novel Fragments-based Similarity Measurement Algorithm for Visual Tracking

2014 ◽  
Vol 9 (9) ◽  
Author(s):  
Jun Shang ◽  
Chuanbo Chen ◽  
Hu Liang ◽  
He Tang ◽  
Mudar Sarem
2018 ◽  
Vol 11 (4) ◽  
pp. 486-495
Author(s):  
Ke Yi Zhou ◽  
Shaolin Hu

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 the morphological 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.


2012 ◽  
Vol 182-183 ◽  
pp. 1169-1173
Author(s):  
Li Fang Yang ◽  
Xiang Lin Huang ◽  
Rui Lv ◽  
Hui Lv

For the reason that dominant colors can characterize color information of image region and can represent the image using fewer dimensions, it is one of the widely used color features in image retrieval. We extract the dominant color feature in HSV color space, and combine it with color distribution information. In this paper, a new similarity measurement algorithm based on block distance is proposed for dominant color matching. Our proposed algorithm not only takes the distance between dominant colors into account, but also the difference of the percentage of dominant colors. The average precision of our algorithm improves about 5% and about 14% respectively compared with block distance and Euclidean distance. Although the average precision of our algorithm is almost equal to quadratic form distance, the computation cost of our algorithm is obviously less than it.


2021 ◽  
Vol 1971 (1) ◽  
pp. 012085
Author(s):  
Jianhua Zhang ◽  
Xiaojun Meng ◽  
Huidong Huangfu ◽  
Jianglong Zhou ◽  
Haiyan Chen ◽  
...  

2020 ◽  
Vol 2020 ◽  
pp. 1-9
Author(s):  
Xiaohui Yang ◽  
Ying Sun

The Internet of Things (IoT) is an open network. And, there are a large number of malicious nodes in the network. These malicious nodes may tamper with the correct data and pass them to other nodes. The normal nodes will use the wrong data for information dissemination due to a lack of ability to verify the correctness of the messages received, resulting in the dissemination of false information on medical, social, and other networks. Auditing user attributes and behavior information to identify malicious user nodes is an important way to secure networks. In response to the user nodes audit problem, a user audit model based on attribute measurement and similarity measurement (AM-SM-UAM) is proposed. Firstly, the user attribute measurement algorithm is constructed, using a hierarchical decision model to construct a judgment matrix to analyze user attribute data. Secondly, the blog similarity measurement algorithm is constructed, evaluating the similarity of blog posts published by different users based on the improved Levenshtein distance. Finally, a user audit model based on a security degree is built, and malicious users are defined by security thresholds. Experimental results show that this model can comprehensively analyze the attribute and behavior data of users and have more accurate and stable performance in the practical application of the network platforms.


2020 ◽  
Author(s):  
Qiang Chen ◽  
Tian-Ning Chen ◽  
Jian Yang ◽  
Wen Xiong ◽  
Ouyang Zhenyu ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document