Search

In this work, we introduce a spatio-temporal kernel for Gaussian process (GP) regression-based sound field estimation. Notably, GPs have the attractive property that the sound field is a linear function of the measurements, allowing the field to be estimated efficiently from distributed microphone measurements. However, to ensure analytical tractability, most existing kernels for sound field estimation have been formulated in the frequency domain, formed independently for each frequency. To address the analytical intractability of spatio-temporal kernels, we here propose to instead learn the kernel directly from data by the means of deep kernel learning. Furthermore, to improve the generalization of the deep kernel, we propose a method for regularizing the learning process using the wave equation. The representational advantages of the deep kernel and the improved generalization obtained by using the wave equation regularization are illustrated using numerical simulations., Comment: Accepted for IWAENC 2024

The ability to accurately estimate room impulse responses (RIRs) is integral to many applications of spatial audio processing. Regrettably, estimating the RIR using ambient signals, such as speech or music, remains a challenging problem due to, e.g., low signal-to-noise ratios, finite sample lengths, and poor spectral excitation. Commonly, in order to improve the conditioning of the estimation problem, priors are placed on the amplitudes of the RIR. Although serving as a regularizer, this type of prior is generally not useful when only approximate knowledge of the delay structure is available, which, for example, is the case when the prior is a simulated RIR from an approximation of the room geometry. In this work, we target the delay structure itself, constructing a prior based on the concept of optimal transport. As illustrated using both simulated and measured data, the resulting method is able to beneficially incorporate information even from simple simulation models, displaying considerable robustness to perturbations in the assumed room dimensions and its temperature.

Recently, many forms of audio industrial applications, such as sound monitoring and source localization, have begun exploiting smart multi-modal devices equipped with a microphone array. Regrettably, model-based methods are often difficult to employ for such devices due to their high computational complexity, as well as the difficulty of appropriately selecting the user-determined parameters. As an alternative, one may use deep network-based methods, but these are often difficult to generalize, nor can they generate the desired beamforming map directly. In this paper, a computationally efficient acoustic beamforming algorithm is proposed, which may be unrolled to form a model-based deep learning network for real-time imaging, here termed the DAMAS-FISTA-Net. By exploiting the natural structure of an acoustic beamformer, the proposed network inherits the physical knowledge of the acoustic system, and thus learns the underlying physical properties of the propagation. As a result, all the network parameters may be learned end-to-end, guided by a model-based prior using back-propagation. Notably, the proposed network enables an excellent interpretability and the ability of being able to process the raw data directly. Extensive numerical experiments using both simulated and real-world data illustrate the preferable performance of the DAMAS-FISTA-Net as compared to alternative approaches., Comment: 12 pages, 9 figures

When a target is masked by mainlobe clutter with the same Doppler frequency, it is difficult for conventional airborne radars to determine whether a target is present in a given observation using regular space-time adaptive processing techniques. Different from phased-array and multiple-input multiple-output (MIMO) arrays, frequency diverse arrays (FDAs) employ frequency offsets across the array elements, delivering additional range-controllable degrees of freedom, potentially enabling suppression for this kind of clutter. However, the reception of coherent FDA systems employing small frequency offsets and achieving high transmit gain can be further improved. To this end, this work proposes an coherent airborne FDA radar receiver that explores the orthogonality of echo signals in the Doppler domain, allowing a joint space-time processing module to be deployed to separate the aliased returns. The resulting range-space-time adaptive processing allows for a preferable detection performance for coherent airborne FDA radars as compared to current alternative techniques., Comment: 11 pages, 9 figures

Spectroscopy detected in the time domain entails many techniques, such as FTIR, pump-probe, FT-Raman, and 2DES, and applications, such as molecule characterization, excited state dynamics studies, or spectra classifications. Surprisingly, all these techniques use sampling schemes that rarely exploit the a priori knowledge the scientist has before the experiment. Indeed, not all the sampling coordinates carry the same amount of information. In this work, we rationalize with examples the various advantages of a smart sampling scheme tailored to the specific experiment characteristics and/or the expected results. The application of a Fisher information approach allows for finding the best sampling scheme to minimize the variance of a desired observable, greatly improving, for example, spectral classifications and multidimensional spectroscopy. In general, we demonstrate how a smart sampling allows reducing by one to two orders of magnitude the acquisition time of an experiment while still providing a similar level of information.

