Search PubMed⌕ Search

Biomedical subjects

Wenming Zheng

Publications and source records attributed to Wenming Zheng.

5 recordsLinked to original sources

Genome-wide reprogramming of metabolism and regulatory networks of Arabidopsis in response to phosphorus.

Affymetrix ATH1 arrays, large-scale real-time reverse transcription PCR of approximately 2200 transcription factor genes and other gene families, and analyses of metabolites and enzyme activities were used to investigate the response of Arabidopsis to phosphate (Pi) deprivation and re-supply. Transcript data were analysed with MapMan software to identify coordinated, system-wide changes in metabolism and other cellular processes. Phosphorus (P) deprivation led to induction or repression of > 1000 genes involved in many processes. A subset, including the induction of genes involved in P uptake, the mobilization of organic Pi, the conversion of phosphorylated glycolytic intermediates to carbohydrates and organic acids, the replacement of P-containing phospholipids with galactolipids and the repression of genes involved in nucleotide/nucleic acid synthesis, was reversed within 3 h after Pi re-supply. Analyses of 22 enzyme activities revealed that changes in transcript levels often, but not always, led to changes in the activities of the encoded enzymes in P-deprived plants. Analyses of metabolites confirmed that P deprivation leads to a shift towards the accumulation of carbohydrates, organic acids and amino acids, and that Pi re-supply leads to use of the latter. P-deprived plants also showed large changes in the expression of many genes involved in, for example, secondary metabolism and photosynthesis. These changes were not reversed rapidly upon Pi re-supply and were probably secondary in origin. Differentially expressed and highly P-specific putative regulator genes were identified that presumably play central roles in coordinating the complex responses of plants to changes in P nutrition. The specific responses to Pi differ markedly from those found for nitrate, whereas the long-term responses during P and N deprivation share common and non-specific features.

Arabidopsis↗

Facial expression recognition using kernel canonical correlation analysis (KCCA).

In this correspondence, we address the facial expression recognition problem using kernel canonical correlation analysis (KCCA). Following the method proposed by Lyons et al. and Zhang et al., we manually locate 34 landmark points from each facial image and then convert these geometric points into a labeled graph (LG) vector using the Gabor wavelet transformation method to represent the facial features. On the other hand, for each training facial image, the semantic ratings describing the basic expressions are combined into a six-dimensional semantic expression vector. Learning the correlation between the LG vector and the semantic expression vector is performed by KCCA. According to this correlation, we estimate the associated semantic expression vector of a given test image and then perform the expression classification according to this estimated semantic expression vector. Moreover, we also propose an improved KCCA algorithm to tackle the singularity problem of the Gram matrix. The experimental results on the Japanese female facial expression database and the Ekman's "Pictures of Facial Affect" database illustrate the effectiveness of the proposed method.

Algorithms↗

Class-incremental generalized discriminant analysis.

Generalized discriminant analysis (GDA) is the nonlinear extension of the classical linear discriminant analysis (LDA) via the kernel trick. Mathematically, GDA aims to solve a generalized eigenequation problem, which is always implemented by the use of singular value decomposition (SVD) in the previously proposed GDA algorithms. A major drawback of SVD, however, is the difficulty of designing an incremental solution for the eigenvalue problem. Moreover, there are still numerical problems of computing the eigenvalue problem of large matrices. In this article, we propose another algorithm for solving GDA as for the case of small sample size problem, which applies QR decomposition rather than SVD. A major contribution of the proposed algorithm is that it can incrementally update the discriminant vectors when new classes are inserted into the training set. The other major contribution of this article is the presentation of the modified kernel Gram-Schmidt (MKGS) orthogonalization algorithm for implementing the QR decomposition in the feature space, which is more numerically stable than the kernel Gram-Schmidt (KGS) algorithm. We conduct experiments on both simulated and real data to demonstrate the better performance of the proposed methods.

Journal Article↗

Foley-Sammon optimal discriminant vectors using kernel approach.

A new nonlinear feature extraction method called kernel Foley-Sammon optimal discriminant vectors (KFSODVs) is presented in this paper. This new method extends the well-known Foley-Sammon optimal discriminant vectors (FSODVs) from linear domain to a nonlinear domain via the kernel trick that has been used in support vector machine (SVM) and other commonly used kernel-based learning algorithms. The proposed method also provides an effective technique to solve the so-called small sample size (SSS) problem which exists in many classification problems such as face recognition. We give the derivation of KFSODV and conduct experiments on both simulated and real data sets to confirm that the KFSODV method is superior to the previous commonly used kernel-based learning algorithms in terms of the performance of discrimination.

Algorithms↗

A modified algorithm for generalized discriminant analysis.

Generalized discriminant analysis (GDA) is an extension of the classical linear discriminant analysis (LDA) from linear domain to a nonlinear domain via the kernel trick. However, in the previous algorithm of GDA, the solutions may suffer from the degenerate eigenvalue problem (i.e., several eigenvectors with the same eigenvalue), which makes them not optimal in terms of the discriminant ability. In this letter, we propose a modified algorithm for GDA (MGDA) to solve this problem. The MGDA method aims to remove the degeneracy of GDA and find the optimal discriminant solutions, which maximize the between-class scatter in the subspace spanned by the degenerate eigenvectors of GDA. Theoretical analysis and experimental results on the ORL face database show that the MGDA method achieves better performance than the GDA method.

Algorithms↗