scholarly journals Discriminative Label Relaxed Regression with Adaptive Graph Learning

2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Jingjing Wang ◽  
Zhonghua Liu ◽  
Wenpeng Lu ◽  
Kaibing Zhang
Keyword(s):  
Feature Extraction ◽  
Manifold Learning ◽  
Local Structure ◽  
Original Data ◽  
Geometric Information ◽  
Graph Regularization ◽  
Subsequent Work ◽  
Structure Information ◽  
Adaptive Weight ◽  
Parameter Values

The traditional label relaxation regression (LRR) algorithm directly fits the original data without considering the local structure information of the data. While the label relaxation regression algorithm of graph regularization takes into account the local geometric information, the performance of the algorithm depends largely on the construction of graph. However, the traditional graph structures have two defects. First of all, it is largely influenced by the parameter values. Second, it relies on the original data when constructing the weight matrix, which usually contains a lot of noise. This makes the constructed graph to be often not optimal, which affects the subsequent work. Therefore, a discriminative label relaxation regression algorithm based on adaptive graph (DLRR_AG) is proposed for feature extraction. DLRR_AG combines manifold learning with label relaxation regression by constructing adaptive weight graph, which can well overcome the problem of label overfitting. Based on a large number of experiments, it can be proved that the proposed method is effective and feasible.

The LBP Integrating Neighbor Pixels on Face Recognition

2013 ◽  
Vol 756-759 ◽  
pp. 3835-3840
Author(s):  
Wei Sheng Li ◽  
Long Chen
Keyword(s):  
Face Recognition ◽  
Local Structure ◽  
Original Data ◽  
Linear Discriminate Analysis ◽  
Discriminate Analysis ◽  
Structure Information ◽  
The Difference ◽  
Relationship Of ◽  
The Relationship

The traditional LBP only considers the difference between the center pixel and the neighbor pixels. In order to use the relationship of the center pixel and neighbor pixels, a manipulative texture method B_LBP is proposed in this paper, which integrates the grayscale intensity of neighbor pixels into traditional LBP. The method keeps the local structure information of original images and enhances the identification ability. LDA (Linear discriminate analysis) is used to reduce the dimensionality of the original data. The experiments are conducted on Yale B and CMU PIE face databases with B_LBP, LEP and LBP. The results show that the B_LBP is superior to the traditional LBP and LEP.

scholarly journals Graph Regularized Deep Sparse Representation for Unsupervised Anomaly Detection

2021 ◽  
Vol 2021 ◽  
pp. 1-19
Author(s):  
Shicheng Li ◽  
Shumin Lai ◽  
Yan Jiang ◽  
Wenle Wang ◽  
Yugen Yi
Keyword(s):  
Anomaly Detection ◽  
Sparse Representation ◽  
Original Data ◽  
Feature Representation ◽  
Detection Methods ◽  
Local Geometry ◽  
L1 Norm ◽  
Graph Regularization ◽  
Structure Information ◽  
Unsupervised Anomaly Detection

Anomaly detection (AD) aims to distinguish the data points that are inconsistent with the overall pattern of the data. Recently, unsupervised anomaly detection methods have aroused huge attention. Among these methods, feature representation (FR) plays an important role, which can directly affect the performance of anomaly detection. Sparse representation (SR) can be regarded as one of matrix factorization (MF) methods, which is a powerful tool for FR. However, there are some limitations in the original SR. On the one hand, it just learns the shallow feature representations, which leads to the poor performance for anomaly detection. On the other hand, the local geometry structure information of data is ignored. To address these shortcomings, a graph regularized deep sparse representation (GRDSR) approach is proposed for unsupervised anomaly detection in this work. In GRDSR, a deep representation framework is first designed by extending the single layer MF to a multilayer MF for extracting hierarchical structure from the original data. Next, a graph regularization term is introduced to capture the intrinsic local geometric structure information of the original data during the process of FR, making the deep features preserve the neighborhood relationship well. Then, a L1-norm-based sparsity constraint is added to enhance the discriminant ability of the deep features. Finally, a reconstruction error is applied to distinguish anomalies. In order to demonstrate the effectiveness of the proposed approach, we conduct extensive experiments on ten datasets. Compared with the state-of-the-art methods, the proposed approach can achieve the best performance.

scholarly journals An Adaptive Unsupervised Feature Selection Algorithm Based on MDS for Tumor Gene Data Classification

Sensors ◽  
2021 ◽  
Vol 21 (11) ◽  
pp. 3627
Author(s):  
Bo Jin ◽  
Chunling Fu ◽  
Yong Jin ◽  
Wei Yang ◽  
Shengbin Li ◽  
...  
Keyword(s):  
Feature Selection ◽  
Local Structure ◽  
Gene Selection ◽  
Dimensional Space ◽  
Original Data ◽  
Global Structure ◽  
Biological Data ◽  
Special Treatment ◽  
Selection Scheme ◽  
Unsupervised Feature Selection

