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

Research output: Contribution to journal › Article › peer-review

49 Citations (Scopus)

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.

Original language	English
Article number	4801604
Pages (from-to)	772-777
Number of pages	6
Journal	IEEE Transactions on Circuits and Systems For Video Technology
Volume	19
Issue number	5
DOIs	https://doi.org/10.1109/TCSVT.2009.2017306
Publication status	Published - May 2009

Keywords

binary principal component analysis
binary sparse nonnegative matrix factorization
face images
fast part-based subspace selection algorithm
image occlusions

Access to Document

10.1109/TCSVT.2009.2017306

http://www.nlpr.ia.ac.cn/2009papers/kz/gk13.pdf

Cite this

@article{02336b7796d94c559be94d5bf1709d0f,

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 = "binary principal component analysis, binary sparse nonnegative matrix factorization, face images, fast part-based subspace selection algorithm, image occlusions",

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 = "English",

volume = "19",

pages = "772--777",

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

issn = "1051-8215",

publisher = "IEEE",

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 - binary principal component analysis

KW - binary sparse nonnegative matrix factorization

KW - face images

KW - fast part-based subspace selection algorithm

KW - image occlusions

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

UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4801604

U2 - 10.1109/TCSVT.2009.2017306

DO - 10.1109/TCSVT.2009.2017306

M3 - Article

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this