arXiv subjects

Geert Leus

Publications and source records attributed to Geert Leus.

At least 19 recordsLinked to original sources

arXiv2026

Topological Signal Processing With Unoriented Operators

Topological signal processing (TSP) processes signals on simplicial complexes with oriented boundary operators, which is the natural choice for flow signals or when the topological invariants play a role for the task at hand. However, many higher-order signals carry no orientation, and applying oriented operators to them is not well-defined since it introduces an arbitrary choice of simplex orientation. We study an unoriented TSP (UTSP) framework that replaces oriented boundaries with unoriented incidence matrices. First, we show that unoriented incidence and Laplacian matrices between arbitrary simplicial levels admit graph-like spectral properties. Second, since dropping orientation removes the Hodge decomposition, we introduce an unoriented counterpart, termed interaction-order decomposition, which quantifies how much of a higher-order signal is explained by aggregating lower-order signals. Third, we use this decomposition to derive regularizers for signal reconstruction that penalize each interaction order separately. Experiments on real-world data show that the order-aware regularizers outperform oriented baselines, with the largest gains when the signal energy is unevenly distributed across orders.

cs.LG↗

arXiv2026

Learning the Topology of a Simplicial Complex Using Noisy Simplicial Signals

Graphs are a fundamental tool for modeling the irregular (non-Euclidean) structure of complex data. However, they are inherently limited to representing pairwise relationships, making them inadequate for datasets exhibiting higher-order interactions. Simplicial complexes (SCs) have emerged as a promising framework for capturing such higher-order dependencies. This paper focuses on the problem of identifying the topology of an SC from signals, which serves as the foundation for SC-based processing and learning schemes. We consider a setting where we observe noisy signals (features) associated with the nodes of the SC (0-simplices) and a subset of the edges (1-simplices). We assume the observed signals are smooth over the unknown SC topology, and that the higher-order interactions are sparse. Building on these assumptions, we formulate topology learning as a nonconvex optimization problem and propose an efficient block-coordinate descent (BCD) algorithm to solve it. A key step in our formulation is the modeling of the topology of the SC using binary edge and triangle selection vectors, combined with efficient greedy algorithms for optimizing such vectors. We establish theoretical convergence guarantees to a stationary point of a relaxed (penalized) version of the problem and discuss computational complexity. Multiple numerical experiments with both synthetic and real-world datasets validate the effectiveness of our approach, highlighting the capability of SC-learning methods to uncover and model higher-order relationships in complex datasets.

eess.SP↗

arXiv2026

Exact Bayesian Tracking of Dynamic Network Topologies

Tracking the temporal evolution of network topologies is a fundamental challenge in social networks, epidemiology, and sensor systems, among others. This paper develops an exact Bayesian tracker for unweighted, directed graphs using nodal signal observations. This framework yields the full posterior probability distribution over network states at each time step, naturally enabling uncertainty quantification, prediction, and principled decision-making. We model the network dynamics as a Markov process on the Boolean hypercube, where edges transition independently according to a flip probability. For efficient computation, we cast the prediction step as a dyadic convolution, and leverage the Fast Walsh-Hadamard Transform to reduce the computational cost from $\mathcal{O} (4^k)$ to $\mathcal{O} (k 2^k)$, where $k$ is the maximum node degree. When the network transition probabilities are unknown, we develop an Expectation-Maximization framework to learn them from the observed signals. Comprehensive experiments on synthetic and six real-world datasets validate the proposed method and demonstrate its superior tracking accuracy, faster recovery from topological changes, and meaningful uncertainty estimates compared to state-of-the-art and classical baselines.

eess.SP↗

arXiv2026

Robust Multi-Source DoA Estimation under Weather-Induced Distortion: Structured Covariance Methods and Performance Bounds