Identifying the key genes related to tumors from gene expression data with a large number of features is important for the accurate classification of tumors and to make special treatment decisions. In recent years, unsupervised feature selection algorithms have attracted considerable attention in the field of gene selection as they can find the most discriminating subsets of genes, namely the potential information in biological data. Recent research also shows that maintaining the important structure of data is necessary for gene selection. However, most current feature selection methods merely capture the local structure of the original data while ignoring the importance of the global structure of the original data. We believe that the global structure and local structure of the original data are equally important, and so the selected genes should maintain the essential structure of the original data as far as possible. In this paper, we propose a new, adaptive, unsupervised feature selection scheme which not only reconstructs high-dimensional data into a low-dimensional space with the constraint of feature distance invariance but also employs ℓ2,1-norm to enable a matrix with the ability to perform gene selection embedding into the local manifold structure-learning framework. Moreover, an effective algorithm is developed to solve the optimization problem based on the proposed scheme. Comparative experiments with some classical schemes on real tumor datasets demonstrate the effectiveness of the proposed method.

scholarly journals A Novel Finger Vein Recognition Method Based on Aggregation of Radon-Like Features

Sensors ◽  
2021 ◽  
Vol 21 (5) ◽  
pp. 1885
Author(s):  
Qiong Yao ◽  
Dan Song ◽  
Xiang Xu ◽  
Kun Zou
Keyword(s):  
Feature Extraction ◽  
Extraction Method ◽  
Spatial Information ◽  
Individual Recognition ◽  
Vein Pattern ◽  
Low Contrast ◽  
Feature Extraction Method ◽  
Structure Information ◽  
Finger Vein ◽  
Specific Implementation

Finger vein (FV) biometrics is one of the most promising individual recognition traits, which has the capabilities of uniqueness, anti-forgery, and bio-assay, etc. However, due to the restricts of imaging environments, the acquired FV images are easily degraded to low-contrast, blur, as well as serious noise disturbance. Therefore, how to extract more efficient and robust features from these low-quality FV images, remains to be addressed. In this paper, a novel feature extraction method of FV images is presented, which combines curvature and radon-like features (RLF). First, an enhanced vein pattern image is obtained by calculating the mean curvature of each pixel in the original FV image. Then, a specific implementation of RLF is developed and performed on the previously obtained vein pattern image, which can effectively aggregate the dispersed spatial information around the vein structures, thus highlight vein patterns and suppress spurious non-boundary responses and noises. Finally, a smoother vein structure image is obtained for subsequent matching and verification. Compared with the existing curvature-based recognition methods, the proposed method can not only preserve the inherent vein patterns, but also eliminate most of the pseudo vein information, so as to restore more smoothing and genuine vein structure information. In order to assess the performance of our proposed RLF-based method, we conducted comprehensive experiments on three public FV databases and a self-built FV database (which contains 37,080 samples that derived from 1030 individuals). The experimental results denoted that RLF-based feature extraction method can obtain more complete and continuous vein patterns, as well as better recognition accuracy.

Kernel Null Space Marginal Fisher Analysis for Face Recognition

2014 ◽  
Vol 889-890 ◽  
pp. 1065-1068
Author(s):  
Yu’e Lin ◽  
Xing Zhu Liang ◽  
Hua Ping Zhou
Keyword(s):  
Feature Extraction ◽  
Face Recognition ◽  
Sample Size ◽  
High Performance ◽  
Null Space ◽  
Small Sample Size ◽  
Recognition Rate ◽  
Original Data ◽  
Small Sample ◽  
Neighborhood Structure

In the recent years, the feature extraction algorithms based on manifold learning, which attempt to project the original data into a lower dimensional feature space by preserving the local neighborhood structure, have drawn much attention. Among them, the Marginal Fisher Analysis (MFA) achieved high performance for face recognition. However, MFA suffers from the small sample size problems and is still a linear technique. This paper develops a new nonlinear feature extraction algorithm, called Kernel Null Space Marginal Fisher Analysis (KNSMFA). KNSMFA based on a new optimization criterion is presented, which means that all the discriminant vectors can be calculated in the null space of the within-class scatter. KNSMFA not only exploits the nonlinear features but also overcomes the small sample size problems. Experimental results on ORL database indicate that the proposed method achieves higher recognition rate than the MFA method and some existing kernel feature extraction algorithms.

scholarly journals Non-negative sparse Laplacian regularized latent multi-view subspace clustering

2021 ◽  
Vol 15 ◽  
pp. 174830262110249
Author(s):  
Cong-Zhe You ◽  
Zhen-Qiu Shu ◽  
Hong-Hui Fan
Keyword(s):  
Subspace Clustering ◽  
Structural Features ◽  
Space Representation ◽  
Graph Regularization ◽  
Structure Information ◽  
Cluster Data ◽  
Latent Space ◽  
Low Dimensional ◽  
Relationship Of ◽  
The Relationship

