Searched for: author%3A%22Coutino%2C+Mario%22
(1 - 20 of 40)

Pages

List view
Grid view
document
Yang, Qiuling (author), Coutino, Mario (author), Leus, G.J.T. (author), Giannakis, Georgios B. (author)
Graph-based learning and estimation are fundamental problems in various applications involving power, social, and brain networks, to name a few. While learning pair-wise interactions in network data is a well-studied problem, discovering higher-order interactions among subsets of nodes is still not yet fully explored. To this end, encompassing...
journal article 2023
document
Coutino, Mario (author), Leus, G.J.T. (author)
One of the main challenges of graph filters is the stability of their design. While classical graph filters allow for a stable design using optimal polynomial approximation theory, generalized graph filters tend to suffer from the ill-conditioning of the involved system matrix. This issue, accentuated for increasing graph filter orders,...
journal article 2022
document
Kokke, C.A. (author), Coutino, Mario (author), Heusdens, R. (author), Leus, G.J.T. (author), Anitori, L. (author)
Doppler velocity estimation in pulse-Doppler radar is done by evaluating the target returns of bursts of pulses. While this provides convenience and accuracy, it requires multiple pulses. In adaptive and cognitive radar systems, the ability to adapt on consecutive pulses, instead of bursts, brings potential performance benefits. Hence, with...
conference paper 2022
document
He, Y. (author), Coutino, Mario (author), Isufi, E. (author), Leus, G.J.T. (author)
In this work, we focus on partitioning dynamic graphs with two types of nodes (bi-colored), though not necessarily bipartite graphs. They commonly appear in communication network applications, e.g., one color being base stations, the other users, and the dynamic process being the varying connection status between base stations and moving...
conference paper 2022
document
Natali, A. (author), Isufi, E. (author), Coutino, Mario (author), Leus, G.J.T. (author)
This work proposes an algorithmic framework to learn time-varying graphs from online data. The generality offered by the framework renders it model-independent, i.e., it can be theoretically analyzed in its abstract formulation and then instantiated under a variety of model-dependent graph learning problems. This is possible by phrasing (time...
journal article 2022
document
Coutino, Mario (author)
To the surprise of most of us, complexity in nature spawns from simplicity. No matter how simple a basic unit is, when many of them work together, the interactions among these units lead to complexity. This complexity is present in the spreading of diseases, where slightly different policies, or conditions,might lead to very different results;...
doctoral thesis 2021
document
Zhang, Kaiwen (author), Coutino, Mario (author), Isufi, E. (author)
Graph sampling strategies require the signal to be relatively sparse in an alternative domain, e.g. bandlimitedness for reconstructing the signal. When such a condition is violated or its approximation demands a large bandwidth, the reconstruction often comes with unsatisfactory results even with large samples. In this paper, we propose an...
conference paper 2021
document
Yang, M. (author), Coutino, Mario (author), Leus, G.J.T. (author), Isufi, E. (author)
A critical task in graph signal processing is to estimate the true signal from noisy observations over a subset of nodes, also known as the reconstruction problem. In this paper, we propose a node-adaptive regularization for graph signal reconstruction, which surmounts the conventional Tikhonov regularization, giving rise to more degrees of...
journal article 2021
document
Natali, A. (author), Coutino, Mario (author), Isufi, E. (author), Leus, G.J.T. (author)
Signal processing and machine learning algorithms for data sup-ported over graphs, require the knowledge of the graph topology. Unless this information is given by the physics of the problem (e.g., water supply networks, power grids), the topology has to be learned from data. Topology identification is a challenging task, as the problem is often...
conference paper 2021
document
Leus, G.J.T. (author), Yang, M. (author), Coutino, Mario (author), Isufi, E. (author)
To deal with high-dimensional data, graph filters have shown their power in both graph signal processing and data science. However, graph filters process signals exploiting only pairwise interactions between the nodes, and they are not able to exploit more complicated topological structures. Graph Volterra models, on the other hand, are also...
conference paper 2021
document
Natali, A. (author), Isufi, E. (author), Coutino, Mario (author), Leus, G.J.T. (author)
Topology identification is an important problem across many disciplines, since it reveals pairwise interactions among entities and can be used to interpret graph data. In many scenarios, however, this (unknown) topology is time-varying, rendering the problem even harder. In this paper, we focus on a time-varying version of the structural...
conference paper 2021
document
Li, Bingcong (author), Coutino, Mario (author), Giannakis, Georgios B. (author), Leus, G.J.T. (author)
With the well-documented popularity of Frank Wolfe (FW) algorithms in machine learning tasks, the present paper establishes links between FW subproblems and the notion of momentum emerging in accelerated gradient methods (AGMs). On the one hand, these links reveal why momentum is unlikely to be effective for FW-type algorithms on general...
journal article 2021
document
Sharma, Shubham (author), Coutino, Mario (author), Chepuri, Sundeep Prabhakar (author), Leus, G.J.T. (author), Hari, K. V.S. (author)
The design of feasible trajectories to traverse the k-space for sampling in magnetic resonance imaging (MRI) is important while considering ways to reduce the scan time. Over the recent years, non-Cartesian trajectories have been observed to result in benign artifacts and being less sensitive to motion. In this paper, we propose a generalized...
journal article 2020
document
Coutino, Mario (author), Isufi, E. (author), Maehara, T. (author), Leus, G.J.T. (author)
In this work, we explore the state-space formulation of network processes to recover the underlying network structure (local connections). To do so, we employ subspace techniques borrowed from system identification literature and extend them to the network topology inference problem. This approach provides a unified view of the traditional...
conference paper 2020
document
Li, Qiongxiu (author), Coutino, Mario (author), Leus, G.J.T. (author), Christensen, M. Graesboll (author)
With an increasingly interconnected and digitized world, distributed signal processing and graph signal processing have been proposed to process its big amount of data. However, privacy has become one of the biggest challenges holding back the widespread adoption of these tools for processing sensitive data. As a step towards a solution, we...
conference paper 2020
document
Coutino, Mario (author), Isufi, E. (author), Maehara, Takanori (author), Leus, G.J.T. (author)
In this article, we explore the state-space formulation of a network process to recover from partial observations the network topology that drives its dynamics. To do so, we employ subspace techniques borrowed from system identification literature and extend them to the network topology identification problem. This approach provides a unified...
journal article 2020
document
Coutino, Mario (author), Karanikolas, Georgios V (author), Leus, G.J.T. (author), Giannakis, Georgios B. (author)
Link prediction is one of the core problems in network and data science with widespread applications. While predicting pairwise nodal interactions (links) in network data has been investigated extensively, predicting higher-order interactions (higher-order links) is still not fully understood. Several approaches have been advocated to predict...
conference paper 2020
document
Kazaz, T. (author), Coutino, Mario (author), Janssen, G.J.M. (author), van der Veen, A.J. (author)
In this paper, we focus on the problem of blind joint calibration of multiband transceivers and time-delay (TD) estimation of multipath channels. We show that this problem can be formulated as a particular case of covariance matching. Although this problem is severely ill-posed, prior information about radio-frequency chain distortions and...
conference paper 2020
document
Yang, Qiuling (author), Coutino, Mario (author), Wang, Gang (author), Giannakis, Georgios B. (author), Leus, G.J.T. (author)
To perform any meaningful optimization task, distribution grid operators need to know the topology of their grids. Although power grid topology identification and verification has been recently studied, discovering instantaneous interplay among subsets of buses, also known as higher-order interactions in recent literature, has not yet been...
conference paper 2020
document
Coutino, Mario (author), Chepuri, Sundeep Prabhakar (author), Maehara, Takanori (author), Leus, G.J.T. (author)
To analyze and synthesize signals on networks or graphs, Fourier theory has been extended to irregular domains, leading to a so-called graph Fourier transform. Unfortunately, different from the traditional Fourier transform, each graph exhibits a different graph Fourier transform. Therefore to analyze the graph-frequency domain properties of...
journal article 2020
Searched for: author%3A%22Coutino%2C+Mario%22
(1 - 20 of 40)

Pages

List view
Grid view