基于年龄流形的人脸图像年龄识别

人随着年龄的增长,外貌特征会发生相应的变化。而这种变化导致人脸识别率急剧下降,为此本文提出一种自动估计人脸年龄的方法,即利用流形学习方法从高维的人脸图像空间中的提取低维年龄流形作为人脸图像的年龄特征,然后利用支持向量回归方法构建全局年龄函数,最后用所得的年龄函数估计出未知人脸图像的年龄值。     

一种新的人脸图像本征维数估计方法

利用拓扑理论中的单形定义,本文提出了一种针对人脸图像本征维数的估计方法.首先给出一个简单的几何模型,说明在不同的姿态和光照条件下人脸图像可看成一个弯曲流形;然后把人脸流形模型近似为一个单纯复形,获得相应的单形数目;最后,利用单纯复形中单形的最大维数是单纯复形的维数的性质,从而估计出人脸图像的本征维数.实验结果表明,本文方法跟经典方法,如分形方法、熵估计方法及k-近邻图方法等相比较,在人脸图像本征维数估计方面是有效的和准确的.     

二维类内差异信息保持的人脸识别

为了使增强的Fisher鉴别准则(EFDC)避免因PCA降维带来的鉴别信息丢失问题,本文将其进行二维推广,提出基于二维类内差异信息保持(2D-IDP)的人脸识别方法,该方法建立了一个鲁棒性更强的鉴别准则,使得投影后不同类的样本点尽量远离的同时,类内紧致性和差异信息都得到有效保持,避免了过学习现象的产生.同时对EFDC近邻图中的参数t作了重新定义,使其能根据不同的输入样本自适应的变化,避免了t选择不当导致的识别性能下降的问题.在YALE和AR人脸库上的实验表明了本文方法的有效性.     

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

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

基于局部线性嵌入和云神经网络的转子故障诊断方法

提出了一种基于流形学习的汽轮机转子故障诊断方法。利用振动信号构造一个能够表示该信号的矩阵作为流形学习的输入数据,使用局部线性嵌入算法对矩阵进行维数约简,实现了高维数据向低维空间的嵌入,从而有效提取了故障特征。文中使用云神经网络分类器测试LLE算法输出维数大于3时的故障诊断率,并分析了各个参数对诊断率的影响。该方法克服了在样本较少的情况下故障诊断的困难,能在有限的故障数据中发掘故障特征并进行故障诊断。     

流形核与LPP相结合的毛杆折痕识别方法

针对毛杆折痕难以检测问题,将非线性流形的思想引入到折痕识别领域。提出运用流形核函数与局部保持投影相结合的方法进行毛杆特征提取。首先基于区域图像构造协方差矩阵作为图像特征,利用仿射不变度量作为样本点的距离测度。然后通过定义的黎曼核函数选择流形上的近邻点,使得近邻点的选择符合数据呈非线性流形的假设,并结合数据类别信息构造相应的核矩阵。最后利用局部保持投影算法对毛杆图像进行降维。实验结果表明,本文算法能够有效克服光照不均和残余绒毛等外部因素影响,具有较好的稳健性和较高的识别率。     

基于QR分解的线性图嵌入算法与人脸识别

针对小样本问题,提出了一种基于QR分解的线性图嵌入(Linear Extension ofGraph Embedding,LGE)求解算法,并将其用于人脸识别.与传统的用主成分分析进行降维不同,新算法利用QR分解对数据进行降维,然后在降维后的空间利用线性图嵌入算法进行二次特征抽取,最后利用最近邻分类器进行分类识别.新算法有效的解决了小样本问题,并且在降维的过程中不损失鉴别信息,提高了算法的识别率.在Yale和PIE人脸数据库的实验表明了本文算法在识别性能上优于传统算法.     

Curvelet域流形学习人脸识别算法研究

Curvelet是一种多尺度多方向的图像变换工具,能有效克服小波在表达图像沿边缘奇异特征时的冗余,形成特征的稀疏表达.进一步考虑高维图像可能存在于一个低维流形上,所以提出将曲波提取到的特征应用流形学习处理以发现其低维结构应用于人脸识别.实验表明Curvelet提取到的特征经LLE处理后能找到优于LLE下的流形结构.和已有Gabor结合流形学习人脸识别的比较研究说明,曲波结合流形学习的方法获得了高于Gabor结合流形学习的识别率,在Essex表情库和YaleB光照库上的实验证明了这一点.     

