Source author record

Daniel Romero

Daniel Romero appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

13works
15topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

13 published item(s)

preprint2026arXiv

Learning the Channel Gain from Anywhere to Anywhere via Cross-environment Transformer Estimators

Channel-gain maps provide the channel gain between any two locations in a geographical region. They find numerous applications, from resource allocation and interference control to path planning for autonomous vehicles. Channel-gain map estimation (CGME) is considerably more challenging than conventional radio map estimation (RME) because channel-gain maps are functions over a 6-dimensional input space. This calls for specialized methods, which currently rely on the (inaccurate) radio tomographic model or require a prohibitively large number of measurements since they do not exploit any spatial structure. This paper overcomes this issue by leveraging spatial patterns that channel-gain maps exhibit across environments, as dictated by the laws of physics and typical environmental characteristics (e.g. building materials and layouts). Adopting a metalearning perspective, a transformer-based estimator is proposed to implicitly learn this common structure from measurements collected in multiple environments. This enables CGME in new environments from significantly fewer measurements (five times less in our experiments). To maximize learning efficiency, the transformer is composed with a feature map that enforces the invariances of CGME, such as those following from reciprocity. Numerical experiments corroborate the merits of the proposed estimator relative to existing methods.

preprint2022arXiv

Aerial Base Station Placement: A Tutorial Introduction

The deployment of Aerial Base Stations (ABSs) mounted on board Unmanned Aerial Vehicles (UAVs) is emerging as a promising technology to provide connectivity in areas where terrestrial infrastructure is insufficient or absent. This may occur for example in remote areas, large events, emergency situations, or areas affected by a natural disaster such as a wildfire or a tsunami. To successfully materialize this goal, it is required that ABSs are placed at locations in 3D space that ensure a high quality of service (QoS) to the ground terminals. This paper provides a tutorial introduction to this ABS placement problem where the fundamental challenges and trade-offs are first investigated by means of a toy application example. Next, the different approaches in the literature to address the aforementioned challenges in both 2D or 3D space will be introduced and a discussion on adaptive placement will be provided. The paper is concluded by discussing future research directions.

preprint2022arXiv

Comments on "Design of Asymmetric Shift Operators for Efficient Decentralized Subspace Projection"

This correspondence disproves the main results in the paper "Design of Asymmetric Shift Operators for Efficient Decentralized Subspace Projection" by S. Mollaebrahim and B. Beferull-Lozano. Counterexamples and counterproofs are provided when applicable. A correction is suggested for some of the flaws. However, it does not seem possible to amend most of the flaws since the overall approach based on a Schur decomposition of the shift matrix does not appear to be helpful to solve the desired problem.

preprint2022arXiv

Implicit Channel Charting with Application to UAV-aided Localization

Traditional localization algorithms based on features such as time difference of arrival are impaired by non-line of sight propagation, which negatively affects the consistency that they expect among distance estimates. Instead, fingerprinting localization is robust to these propagation conditions but requires the costly collection of large data sets. To alleviate these limitations, the present paper capitalizes on the recently-proposed notion of channel charting to learn the geometry of the space that contains the channel state information (CSI) measurements collected by the nodes to be localized. The proposed algorithm utilizes a deep neural network that learns distances between pairs of nodes using their measured CSI. Unlike standard channel charting approaches, this algorithm directly works with the physical geometry and therefore only implicitly learns the geometry of the radio domain. Simulation results demonstrate that the proposed algorithm outperforms its competitors and allows accurate localization in emergency scenarios using an unmanned aerial vehicle.

preprint2022arXiv

Spectrum Surveying: Active Radio Map Estimation with Autonomous UAVs

