Local Non-negative Matrix Factorization Research Articles

A New Feature Extraction and Recognition Method for Microexpression Based on Local Non-negative Matrix Factorization.

Microexpression is usually characterized by short duration and small action range, and the existing general expression recognition algorithms do not work well for microexpression. As a feature extraction method, non-negative matrix factorization can decompose the original data into different components, which has been successfully applied to facial recognition. In this paper, local non-negative matrix factorization is explored to decompose microexpression into some facial muscle actions, and extract features for recognition based on apex frame. However, the existing microexpression datasets fall short of samples to train a classifier with good generalization. The macro-to-micro algorithm based on singular value decomposition can augment the number of microexpressions, but it cannot meet non-negative properties of feature vectors. To address these problems, we propose an improved macro-to-micro algorithm to augment microexpression samples by manipulating the macroexpression data based on local non-negative matrix factorization. Finally, several experiments are conducted to verify the effectiveness of the proposed scheme, which results show that it has a higher recognition accuracy for microexpression compared with the related algorithms based on CK+/CASME2/SAMM datasets.

Face Recognition System for Indoor Applications Based on Video with the LNMF and NMFsc Methods

Face detection and face recognition are among the most important research topics in computer vision, as many applications use faces as objects of biometric technology. One of the main issues in applying face recognition is recording the attendance of active participants in a room. The challenge is that recognition through video with multiple object conditions in one frame may be difficult to perform. The Principal Component Analysis method is commonly used in face detection. Principal Component Analysis still has shortcomings: the accuracy decreases when it is applied to large datasets and performs slowly in real-time applications. Therefore, this study simulates a face recognition system installed in a room based on video recordings using Non-negative Matrix Factorization suppressed carrier and Local Non-negative Matrix Factorization methods. Data acquisition is obtained by capturing video in classrooms with a resolution of 640 x 480 pixels in RGB, .avi format, video frame rate of 30 fps, and video duration of ±10 seconds. The proposed system can perform face recognition in which the average accuracy value of the Local Non-negative Matrix Factorization method is 71.61% with a computation time of 152,634 seconds. By contrast, the average accuracy value of the Non-negative Matrix Factorization suppressed carrier method is 86.76% with a computation time of 467,785 seconds. The proposed system is expected to be used for simultaneously finding and identifying faces in real time.

An accurate multi-modal biometric identification system for person identification via fusion of face and finger print

Internet of things (IoT) have entirely revolutionized the industry. However, the cyber-security of IoT enabled cyber-physical systems is still one of the main challenges. The success of cyber-physical system is highly reliant on its capability to withstand cyberattacks. Biometric identification is the key factor responsible for the provision of secure cyber-physical system. The conventional unimodal biometric systems do not have the potential to provide the required level of security for cyber-physical system. The unimodal biometric systems are affected by a variety of issues like noisy sensor data, non-universality, susceptibility to forgery and lack of invariant representation. To overcome these issues and to provide higher-security enabled cyber-physical systems, the combination of different biometric modalities is required. To ensure a secure cyber-physical system, a novel multi-modal biometric system based on face and finger print is proposed in this work. Finger print matching is performed using alignment-based elastic algorithm. For the improved facial feature extraction, extended local binary patterns (ELBP) are used. For the effective dimensionality reduction of extracted ELBP feature space, local non-negative matrix factorization is used. Score level fusion is performed for the fusion. Experimental evaluation is done on FVC 2000 DB1, FVC 2000 DB2, ORL (AT&T) and YALE databases. The proposed method achieved a high recognition accuracy of 99.59%.

Underdetermined Source Separation of Bearing Faults Based on Optimized Intrinsic Characteristic-Scale Decomposition and Local Non-Negative Matrix Factorization

Since roller bearing is one of the most vulnerable components, bearing faults usually occur in an unprepared situation with multiple faults, and the quantity of sensors is limited in the real-time working environment, resulting in an underdetermined blind source separation (UBSS) problem to extract the fault features. Because the collected signals are usually not independent and not sparse enough, traditional methods of separating signals cannot perform well. In this paper, an optimized intrinsic characteristic-scale decomposition (OICD) method is proposed to solve the underdetermined problem. Meanwhile, the constraint error factor is introduced to overcome the drawback that the ideal ending condition of ICD is not proper for the vibration signal of bearing. In addition, given that non-negative matrix factorization (NMF) is not limited by the source signal independence and sparsity, an improved UBSS model is constructed, and the PCs are used as the input matrix of local NMF to obtain the separation signal. Ultimately, envelope analysis is utilized to detect the source signal feature. Both simulated and experimental vibration signals are used to verify the effectiveness of the proposed approach. Besides, the traditional method is juxtaposed with the suggested method. The results indicate that the proposed method is effective in dealing with the compound faults separation of the rotating machinery.

