Wavelet Transform for Face Recognition Based on Improved Fuzzy C-Means

2014 ◽  
Vol 602-605 ◽  
pp. 2170-2173
Author(s):  
Xiao Fei Li
Keyword(s):  
Face Recognition ◽  
Wavelet Transform ◽  
Wavelet Analysis ◽  
Dimensional Space ◽  
Training Data ◽  
High Dimensional ◽  
Analysis Method ◽  
Running Time ◽  
Fuzzy C Means ◽  
Low Dimensional

The popular approaches for face recognition are PCA and LDA methods. But PCA could not capture the simplest invariance unless information is explicitly provided in the training data and LDA approach suffers from a small size problem. 2DPCA could reduce high dimensional data to a low-dimensional space.2DLDA could extract the proper features from image matrices based on LDA. Ensemble incomplete wavelet analysis method for face recognition is proposed based on improved fuzzy C-Means in this paper. The method proposed shows that it improves the accuracy and reduces the running time.

IMPROVEMENT OF IMAGE CLASSIFICATION USING WAVELET COEFFICIENTS WITH STRUCTURED-BASED NEURAL NETWORK

2008 ◽  
Vol 18 (03) ◽  
pp. 195-205 ◽  
Author(s):  
WEIBAO ZOU ◽  
ZHERU CHI ◽  
KING CHUEN LO
Keyword(s):  
Neural Network ◽  
Wavelet Analysis ◽  
Image Classification ◽  
Dimensional Space ◽  
Training Data ◽  
Wavelet Coefficients ◽  
Classification Rate ◽  
Data Set ◽  
Low Dimensional ◽  
High Level

Image classification is a challenging problem in organizing a large image database. However, an effective method for such an objective is still under investigation. A method based on wavelet analysis to extract features for image classification is presented in this paper. After an image is decomposed by wavelet, the statistics of its features can be obtained by the distribution of histograms of wavelet coefficients, which are respectively projected onto two orthogonal axes, i.e., x and y directions. Therefore, the nodes of tree representation of images can be represented by the distribution. The high level features are described in low dimensional space including 16 attributes so that the computational complexity is significantly decreased. 2800 images derived from seven categories are used in experiments. Half of the images were used for training neural network and the other images used for testing. The features extracted by wavelet analysis and the conventional features are used in the experiments to prove the efficacy of the proposed method. The classification rate on the training data set with wavelet analysis is up to 91%, and the classification rate on the testing data set reaches 89%. Experimental results show that our proposed approach for image classification is more effective.

scholarly journals Locally Linear Discriminate Embedding for Face Recognition

2009 ◽  
Vol 2009 ◽  
pp. 1-8 ◽  
Author(s):  
Eimad E. Abusham ◽  
E. K. Wong
Keyword(s):  
Face Recognition ◽  
Dimensional Space ◽  
Linear Structure ◽  
Data Representation ◽  
High Dimensional ◽  
Fast Processing ◽  
Novel Method ◽  
Computational Simplicity ◽  
Low Dimensional ◽  
Locally Linear

A novel method based on the local nonlinear mapping is presented in this research. The method is called Locally Linear Discriminate Embedding (LLDE). LLDE preserves a local linear structure of a high-dimensional space and obtains a compact data representation as accurately as possible in embedding space (low dimensional) before recognition. For computational simplicity and fast processing, Radial Basis Function (RBF) classifier is integrated with the LLDE. RBF classifier is carried out onto low-dimensional embedding with reference to the variance of the data. To validate the proposed method, CMU-PIE database has been used and experiments conducted in this research revealed the efficiency of the proposed methods in face recognition, as compared to the linear and non-linear approaches.

scholarly journals Energy Analysis Method Based on Wavelet Transform for Sensor Fault Diagnosis

2011 ◽  
Vol 2-3 ◽  
pp. 117-122 ◽  
Author(s):  
Peng Peng Qian ◽  
Jin Guo Liu ◽  
Wei Zhang ◽  
Ying Zi Wei
Keyword(s):  
Wavelet Transform ◽  
Fault Diagnosis ◽  
Wavelet Analysis ◽  
Energy Analysis ◽  
Sensor Faults ◽  
Analysis Method ◽  
Sensor Fault ◽  
Fault Type ◽  
Ideal Tool ◽  
Non Stationary Signal

Wavelet analysis with its unique features is very suitable for analyzing non-stationary signal, and it can also be used as an ideal tool for signal processing in fault diagnosis. The characteristics of the faults and the necessary information on the diagnosis can be constructed and extracted respectively by wavelet analysis. Though wavelet analysis is specialized in characteristics extraction, it can not determine the fault type. So this paper has proposed an energy analysis method based on wavelet transform. Experiment results show the method is very effective for sensor fault diagnosis, because it can not only detect the sensor faults, but also determine the fault type.

