Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

ISCAS

2008

IEEE

2008

IEEE

— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based representation. The NMF decomposition is not in general unique and a part based representation not guaranteed. However, imposing sparseness both improves the uniqueness of the decomposition and favors part based representation. Sparseness in the form of attaining as many zero elements in the solution as possible is appealing from a conceptional point of view and corresponds to minimizing reconstruction error with an L0 norm constraint. In general, solving for a given L0 norm is an NP hard problem thus convex relaxation regularization by the L1 norm is often considered, i.e., minimizing (1 2 V − WH 2 F + λ H 1). An open problem is to control the degree of sparsity λ imposed. We here demonstrate that a full regularization path for the L1 norm regularized least squares NMF for ﬁxed W can be calculated at th...

Added |
31 May 2010 |

Updated |
31 May 2010 |

Type |
Conference |

Year |
2008 |

Where |
ISCAS |

Authors |
Morten Mørup, Kristoffer Hougaard Madsen, Lars Kai Hansen |

Comments (0)