Radio maps find numerous applications in wireless communications and mobile robotics tasks, including resource allocation, interference coordination, and mission planning. Although numerous techniques have been proposed to construct radio maps from spatially distributed measurements, the locations of such measurements are assumed predetermined beforehand. In contrast, this paper proposes spectrum surveying, where a mobile robot such as an unmanned aerial vehicle (UAV) collects measurements at a set of locations that are actively selected to obtain high-quality map estimates in a short surveying time. This is performed in two steps. First, two novel algorithms, a model-based online Bayesian estimator and a data-driven deep learning algorithm, are devised for updating a map estimate and an uncertainty metric that indicates the informativeness of measurements at each possible location. These algorithms offer complementary benefits and feature constant complexity per measurement. Second, the uncertainty metric is used to plan the trajectory of the UAV to gather measurements at the most informative locations. To overcome the combinatorial complexity of this problem, a dynamic programming approach is proposed to obtain lists of waypoints through areas of large uncertainty in linear time. Numerical experiments conducted on a realistic dataset confirm that the proposed scheme constructs accurate radio maps quickly.

preprint2020arXiv

Aerial Spectrum Surveying: Radio Map Estimation with Autonomous UAVs

Radio maps are emerging as a popular means to endow next-generation wireless communications with situational awareness. In particular, radio maps are expected to play a central role in unmanned aerial vehicle (UAV) communications since they can be used to determine interference or channel gain at a spatial location where a UAV has not been before. Existing methods for radio map estimation utilize measurements collected by sensors whose locations cannot be controlled. In contrast, this paper proposes a scheme in which a UAV collects measurements along a trajectory. This trajectory is designed to obtain accurate estimates of the target radio map in a short time operation. The route planning algorithm relies on a map uncertainty metric to collect measurements at those locations where they are more informative. An online Bayesian learning algorithm is developed to update the map estimate and uncertainty metric every time a new measurement is collected, which enables real-time operation.

preprint2016arXiv

Kernel-based Reconstruction of Graph Signals

A number of applications in engineering, social sciences, physics, and biology involve inference over networks. In this context, graph signals are widely encountered as descriptors of vertex attributes or features in graph-structured data. Estimating such signals in all vertices given noisy observations of their values on a subset of vertices has been extensively analyzed in the literature of signal processing on graphs (SPoG). This paper advocates kernel regression as a framework generalizing popular SPoG modeling and reconstruction and expanding their capabilities. Formulating signal reconstruction as a regression task on reproducing kernel Hilbert spaces of graph signals permeates benefits from statistical learning, offers fresh insights, and allows for estimators to leverage richer forms of prior information than existing alternatives. A number of SPoG notions such as bandlimitedness, graph filters, and the graph Fourier transform are naturally accommodated in the kernel framework. Additionally, this paper capitalizes on the so-called representer theorem to devise simpler versions of existing Thikhonov regularized estimators, and offers a novel probabilistic interpretation of kernel methods on graphs based on graphical models. Motivated by the challenges of selecting the bandwidth parameter in SPoG estimators or the kernel map in kernel-based methods, the present paper further proposes two multi-kernel approaches with complementary strengths. Whereas the first enables estimation of the unknown bandwidth of bandlimited signals, the second allows for efficient graph filter selection. Numerical tests with synthetic as well as real data demonstrate the merits of the proposed methods relative to state-of-the-art alternatives.

preprint2015arXiv

Compression Limits for Random Vectors with Linearly Parameterized Second-Order Statistics

The class of complex random vectors whose covariance matrix is linearly parameterized by a basis of Hermitian Toeplitz (HT) matrices is considered, and the maximum compression ratios that preserve all second-order information are derived --- the statistics of the uncompressed vector must be recoverable from a set of linearly compressed observations. This kind of vectors arises naturally when sampling wide-sense stationary random processes and features a number of applications in signal and array processing. Explicit guidelines to design optimal and nearly optimal schemes operating both in a periodic and non-periodic fashion are provided by considering two of the most common linear compression schemes, which we classify as dense or sparse. It is seen that the maximum compression ratios depend on the structure of the HT subspace containing the covariance matrix of the uncompressed observations. Compression patterns attaining these maximum ratios are found for the case without structure as well as for the cases with circulant or banded structure. Universal samplers are also proposed to compress unknown HT subspaces.

preprint2014arXiv

Compressive Periodogram Reconstruction Using Uniform Binning

