Searched for: subject%253A%2522process%2522
(1 - 20 of 23)

Pages

List view
Grid view
document
Kokke, C.A. (author), Coutino, Mario (author), Anitori, Laura (author), Heusdens, R. (author), Leus, G.J.T. (author)
Sensor selection is a useful method to help reduce data throughput, as well as computational, power, and hardware requirements, while still maintaining acceptable performance. Although minimizing the Cramér-Rao bound has been adopted previously for sparse sensing, it did not consider multiple targets and unknown source models. In this work, we...
conference paper 2023
document
Kokke, C.A. (author), Coutino, Mario (author), Heusdens, R. (author), Leus, G.J.T. (author)
Sensor selection is a useful method to help reduce computational, hardware, and power requirements while maintaining acceptable performance. Although minimizing the Cramér-Rao bound has been adopted previously for sparse sensing, it did not consider multiple targets and unknown target directions. We propose to tackle the sensor selection problem...
conference paper 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
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
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
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
Leus, G.J.T. (author), Yang, Maosheng (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
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
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
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), 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
document
Yang, M. (author), Coutino, Mario (author), Isufi, E. (author), Leus, G.J.T. (author)
While regularization on graphs has been successful for signal reconstruction, strategies for controlling the bias-variance trade-off of such methods have not been completely explored. In this work, we put forth a node varying regularizer for graph signal reconstruction and develop a minmax approach to design the vector of regularization...
conference paper 2020
document
Natali, A. (author), Coutino, Mario (author), Leus, G.J.T. (author)
Data defined over a network have been successfully modelled by means of graph filters. However, although in many scenarios the connectivity of the network is known, e.g., smart grids, social networks, etc., the lack of well-defined interaction weights hinders the ability to model the observed networked data using graph filters. Therefore, in...
conference paper 2020
document
Coutino, Mario (author), Isufi, E. (author), Leus, G.J.T. (author)
Graph filters are one of the core tools in graph signal processing. A central aspect of them is their direct distributed implementation. However, the filtering performance is often traded with distributed communication and computational savings. To improve this tradeoff, this paper generalizes state-of-the-art distributed graph filters to...
journal article 2019
document
Coutino, Mario (author), Isufi, E. (author), Maehara, Takanori (author), Leus, G.J.T. (author)
In this work, we explore the limits of finite-time distributed consensus through the intersection of graph filters and matrix function theory. We focus on algorithms capable to compute the consensus exactly through filtering operations over a graph, and that have been proven to converge in finite time. In this context, we show that there...
conference paper 2019
document
Ortiz-Jimenez, Guillermo (author), Coutino, Mario (author), Chepuri, S.P. (author), Leus, G.J.T. (author)
We consider the problem of designing sparse sampling strategies for multidomain signals, which can be represented using tensors that admit a known multilinear decomposition. We leverage the multidomain structure of tensor signals and propose to acquire samples using a Kronecker-structured sensing function, thereby circumventing the curse of...
journal article 2019
document
Coutino, Mario (author), Leus, G.J.T. (author)
As the size of the sensor network grows, synchronization starts to become the main bottleneck for distributed computing. As a result, efforts in several areas have been focused on the convergence analysis of asynchronous computational methods. In this work, we aim to cross-pollinate distributed graph filters with results in parallel computing...
conference paper 2019
document
Coutino, Mario (author), Isufi, E. (author), Leus, G.J.T. (author)
The main challenges distributed graph filters face in practice are the communication overhead and computational complexity. In this work, we extend the state-of-the-art distributed finite impulse response (FIR) graph filters to an edge-variant (EV) version, i.e., a filter where every node weights the signals from its neighbors with different...
conference paper 2018
Searched for: subject%253A%2522process%2522
(1 - 20 of 23)

Pages

List view
Grid view