带标志点的LTSA算法及其在轴承故障诊断中的应用

针对非监督式流形学习算法面临的增量式学习问题,提出一种带标志点的增量式局部切空间排列算法.该方法在局部切空间排列算法的基础上,利用最小角度回归算法从原始训练样本中选取标志点,以选取的标志点和新增样本建立所有样本的全局坐标矩阵,利用原始样本低维嵌入坐标和全局坐标矩阵对新增样本的低维嵌入坐标进行估计,并采用全局坐标矩阵特征值迭代方法更新所有样本的低维嵌入坐标.滚动轴承4种不同状态振动数据样本的增量式识别结果表明,本方法在实现局部切空间排列算法增量式学习的基础上,保持了对滚动轴承不同状态样本较高的类别可分性测度.     

转子故障数据集降维的CKLPMDP算法研究

针对传统的数据降维方法难以兼顾局部流形结构和多流形判别结构学习的问题,提出一种相关熵测度核局部保持多流形判别投影算法(correntropy kernel locality preserving multi-manifold discriminant projection, CKLPMDP)的转子故障数据集降维方法。该方法的显著特点是采用相关熵测度监督近邻图的构建,首先将数据集映射到高维核空间,然后在核空间中综合考虑数据集的局部流形结构和多流形判别结构信息,提取出最优表征故障数据集的低维敏感特征矢量,采用三维图直观地显示出低维分类效果,并以低维敏感特征矢量输入K近邻分类器(K-nearest neighbor, KNN)中的辨识率和聚类分析中类间距S_b、类内距S_w作为衡量降维效果的指标。通过双跨转子实验台的振动信号数据集进行验证,与其他几种典型特征提取方法对比,该方法能更有效地提取出局部流形和多流形判别信息,在转子故障辨识中表现出更好的分类性能。     

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.     

Reversible Data Hiding in Encrypted Images Based on Prediction and Adaptive Classification Scrambling

Reversible data hiding in encrypted images (RDH-EI) technology is widely used in cloud storage for image privacy protection. In order to improve the embedding capacity of the RDH-EI algorithm and the security of the encrypted images, we proposed a reversible data hiding algorithm for encrypted images based on prediction and adaptive classification scrambling. First, the prediction error image is obtained by a novel prediction method before encryption. Then, the image pixel values are divided into two categories by the threshold range, which is selected adaptively according to the image content. Multiple high-significant bits of pixels within the threshold range are used for embedding data and pixel values outside the threshold range remain unchanged. The optimal threshold selected adaptively ensures the maximum embedding capacity of the algorithm. Moreover, the security of encrypted images can be improved by the combination of XOR encryption and classification scrambling encryption since the embedded data is independent of the pixel position. Experiment results demonstrate that the proposed method has higher embedding capacity compared with the current state-ofthe-art methods for images with different texture complexity.     

Reversible Data Hiding Based on Pixel-Value-Ordering and Pixel Block Merging Strategy

With the reversible data hiding method based on pixel-value-ordering, data are embedded through the modification of the maximum and minimum values of a block. A significant relationship exists between the embedding performance and the block size. Traditional pixel-value-ordering methods utilize pixel blocks with a fixed size to embed data; the smaller the pixel blocks, greater is the embedding capacity. However, it tends to result in the deterioration of the quality of the marked image. Herein, a novel reversible data hiding method is proposed by incorporating a block merging strategy into Li et al.’s pixel-value-ordering method, which realizes the dynamic control of block size by considering the image texture. First, the cover image is divided into non-overlapping 2×2 pixel blocks. Subsequently, according to their complexity, similarity and thresholds, these blocks are employed for data embedding through the pixel-value-ordering method directly or after being emerged into 2×4, 4×2, or 4×4 sized blocks. Hence, smaller blocks can be used in the smooth region to create a high embedding capacity and larger blocks in the texture region to maintain a high peak signal-to-noise ratio. Experimental results prove that the proposed method is superior to the other three advanced methods. It achieves a high embedding capacity while maintaining low distortion and improves the embedding performance of the pixel-value-ordering algorithm.     

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.     

