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

Reverberation is well-known to have a detrimental impact on many localization methods for audio sources. We address this problem by imposing a model for the early reflections as well as a model for the audio source itself. Using these models, we propose two iterative localization methods that estimate the direction-of-arrival (DOA) of both the direct path of the audio source and the early reflections.

In this work, we consider enhancement of multichannel speech recordings. Linear filtering and subspace approaches have been considered previously for solving the problem. The current linear filtering methods, although many variants exist, have limited control of noise reduction and speech distortion. Subspace approaches, on the other hand, can potentially yield better control by filtering in the eigen-domain, but traditionally these approaches have not been optimized explicitly for traditional noise reduction and signal distortion measures.

We consider the problem of selecting optimal sensor placements. The proposed approach is based on the sampling theorem of graph signals. We choose sensors that maximize the graph cut-off frequency, i.e., the most informative sensors for predicting the values on unselected sensors. We study the existing methods in the context of graph signal processing and clarify the relationship between these methods and the proposed approach. The effectiveness of our approach is verified through numerical experiments, showing advantages in prediction error and execution time.

This work proposes two methods for providing speech privacy between spatial zones in anechoic and reverberant environments. The methods are based on masking the content leaked between regions. The masking is optimised to maximise the speech intelligibility contrast (SIC) between the zones. The first method uses a uniform masker signal that is combined with desired multizone loudspeaker signals and requires acoustic contrast between zones.

We present an extension of recent semidefinite programming formulations for atomic decomposition over continuous dictionaries, with applications to continuous or 'gridless' compressed sensing. The dictionary considered in this paper is defined in terms of a general matrix pencil and is parameterized by a complex variable that varies over a segment of a line or circle in the complex plane. The main result of the paper is the formulation as a convex semidefinite optimization problem, and a simple constructive proof of the equivalence.