Recently, in the area of artificial intelligence and machine learning, subspace clustering of multi-view data is a research hotspot. The goal is to divide data samples from different sources into different groups. We proposed a new subspace clustering method for multi-view data which termed as Non-negative Sparse Laplacian regularized Latent Multi-view Subspace Clustering (NSL2MSC) in this paper. The method proposed in this paper learns the latent space representation of multi view data samples, and performs the data reconstruction on the latent space. The algorithm can cluster data in the latent representation space and use the relationship of different views. However, the traditional representation-based method does not consider the non-linear geometry inside the data, and may lose the local and similar information between the data in the learning process. By using the graph regularization method, we can not only capture the global low dimensional structural features of data, but also fully capture the nonlinear geometric structure information of data. The experimental results show that the proposed method is effective and its performance is better than most of the existing alternatives.

scholarly journals Double stages of feature extarction-based GFPMI for colored finger vein identification

2020 ◽  
Vol 18 (2) ◽  
pp. 927
Author(s):  
Dawlat Mustafa Sulaiman ◽  
Adnan Mohsin Abdulazeez ◽  
Habibollah Haron
Keyword(s):  
Feature Extraction ◽  
Texture Features ◽  
Biometric Identification ◽  
Gray Level ◽  
Image Detection ◽  
Structure Information ◽  
Finger Vein ◽  
Gray Level Image ◽  
Vein Recognition ◽  
Finger Vein Recognition

Today, finger vein recognition has a lot of attention as a promising approach of biometric identification framework and still does not meet the challenges of the researchers on this filed. To solve this problem, we propose s double stage of feature extraction schemes based localized finger fine image detection. We propose Globalized Features Pattern Map Indication (GFPMI) to extract the globalized finger vein line features basede on using two generated vein image datasets: original gray level color, globalized finger vein line feature, original localized gray level image, and the colored localized finger vein images. Then, two kinds of features (gray scale and texture features) are extracted, which tell the structure information of the whole finger vein pattern in the whole dataset. The recurrent based residual neural network (RNN) is used to identify the finger vein images. The experimental show that the localized colored finger vein images based globalized feature extraction has achieved the higher accuracy (93.49%) while the original image dataset achieved less accuracy by (69.86%).

scholarly journals The Boron & De Weer Model of Intracellular pH Regulation

2020 ◽  
Author(s):  
Rossana Occhipinti ◽  
Soroush Safaei ◽  
Peter J. Hunter ◽  
Walter F. Boron
Keyword(s):  
Cell Membrane ◽  
Intracellular Ph ◽  
Ph Regulation ◽  
Quantitative Model ◽  
Historical Background ◽  
Acid Base ◽  
Experimental Conditions ◽  
Subsequent Work ◽  
Energy Dependent ◽  
Parameter Values

The classic Boron & De Weer (1976) paper provided the first evidence of active regulation of pH} in cells by an energy-dependent acid-base transporter. These authors also developed a quantitative model --- comprising passive fluxes of acid-base equivalents across the cell membrane, intracellular reactions, and an active transport mechanism in the cell membrane (modelled as a proton pump) --- to help interpret their measurements of intracellular pH under perturbations of both extracellular CO2/HCO3- and extracellular NH3/NH4+. This Physiome paper seeks to make that model, and the experimental conditions under which it was developed, available in a reproducible and well-documented form, along with a software implementation that makes the model easy to use and understand. We have also taken the opportunity to update some of the units used in the original paper, and to provide a few parameter values that were missing in the original paper. Finally, we provide an historical background to the Boron & De Weer (1976) proposal for active pH regulation and a commentary on subsequent work that has enriched our understanding of this most basic aspect of cellular physiology.

scholarly journals A Deep Regression Model with Low-Dimensional Feature Extraction for Multi-Parameter Manufacturing Quality Prediction

2020 ◽  
Vol 10 (7) ◽  
pp. 2522
Author(s):  
Jun Deng ◽  
Yun Bai ◽  
Chuan Li
Keyword(s):  
Feature Extraction ◽  
Manifold Learning ◽  
Percentage Error ◽  
Quality Prediction ◽  
Manufacturing Quality ◽  
Regression Framework ◽  
Nonlinear Technique ◽  
Low Dimensional ◽  
Parts Manufacturing ◽  
Learned Features

Manufacturing quality prediction can be used to design better parameters at an earlier production stage. However, in complex manufacturing processes, prediction performance is affected by multi-parameter inputs. To address this issue, a deep regression framework based on manifold learning (MDRN) is proposed in this paper. The multi-parameter inputs (i.e., high-dimensional information) were firstly analyzed using manifold learning (ML), which is an effective nonlinear technique for low-dimensional feature extraction that can enhance the representation of multi-parameter inputs and reduce calculation burdens. The features obtained through the ML were then learned by a deep learning architecture (DL). It can learn sufficient features of the pattern between manufacturing quality and the low-dimensional information in an unsupervised framework, which has been proven to be effective in many fields. Finally, the learned features were inputted into the regression network, and manufacturing quality predictions were made. One type (two cases) of machinery parts manufacturing system was investigated in order to estimate the performance of the proposed MDRN with three comparisons. The experiments showed that the MDRN overwhelmed all the peer methods in terms of mean absolute percentage error, root-mean-square error, and threshold statistics. Based on these results, we conclude that integrating the ML technique for dimension reduction and the DL technique for feature extraction can improve multi-parameter manufacturing quality predictions.

Sign in / Sign up

Export Citation Format

Share Document