Relative entropy based uncertainty principles for graph signals

In physical quantum mechanics, the uncertainty principle in presence of quantum memory [Berta M, Christandl M, Colbeck R,et al., Nature Physics] can reach much lower bound, which has resulted in a huge breakthrough in quantum mechanics. Inspired by this idea, this paper would propose some novel uncertainty relations in terms of relative entropy for signal representation and time-frequency resolution analysis. On one hand, the relative entropy measures the distinguishability between the known (priori) basis and the client basis, which implies that we have partial “memory” of the client basis so that the uncertainty bounds become sharper in some cases. On the other hand, in some cases, if the reference basis along with nearly the same energy distribution could be given, then the uncertainty bound would tend to zero, as shows that there is no uncertainty any longer. These novel uncertainty relationships with sharper bounds would give us the potential advantages over the classical counterpart. In addition, the detailed comparison with classical Shannon entropy based uncertainty principle has been addressed as well via combined uncertainty relations. Finally, the theoretical analysis and numerical experiments on certain application over graph signals have been demonstrated to show the efficiency of these proposed relations.