Robert Aichner

Robert Aichner

Auto-generated profile, based on publicly available information

Robert Aichner

University of Erlangen-Nuremberg

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2004
Verified
Book Chapter
Closed access
PDF file
HBHerbert Buchner
Herbert Buchner
RARobert Aichner
Robert Aichner
WKWalter Kellermann
Walter Kellermann

21 October 2005 in Signal Processing
Verified
Journal Article
Closed access
RARobert Aichner
Robert Aichner
HBHerbert Buchner
Herbert Buchner
FYFei Yan
Fei Yan
WKWalter Kellermann
Walter Kellermann


1 January 2007
Verified
Conference Paper
Closed access
RARobert Aichner
Robert Aichner
HBHerbert Buchner
Herbert Buchner
MZMeray Zourub
Meray Zourub
WKWalter Kellermann
Walter Kellermann
In this paper we propose two novel methods for preserving the spatial information in source separation algorithms. Our approach is applicable to any source separation algorithm and is based on an additional supervised adaptive filtering with the reference signals generated by the source separation system. If a special constrained optimization scheme is applied to derive the source separation algorithm then the novel approach can be simplified. The quality of the spatial representation and the separation performance of both methods and two state-of-the-art approaches from the literature have been evaluated by a MUSHRA listening test according to the relevant ITU recommendation showing that the novel methods clearly outperform the state-of-the-art approaches.

12 September 2006 in EURASIP Journal on Advances in Signal Processing
Verified
Journal Article
Open access
PDF file
RARobert Aichner
Robert Aichner
HBHerbert Buchner
Herbert Buchner
WKWalter Kellermann
Walter Kellermann
Based on a recently presented generic broadband blind source separation (BSS) algorithm for convolutive mixtures, we propose in this paper a novel algorithm combining advantages of broadband algorithms with the computational efficiency of narrowband techniques. By selective application of the Szegö theorem which relates properties of Toeplitz and circulant matrices, a new normalization is derived as a special case of the generic broadband algorithm. This results in a computationally efficient and fast converging algorithm without introducing typical narrowband problems such as the internal permutation problem or circularity effects. Moreover, a novel regularization method for the generic broadband algorithm is proposed and subsequently also derived for the proposed algorithm. Experimental results in realistic acoustic environments show improved performance of the novel algorithm compared to previous approximations.