Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Tony Gustafsson

dblp:86/7160 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 2003
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 4 · 3 first-authorArtificial intelligence and machine learning · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Audio and music processing · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Audio and music processing › room acoustics
reverberant environment
0.012003
Source localization in reverberant environments: modeling and statistical analysis · IEEE Trans. Speech Audio Process. 2003
Audio and music processing
sound source localization
0.012003
Source localization in reverberant environments: modeling and statistical analysis · IEEE Trans. Speech Audio Process. 2003
Audio and music processing
room acoustics
0.012003
Source localization in reverberant environments: modeling and statistical analysis · IEEE Trans. Speech Audio Process. 2003
Audio and music processing › room acoustics
room transfer function modeling
0.012003
Source localization in reverberant environments: modeling and statistical analysis · IEEE Trans. Speech Audio Process. 2003

Methods — techniques the papers use, named apart from their topics

statistical modeling · 0.0image method · 0.0PHAT time-delay estimation · 0.0
YearPublicationVenuePosition
2003 Source localization in reverberant environments: modeling and statistical analysis
abstract
Room reverberation is typically the main obstacle for designing robust microphone-based source localization systems. The purpose of the paper is to analyze the achievable performance of acoustical source localization methods when room reverberation is present. To facilitate the analysis, we apply well known results from room acoustics to develop a simple but useful statistical model for the room transfer function. The properties of the statistical model are found to correlate well with results from real data measurements. The room transfer function model is further applied to analyze the statistical properties of some existing methods for source localization. In this respect we consider especially the asymptotic error variance and the probability of an anomalous estimate. A noteworthy outcome of the analysis is that the so-called PHAT time-delay estimator is shown to be optimal among a class of cross-correlation based time-delay estimators. To verify our results on the error variance and the outlier probability we apply the image method for simulation of the room transfer function.
Tony Gustafsson, Bhaskar D. Rao, Mohan M. Trivedi
IEEE Trans. Speech Audio Process.1
2002 Analysis of time-delay estimation in reverberant environments
abstract
The main obstacle for designing robust microphone-based source localization systems is the effects of room reverberation. Utilizing results from statistical room acoustics, we analyze the performance of GCC-based methods for time-delay estimation. An interesting outcome of the analysis is that the so-called PHAT time-delay estimator is shown to be optimal among a class of cross-correlation based time-delay estimators.
Tony Gustafsson, Bhaskar D. Rao, Mohan M. Trivedi
ICASSP1
2000 Statistical analysis of a signal separation method based on second order statistics
abstract
This paper explores an existing method for signal separation, which is based on second order statistics. Here, statistical analysis of a generalized version of the original algorithm is given. The generalized method includes a weighting matrix, and a result of the statistical analysis is that the best possible weighting is found. The problem of initialization of the involved non-linear optimization is also discussed.
Tony Gustafsson, Ulf A. Lindgren, Henrik Sahlin
ICASSP1
1999 Non-linear instantaneous least squares and its high SNR analysis
abstract
A novel approach for signal parameter estimation, named the non-linear instantaneous least squares (NILS) estimator, is proposed and a high SNR statistical analysis of the estimates is presented. The algorithm is generally applicable to deterministic signal in noise models. However, it is of particular interest in applications where the "conventional" non-linear least squares criterion suffers from numerous local minima. The key idea here is to apply a sliding window to estimate the instantaneous amplitude, which is then used in a separable least squares criterion-function. Hereby the radius of attraction of the global minimum is under the control of the user, which makes the NILS approach advantageous to use in practical applications. Numerical results using polynomial-phase signals validate the theoretical results.
Jakob Ängeby, Mats Viberg, Tony Gustafsson
ICASSP3
1998 An instrumental variable based subspace tracking algorithm based on subspace averaging
abstract
In this paper an instrumental variable based subspace tracking algorithm is proposed. The basic idea of the algorithm is to reduce the amount of computations using a certain perturbation/approximation strategy. The complexity is reduced to O(mn/sup 2/), which should be compared to O(ml/sup 2/) for the SVD, where m, l/spl Gt/n in general (m denotes the number of sensors, l denotes the number of instruments, and n denotes the number of signals). The proposed algorithm turns out to be related to Karasalo's subspace averaging approach (1986). In a series of simulations we demonstrate that the detection, stationary estimation, and tracking performance of the proposed algorithm is essentially equivalent to that achieved by the truncated SVD.
Tony Gustafsson
ICASSP1