In this paper, two problems that show great similarities are examined. The first problem is the reconstruction of the angular-domain periodogram from spatial-domain signals received at different time indices. The second one is the reconstruction of the frequency-domain periodogram from time-domain signals received at different wireless sensors. We split the entire angular or frequency band into uniform bins. The bin size is set such that the received spectra at two frequencies or angles, whose distance is equal to or larger than the size of a bin, are uncorrelated. These problems in the two different domains lead to a similar circulant structure in the so-called coset correlation matrix. This circulant structure allows for a strong compression and a simple least-squares reconstruction method. The latter is possible under the full column rank condition of the system matrix, which can be achieved by designing the spatial or temporal sampling patterns based on a circular sparse ruler. We analyze the statistical performance of the compressively reconstructed periodogram including bias and variance. We further consider the case when the bins are so small that the received spectra at two frequencies or angles, with a spacing between them larger than the size of the bin, can still be correlated. In this case, the resulting coset correlation matrix is generally not circulant and thus a special approach is required.

preprint2014arXiv

Cooperative Compressive Power Spectrum Estimation

We examine power spectrum estimation from wide-sense stationary signals received at different wireless sensors. We organize multiple sensors into several groups, where each group estimates the temporal correlation only at particular lags, which are different from group to group. A fusion centre collects all the correlation estimates from different groups of sensors, and uses them to estimate the power spectrum. This reduces the required sampling rate per sensor. We further investigate the conditions required for the system matrix to have full column rank, which allows for a least-squares reconstruction method.

preprint2013arXiv

Critical Transitions in Social Network Activity

A large variety of complex systems in ecology, climate science, biomedicine and engineering have been observed to exhibit tipping points, where the internal dynamical state of the system abruptly changes. For example, such critical transitions may result in the sudden change of ecological environments and climate conditions. Data and models suggest that detectable warning signs may precede some of these drastic events. This view is also corroborated by abstract mathematical theory for generic bifurcations in stochastic multi-scale systems. Whether the stochastic scaling laws used as warning signs are also present in social networks that anticipate a-priori {\it unknown} events in society is an exciting open problem, to which at present only highly speculative answers can be given. Here, we instead provide a first step towards tackling this formidable question by focusing on a-priori {\it known} events and analyzing a social network data set with a focus on classical variance and autocorrelation warning signs. Our results thus pertain to one absolutely fundamental question: Can the stochastic warning signs known from other areas also be detected in large-scale social network data? We answer this question affirmatively as we find that several a-priori known events are preceded by variance and autocorrelation growth. Our findings thus clearly establish the necessary starting point to further investigate the relation between abstract mathematical theory and various classes of critical transitions in social networks.

preprint2011arXiv

Debugging of Web Applications with Web-TLR

Web-TLR is a Web verification engine that is based on the well-established Rewriting Logic--Maude/LTLR tandem for Web system specification and model-checking. In Web-TLR, Web applications are expressed as rewrite theories that can be formally verified by using the Maude built-in LTLR model-checker. Whenever a property is refuted, a counterexample trace is delivered that reveals an undesired, erroneous navigation sequence. Unfortunately, the analysis (or even the simple inspection) of such counterexamples may be unfeasible because of the size and complexity of the traces under examination. In this paper, we endow Web-TLR with a new Web debugging facility that supports the efficient manipulation of counterexample traces. This facility is based on a backward trace-slicing technique for rewriting logic theories that allows the pieces of information that we are interested to be traced back through inverse rewrite sequences. The slicing process drastically simplifies the computation trace by dropping useless data that do not influence the final result. By using this facility, the Web engineer can focus on the relevant fragments of the failing application, which greatly reduces the manual debugging effort and also decreases the number of iterative verifications.

preprint2011arXiv

Dynamic Backward Slicing of Rewriting Logic Computations

Trace slicing is a widely used technique for execution trace analysis that is effectively used in program debugging, analysis and comprehension. In this paper, we present a backward trace slicing technique that can be used for the analysis of Rewriting Logic theories. Our trace slicing technique allows us to systematically trace back rewrite sequences modulo equational axioms (such as associativity and commutativity) by means of an algorithm that dynamically simplifies the traces by detecting control and data dependencies, and dropping useless data that do not influence the final result. Our methodology is particularly suitable for analyzing complex, textually-large system computations such as those delivered as counter-example traces by Maude model-checkers.