scispace - formally typeset
Search or ask a question
Conference

International Conference on Independent Component Analysis and Signal Separation 

About: International Conference on Independent Component Analysis and Signal Separation is an academic conference. The conference publishes majorly in the area(s): Independent component analysis & Blind signal separation. Over the lifetime, 477 publications have been published by the conference receiving 7868 citations.

Papers published on a yearly basis

Papers
More filters
Book ChapterDOI
05 Mar 2006
TL;DR: A wide class of loss (cost) functions for non-negative matrix factorization (NMF) are discus and several novel algorithms with improved efficiency and robustness to noise and outliers are derived and applied to blind (or semi blind) source separation.
Abstract: In this paper we discus a wide class of loss (cost) functions for non-negative matrix factorization (NMF) and derive several novel algorithms with improved efficiency and robustness to noise and outliers. We review several approaches which allow us to obtain generalized forms of multiplicative NMF algorithms and unify some existing algorithms. We give also the flexible and relaxed form of the NMF algorithms to increase convergence speed and impose some desired constraints such as sparsity and smoothness of components. Moreover, the effects of various regularization terms and constraints are clearly shown. The scope of these results is vast since the proposed generalized divergence functions include quite large number of useful loss functions such as the squared Euclidean distance,Kulback-Leibler divergence, Itakura-Saito, Hellinger, Pearson’s chi-square, and Neyman’s chi-square distances, etc. We have applied successfully the developed algorithms to blind (or semi blind) source separation (BSS) where sources can be generally statistically dependent, however they satisfy some other conditions or additional constraints such as nonnegativity, sparsity and/or smoothness.

313 citations

Book ChapterDOI
09 Sep 2007
TL;DR: This paper proposes to use local cost functions whose simultaneous or sequential (one by one) minimization leads to a very simple ALS algorithm which works under some sparsity constraints both for an under-determined and overdetermined model.
Abstract: In the paper we present new Alternating Least Squares (ALS) algorithms for Nonnegative Matrix Factorization (NMF) and their extensions to 3D Nonnegative Tensor Factorization (NTF) that are robust in the presence of noise and have many potential applications, including multi-way Blind Source Separation (BSS), multi-sensory or multi-dimensional data analysis, and nonnegative neural sparse coding. We propose to use local cost functions whose simultaneous or sequential (one by one) minimization leads to a very simple ALS algorithm which works under some sparsity constraints both for an under-determined (a system which has less sensors than sources) and overdetermined model. The extensive experimental results confirm the validity and high performance of the developed algorithms, especially with usage of the multi-layer hierarchical NMF. Extension of the proposed algorithm to multidimensional Sparse Component Analysis and Smooth Component Analysis is also proposed.

297 citations

Book ChapterDOI
22 Sep 2004
TL;DR: In this article, an extension to the non-negative matrix factorization (NNMF) algorithm is presented, which is capable of identifying components with temporal structure and is used to extract multiple sound objects from a single channel auditory scene.
Abstract: In this paper we present an extension to the Non-Negative Matrix Factorization algorithm which is capable of identifying components with temporal structure. We demonstrate the use of this algorithm in the magnitude spectrum domain, where we employ it to perform extraction of multiple sound objects from a single channel auditory scene.

293 citations

Book ChapterDOI
09 Sep 2007
TL;DR: A sparse latent variable model that can learn sounds based on their distribution of time/ frequency energy is presented that can be used to extract known types of sounds from mixtures in two scenarios.
Abstract: In this paper we describe a methodology for model-based single channel separation of sounds. We present a sparse latent variable model that can learn sounds based on their distribution of time/ frequency energy. This model can then be used to extract known types of sounds from mixtures in two scenarios. One being the case where all sound types in the mixture are known, and the other being being the case where only the target or the interference models are known. The model we propose has close ties to non-negative decompositions and latent variable models commonly used for semantic analysis.

290 citations

Book ChapterDOI
05 Mar 2006
TL;DR: This paper solves an ICA problem where both source and observation signals are multivariate, thus, vectorized signals and proposes the frequency domain blind source separation (BSS) for convolutive mixtures as an application of IVA.
Abstract: In this paper, we solve an ICA problem where both source and observation signals are multivariate, thus, vectorized signals. To derive the algorithm, we define dependence between vectors as Kullback-Leibler divergence between joint probability and the product of marginal probabilities, and propose a vector density model that has a variance dependency within a source vector. The example shows that the algorithm successfully recovers the sources and it does not cause any permutation ambiguities within the sources. Finally, we propose the frequency domain blind source separation (BSS) for convolutive mixtures as an application of IVA, which separates 6 speeches with 6 microphones in a reverberant room environment.

264 citations

Performance
Metrics
No. of papers from the Conference in previous years
YearPapers
200997
2007105
2006119
20051
2004155