Loading...
Search for: convolutive-mixture
0.006 seconds

    Separating convolutive mixtures by mutual information minimization

    , Article 6th International Work-Conference on Artificial and Natural Neural Networks, IWANN 2001, Granada, 13 June 2001 through 15 June 2001 ; Volume 2085 LNCS, Issue PART 2 , 2001 , Pages 834-842 ; 03029743 (ISSN); 9783540422372 (ISBN) Babaie Zadeh, M ; Jutten, C ; Nayebi, K ; Sharif University of Technology
    Springer Verlag  2001
    Abstract
    Blind Source Separation (BSS) is a basic problem in signal processing. In this paper, we present a new method for separating convolutive mixtures based on the minimization of the output mutual information. We also introduce the concept of joint score function, and derive its relationship with marginal score function and independence. The new approach for minimizing the mutual information is very efficient, although limited by multivariate distribution estimations. © Springer-Verlag Berlin Heidelberg 2001  

    A new method for separation of speech signals in convolutive mixtures

    , Article 13th European Signal Processing Conference, EUSIPCO 2005, Antalya, 4 September 2005 through 8 September 2005 ; 2005 , Pages 2210-2213 ; 1604238216 (ISBN); 9781604238211 (ISBN) Ferdosizadeh, M ; Babaie Zadeh, M ; Marvasti, F. A ; Sharif University of Technology
    2005
    Abstract
    In this paper, the performance of the gradient method based on Score Function Difference (SFD) in the separation of i.i.d. and periodic signals will be investigated. We will see that this algorithm will separate periodic signals better than i.i.d. ones. By using this experimental result and the fact that voiced frames of speech signals are approximately periodic, a modified algorithm named VDGaradient has been proposed for separation of speech signals in synthetic convolutive mixtures. In this method, voiced frames of speech signal will be used as the input to the gradient method, then the resulting separating system will be applied to separate sources completely  

    Multimodal soft nonnegative matrix go-factorization for convolutive source separation

    , Article IEEE Transactions on Signal Processing ; Volume 65, Issue 12 , 2017 , Pages 3179-3190 ; 1053587X (ISSN) Sedighin, F ; Babaie Zadeh, M ; Rivet, B ; Jutten, C ; Sharif University of Technology
    Abstract
    In this paper, the problem of convolutive source separation via multimodal soft Nonnegative Matrix Co-Factorization (NMCF) is addressed. Different aspects of a phenomenon may be recorded by sensors of different types (e.g., audio and video of human speech), and each of these recorded signals is called a modality. Since the underlying phenomenon of the modalities is the same, they have some similarities. Especially, they usually have similar time changes. It means that changes in one of them usually correspond to changes in the other one. So their active or inactive periods are usually similar. Assuming this similarity, it is expected that the activation coefficient matrices of their... 

    A general approach for mutual information minimization and its application to blind source separation

    , Article Signal Processing ; Volume 85, Issue 5 SPEC. ISS , 2005 , Pages 975-995 ; 01651684 (ISSN) Babaie Zadeh, M ; Jutten, C ; Sharif University of Technology
    Elsevier  2005
    Abstract
    In this paper, a nonparametric "gradient" of the mutual information is first introduced. It is used for showing that mutual information has no local minima. Using the introduced "gradient", two general gradient based approaches for minimizing mutual information in a parametric model are then presented. These approaches are quite general, and principally they can be used in any mutual information minimization problem. In blind source separation, these approaches provide powerful tools for separating any complicated (yet separable) mixing model. In this paper, they are used to develop algorithms for separating four separable mixing models: linear instantaneous, linear convolutive, post...