Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Multi-threshold recurrence plot calculation method and device

A multi-threshold, graph computing technology, applied in computing, complex mathematical operations, special data processing applications, etc., can solve the problems of enlarged white area and high density of black points, and achieves low computational complexity, low computational cost, and system Rich and comprehensive effect of recursive information

Inactive Publication Date: 2016-03-02
NANJING UNIV
View PDF0 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

If ε is too large, there will be too many wrong adjacent points, and the density of black points in the recursive graph is too high; if ε is too small, many normal adjacent points will not be described, and the white area of ​​the recursive graph will become larger

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
  • Multi-threshold recurrence plot calculation method and device
  • Multi-threshold recurrence plot calculation method and device
  • Multi-threshold recurrence plot calculation method and device

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0041] A specific embodiment of the present invention will be introduced below in conjunction with the accompanying drawings. Such as figure 1 As shown, this embodiment is completed in the following steps.

[0042] 1. Define the data structure of the multi-threshold recursive matrix

[0043] In order to facilitate the diagonal search, in this embodiment, the diagonal and non-recursive diagonals on the straight line i-j=l are taken as examples, using Record multi-threshold recursive graph data, here

[0044] Z l=(Z l,0 ,Z l,1 ,...,Z l,m ,...,) T , l=T L ,T L +1,...,T H ,

[0045] and is a record of M bits, where r bits (log 2 Q≤rq ≥R q,i,j ≥ε q-1 unit run. T L and T H and the determined search scope such as figure 2 shown. M and r are selected according to the sequence length and the device software and hardware system, as in the DSP system, M=32, r=16, at this time, the sequence length that can be processed is N=2 r = 2 16 .

[0046] Additionally, def...

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 multi-threshold recurrence plot calculation method and device, and is characterized in that recursion points are inquired by a nearest neighbor point search method based on a data query tree, a multi-threshold recurrence plot is stored in a compressed format, and diagonals in different threshold recurrence plots can be recurred and searched from the multi-threshold recurrence plot. The method comprises the following specific steps: (1) establishing and initializing a recurrence plot data structure; (2) carrying out recurrence update on the data query tree; (3) searching all nearest neighbor points in a neighbourhood which takes a current point as the center and a maximum threshold value Epsilon Q as a radius in the query tree as the recurrence points, taking a formula as a reference threshold value to quantize the recurrence points, wherein a quantization distance is used for forming the matrix elements of the multi-threshold recurrence plot; (4) recording all recurrence points into the recurrence plot record; repeating the step (2) to the step (4) to search all the recurrence points; and (5) in a multi-threshold recurrence plot data record, inquiring and recording the diagonals in the different threshold recurrence plots. When only a recurrence unit in an area (TL is greater than or equal to 1 and smaller than or equal to i-j, and TH is greater than or equal to i-j and smaller than N-1) is required, the length of the query tree is not greater than NW=TH-TL+1.

Description

technical field [0001] The invention relates to a calculation method of a recursive graph, which is mainly used for processing non-stationary and nonlinear signals. Background technique [0002] The recursive state of the system means that some states of the system are similar at a specific time. Recursive phenomena are a fundamental feature of deterministic dynamical systems. Eckmann et al. proposed a tool that can observe the recursive characteristics of the state on a two-dimensional graph - Recurrence Plot (RP), which enables us to analyze and process non-stationary nonlinear signals on a two-dimensional recurrence graph. [0003] For a set of d-dimensional space vectors its recursive graph Depend on [0004] R i,j =Θ(ε-||x i -x j ||), i, j=0, 1, ..., N-1 [0005] Composition, where ε is the threshold value, ||·|| is the norm operation, which can be ||·|| 2 (Euclidean distance), Θ(·) is the Heaviside function. due to R i,i ≡0 and R i,j =R j,i , in fact onl...

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
IPC IPC(8): G06F17/30G06F17/16
Inventor 赵正敏
Owner NANJING UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products