Iterative Weighted Non-smooth Non-negative Matrix Factorization for Face Recognition

Non-negative Matrix Factorization (NMF) is a part-based image representation method. It comes from the intuitive idea that entire face image can be constructed by combining several parts. In this paper, we propose a framework for face recognition by finding localized, part-based representations, denoted “Iterative weighted non-smooth non-negative matrix factorization” (IWNS-NMF). A new cost function is proposed in order to incorporate sparsity which is controlled by a specific parameter and weights of feature coefficients. This method extracts highly localized patterns, which generally improves the capability of face recognition. After extracting patterns by IWNS-NMF, we use principle component analysis to reduce dimension for classification by linear SVM. The Recognition rates on ORL, YALE and JAFFE datasets were 97.5, 93.33 and 87.8%, respectively. Comparisons to the related methods in the literature indicate that the proposed IWNS-NMF method achieves higher face recognition performance than NMF, NS-NMF, Local NMF and SNMF.

Robust video identification approach based on local non-negative matrix factorization

With the popularization of media-capture devices and the development of the Internet's basic facilities, video has become the most popular media information in recent years. The massive capacity of video imposes the demand of automatic video identification techniques which are very important to various applications such as content based video retrieval and copy detection. Therefore, as a challenging problem, video identification has drawn more and more attention in the past decade. The problem addressed here is to identify a given video clip in a given set of video sequences. In this paper, a robust video identification algorithm based on local non-negative matrix factorization (LNMF) is presented. First, some concepts about LNMF are described and the way of finding the factorized matrix is given. Then, its convergence is proven. In addition, a LNMF based shot detection method is proposed for constructing a video identification framework completely based on LNMF. Finally, a LNMF based identification approach using Hausdorff distance is introduced and a two-stage search process is proposed. Experimental results show the robustness of the proposed approach to many kinds of content-preserved distortions and its superiority to other algorithms.

Local discriminant non-negative matrix factorization feature extraction for hyperspectral image classification

Non-negative matrix factorization (NMF) ignores both the local geometric structure of and the discriminative information contained in a data set. A manifold geometry-based NMF dimension reduction method called local discriminant NMF (LDNMF) is proposed in this paper. LDNMF preserves not only the non-negativity but also the local geometric structure and discriminative information of the data. The local geometric and discriminant structure of the data manifold can be characterized by a within-class graph and a between-class graph. An efficient multiplicative updating procedure is produced, and its global convergence is guaranteed theoretically. Experimental results on two hyperspectral image data sets show that the proposed LDNMF is a powerful and promising tool for extracting hyperspectral image features.

Local Application of Non Negative Matrix Factorization Algorithm in Face Recognition

Face recognition is a challenging issue in field of multi-science, main contents of research is how to make computer have ability of face recognition face recognition technology involved in a lot, which is a key feature extraction and classification method, this paper focuses on study of related theory. Non-negative matrix factorization trapped MF) algorithm and local non-negative matrix factorization (LNMF) algorithm is a feature extraction method based on local features, has been successfully used in face recognition NMF algorithm in face recognition rate is low, although LNMF algorithm to a certain extent, improve recognition rate, but its price is to increase number of iterations. In addition, two algorithms have failed to solve good nonlinear separable problems the kernel method combined with LNMF algorithm, kernel local non-negative matrix factorization (KLNMF) algorithm, first by a nonlinear transformation of original space to high-dimensional space, making samples linearly separable, and then use LNMF algorithm to extract face features. In classification part, paper presents decision rules of classification of their own, and design based on NMF subspace classifier. DOI : http://dx.doi.org/10.11591/telkomnika.v12i3.4356 Full Text: PDF

Palmprint recognition method based on localized non-negative sparse coding

To more effectively extract localized features of images,on the basis of the traditional Non-negative Sparse Coding(Hoyer NNSC) algorithm,a novel localized NNSC(LNNSC) algorithm with sparse constraint was proposed.This algorithm considered the sparse measure constraint of feature basis vectors and the maximized representativeness of features,and could obtain the strengthened localized image features.At the same time,this algorithm utilized the Laplace density model as the feature coefficients sparse punitive function to ensure an image's sparse structure.Furthermore,on the basis of feature extraction,by utilizing the Radial Basis Probabilistic Neural Networks(RBPNN),the palmprint recognition task could be implemented automatically.Compared with the palmprint recognition methods of Non-negative Matrix Factorization(NMF),Local NMF(LNMF) and Hoyer-NNSC,simulation results show that our method proposed here displays feasibility and practicality in palmprint recognition.