scholarly journals Discovering a sparse set of pairwise discriminating features in high-dimensional data

2020 ◽  
Author(s):  
Samuel Melton ◽  
Sharad Ramanathan
Keyword(s):  
Single Cell ◽  
Dimensional Space ◽  
Cell Types ◽  
Dimensional Subspace ◽  
Supplementary Information ◽  
High Dimensional ◽  
Technological Advances ◽  
Data Points ◽  
Low Dimensional ◽  
Sparse Set

Abstract Motivation Recent technological advances produce a wealth of high-dimensional descriptions of biological processes, yet extracting meaningful insight and mechanistic understanding from these data remains challenging. For example, in developmental biology, the dynamics of differentiation can now be mapped quantitatively using single-cell RNA sequencing, yet it is difficult to infer molecular regulators of developmental transitions. Here, we show that discovering informative features in the data is crucial for statistical analysis as well as making experimental predictions. Results We identify features based on their ability to discriminate between clusters of the data points. We define a class of problems in which linear separability of clusters is hidden in a low-dimensional space. We propose an unsupervised method to identify the subset of features that define a low-dimensional subspace in which clustering can be conducted. This is achieved by averaging over discriminators trained on an ensemble of proposed cluster configurations. We then apply our method to single-cell RNA-seq data from mouse gastrulation, and identify 27 key transcription factors (out of 409 total), 18 of which are known to define cell states through their expression levels. In this inferred subspace, we find clear signatures of known cell types that eluded classification prior to discovery of the correct low-dimensional subspace. Availability and implementation https://github.com/smelton/SMD. Supplementary information Supplementary data are available at Bioinformatics online.

SUBSPACE LEARNING BASED ON LAPLACIAN EIGENMAPS AND LDA FOR FACE RECOGNITION

2006 ◽  
Vol 03 (01) ◽  
pp. 45-51
Author(s):  
YANWEI PANG ◽  
ZHENGKAI LIU ◽  
YUEFANG SUN
Keyword(s):  
Face Recognition ◽  
Subspace Learning ◽  
Dimensional Subspace ◽  
Training Data ◽  
Objective Functions ◽  
Recognition Method ◽  
Laplacian Eigenmaps ◽  
Linear Discriminant ◽  
Structure Information ◽  
Low Dimensional

Subspace-based face recognition method aims to find a low-dimensional subspace of face appearance embedded in a high-dimensional image space. The differences between different methods lie in their different motivations and objective functions. The objective function of the proposed method is formed by combining the ideas of linear Laplacian eigenmaps and linear discriminant analysis. The actual computation of the subspace reduces to a maximum eigenvalue problem. Major advantage of the proposed method over traditional methods is that it utilizes both local manifold structure information and discriminant information of the training data. Experimental results on the AR face databases demonstrate the effectiveness of the proposed method.

Research on Goniometer Fault Detection of a Certain Missile Based on Wavelet Analysis

2012 ◽  
Vol 490-495 ◽  
pp. 1600-1604
Author(s):  
Zhu Lin Wang ◽  
Jiang Kun Mao ◽  
Zi Bin Zhang ◽  
Xi Wei Guo
Keyword(s):  
Wavelet Transform ◽  
Wavelet Analysis ◽  
Discrete Wavelet Transform ◽  
Frequency Analysis ◽  
Discrete Wavelet ◽  
Analysis Method ◽  
Frequency Method ◽  
Time Frequency Analysis ◽  
Time Frequency ◽  
Fault Characteristic

Aiming at the problem of existing time-frequency analysis methods was not effective to goniometer keeping fault of a certain missile, combined time -frequency analysis method of CWT and DWT for the fault was put forward based on the fault characteristic. The process of the method proposed was given and the time-frequency method of continuous and discrete wavelet transform was analysed. The signal when goniometer keeping fault occurred was analysed by the method that was put forward. The simulation showed that the method which was effective to the fault detecting could accurately detect the time and location of goniometer fault occurred.

Research of Feature Extraction Method on Facial Expression Change

2011 ◽  
Vol 211-212 ◽  
pp. 813-817 ◽  
Author(s):  
Jin Qing Liu ◽  
Qun Zhen Fan
Keyword(s):  
Feature Extraction ◽  
Wavelet Transform ◽  
Facial Expression ◽  
Extraction Method ◽  
Dimensional Space ◽  
Recognition Rate ◽  
Low Frequency ◽  
Expression Change ◽  
Feature Extraction Method ◽  
Low Dimensional