Current literature show that frequency diverse arrays (FDAs) are able of producing range-angle-dependent and time-variant transmit beampatterns, but the resulting time and range dependencies and their characteristics are still not well understood. This paper examines the FDA transmission model and the model for the FDA array factor, considering their time-range relationship. We develop two FDA transmit beampatterns, both yielding the auto-scanning capability of the FDA transmit beams. The scan speed, scan volume, and initial mainlobe direction of the beams are also analyzed. In addition, the equivalent conditions for the FDA integral transmit beampattern and the multiple-input multiple-output (MIMO) beampattern are investigated. Various numerical simulations illustrate the auto-scanning property of the FDA beampattern and the proposed equivalent relationship with the MIMO beampattern, providing the basis for an improved understanding and design of the FDA transmit beampattern., Comment: 31 pages, 9 figures

This paper considers the problem of jointly designing the transmit waveforms and weights for a frequency diverse array (FDA) in a spectrally congested environment in which unintentional spectral interferences exist. Exploiting the properties of the interference signal induced by the processing of the multi-channel mixing and low-pass filtering FDA receiver, the interference covariance matrix structure is derived. With this, the receive weights are formed using the minimum variance distortionless response (MVDR) method for interference cancellation. Owing to the fact that the resulting output signal-to-interference-plus-noise ratio (SINR) is a function of the transmit waveforms and weights, as well as due to the ever-greater competition for the finite available spectrum, a joint design scheme for the FDA transmit weights and the spectrally compatible waveforms is proposed to efficiently use the available spectrum while maintaining a sufficient receive SINR. The performance of the proposed technique is verified using numerical simulations in terms of the achievable SINR, spectral compatiblity, as well as several aspects of the synthesized waveforms., Comment: 13 pages, 14 figures

In this paper, we focus on the design of the transmit waveforms of a frequency diverse array (FDA) in order to improve the output signal-to-interference-plus-noise ratio (SINR) in the presence of signal-dependent mainlobe interference. Since the classical multi-carrier matched filtering-based FDA receiver cannot effectively utilize the waveform diversity of FDA, a novel FDA receiver framework based on multi-channel mixing and low-pass filtering is developed to keep the separation of the transmit waveform at the receiver side, while preserving the FDA range-controllable degrees of freedom. Furthermore, a range-angle minimum variance distortionless response beamforming technique is introduced to synthesize receiver filter weights with the ability to suppress a possible signal-dependent mainlobe interference. The resulting FDA transmit waveform design problem is initially formulated as an optimization problem consisting of a non-convex objective function and multiple non-convex constraints. To efficiently slove this, we introduce two algorithms, one based on a signal relaxation technique, and the other based on the majorization minimization technique. The preferable performance of the proposed multi-channel low-pass filtering receiver and the optimized transmit waveforms is illustrated using numerical simulations, indicating that the resulting FDA system is not only able to effectively suppress mainlobe interference, but also to yield estimates with a higher SINR than the FDA system without waveform optimization., Comment: 37 pages, 11 figures

In this short paper, we describe an efficient numerical solver for the optimal sampling problem considered in "Designing Sampling Schemes for Multi-Dimensional Data". An implementation may be found on https://www.maths.lu.se/staff/andreas-jakobsson/publications/.

In this work, we introduce a novel approach for determining a joint sparse spectrum from several non-uniformly sampled data sets, where each data set is assumed to have its own, possibly disjoint, and only partially known, sampling times. The potential of the proposed approach is illustrated using a spectral estimation problem in paleoclimatology. In this problem, each data point derives from a separate ice core measurement, resulting in that even though all measurements reflect the same periodicities, the sampling times and phases differ among the data sets. In addition, sampling times are only approximately known. The resulting joint estimate exploiting all available data is formulated using a sparse reconstruction framework allowing for a reliable and robust estimate of the underlying periodicities. The corresponding misspecified Cram\'er-Rao lower bound, accounting for the expected sampling uncertainties, is derived and the proposed method is shown to attain the resulting bound when the signal to noise ratio is sufficiently high. The performance of the proposed method is illustrated as compared to other commonly used approaches using both simulated and measured ice core data sets.

