Feature fusion of palmprint and face via tensor analysis and curvelet transform

In order to improve the recognition accuracy of the unimodal biometric system and to address the problem of the small samples recognition, a multimodal biometric recognition approach based on feature fusion level and curve tensor is proposed in this paper. The curve tensor approach is an extension of the tensor analysis method based on curvelet coefficients space. We use two kinds of biometrics: palmprint recognition and face recognition. All image features are extracted by using the curve tensor algorithm and then the normalized features are combined at the feature fusion level by using several fusion strategies. The k-nearest neighbour (KNN) classifier is used to determine the final biometric classification. The experimental results demonstrate that the proposed approach outperforms the unimodal solution and the proposed nearly Gaussian fusion (NGF) strategy has a better performance than other fusion rules.     

Semi-supervised kernel learning based optical image recognition

This paper is to propose semi-supervised kernel learning based optical image recognition, called Semi-supervised Graph-based Global and Local Preserving Projection (SGGLPP) through integrating graph construction with the specific DR process into one unified framework. SGGLPP preserves not only the positive and negative constraints but also the local and global structure of the data in the low dimensional space. In SGGLPP, the intrinsic and cost graphs are constructed using the positive and negative constraints from side-information and k nearest neighbor criterion from unlabeled samples. Moreover, kernel trick is applied to extend SGGLPP called KSGGLPP by on the performance of nonlinear feature extraction. Experiments are implemented on UCI database and two real image databases to testify the feasibility and performance of the proposed algorithm.     

基于局部保持投影的掌纹识别

为了保持掌纹空间的局部结构,运用局部保持投影(LPP)方法进行掌纹识别.在小样本图像识别中,特征方程矩阵存在奇异性.传统的解决方法是运用主元分析(PCA)获得原样本的低维特征子空间,在该空间中运用LPP进行特征提取.由于PCA和LPP的投影标准本质上是不同的,PCA降维时丢失许多重要的判别信息.为了解决这个问题,提出运用三级小波变换、图像下抽样、图像分块求平均值三种方法降低掌纹空间的维数,在低维图像上应用LPP提取局部特征.计算特征矢量间的余弦距离进行掌纹匹配.运用PolyU掌纹图像库进行测试,结果表明,该算法的识别性能均优于PCA和PCA LPP.特征提取和匹配总时间小于0.1 S,具有快速、有效、易于实现等优点.     

Palmprint recognition method based on score level fusion

Different palmprint recognition methods have different advantages. The texture- and feature-based palmprint recognition methods can well exploit the minutiae of the palmprint but are not very robust to the possible variation such as the rotation and shift of the palm. The representation-based palmprint recognition method can well take advantage of the holistic information but seems not to be able to fully exploit the minutiae of the palmprint. In this paper, we propose to fuse the competitive coding method and two-phase test sample sparse representation (TPTSR) method for palmprint recognition. As one of representation-based methods, TPTSR method takes the whole palmprint image as the input and determines the contribution of the training samples of each class in representing the test sample. TPTSR also uses the contribution to calculate the similarities between the test sample and every class. The competitive coding method is a feature-based method and is highly complementary with TPTSR. We use a weighted fusion scheme to combine the matching scores generated from TPTSR and the competitive coding method. The experimental results show that the proposed method can obtain a very high classification accuracy and outperforms both TPTSR and the competitive coding method.     

基于核独立成分分析的人脸识别

研究一种基于核独立成分分析的人脸识别方法。利用支持向量机的核函数思想,将原始人脸图像向量映射到高维特征空间,然后在高维特征空间中进行独立成分分析(ICA),提取非线性独立成分作为特征向量进行分类识别。实验结果表明该方法要比常规的基于ICA和PCA的人脸识别算法的识别率要高。     

A sparse representation method based on kernel and virtual samples for face recognition

