文摘
A recurrence plot is maximally informative if and only if the corresponding graph is connected. The diameter of the connected graph is always equals 1 or 2. The multi-level recurrence plot bridges the information gap between the unthresholded recurrence plot (URP) and the binary recurrence plot. If the graph is connected, then, with singular value decomposition a signal can be reconstructed from its URP in a numerically robust way.