Modelling of spatial causality among distinctive properties of an image using conditional random field for image classification

In this paper, we proposed an ordered patch-based method using conditional random field (CRF) in order to encode local properties and their spatial relationship in the images to address texture classification, face recognition and scene classification problems. Typical image classification approaches classify images without considering spatial causality among distinctive properties of an image to represent it in the feature space. In this method first, each image is encoded as a sequence of ordered patches including local properties. Second, the sequence of these ordered patches is modelled as a probabilistic feature vector using CRF to model spatial relationship of these local properties; and finally, image classification is performed on such probabilistic image representation. Experimental results on several standard image datasets indicate that the proposed method outperforms some of existing image classification methods.     

基于光谱特征和纹理特征协同学习的高光谱图像数据分类

高光谱遥感图像中包含有大量的高维数据,传统的有监督学习算法在对这些数据进行分类时要求获取足够多的有标记样本用于分类器的训练.然而,对高光谱图像中大量的复杂地物像元所属类别进行准确标注通常需要耗费极大的人力.在本文中,我们提出了一种基于半监督学习的光谱和纹理特征协同学习(STF-CT)--法,利用协同学习机制将高光谱图像光谱特征和空间纹理特征这两种不同的特征结合起来,用于小训练样本集下的高光谱图像数据分类问题.STF-CT算法充分利用了高光谱图像的光谱和纹理特征这两个独立视图,构建起一种有效的半监督分类方法,用于提升分类器在小训练样本集情况下的分类精度.实验结果表明该算法在小训练样本集下的高光谱地物分类问题上具有很好的效果.     

基于方差和显著性特征的超声图像分割方法研究

针对超声图像对比度小导致的影像上相邻灰度差别很小,人眼有时难于区分的问题,提出了一种基于方差和显著性特征的超声图像分割方法。首先提取图像中已知样本像素点的方差和显著性特征;然后利用支持向量机根据提取的样本像素点方差和显著性特征进行样本训练,得到分类模型;最后根据训练模型对整幅图像上的像素点进行分类,实现图像的有效分割。实验结果表明该方法针对超声图像的分割是有效的。     

基于遗传算法优化支持向量机的超声图像缺陷分类

超声图像缺陷在分类时由于存在样本数量少、样本类别多、不易区分等问题,分类的准确率较低。针对这些问题,提出了基于遗传算法优化支持向量机的超声图像缺陷分类方法。该方法首先通过图像处理提取超声图像缺陷的特征数据,然后训练支持向量机作为超声图像缺陷分类器,最后采用遗传算法优化参数求得最优的分类器。实验结果表明,提出的超声图像缺陷分类器在识别率方面优于其他方法的分类器,综合识别率达到了90%,可以有效地辅助工作人员对超声图像缺陷进行分类识别。     

基于视觉内容分析和遗传算法优化的鲁棒图像水印算法

目的为了兼顾水印图像的不可感知性与鲁棒性,利用DCT(Discrete Cosine Transform)变换域,设计载体视觉内容分析耦合遗传算法优化的鲁棒图像水印技术。方法首先,将载体图像分割为一系列的非重叠子块,并引入奇异值分解机制,定义视觉内容分析方法,获取每个子块的活性因子,活性因子值较大的子块为水印嵌入位置;利用DCT机制处理活性因子值较大的子块得到相应的直流系数;联合结构相似度SSIM、峰值信噪比PSNR以及归一化相关系数NC,并基于权重因子设计适应度函数,通过执行遗传算法寻找最优的嵌入强度;根据优化的嵌入强度构建水印嵌入方法,将二值水印隐藏到这些直流系数中,通过逆DCT变换输出水印图像;设计水印检测方法,从水印图像中提取二值水印。结果实验数据显示,与当前基于变换域的水印技术相比,所提算法具有更高的视觉不可感知性与抗几何攻击能力,面对多种几何攻击,所提算法的PSNR与NC值分别保持在45 dB,0.96以上。结论所提算法能够较好地将水印信息隐藏在载体中,具有较高的视觉不可感知性与抗几何攻击能力,在版权保护、信息防伪等领域具有较好的参考价值。