arXiv subjects

Olivier Leveque

Publications and source records attributed to Olivier Leveque.

13 recordsLinked to original sources

arXiv2025

From Spaceborne to Airborne: SAR Image Synthesis Using Foundation Models for Multi-Scale Adaptation

The availability of Synthetic Aperture Radar (SAR) satellite imagery has increased considerably in recent years, with datasets commercially available. However, the acquisition of high-resolution SAR images in airborne configurations, remains costly and limited. Thus, the lack of open source, well-labeled, or easily exploitable SAR text-image datasets is a barrier to the use of existing foundation models in remote sensing applications. In this context, synthetic image generation is a promising solution to augment this scarce data, enabling a broader range of applications. Leveraging over 15 years of ONERA's extensive archival airborn data from acquisition campaigns, we created a comprehensive training dataset of 110 thousands SAR images to exploit a 3.5 billion parameters pre-trained latent diffusion model \cite{Baqu2019SethiR}. In this work, we present a novel approach utilizing spatial conditioning techniques within a foundation model to transform satellite SAR imagery into airborne SAR representations. Additionally, we demonstrate that our pipeline is effective for bridging the realism of simulated images generated by ONERA's physics-based simulator EMPRISE \cite{empriseem_ai_images}. Our method explores a key application of AI in advancing SAR imaging technology. To the best of our knowledge, we are the first to introduce this approach in the literature.

eess.IV↗

arXiv2023

A Binary Annular Phase Mask to Regulate Spherical Aberration and Allow Super-Localization in Single-Particle Tracking over Extended Depth-of-Focus

Important applications of single-particle tracking (SPT) aim at deciphering the diffusion properties of single fluorescent nanoparticles immersed in heterogeneous environments, such as multi-cellular biological tissues. To maximize the particle localization precision in such complex environments, high numerical aperture objectives are often required, which intrinsically restrict depth-of-focus (DOF) to less than a micrometer and impedes recording long trajectories when particles escape the plane of focus. In this work, we show that a simple binary phase mask can work with the spherical aberration inevitably induced by thick sample inhomogeneities, to extend the DOF of a single-molecule fluorescence microscope over more than 4 μm. The effect of point-spread-function (PSF) engineering over spherical aberration regularizes inhomogeneities of the PSF along the optical axis by restricting it to a narrow distribution. This allows the use of a single fitting function (i.e. Gaussian function) to localize single emitters over the whole extended DOF. Application of this simple approach on diffusing nanoparticles demonstrate that SPT trajectories can be recorded on significantly longer times.

physics.optics↗

arXiv2018

Satellite Positioning with Large Constellations

Modern global navigation satellite system receivers can access signals from several satellite constellations (including GPS, GLONASS, Galileo, BeiDou). Once these constellations are all fully operational, a typical receiver can expect to have on the order of 40-50 satellites in view. Motivated by that observation, this paper presents an asymptotic analysis of positioning algorithms in the large-constellation regime. We determine the exact asymptotic behavior for both pseudo-range and carrier-phase positioning. One interesting insight from our analysis is that the standard carrier-phase positioning approach based on resolving the carrier-phase integer ambiguities fails for large satellite constellations. Instead, we adopt a Bayesian approach, in which the ambiguities are treated as noise terms and not explicitly estimated.

eess.SP↗

arXiv2016

Communication Tradeoffs in Wireless Networks

We characterize the maximum achievable broadcast rate in a wireless network under various fading assumptions. Our result exhibits a duality between the performance achieved in this context by collaborative beamforming strategies and the number of degrees of freedom available in the network.

cs.IT↗

arXiv2016

On the Broadcast Capacity of Large Wireless Networks at Low SNR

