Virtual images inspired consolidate collaborative representation-based classification method for face recognition

Abstract

The collaborative representation-based classification method performs well in the field of classification of high-dimensional images such as face recognition. It utilizes training samples from all classes to represent a test sample and assigns a class label to the test sample using the representation residuals. However, this method still suffers from the problem that limited number of training sample influences the classification accuracy when applied to image classification. In this paper, we propose a modified collaborative representation-based classification method (MCRC), which exploits novel virtual images and can obtain high classification accuracy. The procedure to produce virtual images is very simple but the use of them can bring surprising performance improvement. The virtual images can sufficiently denote the features of original face images in some case. Extensive experimental results doubtlessly demonstrate that the proposed method can effectively improve the classification accuracy. This is mainly attributed to the integration of the collaborative representation and the proposed feature-information dominated virtual images.     

Improving representation-based classification for robust face recognition

The sparse representation classification (SRC) method proposed by Wright et al. is considered as the breakthrough of face recognition because of its good performance. Nevertheless it still cannot perfectly address the face recognition problem. The main reason for this is that variation of poses, facial expressions, and illuminations of the facial image can be rather severe and the number of available facial images are fewer than the dimensions of the facial image, so a certain linear combination of all the training samples is not able to fully represent the test sample. In this study, we proposed a novel framework to improve the representation-based classification (RBC). The framework first ran the sparse representation algorithm and determined the unavoidable deviation between the test sample and optimal linear combination of all the training samples in order to represent it. It then exploited the deviation and all the training samples to resolve the linear combination coefficients. Finally, the classification rule, the training samples, and the renewed linear combination coefficients were used to classify the test sample. Generally, the proposed framework can work for most RBC methods. From the viewpoint of regression analysis, the proposed framework has a solid theoretical soundness. Because it can, to an extent, identify the bias effect of the RBC method, it enables RBC to obtain more robust face recognition results. The experimental results on a variety of face databases demonstrated that the proposed framework can improve the collaborative representation classification, SRC, and improve the nearest neighbor classifier.     

Face recognition based on symmetrical virtual image and original training image

In face representation-based classification methods, we are able to obtain high recognition rate if a face has enough available training samples. However, in practical applications, we only have limited training samples to use. In order to obtain enough training samples, many methods simultaneously use the original training samples and corresponding virtual samples to strengthen the ability of representing the test sample. One is directly using the original training samples and corresponding mirror samples to recognize the test sample. However, when the test sample is nearly symmetrical while the original training samples are not, the integration of the original training and mirror samples might not well represent the test samples. To tackle the above-mentioned problem, in this paper, we propose a novel method to obtain a kind of virtual samples which are generated by averaging the original training samples and corresponding mirror samples. Then, the original training samples and the virtual samples are integrated to recognize the test sample. Experimental results on five face databases show that the proposed method is able to partly overcome the challenges of the various poses, facial expressions and illuminations of original face image.     

分块稀疏表示和2DPCA的人脸识别方法

稀疏表示提出了一种分块稀疏表示和二维主成分分析(2DPCA)的人脸识别方法.该方法应用了逐像素分块的与2DPCA技术相结合的方式,充分地考虑了图像中相邻的多个像素间的相关性.实验结果表明,其中提出的新算法具有可行性以及在识别精度上的优越性.进一步的研究还表明,所提出的分块识别的方法较之于以往传统算法在存在位置偏移、单色遮挡问题的人脸图像误判率上也有显著降低.     

A supervised dimensionality reduction method-based sparse representation for face recognition

The sparse representation-based classification (SRC) method is a powerful tool to present high-dimensionality data and its superiority in many fields, especially in face recognition application has been proved. With sparsity appropriately harnessed, the SRC can solve face classification problems caused by varying expression, illumination as well as occlusion and disguise. However, face images as high-dimensionality data are usually noisy and the dimensionality is always larger than the number of training sample in real-world applications, which bring a disadvantage for the performance of SRC. Therefore, it is beneficial to perform dimensionality reduction (DR) before utilizing the SRC method. But most prevalent DR methods have no direct connection to SRC. In this paper, we proposed a supervised DR algorithm which suits SRC well and improves the discriminating ability in the low-dimensionality space. The proposed method utilizes the fisher discriminant criterion and low-dimensionality reconstructive restriction to extract the discriminating structure of data. The extensive experiments on public face databases verified the effectiveness of the supervised DR with the model of sparse representation.     

基于小波纹理的文种改进算法

基于小波纹理分析的文种识别方法，提取的是文档图像的整体特征，具有算法简单、处理较快的特点。我们对这种算法进行了改进，使用可变阈值代替距离公式，使得判决结果可按用户的意愿调节，并增加了拒识功能，用1420幅图进行实验，得到的准确率是76．40％。     