In this paper, the purpose is to find a method that can be more suited to facial expression change and also improve the recognition rate. The proposed system contains three parts, wavelet transform, Fisher linear discriminant method feature extraction and face classification. The basic idea of the proposed method is that first extract the low-frequency components through wavelet transform, then the low-frequency images mapped into a low-dimensional space by PCA transform, and finally the utilization of LDA feature extraction method in low-dimensional space. The algorithms were tested on ORL and Yale face database, respectively. Experimental results shows that the proposed method not only improve the recognition rate, but also improve the recognition speed. This method can effectively overcome the impact of expression changes on face recognition, and play a certain role in inhibition of expression.

Extracting principal parameters of complex networks

2015 ◽  
Vol 26 (09) ◽  
pp. 1550103
Author(s):  
Yifang Ma ◽  
Zhiming Zheng
Keyword(s):  
Dynamic Systems ◽  
Growth Process ◽  
Dimensional Space ◽  
High Dimensional ◽  
Scale Function ◽  
Control Parameters ◽  
Diffusion Matrix ◽  
Similarity Relations ◽  
Low Dimensional ◽  
Network Ensembles

The evolution of networks or dynamic systems is controlled by many parameters in high-dimensional space, and it is crucial to extract the reduced and dominant ones in low-dimensional space. Here we consider the network ensemble, introduce a matrix resolvent scale function and apply it to a spectral approach to get the similarity relations between each pair of networks. The concept of Diffusion Maps is used to get the principal parameters, and we point out that the reduced dimensional principal parameters are captured by the low order eigenvectors of the diffusion matrix of the network ensemble. We validate our results by using two classical network ensembles and one dynamical network sequence via a cooperative Achlioptas growth process where an abrupt transition of the structures has been captured by our method. Our method provides a potential access to the pursuit of invisible control parameters of complex systems.

Cost-Sensitive Sparsity Preserving Projections for Face Recognition

2013 ◽  
Vol 760-762 ◽  
pp. 1615-1620 ◽  
Author(s):  
Xiao Yuan Jing ◽  
Wen Qian Li ◽  
Hao Gao ◽  
Yong Fang Yao ◽  
Jiang Yue Man
Keyword(s):  
Face Recognition ◽  
Sparse Representation ◽  
Dimensional Space ◽  
Recognition Rate ◽  
Recognition Task ◽  
Cost Information ◽  
The Public ◽  
Sparsity Preserving Projection ◽  
Low Dimensional ◽  
The Cost

As one of the most popular research topics, sparse representation (SR) technique has been successfully employed to solve face recognition task. Though current SR based methods prove to achieve high classification accuracy, they implicitly assume that the losses of all misclassifications are the same. However, in many real-world face recognition applications, this assumption may not hold as different misclassifications could lead to different losses. Driven by this concern, in this paper, we propose a cost-sensitive sparsity preserving projections (CSSPP) for face recognition. CSSPP considers the cost information of sparse representation while calculating the sparse structure of the training set. Then, CSSPP employs the sparsity preserving projection method to achieve the projection transform and keeps the sparse structure in the low-dimensional space. Experimental results on the public AR and FRGC face databases are presented to demonstrate that both of the proposed approaches can achieve high recognition rate and low misclassification loss, which validate the efficacy of the proposed approach.

scholarly journals SCDRHA: A scRNA-Seq Data Dimensionality Reduction Algorithm Based on Hierarchical Autoencoder

2021 ◽  
Vol 12 ◽  
Author(s):  
Jianping Zhao ◽  
Na Wang ◽  
Haiyun Wang ◽  
Chunhou Zheng ◽  
Yansen Su
Keyword(s):  
Dimensionality Reduction ◽  
Data Visualization ◽  
State Of The Art ◽  
Dimensional Space ◽  
High Dimensional ◽  
Reduction Algorithm ◽  
Cell Clustering ◽  
Data Dimensionality Reduction ◽  
Single Cell Rna Sequencing ◽  
Low Dimensional

Dimensionality reduction of high-dimensional data is crucial for single-cell RNA sequencing (scRNA-seq) visualization and clustering. One prominent challenge in scRNA-seq studies comes from the dropout events, which lead to zero-inflated data. To address this issue, in this paper, we propose a scRNA-seq data dimensionality reduction algorithm based on a hierarchical autoencoder, termed SCDRHA. The proposed SCDRHA consists of two core modules, where the first module is a deep count autoencoder (DCA) that is used to denoise data, and the second module is a graph autoencoder that projects the data into a low-dimensional space. Experimental results demonstrate that SCDRHA has better performance than existing state-of-the-art algorithms on dimension reduction and noise reduction in five real scRNA-seq datasets. Besides, SCDRHA can also dramatically improve the performance of data visualization and cell clustering.

Sign in / Sign up

Export Citation Format

Share Document