Face Recognition Algorithm for Photographs and Viewed Sketch Matching Using Score-Level Fusion

For criminal searches, the necessity of matching photographs with sketches is increasing. Previously, matching was performed manually by a human observer, a time-consuming process whose accuracy can be affected by the level of human expertise. Therefore, we propose a new face recognition algorithm for photographs and sketches. This research is novel in the following three ways. First, to overcome the decrease in matching accuracy due to pose and illumination variation, we use eye alignment and retinex filtering to normalize pose, size and illumination. Second, we compare the performance of various face recognition methods, such as principal component analysis (PCA), local binary pattern (LBP), local non-negative matrix factorization (LNMF), support vector machine-discriminant analysis (SVM-DA) and modified census transform (MCT), for the matching of photographs and viewed sketches. Third, these five face recognition methods are combined on the basis of score-level fusion to enhance matching accuracy, thereby overcoming the performance limitations of single face recognition methods. Experimental results using a CUHK dataset showed that the accuracy of the proposed method is better than that of uni-modal face recognition methods.

Robustness of Face Recognition to Variations of Illumination on Mobile Devices Based on SVM

With the increasing popularity of mobile devices, it has become necessary to protect private information and content in these devices. Face recognition has been favored over conventional passwords or security keys, because it can be easily implemented using a built-in camera, while providing user convenience. However, because mobile devices can be used both indoors and outdoors, there can be many illumination changes, which can reduce the accuracy of face recognition. Therefore, we propose a new face recognition method on a mobile device robust to illumination variations. This research makes the following four original contributions. First, we compared the performance of face recognition with illumination variations on mobile devices for several illumination normalization procedures suitable for mobile devices with low processing power. These include the Retinex filter, histogram equalization and histogram stretching. Second, we compared the performance for global and local methods of face recognition such as PCA (Principal Component Analysis), LNMF (Local Non-negative Matrix Factorization) and LBP (Local Binary Pattern) using an integer-based kernel suitable for mobile devices having low processing power. Third, the characteristics of each method according to the illumination variations are analyzed. Fourth, we use two matching scores for several methods of illumination normalization, Retinex and histogram stretching, which show the best and 2nd best performances, respectively. These are used as the inputs of an SVM (Support Vector Machine) classifier, which can increase the accuracy of face recognition. Experimental results with two databases (data collected by a mobile device and the AR database) showed that the accuracy of face recognition achieved by the proposed method was superior to that of other methods.

A comparative study of facial appearance modeling methods for active appearance models

Active appearance models (AAMs) have been widely used in many face modeling and facial feature extraction methods. One of the problems of AAMs is that it is difficult to model a sufficiently wide range of human facial appearances, the pattern of intensities across a face image patch. Previous researches have used principal component analysis (PCA) for facial appearance modeling, but there has been little analysis and comparison between PCA and many other facial appearance modeling methods such as non-negative matrix factorization (NMF), local NMF (LNMF), and non-smooth NMF (ns-NMF). The main contribution of this paper is to find a suitable facial appearance modeling method for AAMs by a comparative study. In the experiments, PCA, NMF, LNMF, and ns-NMF were used to produce the appearance model of the AAMs and the root mean square (RMS) errors of the detected feature points were analyzed using the AR and BERC face databases. Experimental results showed that (1) if the appearance variations of testing face images were relatively non-sparser than those of training face images, the non-sparse methods (PCA, NMF) based AAMs outperformed the sparse methods (nsNMF, LNMF) based AAMs. (2) If the appearance variations of testing face images are relatively sparser than those of training face images, the sparse methods (nsNMF) based AAMs outperformed the non-sparse methods (PCA, NMF) based AAMs.

Occlusion invariant face recognition using selective local non-negative matrix factorization basis images

In this paper, we propose a novel occlusion invariant face recognition algorithm based on Selective Local Non-negative Matrix Factorization (S-LNMF) technique. The proposed algorithm is composed of two phases; the occlusion detection phase and the selective LNMF-based recognition phase. We use a local approach to effectively detect partial occlusions in an input face image. A face image is first divided into a finite number of disjointed local patches, and then each patch is represented by PCA (Principal Component Analysis), obtained by corresponding occlusion-free patches of training images. And the 1-NN threshold classifier is used for occlusion detection for each patch in the corresponding PCA space. In the recognition phase, by employing the LNMF-based face representation, we exclusively use the LNMF bases of occlusion-free image patches for face recognition. Euclidean nearest neighbor rule is applied for the matching. We have performed experiments on AR face database that includes many occluded face images by sunglasses and scarves. The experimental results demonstrate that the proposed local patch-based occlusion detection technique works well and the S-LNMF method shows superior performance to other conventional approaches.

