graph learning

Compound Markov random field model of signals on graph: an application to graph learning

In this work we address the problem of Signal on Graph (SoG) modeling, which can provide a powerful image processing tool for suitable SoG construction. We propose a novel SoG Markovian model suited to jointly characterizing the graph signal values and the graph edge processes. Specifically, we resort to the compound MRF called pixel-edge model formerly introduced in natural images modeling and we reformulate it to frame SoG modeling.

A joint Markov model for communities, connectivity and signals defined over graphs

Real-world networks are typically described in terms of nodes, links, and communities, having signal values often associated with them. The aim of this letter is to introduce a novel Compound Markov random field model (Compound MRF, or CMRF) for signals defined over graphs, encompassing jointly signal values at nodes, edge weights, and community labels. The proposed CMRF generalizes Markovian models previously proposed in the literature, since it accounts for different kinds of interactions between communities and signal smoothness constraints.

© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma