Binary sparse nonnegative matrix factorization

Yuan Yuan; Xuelong Li; Yanwei Pang; Xin Lu; Dacheng Tao

doi:10.1109/TCSVT.2009.2017306

Binary sparse nonnegative matrix factorization

Yuan Yuan, Xuelong Li, Yanwei Pang, Xin Lu, Dacheng Tao

科研成果: 期刊稿件 › 文章 › 同行评审

49 引用（Scopus）

摘要

This paper presents a fast part-based subspace selection algorithm, termed the binary sparse nonnegative matrix factorization (B-SNMF). Both the training process and the testing process of B-SNMF are much faster than those of binary principal component analysis (B-PCA). Besides, B-SNMF is more robust to occlusions in images. Experimental results on face images demonstrate the effectiveness and the efficiency of the proposed B-SNMF.

源语言	英语
文章编号	4801604
页（从-至）	772-777
页数	6
期刊	IEEE Transactions on Circuits and Systems for Video Technology
卷	19
期	5
DOI	https://doi.org/10.1109/TCSVT.2009.2017306
出版状态	已出版 - 5月 2009
已对外发布	是

访问文件

10.1109/TCSVT.2009.2017306

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{a7b2591caca24ea9ab2da3c300b66bf1,

title = "Binary sparse nonnegative matrix factorization",

abstract = "This paper presents a fast part-based subspace selection algorithm, termed the binary sparse nonnegative matrix factorization (B-SNMF). Both the training process and the testing process of B-SNMF are much faster than those of binary principal component analysis (B-PCA). Besides, B-SNMF is more robust to occlusions in images. Experimental results on face images demonstrate the effectiveness and the efficiency of the proposed B-SNMF.",

keywords = "Fast algorithms, Non-negative matrix factorization, Part-based representation, Sparseness, Subspace selection",

author = "Yuan Yuan and Xuelong Li and Yanwei Pang and Xin Lu and Dacheng Tao",

year = "2009",

month = may,

doi = "10.1109/TCSVT.2009.2017306",

language = "英语",

volume = "19",

pages = "772--777",

journal = "IEEE Transactions on Circuits and Systems for Video Technology",

issn = "1051-8215",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "5",

}

TY - JOUR

T1 - Binary sparse nonnegative matrix factorization

AU - Yuan, Yuan

AU - Li, Xuelong

AU - Pang, Yanwei

AU - Lu, Xin

AU - Tao, Dacheng

PY - 2009/5

Y1 - 2009/5

N2 - This paper presents a fast part-based subspace selection algorithm, termed the binary sparse nonnegative matrix factorization (B-SNMF). Both the training process and the testing process of B-SNMF are much faster than those of binary principal component analysis (B-PCA). Besides, B-SNMF is more robust to occlusions in images. Experimental results on face images demonstrate the effectiveness and the efficiency of the proposed B-SNMF.

AB - This paper presents a fast part-based subspace selection algorithm, termed the binary sparse nonnegative matrix factorization (B-SNMF). Both the training process and the testing process of B-SNMF are much faster than those of binary principal component analysis (B-PCA). Besides, B-SNMF is more robust to occlusions in images. Experimental results on face images demonstrate the effectiveness and the efficiency of the proposed B-SNMF.

KW - Fast algorithms

KW - Non-negative matrix factorization

KW - Part-based representation

KW - Sparseness

KW - Subspace selection

UR - http://www.scopus.com/inward/record.url?scp=67249096976&partnerID=8YFLogxK

U2 - 10.1109/TCSVT.2009.2017306

DO - 10.1109/TCSVT.2009.2017306

M3 - 文章

AN - SCOPUS:67249096976

SN - 1051-8215

VL - 19

SP - 772

EP - 777

JO - IEEE Transactions on Circuits and Systems for Video Technology

JF - IEEE Transactions on Circuits and Systems for Video Technology

IS - 5

M1 - 4801604

ER -

Binary sparse nonnegative matrix factorization

摘要

访问文件

其它文件与链接

指纹

引用此