Localized versus Locality-Preserving Subspace Projections for Face Recognition

Three different localized representation methods and a manifold learning approach to face recognition are compared in terms of recognition accuracy. The techniques under investigation are (a) local nonnegative matrix factorization (LNMF); (b) independent component analysis (ICA); (c) NMF with sparse constraints (NMFsc); (d) locality-preserving projections (Laplacian faces). A systematic comparative analysis is conducted in terms of distance metric used, number of selected features, and sources of variability on AR and Olivetti face databases. Results indicate that the relative ranking of the methods is highly task-dependent, and the performances vary significantly upon the distance metric used.

Face recognition using localized features based on non-negative sparse coding

Neural networks in the visual system may be performing sparse coding of learnt local features that are qualitatively very similar to the receptive fields of simple cells in the primary visual cortex, V1. In conventional sparse coding, the data are described as a combination of elementary features involving both additive and subtractive components. However, the fact that features can ‘cancel each other out’ using subtraction is contrary to the intuitive notion of combining parts to form a whole. Thus, it has recently been argued forcefully for completely non-negative representations. This paper presents Non-Negative Sparse Coding (NNSC) applied to the learning of facial features for face recognition and a comparison is made with the other part-based techniques, Non-negative Matrix Factorization (NMF) and Local-Non-negative Matrix Factorization (LNMF). The NNSC approach has been tested on the Aleix–Robert (AR), the Face Recognition Technology (FERET), the Yale B, and the Cambridge ORL databases, respectively. In doing so, we have compared and evaluated the proposed NNSC face recognition technique under varying expressions, varying illumination, occlusion with sunglasses, occlusion with scarf, and varying pose. Tests were performed with different distance metrics such as the L1-metric, L2-metric, and Normalized Cross-Correlation (NCC). All these experiments involved a large range of basis dimensions. In general, NNSC was found to be the best approach of the three part-based methods, although it must be observed that the best distance measure was not consistent for the different experiments.

NMF, LNMF, and DNMF modeling of neural receptive fields involved in human facial expression perception

Recently, three learning algorithms, namely non-negative matrix factorization (NMF), local non-negative matrix factorization (LNMF), and discriminant non-negative matrix factorization (DNMF) have been proposed to produce sparse image representations. However, when their input is a database of human facial images, they decompose the images into sparse representations with quite different degree of sparseness. Within a continuum of sparseness ranging from holistic to local image representation, the first algorithm rather tends towards the first extreme, while the second algorithm produces a local representation. The third algorithm provides an image representation that is in between these two extremes. These algorithms decompose the facial images in the database into basis images and their corresponding coefficients. The basis images are learned by the algorithm when human face images are given as input. By analogy to neurophysiology, the basis images could be associated with the receptive fields of neuronal cells involved in encoding human faces. Taken from this point of view, the paper presents an analysis of these three representations in connection to the receptive field parameters such as spatial frequency, frequency orientation, position, length, width, aspect ratio, etc. By analyzing the tiling properties of these bases we can have an insight of how suitable these algorithms are to resemble biological visual perception systems.

NON-NEGATIVE MATRIX FACTORIZATION FRAMEWORK FOR FACE RECOGNITION

Non-negative Matrix Factorization (NMF) is a part-based image representation method which adds a non-negativity constraint to matrix factorization. NMF is compatible with the intuitive notion of combining parts to form a whole face. In this paper, we propose a framework of face recognition by adding NMF constraint and classifier constraints to matrix factorization to get both intuitive features and good recognition results. Based on the framework, we present two novel subspace methods: Fisher Non-negative Matrix Factorization (FNMF) and PCA Non-negative Matrix Factorization (PNMF). FNMF adds both the non-negative constraint and the Fisher constraint to matrix factorization. The Fisher constraint maximizes the between-class scatter and minimizes the within-class scatter of face samples. Subsequently, FNMF improves the capability of face recognition. PNMF adds the non-negative constraint and characteristics of PCA, such as maximizing the variance of output coordinates, orthogonal bases, etc. to matrix factorization. Therefore, we can get intuitive features and desirable PCA characteristics. Our experiments show that FNMF and PNMF achieve better face recognition performance than NMF and Local NMF.