Scheduled System Maintenance:
On April 27th, single article purchases and IEEE account management will be unavailable from 2:00 PM - 4:00 PM ET (18:00 - 20:00 UTC).
We apologize for the inconvenience.
By Topic

Non-negative matrix factorization considering given vectors in a basis

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Amano, Y. ; Div. of Comput. Sci., Hokkaido Univ., Sapporo, Japan ; Tanaka, A. ; Miyakoshi, M.

Recently, a novel matrix factorization, named non-negative matrix factorization (NMF), attracts much attention in the field of signal processing. A matrix with non-negative elements can be decomposed into a product of two matrices with non-negative elements by the NMF. One resulting matrix can be regarded as a basis matrix; and the other can be regarded as a coefficient matrix giving linear combinations of the basis vectors. In practical problems, there exists a case where an ideal basis is partially known. In this paper, we propose a novel method for NMF considering given vectors in an ideal basis. We introduce a criterion for the method and construct an algorithm to optimize the criterion. Moreover, we prove that the proposed algorithm surely converges. Some results of computer simulations are also given to verify the efficacy of the proposed method.

Published in:

Granular Computing (GrC), 2011 IEEE International Conference on

Date of Conference:

8-10 Nov. 2011