Blind source separation by sparse decomposition
暂无分享,去创建一个
[1] Ronald R. Coifman,et al. Entropy-based algorithms for best basis selection , 1992, IEEE Trans. Inf. Theory.
[2] Terrence J. Sejnowski,et al. An Information-Maximization Approach to Blind Separation and Blind Deconvolution , 1995, Neural Computation.
[3] Michael Zibulevsky,et al. Penalty/Barrier Multiplier Methods for Convex Programming Problems , 1997, SIAM J. Optim..
[4] Michael A. Saunders,et al. Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..
[5] Aapo Hyvärinen,et al. Fast and robust fixed-point algorithms for independent component analysis , 1999, IEEE Trans. Neural Networks.
[6] Bruno A. Olshausen,et al. PROBABILISTIC FRAMEWORK FOR THE ADAPTATION AND COMPARISON OF IMAGE CODES , 1999 .
[7] Jean-Franois Cardoso. High-Order Contrasts for Independent Component Analysis , 1999, Neural Computation.
[8] Terrence J. Sejnowski,et al. Blind source separation of more sources than mixtures using overcomplete representations , 1999, IEEE Signal Processing Letters.
[9] Terrence J. Sejnowski,et al. Learning Overcomplete Representations , 2000, Neural Computation.