Sorry, you need to enable JavaScript to visit this website.

It is known that the calculation of a matrix–vector product can be accelerated if this matrix can be recast (or approximated) by the Kronecker product of two smaller matrices. In array signal processing, the manifold matrix can be described as the Kronecker product of two other matrices if the sensor array displays a separable geometry. This forms the basis of the Kronecker Array Transform (KAT), which was previously introduced to speed up the calculations of acoustic images with microphone arrays.


Identifying characteristic vibrational modes and frequencies is of great importance for monitoring the health of structures such as buildings and bridges. In this work, we address the problem of estimating the modal parameters of a structure from small amounts of vibrational data collected from wireless sensors distributed on the structure. We consider a randomized spatial compression scheme for minimizing the amount of data that is collected and transmitted by the sensors.


This work investigates the parameter estimation performance of super-resolution line spectral estimation using atomic norm minimization. The focus is on analyzing the algorithm's accuracy of inferring the frequencies and complex magnitudes from noisy observations. When the Signal-to-Noise Ratio is reasonably high and the true frequencies are separated by $O(\frac{1}{n})$, the atomic norm estimator is shown to localize the correct number of frequencies, each within a neighborhood of size $O(\sqrt{\frac{\log n}{n^3}} \sigma)$ of one of the true frequencies.


We consider the problem of geolocating two unknown co-channel emitters by a cluster of formation-flying satellites using both time difference of arrival (TDOA) and frequency difference of arrival (FDOA) measurements. As the association between the TDOA/FDOA measurements obtained by each pair of satellites and the corresponding emitters is typically not known, the emitter-measurement association and the emitters' locations need to be jointly estimated. In this paper, we first formulate the joint estimation problem as a mixed integer nonlinear optimization problem.


Hyperspectral unmixing consists in determining the reference spectral
signatures composing a hyperspectral image and their relative
abundance fractions in each pixel. In practice, the identified signatures
may be affected by a significant spectral variability resulting
for instance from the temporal evolution of the imaged scene. This
phenomenon can be accounted for by using a perturbed linear mixing
model. This paper studies an online estimation algorithm for the
parameters of this extended linear mixing model. This algorithm is