To improve the classification accuracy of face recognition, a sparse representation method based on kernel and virtual samples is proposed in this paper. The proposed method has the following basic idea: first, it extends the training samples by copying the left side of the original training samples to the right side to form virtual training samples. Then the virtual training samples and the original training samples make up a new training set and we use a kernel-induced distance to determine M nearest neighbors of the test sample from the new training set. Second, it expresses the test sample as a linear combination of the selected M nearest training samples and finally exploits the determined linear combination to perform classification of the test sample. A large number of face recognition experiments on different face databases illustrate that the error ratios obtained by our method are always lower more or less than face recognition methods including the method mentioned in Xu and Zhu [21], the method proposed in Xu and Zhu [39], sparse representation method based on virtual samples (SRMVS), collaborative representation based classification with regularized least square (CRC_RLS), two-phase test sample sparse representation (TPTSSR), and the feature space-based representation method.     

嗓音多频带非线性分析的声带病变识别

提出了一种嗓音多频带非线性分析的声带病变识别方法,以提高声带病变嗓音的识别率。首先采用Gammatone听觉滤波器组对嗓音信号进行滤波,求取每个频带下的最大李雅普诺夫指数;对映射到核空间的数据采用高斯最大似然度准则优化核函数,然后采用优化核主成分分析算法实现特征抽取。识别实验表明,多频带最大李雅普诺夫指数的识别率比传统的MFCC和最大李雅普诺夫指数分别有6.52%和8.45%的提高,且采用优化核主成分分析算法比传统核主成分分析算法有更好的抽取效果.将多频带非线性分析和优化核主成分分析算法结合,识别率提升至97.82%。     

Improve the two-phase test samples representation method for palmprint recognition

Palmprint recognition, as a very important personal identification technology, is taking more and more attention. A recently proposed method – two-phase test samples representation method (TPTSR) has attracted much attention and performed very well in biometrics. The TPTSR not only is a competent representation-based classification method, but also is computationally much more efficient than the original sparse representation methods. However, though the TPTSR seems to be suitable for palmprint recognition, it has not been widely tested and it is not known how to properly set the parameter (the number of the nearest neighbors), which is definitely crucial for real-world applications. This paper will analyze the performance of the method in the palmprint identification for the first time and explore the proper value of the parameter of the method. In order to address the above issues, lots of experiments on the palmprint recognition are conducted. This paper also shows experimental comparisons between TPTSR and several other methods. This paper provides significant instructions apply TPTSR to palmprint recognition.     

核覆盖算法在光谱分类问题中的研究

针对光谱分类,提出了一种基于核技巧的覆盖算法——核覆盖算法。该算法将核技巧与覆盖算法相结合,并在特征空间中抽取支持向量。实验表明核覆盖算法在光谱分类中的精度与SVM相差不大,但是它只涉及距离的计算,不必象SVM那样求解二次规划问题,对于核宽的选择也不象SVM那样非常敏感。核覆盖算法与覆盖算法相比分类性能相当,它的优势在于引入的非线性映射Φ改变了样本集在特征空间中之间的距离关系,使得核覆盖算法得到的支持向量个数大大少于覆盖算法。     

基于小波核偏最小二乘回归方法的混沌系统建模研究

基于核学习的强大非线性映射能力,结合用于回归建模的线性偏最小二乘(PLS)算法,提出一种小波核偏最小二乘(WKPLS)回归方法. 该方法基于支持向量机使用的经典核函数技巧,将输入映射到高维非线性的特征空间,在特征空间中,构造线性的PLS回归模型. PLS方法利用输入与输出变量之间的协方差信息提取潜在特征,而可允许的小波核函数具有近似正交以及适用于信号局部分析的特性. 因此,结合它们优点的WKPLS方法显示了更好的非线性建模性能. 将WKPLS方法应用在非线性混沌动力系统建模上,并与基于高斯核的核偏最小二乘 关键词： 小波核 偏最小二乘回归 混沌系统 建模     

基于多光谱图像融合的掌纹识别方法