采用改进的基于余量的算法实现人脸识别中最佳Gabor特征的选择

基于2DGabor变换的人脸特征描述已经受到了很多人的关注。然而现有的Gabor特征维数较高,而且具有冗余性,因此选择最佳的Gabor特征用于人脸识别显得尤为的重要。利用最大余量原理的特征选择算法在目前的机器学习研究中已经占据了重要的地位。本文在基于余量的迭代搜索法(Simba)的基础上,引入了一种新的选择算法:基于余量的共轭梯度法(Cgmba),它只需较少次迭代就可以找到最佳解。我们在IMM人脸库上进行了实验,实验结果表明:尽管只使用了一半不到的特征,但Cgmba和Simba的识别率却分别提高了3.75和1.25个百分点,同时也证实了我们提出的Cgmba明显优于Simba。最后我们对Cgmba选择的Gabor特征的分布情况进行了分析,可以看出较大尺度的特征相对于较小尺度的特征对于分辩人脸的细微差别具有同等的重要性,而且在垂直,135°方向的特征具有更强的分辩能力。     

采用ASPCM模型进行姿势鲁棒性人脸识别

提出ASPCM模型,并将其用于不同姿势下的人脸识别。对人脸图像的形状表示和纹理表示进行主成分分析,建立形状模型和纹理模型;以形状参数、纹理参数和姿势参数间的转换确定人脸图像与头部角度间的映射关系;使用精确性和概括性两个标准衡量ASPCM模型的分解性能和合成性能;根据平均纹理相似度判断输入图像与模型视图间的相似程度。实验表明,该模型分解性能的精确性误差和概括性误差均在1.85°以内;合成性能的这两种误差均在1.1个像素以内;精确性和概括性的平均纹理相似度均在95.8%以上;当头部转动角度在25°以内时,该模型的识别率达到100%。     

人脸识别的一种新的特征提取方法

针对人脸识别中判别特征的提取问题,本文提出了一种新的人脸识别算法—扩展保局投影（ELPP）。普通保局投影（LPP）在构建权图时侧重保持样本的局部结构,属于无监督学习算法。扩展保局投影在保局投影的基础上进行扩展,通过引入可调因子,在保持人脸图像局部流形结构的同时考虑样本的类别信息,从而充分提取样本的判别特征。本文采用最小近邻分类器估算识别率。在Yale人脸库以及AT＆T人脸库的测试结果表明,在姿态、光照、表情、训练样本数目变化的情况下,ELPP都具有较好的识别率。     

基于虚拟试验箱的康复手势识别算法研究

研究了基于自主研发的手部康复训练系统的康复手势识别方法。针对现有手势识别算法识别手势过于单一、不具备针对性的问题,通过对手部功能障碍患者的手部运动及控制力的分析,提出了一种新的基于虚拟试验箱的康复手势识别算法。该算法的核心是利用摄像头捕捉不同的康复手势,并通过辅助训练标志板来实现手和辅助康复器械定位。基于改进的形状上下文识别算法的处理器实现了康复手势识别功能,并进一步控制虚拟场景中的物体做出相应的反应。该算法可以完成推、拉、悬垂、托举、二指捏等典型康复手势的准确识别,并与现有的手势识别算法进行了准确的对比。实验结果表明,该算法在识别率上有一定的提高,并且在识别的手势上更具有针对性。     

Combination of direct matching and collaborative representation for face recognition

Difficulties associated with the use of Buchdahl's retardation coefficients in image assessment are examined. It is shown that, by a series of approximations and corresponding transformations, the set of coordinates of transmitted rays from any object point can be expressed as a circular region perpendicular to the optical axis. Furthermore, it is shown that, under these transformations, the form of the retardation expansion remains constant and only the coefficients need be altered. These changes are independent of the field angle, but depend on the f-number of the system. The coefficients thus derived are field-independent in contrast to those specified by most authors. Expressions for the coefficients under each of the transformations introduced are presented. Also a brief discussion of the convergence of the retardation expansion is presented and the results indicate that the above approximations are sound over the region of convergence of the truncated aberration expansion of order eight.     

共享空间基-逐类剩余空间基混合稀疏表示人脸识别算法

针对传统训练样本字典学习未利用类共有信息的不足,引入共享空间和与类别相关的剩余空间,提出了共享空间基-逐类剩余空间基混合稀疏表示人脸识别的算法。该算法首先提取训练样本主成分分析(PCA)特征,获取无标记的共享空间基及其重构样本得到类共有信息;然后结合原始样本得到差分训练集合,并引入类间差异信息构建逐类特异性剩余空间基;最后融合共享空间基和剩余空间基,利用残差判别函数完成模式分类。该方法不仅利用混合空间的正交特性,而且发挥剩余空间的鉴别能力和共享信息稀疏逼近的作用,使结构性字典和模式分类紧密结合。该方法的有效性,分别通过用AR、CMU PIE、Extended Yale B人脸数据库进行的实验得到验证。     

