Minimum mean distance-based dynamic time warping method

A technology of dynamic time regularization and average distance, applied in instruments, character and pattern recognition, computer parts, etc., to achieve the effect of low false recognition rate

Inactive Publication Date: 2017-12-08
ZHEJIANG UNIV OF TECH
View PDF0 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the traditional dynamic time warping algorithm also has disadvantages. For example, consider using the dynamic time warping distance to calculate the matching of the following three segments of DC signals:

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Minimum mean distance-based dynamic time warping method
  • Minimum mean distance-based dynamic time warping method
  • Minimum mean distance-based dynamic time warping method

Examples

Experimental program
Comparison scheme
Effect test

example

[0052] Example: Carry out the kNN nearest neighbor method classification test on 609 nuclear radiation detection time series containing outliers. The template library used uses peak segments other than all currently tested data sets and does not contain random outlier components after manual selection. The quantitative evaluation standard adopted by the kNN nearest neighbor method classification is the statistical counting matrix (n ij ) 4×4 , n ij Indicates the number of peak segments for which the jth category is classified into category i. if (n ij ) is a diagonal matrix, it can be considered that the misrecognition rate of cluster classification is 0, otherwise the detection rate and false alarm rate of each category can be calculated according to the following formula: category j

[0053] The count matrix obtained by kNN nearest neighbor classification for 609 nuclear radiation detection time series containing outliers: the conventional DTW is

[0054] The DTW b...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a minimum mean distance-based dynamic time warping method. The method comprises the following steps of: 1) creating a mean distance matrix and a path length matrix for two time sequences; and 2) solving dynamic planning of a formula (as shown in the specification): 2.1) carrying out initialization, 2.2) carrying out assignment on the first line and first column of the mean distance matrix (as shown in the specification), carrying out weighted array on the first line and neighbors, in the same line, at the former column to calculate an arithmetic mean, and carrying out weighted array on the first column and the neighbors, in the same column, of the former line to calculate an arithmetic mean, 2.3) carrying out assignment on the lines except the first line and the columns except the first column of the mean distance matrix (as shown in the specification), combining three adjacent points, adjacent to the current point, of the former line and the former column and calculating arithmetic means, selecting the minimum mean of the obtained three means to serve as a mean distance value of the current point, and adding 1 to a path length value of the current point on the basis of a length value of the selected adjacent point, and 2.4) outputting a formula (as shown in the specification) and 1 (n, m). The minimum mean distance-based dynamic time warping method provided by the invention is relatively low in false accept rate.

Description

technical field [0001] The invention relates to a dynamic time warping method. Background technique [0002] Distance is a common method to measure the dissimilarity (similarity) of two time series. Since the distribution of sequence values ​​on the time axis will shift and expand, direct point-to-point calculations will have the risk of deviating from common sense judgments. For example, for two sequences (a, a, b, b, a) and (a, b, b, a, a) patterns, it needs to be judged to be consistent in practical application or engineering practice, but the value calculated by using distance is 2|a-b|. Using the traditional dynamic time warping algorithm to calculate the distance value is 0, which is more in line with the needs of actual engineering. However, the traditional dynamic time warping algorithm also has disadvantages. For example, consider using the dynamic time warping distance to calculate the matching of the following three segments of DC signals: [0003] A=(0.1,0.1)...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06K9/62
CPCG06F18/22G06F18/24147
Inventor 陆成刚
Owner ZHEJIANG UNIV OF TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap