Sciweavers

238 search results - page 19 / 48
» A Constraint Learning Algorithm for Blind Source Separation
Sort
View
IJON
2008
92views more  IJON 2008»
13 years 9 months ago
Nonnegative matrix factorization with quadratic programming
Nonnegative Matrix Factorization (NMF) solves the following problem: find such nonnegative matrices A RI
Rafal Zdunek, Andrzej Cichocki
ICA
2004
Springer
14 years 2 months ago
Blind Maximum Likelihood Separation of a Linear-Quadratic Mixture
Abstract. We proposed recently a new method for separating linearquadratic mixtures of independent real sources, based on parametric identification of a recurrent separating struc...
Shahram Hosseini, Yannick Deville
SIP
2003
13 years 10 months ago
Time Domain Optimization Techniques for Blind Separation of Non-stationary Convolutive Mixed Signals
This paper aims to solve the problem of Blind Signal Separation (BSS) in a convolutive environment based on output correlation matrix diagonalization. Firstly an extension of the ...
Iain Russell, Alfred Mertins, Jiangtao Xi
ICA
2007
Springer
14 years 3 months ago
Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization
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) ...
Andrzej Cichocki, Rafal Zdunek, Shun-ichi Amari
ESANN
2006
13 years 10 months ago
A simple idea to separate convolutive mixtures in an undetermined scenario
We consider a blind separation problem for undetermined mixtures of two BPSK signals in a multi-path fading channel. We use independence and frequency diversity of the two source s...
Maciej Pedzisz, Ali Mansour