基于切割子模块的单样本人脸识别

针对单样本人脸识别问题,本文提出了一种基于单样本切割的子模块主成分分析方法.该方法将单样本人脸图片切割成大小相同、互不重叠的多个子模块,切割后的子模块集构成新的样本集.对所有子模块作主成分分析(PCA)并提取特征,同一人脸的子模块特征系数作为分类识别的依据.在ORL人脸库上的测试结果表明,同PCA,(PC)2A,Sub-pattern LDA相比,该方法具有更好的识别率.     

一种改进的自然纹理合成方法

自然纹理合成方法是一种适合自然景物的基于样图的快速纹理合成方法。但是候选点超越样图边界的问题没有很好得到解决,成为导致合成后图像产生的纹理块间明显变化的主要因素。论文提出了一种改进的自然纹理合成算法,将样图边缘易产生无效候选点的区域用样图内部与之大小和形状相同的像素块来代替,像素块和被替代像素块沿一条不规则的曲线相匹配。合成过程中在接近边缘时像素块的生长会转向纹理内部。该方法减少了因随机产生候选点而形成的块间不连续,有效地改善了视觉效果。     

改进的基于人眼结构特征的虹膜识别方法

本文提出了一种改进的基于人眼结构特征的虹膜识别方法,基本思想是:首先,通过图像预处理,确定虹膜的位置和大小,将环形虹膜图像展开成矩形并进行归一化与图像增强;其次,利用局部灰度极小值的方法寻找有效虹膜区域内的特征点,依据纹理长度和方向信息去掉伪特征点,得到虹膜二进制编码;最后根据匹配准则进行识别.大量实验表明,该方法识别率高,识别时间短.     

An improved label fusion approach with sparse patch‐based representation for MRI brain image segmentation

The multi‐atlas patch‐based label fusion (LF) method mainly focuses on the measurement of the patch similarity which is the comparison between the atlas patch and the target patch. To enhance the LF performance, the distribution probability about the target can be used during the LF process. Hence, we consider two LF schemes: in the first scheme, we keep the results of the interpolation so that we can obtain the labels of the atlas with discrete values (between 0 and 1) instead of binary values in the label propagation. In doing so, each atlas can be treated as a probability atlas. Second, we introduce the distribution probability of the tissue (to be segmented) in the sparse patch‐based LF process. Based on the probability of the tissue and sparse patch‐based representation, we propose three different LF methods which are called LF‐Method‐1, LF‐Method‐2, and LF‐Method‐3. In addition, an automated estimation method about the distribution probability of the tissue is also proposed. To evaluate the accuracy of our proposed LF methods, the methods were compared with those of the nonlocal patch‐based LF method (Nonlocal‐PBM), the sparse patch‐based LF method (Sparse‐PBM), majority voting method, similarity and truth estimation for propagated segmentations, and hierarchical multi‐atlas LF with multi‐scale feature representation and label‐specific patch partition (HMAS). Based on our experimental results and quantitative comparison, our methods are promising in the magnetic resonance image segmentation. © 2017 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 27, 23–32, 2017     

信息融合的飞机识别方法

以信息融合的理论为基础，利用从可见光图像序列和8-12μm长波红外图像序列中提取的信息对不同种类飞机进行识别。采用矩特征并结合BP神经网络的方法，分别在特征级和决策级两个不同层次上实现了信息融合。实验结果表明，通过信息融合进行飞机识别的准确率可达到90％以上。     

基于虚拟装配的硬币自动包装机设计方法

为解决硬币处理困难的问题,研究和设计了一种新型台式硬币包装机.在开发过程中采用基于 3D 特征造型和虚拟装配等CAD 技术,应用Pro/E 软件实现了该硬币包装机的三维设计和数字化样机的建立;通过动态仿真和干涉分析,验证了设计方案的可行性.该方法为此种硬币包装机物理样机的制作,和日后产品结构的设计优化提供了快捷有效的途径.     

一种基于三维模型投影的人脸识别新方法

研究了使用三维人脸模型进行不同姿势下的人脸识别问题,提出了一种三维建模二维识别的人脸识别算法,首先使用该方法将三维模型向不同方向投影,进而将不同姿势的二维图像与不同方向的投影结果相匹配,进行人脸识别。研究了使用Minolta Vivid 910进行数据获取,创建三维模型的方法和过程。实验结果表明,在进行不同姿势的人脸识别时,该方法的识别速度快于三维可变形模型方法,识别率远优于使用二维正面图像作为模板的人脸识别方法。