Direction-of-arrival (DoA) estimation in adverse weather is degraded by propagation-induced phase and amplitude distortions that violate the covariance structure assumed by classical subspace methods. Motivated by a physics-based model of rain propagation, we develop a structured covariance formulation for rain-distorted arrays in both single- and multi-source scenarios. A key ingredient is to relax the physically parameterized distortion model and instead model the distortion covariance as an unknown real-valued Hermitian Toeplitz matrix. For the single-source case, we derive a closed-form covariance-matching calibration algorithm and provide structured-covariance and physics-informed Cramer-Rao lower bounds (CRLBs). For the multi-source case, we prove that the original per-source distortion model is non-identifiable and introduce a collinear approximation across angles. Under this approximation, we propose three multi-source calibration methods: alternating LASSO, joint LASSO, and a joint nuclear-norm formulation. Simulations under heavy rain demonstrate improved DoA accuracy and source resolvability compared with conventional baselines, highlighting the benefit of structured covariance modeling and calibration for safety-critical sensing.

eess.SP↗

arXiv2026

CRB-Optimal Arrays and Waveforms in Active Sensing: Role of Redundancy and Spatial Covariance of Array Geometry

This paper characterizes the performance limits of optimal array designs using orthogonal and coherent waveforms for both linear and planar arrays. For orthogonal waveforms, we show that the single-target Cramér-Rao Bound (CRB) depends on the sum of the so-called spatial variances of the transmit (Tx) and receive (Rx) arrays, or equivalently, the spatial variance of the sum co-array weighted by the multiplicities of the virtual sensors. This reveals that CRB-optimal geometries are inherently redundant, highlighting a fundamental trade-off between mean squared error (MSE) and identifiability in parameter estimation. Moreover, we derive optimal Tx-Rx sensor allocations given a total sensor budget and show that unequal allocation (favoring the Rx) is optimal even for nonredundant arrays, questioning conventional designs. We extend our results to planar arrays, providing a new general condition that the spatial covariances of the Tx and Rx arrays should satisfy for the optimal waveforms to direct power in the target direction. Additionally, we establish a connection between Diophantine equations and array geometries with equal CRB, along with a constructive method for designing such arrays. Our work provides new guidelines for and insights into optimal array and waveform design with relevance in emerging active sensing multiple-input multiple-output systems.

eess.SP↗

arXiv2026

BUILD with Precision: Bottom-Up Inference of Linear DAGs

Learning the structure of directed acyclic graphs (DAGs) from observational data is a central problem in causal discovery, statistical signal processing, and machine learning. Under a linear Gaussian structural equation model (SEM) with equal noise variances, the problem is identifiable and we show that the ensemble precision matrix of the observations exhibits a distinctive structure that facilitates DAG recovery. Exploiting this property, we propose BUILD (Bottom-Up Inference of Linear DAGs), a deterministic stepwise algorithm that identifies leaf nodes and their parents, then prunes the leaves by removing incident edges to proceed to the next step, exactly reconstructing the DAG from the true precision matrix. In practice, precision matrices must be estimated from finite data, and ill-conditioning may lead to error accumulation across BUILD steps. As a mitigation strategy, we periodically re-estimate the precision matrix (with less variables as leaves are pruned), trading off runtime for enhanced robustness. Reproducible results on challenging synthetic benchmarks demonstrate that BUILD compares favorably to state-of-the-art DAG learning algorithms, while offering an explicit handle on complexity.

cs.LG↗

arXiv2026

Multicluster Design and Control of Large-Scale Affine Formations

Conventional affine formation control (AFC) empowers a network of agents with flexible but collective motions - a potential which has not yet been exploited for large-scale swarms. One of the key bottlenecks lies in the design of an interaction graph, characterized by the Laplacian-like stress matrix. Efficient and scalable design solutions often yield suboptimal solutions on various performance metrics, e.g., convergence speed and communication cost, to name a few. The current state-of-the-art algorithms for finding optimal solutions are computationally expensive and therefore not scalable. In this work, we propose a more efficient optimal design for any generic configuration, with the potential to further reduce complexity for a large class of nongeneric rotationally symmetric configurations. Furthermore, we introduce a multicluster control framework that offers an additional scalability improvement, enabling not only collective affine motions as in conventional AFC but also partially independent motions naturally desired for large-scale swarms. The overall design is compatible with a swarm size of several hundred agents with fast formation convergence, as compared to up to only a few dozen agents by existing methods. Experimentally, we benchmark the performance of our algorithm compared with several state-of-the-art solutions and demonstrate the capabilities of our proposed control strategies.