The present paper focuses on the problem of broadcasting information in the most efficient manner in a large two-dimensional ad hoc wireless network at low SNR and under line-of-sight propagation. A new communication scheme is proposed, where source nodes first broadcast their data to the entire network, despite the lack of sufficient available power. The signal's power is then reinforced via successive back-and-forth beamforming transmissions between different groups of nodes in the network, so that all nodes are able to decode the transmitted information at the end. This scheme is shown to achieve asymptotically the broadcast capacity of the network, which is expressed in terms of the largest singular value of the matrix of fading coefficients between the nodes in the network. A detailed mathematical analysis is then presented to evaluate the asymptotic behavior of this largest singular value.

cs.IT↗

arXiv2013

On Generalized Weighted Hilbert Matrices

In this paper, we study spectral properties of generalized weighted Hilbert matrices. In particular, we establish results on the spectral norm, determinant, as well as various relations between the eigenvalues and eigenvectors of such matrices. We also study the asymptotic behaviour of the spectral norm of the classical Hilbert matrix.

math.SP↗

arXiv2013

Spatial degrees of freedom of MIMO systems in Line-of-Sight Environment

While the efficiency of MIMO transmissions in a rich scattering environment has been demonstrated, less is known about the situation where the fading matrix coefficients come from a line-of-sight model. In this paper, we study in detail how this line-of-sight assumption affects the performance of distributed MIMO transmissions between far away clusters of nodes in a wireless network. Our analysis pertains to the study of a new class of random matrices.

cs.IT↗

arXiv2010

Linear Capacity Scaling in Wireless Networks: Beyond Physical Limits?

We investigate the role of cooperation in wireless networks subject to a spatial degrees of freedom limitation. To address the worst case scenario, we consider a free-space line-of-sight type environment with no scattering and no fading. We identify three qualitatively different operating regimes that are determined by how the area of the network A, normalized with respect to the wavelength lambda, compares to the number of users n. In networks with sqrt{A}/lambda < sqrt{n}, the limitation in spatial degrees of freedom does not allow to achieve a capacity scaling better than sqrt{n} and this performance can be readily achieved by multi-hopping. This result has been recently shown by Franceschetti et al. However, for networks with sqrt{A}/lambda > sqrt{n}, the number of available degrees of freedom is min(n, sqrt{A}/lambda), larger that what can be achieved by multi-hopping. We show that the optimal capacity scaling in this regime is achieved by hierarchical cooperation. In particular, in networks with sqrt{A}/lambda> n, hierarchical cooperation can achieve linear scaling.

cs.IT↗

arXiv2009

Diversity-Multiplexing Tradeoff for the MIMO Static Half-Duplex Relay

In this work, we investigate the diversity-multiplexing tradeoff (DMT) of the multiple-antenna (MIMO) static half-duplex relay channel. A general expression is derived for the DMT upper bound, which can be achieved by a compress-and-forward protocol at the relay, under certain assumptions. The DMT expression is given as the solution of a minimization problem in general, and an explicit expression is found when the relay channel is symmetric in terms of number of antennas, i.e. the source and the destination have n antennas each, and the relay has m antennas. It is observed that the static half-duplex DMT matches the full-duplex DMT when the relay has a single antenna, and is strictly below the full-duplex DMT when the relay has multiple antennas. Besides, the derivation of the upper bound involves a new asymptotic study of spherical integrals (that is, integrals with respect to the Haar measure on the unitary group U(n)), which is a topic of mathematical interest in itself.

cs.IT↗

arXiv2009

Information Theoretic Operating Regimes of Large Wireless Networks

In analyzing the point-to-point wireless channel, insights about two qualitatively different operating regimes--bandwidth- and power-limited--have proven indispensable in the design of good communication schemes. In this paper, we propose a new scaling law formulation for wireless networks that allows us to develop a theory that is analogous to the point-to-point case. We identify fundamental operating regimes of wireless networks and derive architectural guidelines for the design of optimal schemes. Our analysis shows that in a given wireless network with arbitrary size, area, power, bandwidth, etc., there are three parameters of importance: the short-distance SNR, the long-distance SNR, and the power path loss exponent of the environment. Depending on these parameters we identify four qualitatively different regimes. One of these regimes is especially interesting since it is fundamentally a consequence of the heterogeneous nature of links in a network and does not occur in the point-to-point case; the network capacity is {\em both} power and bandwidth limited. This regime has thus far remained hidden due to the limitations of the existing formulation. Existing schemes, either multihop transmission or hierarchical cooperation, fail to achieve capacity in this regime; we propose a new hybrid scheme that achieves capacity.