生物特征识别在信息安全领域发挥着重要作用,掌纹识别作为一种新型生物特征识别方式,具有低失真、非侵入性和高唯一性等优势。传统掌纹研究大多使用自然光成像系统以灰度格式获取,识别精度很难进一步提升。为了获得更多的身份鉴别信息,提出利用多光谱掌纹图像代替自然光掌纹图像。针对现有掌纹识别算法由于没有考虑到不同光谱的特性而导致纹理细节丢失,识别精准率低的问题,提出了一种基于多光谱图像融合的掌纹识别算法。该方法通过对不同光谱下的掌纹图像进行快速自适应二维经验模式分解（FABEMD）,将多光谱掌纹图像分解成一系列频率由高到低的二维固有模态函数(BIMF)和一个残余分量,残余分量可被视为该光谱图像低频信息的初步估计。图像采集过程中光照条件很难保持稳定,而近红外光谱图像在进行FABEMD分解时对光照变换敏感,容易导致分解后的BIMF背景信息过于冗余;因此对分解后的近红外掌纹图像进行背景重建及特征细化,在对背景冗余信息进行平滑处理的同时可以有效增强高频信息的特征表达。为避免直接融合处理后引发的图像过度曝光问题,提出对近红外特征压缩后再融合。此外,提出了一种结合了注意力机制的改进残差网络（IRCANet）,用于融合后的掌纹图像分类,在网络中引入分阶段残差结构,缓解了网络的退化问题,在学习过程中有效地减少信息丢失,对于融合后的多光谱掌纹图像,分阶段残差结构能够稳定地将图像信息在网络间传输,但对图像中的高低频信息区分效果不够显著,为了使网络关注更多区分性特征,利用特征通道间的相互依赖性,在分阶段残差结构中结合了通道注意力(Channel Attention)机制。最终,在香港理工大学（PolyU）多光谱掌纹数据集上进行的综合实验表明,该方法可以取得良好的效果,算法识别准确率能达到99.67%且具有良好的实时性。     

Speech enhancement method based on low-rank approximation in a reproducing kernel Hilbert space

Speech signal is corrupted unavoidably by noisy environment in subway, factory, and restaurant or speech from other speakers in speech communication. Speech enhancement methods have been widely studied to minimize noise influence in different linear transform domain, such as discrete Fourier transform domain, Karhunen-Loeve transform domain or discrete cosine transform domain. Kernel method as a nonlinear transform has received a lot of interest recently and is commonly used in many applications including audio signal processing. However this kind of method typically suffers from the computational complexity. In this paper, we propose a speech enhancement algorithm using low-rank approximation in a reproducing kernel Hilbert space to reduce storage space and running time with very little performance loss in the enhanced speech. We also analyze the root mean squared error bound between the enhanced vectors obtained by the approximation kernel matrix and the full kernel matrix. Simulations show that the proposed method can improve the computation speed of the algorithm with the approximate performance compared with that of the full kernel matrix.     

基于高斯核主成分分析的多通道拉曼光谱重建

针对多通道拉曼成像系统常会受荧光背景、噪声等非线性因素的影响而导致拉曼光谱重建结果一般的问题,提出了一种基于高斯核主成分分析的拉曼光谱重建算法.首先利用相似度因子对标定样本数据集进行预处理,其次通过高斯核函数将标定样本以非线性形式映射至高维特征空间,接着在特征空间中对映射后的数据集提取基函数并通过伪逆法求得与之对应的基函数系数.使用聚甲基丙烯酸甲酯作为测试样本,并引入均方根误差来评估拉曼光谱重建结果的准确性.实验结果表明,相比传统的伪逆法与维纳估计法,该算法具有更高的重建精度及抗噪能力,且能有效降低标定样本中不良数据和成像系统中非线性因素对拉曼光谱重建的影响.因此,该算法可以为多通道拉曼快速成像提供一种有效的拉曼光谱重建算法.     

非高斯冲激干扰下基于Softplus函数的核自适应滤波算法

针对非高斯环境下一般自适应滤波算法性能严重下降问题,本文提出了一种基于Softplus函数的核分式低次幂自适应滤波算法(kernel fractional lower algorithm based on Softplus function,SP-KFLP),该算法将Softplus函数与核分式低次幂准则相结合,利用输...     

A palmprint recognition method based on multi-step representation

