Abstract—We present in this paper a non-orthogonal algo-rithm for the approximate joint diagonalization of a set of matrices. It is an iterative algorithm, using relaxation technique applied on the rows of the diagonalizer. The performances of our algorithm are compared with usual standard algorithms using blind sources separation simulations results. We show that the improvement in estimating the separating matrix can be wreaked when the level noise in the mixture is significant, the length of observed sequences is sufficiently large and when the mixing matrix is not an orthogonal matrix or just about. I
A fast algorithm, named Complex-Valued Fast Frobenius DIAGonalization (CVFFDIAG), is proposed for se...
International audienceWe consider in this work the problem of joint block diagonalization of a set o...
We present an efficient algorithm for the blind signal separation (BSS) problem with convolutive sig...
International audienceA comparative study of approximate joint diagonalization algorithms of a set o...
The problem of blind source separation (BSS) using joint diagonalization of a set of non-unitary eig...
A new efficient algorithm is presented for joint diagonalization of several matrices. The algorithm ...
The problem of blind separation of complex-valued signals via joint diagonalization of a set of non-...
This paper addresses the blind signal separation problem in the presence of sensor noise for the cas...
Joint diagonalization of several correlation matrices is a powerful tool for blind signal separation...
In this paper we present a new method for separating non-stationary sources from their convolutive m...
In Blind Source Separation problems it is assumed that the approximate diagonalization of a matrix ...
This article addresses the problem of blind source separation, in which the source signals are most ...
Abstract—We identify and explain a bias-variance dilemma which exists in the problem of approximate ...
International audienceThis article addresses the problem of the Non Unitary Joint Block Diagonalizat...
International audienceThis article addresses the problem of the Non Unitary Joint Block Diagonalizat...
A fast algorithm, named Complex-Valued Fast Frobenius DIAGonalization (CVFFDIAG), is proposed for se...
International audienceWe consider in this work the problem of joint block diagonalization of a set o...
We present an efficient algorithm for the blind signal separation (BSS) problem with convolutive sig...
International audienceA comparative study of approximate joint diagonalization algorithms of a set o...
The problem of blind source separation (BSS) using joint diagonalization of a set of non-unitary eig...
A new efficient algorithm is presented for joint diagonalization of several matrices. The algorithm ...
The problem of blind separation of complex-valued signals via joint diagonalization of a set of non-...
This paper addresses the blind signal separation problem in the presence of sensor noise for the cas...
Joint diagonalization of several correlation matrices is a powerful tool for blind signal separation...
In this paper we present a new method for separating non-stationary sources from their convolutive m...
In Blind Source Separation problems it is assumed that the approximate diagonalization of a matrix ...
This article addresses the problem of blind source separation, in which the source signals are most ...
Abstract—We identify and explain a bias-variance dilemma which exists in the problem of approximate ...
International audienceThis article addresses the problem of the Non Unitary Joint Block Diagonalizat...
International audienceThis article addresses the problem of the Non Unitary Joint Block Diagonalizat...
A fast algorithm, named Complex-Valued Fast Frobenius DIAGonalization (CVFFDIAG), is proposed for se...
International audienceWe consider in this work the problem of joint block diagonalization of a set o...
We present an efficient algorithm for the blind signal separation (BSS) problem with convolutive sig...