scholarly journals Incremental Nonnegative Matrix Factorization for Face Recognition

2008 ◽  
Vol 2008 ◽  
pp. 1-17 ◽  
Author(s):  
Wen-Sheng Chen ◽  
Binbin Pan ◽  
Bin Fang ◽  
Ming Li ◽  
Jianliang Tang
Keyword(s):  
Face Recognition ◽  
Matrix Factorization ◽  
Nonnegative Matrix Factorization ◽  
Computational Cost ◽  
Nonnegative Matrix ◽  
Matrix Decomposition ◽  
Coefficient Matrix ◽  
Large Matrix ◽  
Training Samples ◽  
Almost All

Nonnegative matrix factorization (NMF) is a promising approach for local feature extraction in face recognition tasks. However, there are two major drawbacks in almost all existing NMF-based methods. One shortcoming is that the computational cost is expensive for large matrix decomposition. The other is that it must conduct repetitive learning, when the training samples or classes are updated. To overcome these two limitations, this paper proposes a novel incremental nonnegative matrix factorization (INMF) for face representation and recognition. The proposed INMF approach is based on a novel constraint criterion and our previous block strategy. It thus has some good properties, such as low computational complexity, sparse coefficient matrix. Also, the coefficient column vectors between different classes are orthogonal. In particular, it can be applied to incremental learning. Two face databases, namely FERET and CMU PIE face databases, are selected for evaluation. Compared with PCA and some state-of-the-art NMF-based methods, our INMF approach gives the best performance.

scholarly journals Retinal vessel segmentation with constrained-based nonnegative matrix factorization and 3D modified attention U-Net

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Yang Yu ◽  
Hongqing Zhu
Keyword(s):  
Matrix Factorization ◽  
Nonnegative Matrix Factorization ◽  
Computational Cost ◽  
Three Dimensional ◽  
Nonnegative Matrix ◽  
Retinal Vessel ◽  
Classification Problem ◽  
Image Resolution ◽  
Retinal Vessels ◽  
Segmentation Task

AbstractDue to the complex morphology and characteristic of retinal vessels, it remains challenging for most of the existing algorithms to accurately detect them. This paper proposes a supervised retinal vessels extraction scheme using constrained-based nonnegative matrix factorization (NMF) and three dimensional (3D) modified attention U-Net architecture. The proposed method detects the retinal vessels by three major steps. First, we perform Gaussian filter and gamma correction on the green channel of retinal images to suppress background noise and adjust the contrast of images. Then, the study develops a new within-class and between-class constrained NMF algorithm to extract neighborhood feature information of every pixel and reduce feature data dimension. By using these constraints, the method can effectively gather similar features within-class and discriminate features between-class to improve feature description ability for each pixel. Next, this study formulates segmentation task as a classification problem and solves it with a more contributing 3D modified attention U-Net as a two-label classifier for reducing computational cost. This proposed network contains an upsampling to raise image resolution before encoding and revert image to its original size with a downsampling after three max-pooling layers. Besides, the attention gate (AG) set in these layers contributes to more accurate segmentation by maintaining details while suppressing noises. Finally, the experimental results on three publicly available datasets DRIVE, STARE, and HRF demonstrate better performance than most existing methods.

scholarly journals Incremental Graph Regulated Nonnegative Matrix Factorization for Face Recognition

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Zhe-Zhou Yu ◽  
Yu-Hao Liu ◽  
Bin Li ◽  
Shu-Chao Pang ◽  
Cheng-Cheng Jia
Keyword(s):  
Face Recognition ◽  
Matrix Factorization ◽  
Information Needs ◽  
Nonnegative Matrix Factorization ◽  
Recognition Rate ◽  
Nonnegative Matrix ◽  
Recognition Algorithm ◽  
Incremental Method ◽  
Real World Application ◽  
The Face

In a real world application, we seldom get all images at one time. Considering this case, if a company hired an employee, all his images information needs to be recorded into the system; if we rerun the face recognition algorithm, it will be time consuming. To address this problem, In this paper, firstly, we proposed a novel subspace incremental method called incremental graph regularized nonnegative matrix factorization (IGNMF) algorithm which imposes manifold into incremental nonnegative matrix factorization algorithm (INMF); thus, our new algorithm is able to preserve the geometric structure in the data under incremental study framework; secondly, considering we always get many face images belonging to one person or many different people as a batch, we improved our IGNMF algorithms to Batch-IGNMF algorithms (B-IGNMF), which implements incremental study in batches. Experiments show that (1) the recognition rate of our IGNMF and B-IGNMF algorithms is close to GNMF algorithm while it runs faster than GNMF. (2) The running times of our IGNMF and B-IGNMF algorithms are close to INMF while the recognition rate outperforms INMF. (3) Comparing with other popular NMF-based face recognition incremental algorithms, our IGNMF and B-IGNMF also outperform then both the recognition rate and the running time.

Block kernel nonnegative matrix factorization for face recognition

2019 ◽  
Vol 17 (01) ◽  
pp. 1850059
Author(s):  
Wen-Sheng Chen ◽  
Jingmin Liu ◽  
Binbin Pan ◽  
Yugao Li
Keyword(s):  
Face Recognition ◽  
Matrix Factorization ◽  
Nonnegative Matrix Factorization ◽  
Nonnegative Matrix ◽  
Superior Performance ◽  
Nonlinear Features ◽  
Data Points ◽  
Class Information ◽  
Sparse Features ◽  
Facial Images

Nonnegative matrix factorization (NMF) is a linear approach for extracting localized feature of facial image. However, NMF may fail to process the data points that are nonlinearly separable. The kernel extension of NMF, named kernel NMF (KNMF), can model the nonlinear relationship among data points and extract nonlinear features of facial images. KNMF is an unsupervised method, thus it does not utilize the supervision information. Moreover, the extracted features by KNMF are not sparse enough. To overcome these limitations, this paper proposes a supervised KNMF called block kernel NMF (BKNMF). A novel objective function is established by incorporating the intra-class information. The algorithm is derived by making use of the block strategy and kernel theory. Our BKNMF has some merits for face recognition, such as highly sparse features and orthogonal features from different classes. We theoretically analyze the convergence of the proposed BKNMF. Compared with some state-of-the-art methods, our BKNMF achieves superior performance in face recognition.

scholarly journals Diffuse Optical Imaging Using Decomposition Methods

2012 ◽  
Vol 2012 ◽  
pp. 1-12 ◽  
Author(s):  
Binlin Wu ◽  
M. Alrubaiee ◽  
W. Cai ◽  
M. Xu ◽  
S. K. Gayen
Keyword(s):  
Experimental Data ◽  
Optical Imaging ◽  
Matrix Factorization ◽  
Nonnegative Matrix Factorization ◽  
Nonnegative Matrix ◽  
Principal Component ◽  
Matrix Decomposition ◽  
Decomposition Methods ◽  
Component Analysis ◽  
Diffuse Optical Imaging

Diffuse optical imaging (DOI) for detecting and locating targets in a highly scattering turbid medium is treated as a blind source separation (BSS) problem. Three matrix decomposition methods, independent component analysis (ICA), principal component analysis (PCA), and nonnegative matrix factorization (NMF) were used to study the DOI problem. The efficacy of resulting approaches was evaluated and compared using simulated and experimental data. Samples used in the experiments included Intralipid-10% or Intralipid-20% suspension in water as the medium with absorptive or scattering targets embedded.

Sign in / Sign up

Export Citation Format

Share Document