eess.SY↗

arXiv2026

A Covariance Matching Approach to Graph Topology Identification

Graph topology identification (GTI) is a central challenge in networked systems, where the underlying structure is often hidden, yet nodal data are available. Conventional solutions to address these challenges rely on probabilistic models or complex optimization formulations, commonly suffering from non-convexity or requiring restrictive assumptions on acyclicity or positivity. In this paper, we propose a novel covariance matching (CovMatch) framework that directly aligns the empirical covariance of the observed data with the theoretical covariance implied by an underlying graph. We show that as long as the data-generating process permits an explicit covariance expression, CovMatch offers a unified route to topology inference. We showcase our methodology on linear structural equation models (SEMs), showing that CovMatch naturally handles both undirected and general sparse directed graphs - whether acyclic or positively weighted - without explicit knowledge of these structural constraints. Through appropriate reparameterizations, CovMatch simplifies the graph learning problem to either a conic mixed integer program for undirected graphs or an orthogonal matrix optimization for directed graphs. Numerical results confirm that, even for relatively large graphs, our approach efficiently recovers the true topology and outperforms standard baselines in accuracy. These findings highlight CovMatch as a powerful alternative to log-determinant or Bayesian methods for GTI, paving the way for broader research on learning complex network topologies with minimal assumptions.

eess.SP↗

arXiv2026

Joint Simplicial Complex Learning via Binary Linear Programming

Learning the topology of higher-order networks from data is a fundamental challenge in many signal processing and machine learning applications. Simplicial complexes provide a principled framework for modeling multi-way interactions, yet learning their structure is challenging due to the strong coupling across different simplicial levels imposed by the inclusion property. In this work, we propose a joint framework for simplicial complex learning that enforces the inclusion property through a linear constraint, enabling the formulation of the problem as a binary linear program. The objective function consists of a combination of smoothness measures across all considered simplicial levels, allowing for the incorporation of arbitrary smoothness criteria. This formulation enables the simultaneous estimation of edges and higher-order simplices within a single optimization problem. Experiments on simulated and real-world data demonstrate that the proposed joint approach outperforms hierarchical and greedy baselines, while more faithfully enforcing higher-order structural priors.

eess.SP↗

arXiv2026

Robust Covariance-Based DoA Estimation under Weather-Induced Distortion

We investigate robust direction-of-arrival (DoA) estimation for sensor arrays operating in adverse weather conditions, where weather-induced distortions degrade estimation accuracy. Building on a physics-based $S$-matrix model established in prior work, we adopt a statistical characterization of random phase and amplitude distortions caused by multiple scattering in rain. Based on this model, we develop a measurement framework for uniform linear arrays (ULAs) that explicitly incorporates such distortions. To mitigate their impact, we exploit the Hermitian Toeplitz (HT) structure of the covariance matrix to reduce the number of parameters to be estimated. We then apply a generalized least squares (GLS) approach for calibration. Simulation results show that the proposed method effectively suppresses rain-induced distortions, improves DoA estimation accuracy, and enhances radar sensing performance in challenging weather conditions.

eess.SP↗

arXiv2026

A 240 Elements Matrix Probe with Aberration Mask for 4D Carotid Artery Computational Ultrasound Imaging

