Georgiev, P. and Pardalos, P. and Theis, Fabian J.
(2005)
*A bilinear algorithm for sparse representations.*
Computational optimization and applications.

Full text not available from this repository.

## Abstract

We consider the following sparse representation problem: represent a given matrix X∈ℝ m×N as a multiplication X=AS of two matrices A∈ℝ m×n (m≤n<N) and S∈ℝ n×N , under requirements that all m×m submatrices of A are nonsingular, and S is sparse in sense that each column of S has at least n−m+1 zero elements. It is known that under some mild additional assumptions, such representation is ...

## Export bibliographical data

Item type: | Article |
---|---|

Date: | 2005 |

Institutions: | Biology, Preclinical Medicine > Institut für Biophysik und physikalische Biochemie > Prof. Dr. Elmar Lang |

Keywords: | Sparse component analysis; Blind source separation; Underdetermined mixtures |

Dewey Decimal Classification: | 500 Science > 570 Life sciences |

Status: | Published |

Refereed: | Unknown |

Created at the University of Regensburg: | Unknown |

Deposited on: | 14 Oct 2010 06:07 |

Last modified: | 31 Jan 2014 06:58 |

Item ID: | 17307 |