Greedy alternative for room geometry estimation from acoustic echoes: a subspace-based method

Conference paper (2017)

Authors

Mario Coutino Signal Processing Systems -

Martin Bo Møller Aalborg University, Bang & Olufsen A/S

J.K. Nielsen Aalborg University, Bang & Olufsen A/S

R. Heusdens Signal Processing Systems -

Research Group

Signal Processing Systems () (TU Delft)

Greedy algorithm Room geometry Source localization Acoustic echoes Sorting reflections

More Info

expand_more

To reference this document use:

http://resolver.tudelft.nl/uuid:460e30a5-f228-4d15-b4ca-b8d458f60720

Published Date

2017

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Microelectronics

Research Group

Signal Processing Systems

Abstract

In this paper, we present a greedy subspace method for the acoustic echoes labeling problem, which occurs in applications such as source localization and room geometry estimation. The orthogonal projection into the null space of the microphones position matrix is used to filter and sort all possible combinations of echoes. A greedy strategy, based on the rank constraint of Euclidean distance matrices (EDMs), is used on the sorted subset of echo combinations to extract the feasible combinations. Numerical simulations using room impulse responses (RIRs) from shoe-box shaped rooms show that the method provides improvements in terms of computational complexity and the number of required measurements with respect to a recently published graph-based method.

Files

07952179.pdf

(.pdf | 3.4 Mb)