Three-dimensional (3D) ultrasound provides enhanced visualization of the carotid artery (CA) anatomy and volumetric flow, offering improved accuracy for cardiovascular diagnosis and monitoring. However, fully populated matrix transducers with large apertures are complex and costly to implement. Computational ultrasound imaging (cUSi) offers a promising alternative by enabling simplified hardware design through model-based reconstruction and spatial field encoding. In this work, we present a 3D cUSi system tailored for CA imaging, consisting of a 240-element matrix probe with a 40 x 24 mm$^2$ large aperture and a spatial encoding mask. We describe the system's design, characterization, and image reconstruction. Phantom experiments show that computational reconstruction using matched filtering (MF) significantly improves volumetric image quality over delay-and-sum (DAS), with spatial encoding enhancing lateral resolution at the cost of reduced contrast ratio. LSQR-based reconstruction was demonstrated to further improve resolution and suppress artifacts. Using both Hadamard and 16-angle plane wave transmission schemes, the system achieved high-resolution images with reasonable contrast, supporting the feasibility of 4D CA imaging applications.

physics.med-ph↗

arXiv2025

4D Computational Ultrasound Imaging of Carotid Artery Flow

Computational ultrasound imaging (cUSi) with few elements and spatial field encoding can provide high-resolution volumetric B-mode imaging. In this work, we extend its application to 4D carotid artery (CA) flow imaging using a custom large-aperture 240-element matrix probe. We implemented a frequency band-based matched filtering strategy that balances resolution and contrast. The system's inherent imaging capabilities were evaluated and validated in flow phantom and human CA experiments. In the phantom study, 3D/4D power Doppler image and speckle-tracking analyses confirmed the system's ability to resolve flow structures and hemodynamics. In the human study, the CA bifurcation flow structure and its local pulsatile flow dynamics were successfully reconstructed. These results demonstrate the feasibility of using a large-footprint, few-element cUSi system for 4D CA flow assessment.

physics.med-ph↗

arXiv2025

Fast Multiagent Formation Stabilization with Sparse Universally Rigid Frameworks

Affine formation control (AFC) is a distributed networked control system that has recently received increasing attention in various applications. AFC is typically achieved using a generalized consensus system where the stress matrix, which encodes the graph structure, is used instead of a graph Laplacian. Universally rigid frameworks (URFs) guarantee the existence of the stress matrix and have thus become the guideline for such a network design. In this work, we propose a convex optimization framework to design the stress matrix for AFC without predefining a rigid graph. We aim to find a resulting network with a reduced number of communication links, but still with a fast convergence speed. We show through simulations that our proposed solutions can yield a more sparse graph, while admitting a faster convergence compared to the state-of-the-art solutions.

eess.SY↗

arXiv2025

Attentional Graph Neural Network Is All You Need for Robust Massive Network Localization

In this paper, we design Graph Neural Networks (GNNs) with attention mechanisms to tackle an important yet challenging nonlinear regression problem: massive network localization. We first review our previous network localization method based on Graph Convolutional Network (GCN), which can exhibit state-of-the-art localization accuracy, even under severe Non-Line-of-Sight (NLOS) conditions, by carefully preselecting a constant threshold for determining adjacency. As an extension, we propose a specially designed Attentional GNN (AGNN) model to resolve the sensitive thresholding issue of the GCN-based method and enhance the underlying model capacity. The AGNN comprises an Adjacency Learning Module (ALM) and Multiple Graph Attention Layers (MGAL), employing distinct attention architectures to systematically address the demerits of the GCN-based method, rendering it more practical for real-world applications. Comprehensive analyses are conducted to explain the superior performance of these methods, including a theoretical analysis of the AGNN's dynamic attention property and computational complexity, along with a systematic discussion of their robust characteristic against NLOS measurements. Extensive experimental results demonstrate the effectiveness of the GCN-based and AGNN-based network localization methods. Notably, integrating attention mechanisms into the AGNN yields substantial improvements in localization accuracy, approaching the fundamental lower bound and showing approximately 37\% to 53\% reduction in localization error compared to the vanilla GCN-based method across various NLOS noise configurations. Both methods outperform all competing approaches by far in terms of localization accuracy, robustness, and computational time, especially for considerably large network sizes.

cs.LG↗

arXiv2025

Topological Signal Processing and Learning: Recent Advances and Future Challenges

