Search the dblp DataBase

Publications of Author

1. Massoud Babaie-Zadeh, Christian Jutten
   Semi-Blind Approaches for Source Separation and Independent component Analysis. [Citation Graph (0, 0)][DBLP]
   ESANN, 2006, pp:301-312 [Conf]
   
2. Massoud Babaie-Zadeh, Ali Mansour, Christian Jutten, Farrokh Marvasti
   A Geometric Approach for Separating Several Speech Signals. [Citation Graph (0, 0)][DBLP]
   ICA, 2004, pp:798-806 [Conf]
   
3. Samareh Samadi, Massoud Babaie-Zadeh, Christian Jutten, Kambiz Nayebi
   Blind Source Separation by Adaptive Estimation of Score Function Difference. [Citation Graph (0, 0)][DBLP]
   ICA, 2004, pp:9-17 [Conf]
   
4. Massoud Babaie-Zadeh, Christian Jutten, Kambiz Nayebi
   Separating Convolutive Mixtures by Mutual Information Minimization. [Citation Graph (0, 0)][DBLP]
   IWANN (2), 2001, pp:834-842 [Conf]
   
5. Massoud Babaie-Zadeh, Christian Jutten, Ali Mansour
   Sparse ICA via cluster-wise PCA. [Citation Graph (0, 0)][DBLP]
   Neurocomputing, 2006, v:69, n:13-15, pp:1458-1466 [Journal]
   
6. Samareh Samadi, Massoud Babaie-Zadeh, Christian Jutten
   Quasi-optimal EASI algorithm based on the Score Function Difference (SFD). [Citation Graph (0, 0)][DBLP]
   Neurocomputing, 2006, v:69, n:13-15, pp:1415-1424 [Journal]
   
7. Christian Jutten, Massoud Babaie-Zadeh, Shahram Hosseini
   Three easy ways for separating nonlinear mixtures? [Citation Graph (0, 0)][DBLP]
   Signal Processing, 2004, v:84, n:2, pp:217-229 [Journal]
   
8. Massoud Babaie-Zadeh, Christian Jutten
   A general approach for mutual information minimization and its application to blind source separation. [Citation Graph (0, 0)][DBLP]
   Signal Processing, 2005, v:85, n:5, pp:975-995 [Journal]
   
9. 
   k/K-Nearest Neighborhood Criterion for Improving Locally Linear Embedding. [Citation Graph (, )][DBLP]
   
   
10. 
    Two Dimensional Compressive Classifier for Sparse Images. [Citation Graph (, )][DBLP]
    
    
11. 
    k/K-Nearest Neighborhood Criterion for Improvement of Locally Linear Embedding. [Citation Graph (, )][DBLP]
    
    
12. 
    Fast Sparse Representation Based on Smoothed l⁰ Norm. [Citation Graph (, )][DBLP]
    
    
13. 
    Fast Block-Sparse Decomposition Based on SL0. [Citation Graph (, )][DBLP]
    
    
14. 
    Sparse Component Analysis in Presence of Noise Using an Iterative EM-MAP Algorithm. [Citation Graph (, )][DBLP]
    
    
15. 
    Estimating the Mixing Matrix in Sparse Component Analysis Based on Converting a Multiple Dominant to a Single Dominant Problem. [Citation Graph (, )][DBLP]
    
    
16. 
    An Alternating Minimization Method for Sparse Channel Estimation. [Citation Graph (, )][DBLP]
    
    
17. 
    Adaptive and Non-adaptive ISI Sparse Channel Estimation Based on SL0 and Its Application in ML Sequence-by-Sequence Equalization. [Citation Graph (, )][DBLP]
    
    
18. 
    Using Non-Negative Matrix Factorization for Removing Show-Through. [Citation Graph (, )][DBLP]
    
    
19. 
    Two dimensional compressive classifier for sparse images. [Citation Graph (, )][DBLP]
    
    
20. 
    Image Coding and Compression with Sparse 3D Discrete Cosine Transform. [Citation Graph (, )][DBLP]
    
    
21. 
    Image Denoising Using Sparse Representations. [Citation Graph (, )][DBLP]
    
    
22. 
    A first step to convolutive sparse representation. [Citation Graph (, )][DBLP]
    
    
23. 
    Decoding real-field codes by an iterative Expectation-Maximization (EM) algorithm. [Citation Graph (, )][DBLP]
    
    
24. 
    Complex-valued sparse representation based on smoothed l⁰ norm. [Citation Graph (, )][DBLP]
    
    
25. 
    Sparse Decomposition over non-full-rank dictionaries. [Citation Graph (, )][DBLP]
    
    
26. 
    Robust-SL0 for stable sparse representation in noisy settings. [Citation Graph (, )][DBLP]
    
    
27. 
    Thresholded smoothed-l⁰(SL0) dictionary learning for sparse representations. [Citation Graph (, )][DBLP]
    
    
28. 
    Inflating compressed samples: A joint source-channel coding approach for noise-resistant compressed sensing. [Citation Graph (, )][DBLP]
    
    
29. 
    Sparse decomposition of two dimensional signals. [Citation Graph (, )][DBLP]
    
    
30. 
    Bayesian Pursuit algorithm for sparse representation. [Citation Graph (, )][DBLP]
    
    
31. 
    A fast approach for overcomplete sparse decomposition based on smoothed L0 norm [Citation Graph (, )][DBLP]
    
    
32. 
    A First Step to Convolutive Sparse Representation [Citation Graph (, )][DBLP]
    
    
33. 
    Approximate Sparse Decomposition Based on Smoothed L0-Norm [Citation Graph (, )][DBLP]
    
    
34. 
    A New Trend in Optimization on Multi Overcomplete Dictionary toward Inpainting [Citation Graph (, )][DBLP]
    
    
35. 
    Sparse Component Analysis (SCA) in Random-valued and Salt and Pepper Noise Removal [Citation Graph (, )][DBLP]
    
    
36. 
    Sparse Recovery using Smoothed $\ell^0$ (SL0): Convergence Analysis [Citation Graph (, )][DBLP]
    
    
37. 
    Bayesian Cramér-Rao Bound for Noisy Non-Blind and Blind Compressed Sensing [Citation Graph (, )][DBLP]
    
    
38. 
    On the stable recovery of the sparsest overcomplete representations in presence of noise [Citation Graph (, )][DBLP]
    
    
39. 
    On the Achievability of Cramér-Rao Bound In Noisy Compressed Sensing [Citation Graph (, )][DBLP]
    
    
40. 
    Bayesian Hypothesis Testing for Sparse Representation [Citation Graph (, )][DBLP]