Related papers: Angular Resolution of Closely-Spaced Targets with …
We present a novel hashing strategy for approximate furthest neighbor search that selects projection bases using the data distribution. This strategy leads to an algorithm, which we call DrusillaHash, that is able to outperform existing…
In this thesis, the numerical solution of three different classes of problems have been studied. Specifically, new techniques have been proposed and their theoretical analysis has been performed, accompanied by a wide set of numerical…
We consider a variant of the clustering problem for a complete weighted graph. The aim is to partition the nodes into clusters maximizing the sum of the edge weights within the clusters. This problem is known as the clique partitioning…
We derive and showcase a novel approach to approximating Fourier transforms in higher dimensions, focusing specifically on the case of 2D radially concentrated ('ring-like') functions. We first reduce the problem to that of evaluating the…
This paper studies a passive localization system, where an extremely large-scale antenna array (ELAA) is deployed at the base station (BS) to locate a user equipment (UE) residing in its near-field (Fresnel) region. We propose a novel…
This paper studies a passive localization system, where an extremely large-scale antenna array (ELAA) is deployed at the base station (BS) to locate a user equipment (UE) residing in its near-field (Fresnel) region. We propose a novel…
We study the Maximum Independent Set of Rectangles (MISR) problem, where we are given a set of axis-parallel rectangles in the plane and the goal is to select a subset of non-overlapping rectangles of maximum cardinality. In a recent…
Extremely large-scale arrays (XL-arrays) have emerged as a promising technology to achieve super-high spectral efficiency and spatial resolution in future wireless systems. The large aperture of XL-arrays means that spherical rather than…
A deep learning model is proposed for reconstructing 2D dielectric breast images from time-domain signals. Unlike existing learning models that employ a fixed antenna array, where input data consists solely of measurements, the proposed…
Neural network-based clustering has recently gained popularity, and in particular a constrained clustering formulation has been proposed to perform transfer learning and image category discovery using deep learning. The core idea is to…
The wide applicability of kernels makes the problem of max-kernel search ubiquitous and more general than the usual similarity search in metric spaces. We focus on solving this problem efficiently. We begin by characterizing the inherent…
The Boolean multireference alignment problem consists in recovering a Boolean signal from multiple shifted and noisy observations. In this paper we obtain an expression for the error exponent of the maximum A posteriori decoder. This…
Background. Relative astrometry at or below the micro-arcsec level with a 1m class space telescope has been repeatedly proposed as a tool for exo-planet detection and characterization, as well as for several topics at the forefront of…
This paper is devoted to general nonconvex problems of multiobjective optimization in Hilbert spaces. Based on Mordukhovich's limiting subgradients, we define a new notion of Pareto critical points for such problems, establish necessary…
In 2017, the next generation Very Large Array (ngVLA) Science Advisory Council, together with the international astronomy community, developed a set of five Key Science Goals (KSGs) to inform, prioritize and refine the technical…
In this paper, a new concept, radial coverage strength, is first proposed to characterize the visual sensing performance when the orientation of the target pose is considered. In particular, the elevation angle of the optical pose of the…
Super-resolution is aimed at reconstructing high-resolution images from low-resolution observations. State-of-the-art approaches underpinned with deep learning allow for obtaining outstanding results, generating images of high perceptual…
Most of the existing methods for estimating the local intrinsic dimension of a data distribution do not scale well to high-dimensional data. Many of them rely on a non-parametric nearest neighbors approach which suffers from the curse of…
Multiple-input multiple-output (MIMO) radar has become a thriving subject of research during the past decades. In the MIMO radar context, it is sometimes more accurate to model the radar clutter as a non-Gaussian process, more specifically,…
Nearest neighbor search is fundamental to a wide range of applications. Since the exact nearest neighbor search suffers from the "curse of dimensionality", approximate approaches, such as Locality-Sensitive Hashing (LSH), are widely used to…