Developing methods to process irregularly structured data is crucial in applications like gene-regulatory, brain, power, and socioeconomic networks. Graphs have been the go-to algebraic tool for modeling the structure via nodes and edges capturing their interactions, leading to the establishment of the fields of graph signal processing (GSP) and graph machine learning (GML). Key graph-aware methods include Fourier transform, filtering, sampling, as well as topology identification and spatiotemporal processing. Although versatile, graphs can model only pairwise dependencies in the data. To this end, topological structures such as simplicial and cell complexes have emerged as algebraic representations for more intricate structure modeling in data-driven systems, fueling the rapid development of novel topological-based processing and learning methods. This paper first presents the core principles of topological signal processing through the Hodge theory, a framework instrumental in propelling the field forward thanks to principled connections with GSP-GML. It then outlines advances in topological signal representation, filtering, and sampling, as well as inferring topological structures from data, processing spatiotemporal topological signals, and connections with topological machine learning. The impact of topological signal processing and learning is finally highlighted in applications dealing with flow data over networks, geometric processing, statistical ranking, biology, and semantic communication.

eess.SP↗

arXiv2025

Jointly optimal array geometries and waveforms in active sensing: New insights into array design via the Cramér-Rao bound

This paper investigates jointly optimal array geometry and waveform designs for active sensing. Specifically, we focus on minimizing the Cramér-Rao lower bound (CRB) of the angle of a single target in white Gaussian noise. We first find that several array-waveform pairs can yield the same CRB by virtue of sequences with equal sums of squares, i.e., solutions to certain Diophantine equations. Furthermore, we show that under physical aperture and sensor number constraints, the CRB-minimizing receive array geometry is unique, whereas the transmit array can be chosen flexibly. We leverage this freedom to design a novel sparse array geometry that not only minimizes the single-target CRB given an optimal waveform, but also has a nonredundant and contiguous sum co-array, a desirable property when launching independent waveforms, with relevance also to the multi-target case.

eess.SP↗

arXiv2024

Deep-Learning-Aided Alternating Least Squares for Tensor CP Decomposition and Its Application to Massive MIMO Channel Estimation

CANDECOMP/PARAFAC (CP) decomposition is the mostly used model to formulate the received tensor signal in a massive MIMO system, as the receiver generally sums the components from different paths or users. To achieve accurate and low-latency channel estimation, good and fast CP decomposition (CPD) algorithms are desired. The CP alternating least squares (CPALS) is the workhorse algorithm for calculating the CPD. However, its performance depends on the initializations, and good starting values can lead to more efficient solutions. Existing initialization strategies are decoupled from the CPALS and are not necessarily favorable for solving the CPD. This paper proposes a deep-learning-aided CPALS (DL-CPALS) method that uses a deep neural network (DNN) to generate favorable initializations. The proposed DL-CPALS integrates the DNN and CPALS to a model-based deep learning paradigm, where it trains the DNN to generate an initialization that facilitates fast and accurate CPD. Moreover, benefiting from the CP low-rankness, the proposed method is trained using noisy data and does not require paired clean data. The proposed DL-CPALS is applied to millimeter wave MIMO-OFDM channel estimation. Experimental results demonstrate the significant improvements of the proposed method in terms of both speed and accuracy for CPD and channel estimation.

eess.SP↗

arXiv2024

Optimal Pilot Design for OTFS in Linear Time-Varying Channels

This paper investigates the positioning of the pilot symbols, as well as the power distribution between the pilot and the communication symbols in the orthogonal time frequency space (OTFS) modulation scheme. We analyze the pilot placements that minimize the mean squared error (MSE) in estimating the channel taps. This allows us to identify two new pilot allocations for OTFS. In addition, we optimize the average channel capacity by adjusting the power balance. We show that this leads to a significant increase in average capacity. The results provide valuable guidance for designing the OTFS parameters to achieve maximum capacity. Numerical simulations are performed to validate the findings.

eess.SP↗