Sparse representation uses all training samples to represent a test sample only once, which can be regarded as a one step representation. However, in palmprint recognition, the appearances of palms are highly correlated which means the information provided by all the training samples are redundant while using the representation-based methods. Hence, how to obtain suitable samples for representation deserves exploring. In this paper, we devise a multi-step representation manner to extract the most representative samples for representation and recognition. In addition, the proposed sample selection strategy is based on contributions of the classes, not merely the effort of a single sample. Compared with some other appearance-based methods, the proposed method obtained a competitive result on PolyU multispectral palmprint database.     

Silhouette Analysis for Performance Evaluation in Machine Learning with Applications to Clustering

Grouping the objects based on their similarities is an important common task in machine learning applications. Many clustering methods have been developed, among them k-means based clustering methods have been broadly used and several extensions have been developed to improve the original k-means clustering method such as k-means ++ and kernel k-means. K-means is a linear clustering method; that is, it divides the objects into linearly separable groups, while kernel k-means is a non-linear technique. Kernel k-means projects the elements to a higher dimensional feature space using a kernel function, and then groups them. Different kernel functions may not perform similarly in clustering of a data set and, in turn, choosing the right kernel for an application could be challenging. In our previous work, we introduced a weighted majority voting method for clustering based on normalized mutual information (NMI). NMI is a supervised method where the true labels for a training set are required to calculate NMI. In this study, we extend our previous work of aggregating the clustering results to develop an unsupervised weighting function where a training set is not available. The proposed weighting function here is based on Silhouette index, as an unsupervised criterion. As a result, a training set is not required to calculate Silhouette index. This makes our new method more sensible in terms of clustering concept.     

Statistical modeling of speech Poincaré sections in combination of frequency analysis to improve speech recognition performance

This paper introduces a combinational feature extraction approach to improve speech recognition systems. The main idea is to simultaneously benefit from some features obtained from Poincare? section applied to speech reconstructed phase space (RPS) and typical Mel frequency cepstral coefficients (MFCCs) which have a proved role in speech recognition field. With an appropriate dimension, the reconstructed phase space of speech signal is assured to be topologically equivalent to the dynamics of the speech production system, and could therefore include information that may be absent in linear analysis approaches. Moreover, complicated systems such as speech production system can present cyclic and oscillatory patterns and Poincare? sections could be used as an effective tool in analysis of such trajectories. In this research, a statistical modeling approach based on Gaussian mixture models (GMMs) is applied to Poincare? sections of speech RPS. A final pruned feature set is obtained by applying an efficient feature selection approach to the combination of the parameters of the GMM model and MFCC-based features. A hidden Markov model-based speech recognition system and TIMIT speech database are used to evaluate the performance of the proposed feature set by conducting isolated and continuous speech recognition experiments. By the proposed feature set, 5.7% absolute isolated phoneme recognition improvement is obtained against only MFCC-based features.     

A framework for classification with single feature kernel matrix

In this paper, we propose a novel classification framework using single feature kernel matrix. Different from the traditional kernel matrices which make use of the whole features of samples to build the kernel matrix, this research uses features of the same dimension of any two samples to build a sub-kernel matrix and sums up all the sub-kernel matrices to get the single feature kernel matrix. We also use single feature kernel matrix to build a new SVM classifier, and adapt SMO (Sequential Minimal Optimization) algorithm to solve the problem of SVM classifier. The results of the experiments on several artificial datasets and some challenging public cancer datasets display the classification performance of the algorithm. The comparisons between our algorithm and L₂-norm SVM on the cancer datasets demonstrate that the accuracy of our algorithm is higher, and the number of support vectors selected is fewer, indicating that our proposed framework is a more practical approach.     

多重分形在掌纹识别中的研究

通过对掌纹的概率密度分布和配分函数的分析，得到掌纹分布具有一定的多重分形性.进一步求取掌纹多重分形谱的宽度、极大值以及谱曲线的不对称程度，并提出以这些参数作为掌纹识别的特征量.这可能为多重分形理论在生物特征识别领域中的应用带来新的思路与方法. 关键词： 分形 模式识别