pith. sign in

arxiv: 1704.08953 · v3 · pith:GWVTMSADnew · submitted 2017-04-28 · 💻 cs.SD

Design of robust two-dimensional polynomial beamformers as a convex optimization problem with application to robot audition

classification 💻 cs.SD
keywords beamformerdesignpolynomialrobusttwo-dimensionaloptimizationproblemproposed
0
0 comments X
read the original abstract

We propose a robust two-dimensional polynomial beamformer design method, formulated as a convex optimization problem, which allows for flexible steering of a previously proposed data-independent robust beamformer in both azimuth and elevation direction.~As an exemplary application, the proposed two-dimensional polynomial beamformer design is applied to a twelve-element microphone array, integrated into the head of a humanoid robot. To account for the effects of the robot's head on the sound field, measured head-related transfer functions are integrated into the optimization problem as steering vectors. The two-dimensional polynomial beamformer design is evaluated using signal-independent and signal-dependent measures. The results confirm that the proposed polynomial beamformer design approximates the original fixed beamformer design very accurately, which makes it an attractive approach for robust real-time data-independent beamforming.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.