arXiv subjects

Zbyněk Koldovský

Publications and source records attributed to Zbyněk Koldovský.

16 recordsLinked to original sources

arXiv2026

Robust Online Overdetermined Independent Vector Analysis Based on Bilinear Decomposition

Online blind source separation is essential for both speech communication and human-machine interaction. Among existing approaches, overdetermined independent vector analysis (OverIVA) delivers strong performance by exploiting the statistical independence of source signals and the orthogonality between source and noise subspaces. However, when applied to large microphone arrays, the number of parameters grows rapidly, which can degrade online estimation accuracy. To overcome this challenge, we propose decomposing each long separation filter into a bilinear form of two shorter filters, thereby reducing the number of parameters. Because the two filters are closely coupled, we design an alternating iterative projection algorithm to update them in turn. Simulation results show that, with far fewer parameters, the proposed method achieves improved performance and robustness.

eess.AS↗

arXiv2025

Blind Capon Beamformer Based on Independent Component Extraction: Single-Parameter Algorithm,

We consider a phase-shift mixing model for linear sensor arrays in the context of blind source extraction. We derive a blind Capon beamformer that seeks the direction where the output is independent of the other signals in the mixture. The algorithm is based on Independent Component Extraction and imposes an orthogonal constraint, thanks to which it optimizes only one real-valued parameter related to the angle of arrival. The Cramér-Rao lower bound for the mean interference-to-signal ratio is derived. The algorithm and the bound are compared with conventional blind and direction-of-arrival estimation+beamforming methods, showing improvements in terms of extraction accuracy. An application is demonstrated in frequency-domain speaker extraction in a low-reverberation room.

eess.SP↗

arXiv2024

Informed FastICA: Semi-Blind Minimum Variance Distortionless Beamformer

Non-Gaussianity-based Independent Vector Extraction leads to the famous one-unit FastICA/FastIVA algorithm when the likelihood function is optimized using an approximate Newton-Raphson algorithm under the orthogonality constraint. In this paper, we replace the constraint with the analytic form of the minimum variance distortionless beamformer (MVDR), by which a semi-blind variant of FastICA/FastIVA is obtained. The side information here is provided by a weighted covariance matrix replacing the noise covariance matrix, the estimation of which is a frequent goal of neural beamformers. The algorithm thus provides an intuitive connection between model-based blind extraction and learning-based extraction. The algorithm is tested in simulations and speaker ID-guided speaker extraction, showing fast convergence and promising performance.

eess.SP↗

arXiv2024

Comparison of Frequency-Fusion Mechanisms for Binaural Direction-of-Arrival Estimation for Multiple Speakers

To estimate the direction of arrival (DOA) of multiple speakers with methods that use prototype transfer functions, frequency-dependent spatial spectra (SPS) are usually constructed. To make the DOA estimation robust, SPS from different frequencies can be combined. According to how the SPS are combined, frequency fusion mechanisms are categorized into narrowband, broadband, or speaker-grouped, where the latter mechanism requires a speaker-wise grouping of frequencies. For a binaural hearing aid setup, in this paper we propose an interaural time difference (ITD)-based speaker-grouped frequency fusion mechanism. By exploiting the DOA dependence of ITDs, frequencies can be grouped according to a common ITD and be used for DOA estimation of the respective speaker. We apply the proposed ITD-based speaker-grouped frequency fusion mechanism for different DOA estimation methods, namely the multiple signal classification, steered response power and a recently published method based on relative transfer function (RTF) vectors. In our experiments, we compare DOA estimation with different fusion mechanisms. For all considered DOA estimation methods, the proposed ITD-based speaker-grouped frequency fusion mechanism results in a higher DOA estimation accuracy compared with the narrowband and broadband fusion mechanisms.

eess.AS↗

arXiv2023

Independent Vector Extraction Constrained on Manifold of Half-Length Filters

Independent Vector Analysis (IVA) is a popular extension of Independent Component Analysis (ICA) for joint separation of a set of instantaneous linear mixtures, with a direct application in frequency-domain speaker separation or extraction. The mixtures are parameterized by mixing matrices, one matrix per mixture. This means that the IVA mixing model does not account for any relationships between parameters across the mixtures/frequencies. The separation proceeds jointly only through the source model, where statistical dependencies of sources across the mixtures are taken into account. In this paper, we propose a mixing model for joint blind source extraction where the mixing model parameters are linked across the frequencies. This is achieved by constraining the set of feasible parameters to the manifold of half-length separating filters, which has a clear interpretation and application in frequency-domain speaker extraction.

eess.AS↗

arXiv2022

Dynamic Independent Component Extraction with Blending Mixing Vector: Lower Bound on Mean Interference-to-Signal Ratio