In this work, we consider the modeling of signals that are almost, but not quite, harmonic, i.e., composed of sinusoids whose frequencies are close to being integer multiples of a common frequency. Typically, in applications, such signals are treated as perfectly harmonic, allowing for the estimation of their fundamental frequency, despite the signals not actually being periodic. Herein, we provide three different definitions of a concept of fundamental frequency for such inharmonic signals and study the implications of the different choices for modeling and estimation. We show that one of the definitions corresponds to a misspecified modeling scenario, and provides a theoretical benchmark for analyzing the behavior of estimators derived under a perfectly harmonic assumption. The second definition stems from optimal mass transport theory and yields a robust and easily interpretable concept of fundamental frequency based on the signals' spectral properties. The third definition interprets the inharmonic signal as an observation of a randomly perturbed harmonic signal. This allows for computing a hybrid information theoretical bound on estimation performance, as well as for finding an estimator attaining the bound. The theoretical findings are illustrated using numerical examples., Comment: Accepted for publication in IEEE Transactions on Signal Processing

We apply two sparse reconstruction techniques, the least absolute shrinkage and selection operator (LASSO) and the sparse exponential mode analysis (SEMA), to two-dimensional (2D) spectroscopy. The algorithms are first tested on model data, showing that both are able to reconstruct the spectra using only a fraction of the data required by the traditional Fourier-based estimator. Through the analysis of a sparsely sampled experimental fluorescence detected 2D spectra of LH2 complexes, we conclude that both SEMA and LASSO can be used to significantly reduce the required data, still allowing to reconstruct the multidimensional spectra. Of the two techniques, it is shown that SEMA offers preferable performance, providing more accurate estimation of the spectral line widths and their positions. Furthermore, SEMA allows for off-grid components, enabling the use of a much smaller dictionary than the LASSO, thereby improving both the performance and lowering the computational complexity for reconstructing coherent multidimensional spectra.

In this work, we present the misspecified Gaussian Cram\'er-Rao lower bound for the parameters of a harmonic signal, or pitch, when signal measurements are collected from an almost, but not quite, harmonic model. For the asymptotic case of large sample sizes, we present a closed-form expression for the bound corresponding to the pseduo-true fundamental frequency. Using simulation studies, it is shown that the bound is sharp and is attained by maximum likelihood estimators derived under the misspecified harmonic assumption. It is shown that misspecified harmonic models achieve a lower mean squared error than correctly specified unstructured models for moderately inharmonic signals. Examining voices from a speech database, we conclude that human speech belongs to this class of signals, verifying that the use of a harmonic model for voiced speech is preferable.

In this work, we consider the problem of estimating the parameters of polynomially damped sinusoidal signals, commonly encountered in, for instance, spectroscopy. Generally, finding the parameter values of such signals constitutes a high-dimensional problem, often further complicated by not knowing the number of signal components or their specific signal structures. In order to alleviate the computational burden, we herein propose a mismatched estimation procedure using simplified, approximate signal models. Despite the approximation, we show that such a procedure is expected to yield predictable results, allowing for statistically and computationally efficient estimates of the signal parameters.

During recent decades, there has been a substantial development in optimal mass transport theory and methods. In this work, we consider multi-marginal problems wherein only partial information of each marginal is available, which is a setup common in many inverse problems in, e.g., imaging and spectral estimation. By considering an entropy regularized approximation of the original transport problem, we propose an algorithm corresponding to a block-coordinate ascent of the dual problem, where Newton's algorithm is used to solve the sub-problems. In order to make this computationally tractable for large-scale settings, we utilize the tensor structure that arises in practical problems, allowing for computing projections of the multi-marginal transport plan using only matrix-vector operations of relatively small matrices. As illustrating examples, we apply the resulting method to tracking and barycenter problems in spatial spectral estimation. In particular, we show that the optimal mass transport framework allows for fusing information from different time steps, as well as from different sensor arrays, also when the sensor arrays are not jointly calibrated. Furthermore, we show that by incorporating knowledge of underlying dynamics in tracking scenarios, one may arrive at accurate spectral estimates, as well as faithful reconstructions of spectra corresponding to unobserved time points.

