Flexible component analysis for sparse, smooth, nonnegative coding or representation

20Citations
Citations of this article
26Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In the paper, we present a new approach to multi-way Blind Source Separation (BSS) and corresponding 3D tensor factorization that has many potential applications in neuroscience and multi-sensory or multidimensional data analysis, and neural sparse coding. We propose to use a set of local cost functions with flexible penalty and regularization terms whose simultaneous or sequential (one by one) minimization via a projected gradient technique leads to simple Hebbian-like local algorithms that work well not only for an over-determined case but also (under some weak conditions) for an under-determined case (i.e., a system which has less sensors than sources). The experimental results confirm the validity and high performance of the developed algorithms, especially with usage of the multi-layer hierarchical approach. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Cichocki, A., Phan, A. H., Zdunek, R., & Zhang, L. Q. (2008). Flexible component analysis for sparse, smooth, nonnegative coding or representation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4984 LNCS, pp. 811–820). https://doi.org/10.1007/978-3-540-69158-7_84

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free