This paper deals with dynamic Blind Source Extraction (BSE) from where the mixing parameters characterizing the position of a source of interest (SOI) are allowed to vary over time. We present a new source extraction model called CvxCSV which is a parameter-reduced modification of the recent Constant Separation Vector (CSV) mixing model. In CvxCSV, the mixing vector evolves as a convex combination of its initial and final values. We derive a lower bound on the achievable mean interference-to-signal ratio (ISR) based on the Cramér-Rao theory. The bound reveals advantageous properties of CvxCSV compared with CSV and compared with a sequential BSE based on independent component extraction (ICE). In particular, the achievable ISR by CvxCSV is lower than that by the previous approaches. Moreover, the model requires significantly weaker conditions for identifiability, even when the SOI is Gaussian.

eess.SP↗

arXiv2022

Joint Acoustic Echo Cancellation and Blind Source Extraction based on Independent Vector Extraction

We describe a joint acoustic echo cancellation (AEC) and blind source extraction (BSE) approach for multi-microphone acoustic frontends. The proposed algorithm blindly estimates AEC and beamforming filters by maximizing the statistical independence of a non-Gaussian source of interest and a stationary Gaussian background modeling interfering signals and residual echo. Double talk-robust and fast-converging parameter updates are derived from a global maximum-likelihood objective function resulting in a computationally efficient Newton-type update rule. Evaluation with simulated acoustic data confirms the benefit of the proposed joint AEC and beamforming filter estimation in comparison to updating both filters individually.

eess.AS↗

arXiv2022

Double Nonstationarity: Blind Extraction of Independent Nonstationary Vector/Component from Nonstationary Mixtures -- Algorithms

In this article, nonstationary mixing and source models are combined for developing new fast and accurate algorithms for Independent Component or Vector Extraction (ICE/IVE), one of which stands for a new extension of the well-known FastICA. This model allows for a moving source-of-interest (SOI) whose distribution on short intervals can be (non-)circular (non-)Gaussian. A particular Gaussian source model assuming tridiagonal covariance matrix structures is proposed. It is shown to be beneficial in the frequency-domain speaker extraction problem. The algorithms are verified in simulations. In comparison to the state-of-the-art algorithms, they show superior performance in terms of convergence speed and extraction accuracy.

eess.SP↗

arXiv2021

Algorithm for Independent Vector Extraction Based on Semi-Time-Variant Mixing Model

A new algorithm for dynamic independent vector extraction is proposed. It is based on the mixing model where mixing parameters related to the source-of-interest (SOI) are time-variant while the separating parameters are time-invariant. A contrast function based on the quasi-likelihood approach is optimized using the Newton-Raphson approach. The update is computed without imposing the orthogonal constraint, and the orthogonality is enforced afterward. This yields an algorithm that is significantly faster than gradient-based algorithms while different from fixed-point methods, which are even faster. We show advantageous properties of the proposed algorithm compared to the fixed-point methods in an on-line processing regime where stable convergence to the SOI is the important issue. The effectiveness of the method is demonstrated in a speech extraction experiment with a dense microphone array.

eess.SP↗

arXiv2021

Auxiliary Function-Based Algorithm for Blind Extraction of a Moving Speaker

Recently, Constant Separating Vector (CSV) mixing model has been proposed for the Blind Source Extraction (BSE) of moving sources. In this paper, we experimentally verify the applicability of CSV in the blind extraction of a moving speaker and propose a new BSE method derived by modifying the auxiliary function-based algorithm for Independent Vector Analysis. Also, a piloted variant is proposed for the method with partially controllable global convergence. The methods are verified under reverberant and noisy conditions using {\color{red} simulated as well as real-world acoustic conditions}. They are also verified within the CHiME-4 speech separation and recognition challenge. The experiments corroborate the applicability of CSV as well as the improved convergence of the proposed algorithms.

eess.AS↗

arXiv2021

Dynamic Independent Component/Vector Analysis: Time-Variant Linear Mixtures Separable by Time-Invariant Beamformers

A novel extension of Independent Component and Independent Vector Analysis for blind extraction/separation of one or several sources from time-varying mixtures is proposed. The mixtures are assumed to be separable source-by-source in series or in parallel based on a recently proposed mixing model that allows for the movements of the desired source while the separating beamformer is time-invariant. The popular FastICA algorithm is extended for these mixtures in one-unit, symmetric and block-deflation variants. The algorithms are derived within a unified framework so that they are applicable in the real-valued as well as complex-valued domains, and jointly to several mixtures, similar to Independent Vector Analysis. Performance analysis of the one-unit algorithm is provided; it shows its asymptotic efficiency under the given mixing and statistical models. Numerical simulations corroborate the validity of the analysis, confirm the usefulness of the algorithms in separation of moving sources, and show the superior speed of convergence and ability to separate super-Gaussian as well as sub-Gaussian signals.