cs.IT↗

arXiv2009

Throughput-Delay Trade-off for Hierarchical Cooperation in Ad Hoc Wireless Networks

Hierarchical cooperation has recently been shown to achieve better throughput scaling than classical multihop schemes under certain assumptions on the channel model in static wireless networks. However, the end-to-end delay of this scheme turns out to be significantly larger than those of multihop schemes. A modification of the scheme is proposed here that achieves a throughput-delay trade-off $D(n)=(\log n)^2 T(n)$ for T(n) between $Θ(\sqrt{n}/\log n)$ and $Θ(n/\log n)$, where D(n) and T(n) are respectively the average delay per bit and the aggregate throughput in a network of n nodes. This trade-off complements the previous results of El Gamal et al., which show that the throughput-delay trade-off for multihop schemes is given by D(n)=T(n) where T(n) lies between $Θ(1)$ and $Θ(\sqrt{n})$. Meanwhile, the present paper considers the network multiple-access problem, which may be of interest in its own right.

cs.IT↗

arXiv2007

Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks

n source and destination pairs randomly located in an area want to communicate with each other. Signals transmitted from one user to another at distance r apart are subject to a power loss of r^{-alpha}, as well as a random phase. We identify the scaling laws of the information theoretic capacity of the network. In the case of dense networks, where the area is fixed and the density of nodes increasing, we show that the total capacity of the network scales linearly with n. This improves on the best known achievability result of n^{2/3} of Aeron and Saligrama, 2006. In the case of extended networks, where the density of nodes is fixed and the area increasing linearly with n, we show that this capacity scales as n^{2-alpha/2} for 2 3. The best known earlier result (Xie and Kumar 2006) identified the scaling law for alpha > 4. Thus, much better scaling than multihop can be achieved in dense networks, as well as in extended networks with low attenuation. The performance gain is achieved by intelligent node cooperation and distributed MIMO communication. The key ingredient is a hierarchical and digital architecture for nodal exchange of information for realizing the cooperation.

cs.IT↗

arXiv2007

Product Multicommodity Flow in Wireless Networks

We provide a tight approximate characterization of the $n$-dimensional product multicommodity flow (PMF) region for a wireless network of $n$ nodes. Separate characterizations in terms of the spectral properties of appropriate network graphs are obtained in both an information theoretic sense and for a combinatorial interference model (e.g., Protocol model). These provide an inner approximation to the $n^2$ dimensional capacity region. These results answer the following questions which arise naturally from previous work: (a) What is the significance of $1/\sqrt{n}$ in the scaling laws for the Protocol interference model obtained by Gupta and Kumar (2000)? (b) Can we obtain a tight approximation to the "maximum supportable flow" for node distributions more general than the geometric random distribution, traffic models other than randomly chosen source-destination pairs, and under very general assumptions on the channel fading model? We first establish that the random source-destination model is essentially a one-dimensional approximation to the capacity region, and a special case of product multi-commodity flow. Building on previous results, for a combinatorial interference model given by a network and a conflict graph, we relate the product multicommodity flow to the spectral properties of the underlying graphs resulting in computational upper and lower bounds. For the more interesting random fading model with additive white Gaussian noise (AWGN), we show that the scaling laws for PMF can again be tightly characterized by the spectral properties of appropriately defined graphs. As an implication, we obtain computationally efficient upper and lower bounds on the PMF for any wireless network with a guaranteed approximation factor.

cs.IT↗