On the optimal sampling design for the Graph Total Variation decoder: recovering piecewise-constant graph signals from a few vertex measurements

Rodrigo Cerqueira Gonzalez Pena
Compressed Sensing teaches us that measurements can be traded for offline computation if the signal being sensed has a simple enough representation. Proper decoders can exactly recover the high-dimensional signal of interest from a lower-dimensional vector of that signal's observations. In graph domains -- like social, similarity, or interaction networks -- the relevant signals often have to do with the network's cluster structure. Partitioning a graph into different communities induces a piecewise-constant signal, an object...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.