eess.SP↗

arXiv2019

Adaptive blind audio source extraction supervised by dominant speaker identification using x-vectors

We propose a novel algorithm for adaptive blind audio source extraction. The proposed method is based on independent vector analysis and utilizes the auxiliary function optimization to achieve high convergence speed. The algorithm is partially supervised by a pilot signal related to the source of interest (SOI), which ensures that the method correctly extracts the utterance of the desired speaker. The pilot is based on the identification of a dominant speaker in the mixture using x-vectors. The properties of the x-vectors computed in the presence of cross-talk are experimentally analyzed. The proposed approach is verified in a scenario with a moving SOI, static interfering speaker, and environmental noise.

eess.AS↗

arXiv2019

MIRaGe: Multichannel Database Of Room Impulse Responses Measured On High-Resolution Cube-Shaped Grid In Multiple Acoustic Conditions

We introduce a database of multi-channel recordings performed in an acoustic lab with adjustable reverberation time. The recordings provide information about room impulse responses (RIR) for various positions of a loudspeaker. In particular, the main positions correspond to 4104 vertices of a cube-shaped dense grid within a 46x36x32 cm volume. The database thus provides a tool for detailed analyses of beampatterns of spatial processing methods as well as for training and testing of mathematical models of the acoustic field.

eess.AS↗

arXiv2019

Cramér-Rao Bounds for Complex-Valued Independent Component Extraction: Determined and Piecewise Determined Mixing Models

This paper presents Cramér-Rao Lower Bound (CRLB) for the complex-valued Blind Source Extraction (BSE) problem based on the assumption that the target signal is independent of the other signals. Two instantaneous mixing models are considered. First, we consider the standard determined mixing model used in Independent Component Analysis (ICA) where the mixing matrix is square and non-singular and the number of the latent sources is the same as that of the observed signals. The CRLB for Independent Component Extraction (ICE) where the mixing matrix is re-parameterized in order to extract only one independent target source is computed. The target source is assumed to be non-Gaussian or non-circular Gaussian while the other signals (background) are circular Gaussian or non-Gaussian. The results confirm some previous observations known for the real domain and bring new results for the complex domain. Also, the CRLB for ICE is shown to coincide with that for ICA when the non-Gaussianity of background is taken into account. %unless the assumed sources' distributions are misspecified. Second, we extend the CRLB analysis to piecewise determined mixing models. Here, the observed signals are assumed to obey the determined mixing model within short blocks where the mixing matrices can be varying from block to block. However, either the mixing vector or the separating vector corresponding to the target source is assumed to be constant across the blocks. The CRLBs for the parameters of these models bring new performance bounds for the BSE problem.

math.ST↗

arXiv2018

Gradient Algorithms for Complex Non-Gaussian Independent Component/Vector Extraction, Question of Convergence

We revise the problem of extracting one independent component from an instantaneous linear mixture of signals. The mixing matrix is parameterized by two vectors, one column of the mixing matrix and one row of the de-mixing matrix. The separation is based on the non-Gaussianity of the source of interest, while the other background signals are assumed to be Gaussian. Three gradient-based estimation algorithms are derived using the maximum likelihood principle and are compared with the Natural Gradient algorithm for Independent Component Analysis and with One-unit FastICA based on negentropy maximization. The ideas and algorithms are also generalized for the extraction of a vector component when the extraction proceeds jointly from a set of instantaneous mixtures. Throughout the paper, we address the problem of the size of the region of convergence for which the algorithms guarantee the extraction of the desired source. We show how that size is influenced by the ratio of powers of the sources within the mixture. Simulations confirm this observation where several algorithms are compared. They show various convergence behavior in a scenario where the source of interest is dominant or weak. Here, our proposed modifications of the gradient methods taking into account the dominance/weakness of the source show improved global convergence property.

eess.SP↗

arXiv2017

Performance Analysis of Source Image Estimators in Blind Source Separation

Blind methods often separate or identify signals or signal subspaces up to an unknown scaling factor. Sometimes it is necessary to cope with the scaling ambiguity, which can be done through reconstructing signals as they are received by sensors, because scales of the sensor responses (images) have known physical interpretations. In this paper, we analyze two approaches that are widely used for computing the sensor responses, especially, in Frequency-Domain Independent Component Analysis. One approach is the least-squares projection, while the other one assumes a regular mixing matrix and computes its inverse. Both estimators are invariant to the unknown scaling. Although frequently used, their differences were not studied yet. A goal of this work is to fill this gap. The estimators are compared through a theoretical study, perturbation analysis and simulations. We point to the fact that the estimators are equivalent when the separated signal subspaces are orthogonal, and vice versa. Two applications are shown, one of which demonstrates a case where the estimators yield substantially different results.

cs.SD↗