This work presents a method for information fusion in source localization applications. The method utilizes the concept of optimal mass transport in order to construct estimates of the spatial spectrum using a convex barycenter formulation. We introduce an entropy regularization term to the convex objective, which allows for low-complexity iterations of the solution algorithm and thus makes the proposed method applicable also to higher-dimensional problems. We illustrate the proposed method's inherent robustness to misalignment and miscalibration of the sensor arrays using numerical examples of localization in two dimensions.

In this work, we propose a novel method for quantifying distances between Toeplitz structured covariance matrices. By exploiting the spectral representation of Toeplitz matrices, the proposed distance measure is defined based on an optimal mass transport problem in the spectral domain. This may then be interpreted in the covariance domain, suggesting a natural way of interpolating and extrapolating Toeplitz matrices, such that the positive semi-definiteness and the Toeplitz structure of these matrices are preserved. The proposed distance measure is also shown to be contractive with respect to both additive and multiplicative noise, and thereby allows for a quantification of the decreased distance between signals when these are corrupted by noise. Finally, we illustrate how this approach can be used for several applications in signal processing. In particular, we consider interpolation and extrapolation of Toeplitz matrices, as well as clustering problems and tracking of slowly varying stochastic processes.

In this work, we propose a method for determining a non-uniform sampling scheme for multi-dimensional signals by solving a convex optimization problem reminiscent of the sensor selection problem. The resulting sampling scheme minimizes the sum of the Cram\'er-Rao lower bound for the parameters of interest, given a desired number of sampling points. The proposed framework allows for selecting an arbitrary subset of the parameters detailing the model, as well as weighing the importance of the different parameters. Also presented is a scheme for incorporating any imprecise a priori knowledge of the locations of the parameters, as well as defining estimation performance bounds for the parameters of interest. Numerical examples illustrate the efficiency of the proposed scheme.

In this paper, we propose an adaptive matched detector of a signal corrupted by a non-Gaussian noise with an inverse gamma texture. The detector is formed using a set of secondary data measurements, and is analytically shown to have a constant false alarm rate. The analytic performance is validated using Monte Carlo simulations, and the proposed detector is shown to offer preferable performance as compared to the related one-step generalized likelihood ratio test (1S-GLRT) and the adaptive subspace detector (ASD).

In this paper, we introduce a wideband dictionary framework for estimating sparse signals. By formulating integrated dictionary elements spanning bands of the considered parameter space, one may efficiently find and discard large parts of the parameter space not active in the signal. After each iteration, the zero-valued parts of the dictionary may be discarded to allow a refined dictionary to be formed around the active elements, resulting in a zoomed dictionary to be used in the following iterations. Implementing this scheme allows for more accurate estimates, at a much lower computational cost, as compared to directly forming a larger dictionary spanning the whole parameter space or performing a zooming procedure using standard dictionary elements. Different from traditional dictionaries, the wideband dictionary allows for the use of dictionaries with fewer elements than the number of available samples without loss of resolution. The technique may be used on both one- and multi-dimensional signals, and may be exploited to refine several traditional sparse estimators, here illustrated with the LASSO and the SPICE estimators. Numerical examples illustrate the improved performance.

In this work, we extend the sparse iterative covariance-based estimator (SPICE), by generalizing the formulation to allow for different norm constraints on the signal and noise parameters in the covariance model. For a given norm, the resulting extended SPICE method enjoys the same benefits as the regular SPICE method, including being hyper-parameter free, although the choice of norms are shown to govern the sparsity in the resulting solution. Furthermore, we show that solving the extended SPICE method is equivalent to solving a penalized regression problem, which provides an alternative interpretation of the proposed method and a deeper insight on the differences in sparsity between the extended and the original SPICE formulation. We examine the performance of the method for different choices of norms, and compare the results to the original SPICE method, showing the benefits of using the extended formulation. We also provide two ways of solving the extended SPICE method; one grid-based method, for which an efficient implementation is given, and a gridless method for the sinusoidal case, which results in a semi-definite programming problem.