27,634 research outputs found
Optimizing Face Recognition Using PCA
Principle Component Analysis PCA is a classical feature extraction and data
representation technique widely used in pattern recognition. It is one of the
most successful techniques in face recognition. But it has drawback of high
computational especially for big size database. This paper conducts a study to
optimize the time complexity of PCA (eigenfaces) that does not affects the
recognition performance. The authors minimize the participated eigenvectors
which consequently decreases the computational time. A comparison is done to
compare the differences between the recognition time in the original algorithm
and in the enhanced algorithm. The performance of the original and the enhanced
proposed algorithm is tested on face94 face database. Experimental results show
that the recognition time is reduced by 35% by applying our proposed enhanced
algorithm. DET Curves are used to illustrate the experimental results.Comment: 9 page
Ultra Low-Complexity Detection of Spectrum Holes in Compressed Wideband Spectrum Sensing
Wideband spectrum sensing is a significant challenge in cognitive radios
(CRs) due to requiring very high-speed analog- to-digital converters (ADCs),
operating at or above the Nyquist rate. Here, we propose a very low-complexity
zero-block detection scheme that can detect a large fraction of spectrum holes
from the sub-Nyquist samples, even when the undersampling ratio is very small.
The scheme is based on a block sparse sensing matrix, which is implemented
through the design of a novel analog-to- information converter (AIC). The
proposed scheme identifies some measurements as being zero and then verifies
the sub-channels associated with them as being vacant. Analytical and
simulation results are presented that demonstrate the effectiveness of the
proposed method in reliable detection of spectrum holes with complexity much
lower than existing schemes. This work also introduces a new paradigm in
compressed sensing where one is interested in reliable detection of (some of
the) zero blocks rather than the recovery of the whole block sparse signal.Comment: 7 pages, 5 figure
Inverse Projection Representation and Category Contribution Rate for Robust Tumor Recognition
Sparse representation based classification (SRC) methods have achieved
remarkable results. SRC, however, still suffer from requiring enough training
samples, insufficient use of test samples and instability of representation. In
this paper, a stable inverse projection representation based classification
(IPRC) is presented to tackle these problems by effectively using test samples.
An IPR is firstly proposed and its feasibility and stability are analyzed. A
classification criterion named category contribution rate is constructed to
match the IPR and complete classification. Moreover, a statistical measure is
introduced to quantify the stability of representation-based classification
methods. Based on the IPRC technique, a robust tumor recognition framework is
presented by interpreting microarray gene expression data, where a two-stage
hybrid gene selection method is introduced to select informative genes.
Finally, the functional analysis of candidate's pathogenicity-related genes is
given. Extensive experiments on six public tumor microarray gene expression
datasets demonstrate the proposed technique is competitive with
state-of-the-art methods.Comment: 14 pages, 19 figures, 10 table
- …