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.     

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

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

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

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

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.     

An improved SRC method based on virtual samples for face recognition

The sparse representation classifier (SRC) performs classification by evaluating which class leads to the minimum representation error. However, in real world, the number of available training samples is limited due to noise interference, training samples cannot accurately represent the test sample linearly. Therefore, in this paper, we first produce virtual samples by exploiting original training samples at the aim of increasing the number of training samples. Then, we take the intra-class difference as data representation of partial noise, and utilize the intra-class differences and training samples simultaneously to represent the test sample in a linear way according to the theory of SRC algorithm. Using weighted score level fusion, the respective representation scores of the virtual samples and the original training samples are fused together to obtain the final classification results. The experimental results on multiple face databases show that our proposed method has a very satisfactory classification performance.     

基于字典算法的OCT图像散斑稀疏降噪

光学相干层析扫描(OCT)作为一种新型无创高分辨率扫描方式,在临床上得到广泛应用,但是OCT图像本身存在严重的散斑噪声,这大大影响了疾病的诊断。本文针对OCT图像中的乘性散斑噪声,改进了两种原始字典降噪算法。该算法首先对OCT图像进行对数变换,采用正交匹配追踪算法进行稀疏编码,以及K奇异值分解学习算法进行自适应字典的更新,最后通过加权平均以及指数变换回到空域。实验结果表明,本文改进的两种字典算法能有效降低OCT图像中的散斑噪声,获得良好的视觉效果。并通过均方误差(MSE)、峰值信噪比(PSNR)、结构相似性(SSIM)以及边缘保持指数(EPI)四个指标评价降噪效果,与两种原始字典降噪算法和传统滤波算法相比,两种改进字典算法降噪效果优于其他算法,其中自适应字典算法表现更好。     

结合稀疏表示和子空间投影的云图检索

卫星云图能从多角度展示各类云系特征及其演变过程,实现基于内容的云图检索在天气实况监测、气候研究等方面具有重要意义。为了优化云图的组合特征,增强其组合特征的泛化能力,本文提出一种结合稀疏表示和子空间投影的特征优化方法。首先分别提取云图的颜色、纹理以及形状三种特征,并对其组合特征进行转换分块;然后对每一块的特征进行稀疏表示,根据不同原子的方差来分组特征,得到显著特征和非显著特征;最后由分组特征的能量来计算得到子空间投影矩阵,将初始的组合特征在投影矩阵上进行投影,得到优化后的云图特征。实验结果表明,本文优化云图特征的方法在查准率、查全率上均优于常用的降维方法和云图检索技术,对组合特征具有较强的优化能力,在实时检索过程中时间复杂度低,是一种全新的检索方法。     

基于稀疏分解的多分量线性调频信号参数估计∗

本文提出了一种多分量线性调频信号的参数估计方法。基于过完备Gabor字典的Matching Pursuit算法,可以将信号表示为Gabor原子的线性组合。这些原子有效的揭示了信号的内在时频结构特征,是信号的一种稀疏表示。本文直接利用分解得到的稀疏信息对信号中调频分量的调频率、初始频率和结束频率进行估计。仿真结果显示,该方法适用于存在强有意干扰或者有色噪声的环境。     

多彩色空间相关分析的人脸识别算法

人脸识别是当前人工智能和模式识别的研究热点,得到了广泛的关注.基于对不同色彩空间数据的分析,论文提出了多彩色空间典型相关分析的人脸识别方法.文中对2维的Contourlet变换特性进行了分析和讨论,利用Contourlet的多尺度,方向性和各向异性等特点,提出了一种基于Contourlet变换的彩色人脸识别算法.算法对原图进行Contourlet分解,对分解得到的低频和高频图像进行cca分析.典型相关分析是一种有效的分析方法,其实际应用十分广泛.低频系数反映图像的轮廓信息,高频系数反映图像的细节信息,使用cca充分利用不同频率的信息,使不同色彩空间的不同分辨率图形的相关性达到最大,得到投影系数,最后,采用决策级最近邻分类器完成人脸识别.在对彩色人脸数据库AR的识别实验中,该算法识别率达到98％以上,与传统算法相比,该算法不仅既有良好的识别结果,而且具有很快的运算速度.     

Determination of candidate subjects for better recognition of faces

In order to improve the accuracy of face recognition and to solve the problem of various poses, we present an improved collaborative representation classification (CRC) algorithm using original training samples and the corresponding mirror images. First, the mirror images are generated from the original training samples. Second, both original training samples and their mirror images are simultaneously used to represent the test sample via improved collaborative representation. Then, some classes which are “close” to the test sample are coarsely selected as candidate classes. At last, the candidate classes are used to represent the test sample again, and then the class most similar to the test sample can be determined finely. The experimental results show our proposed algorithm has more robustness than the original CRC algorithm and can effectively improve the accuracy of face recognition.     

A novel multimodal medical image fusion using sparse representation and modified spatial frequency

Fusion of multimodal imaging data supports medical experts with ample information for better disease diagnosis and further clinical investigations. Recently, sparse representation (SR)‐based fusion algorithms has been gaining importance for their high performance. Building a compact, discriminative dictionary with reduced computational effort is a major challenge to these algorithms. Addressing this key issue, we propose an adaptive dictionary learning approach for fusion of multimodal medical images. The proposed approach consists of three steps. First, zero informative patches of source images are discarded by variance computation. Second, the structural information of remaining image patches is evaluated using modified spatial frequency (MSF). Finally, a selection rule is employed to separate the useful informative patches of source images for dictionary learning. At the fusion step, batch‐OMP algorithm is utilized to estimate the sparse coefficients. A novel fusion rule which measures the activity level in both spatial domain and transform domain is adopted to reconstruct the fused image with the sparse vectors and trained dictionary. Experimental results of various medical image pairs and clinical data sets reveal that the proposed fusion algorithm gives better visual quality and competes with existing methodologies both visually and quantitatively.     

监督式正交迹比判别投影在图像集人脸识别中的应用

研究、分析了人脸识别中提取原始数据特征的已有方法,在此基础上给出了一种应用监督式正交迹比判别投影(SOTRDP)的新型特征提取方法,即SOTRDP方法。不同于现有的非监督判别投影(UDP)方法,SOTRDP方法能够同时利用局部信息和类别信息建立相似性矩阵。在利用改进局部切空间对齐(ILTSA)非线性降维的基础上,利用聚类中心或最靠近它的样本作为输入,拓展SOTRDP用于图像集人脸识别。在PIE 和Honda/UCSD人脸数据库上的实验结果验证了所提方法的有效性。     

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.     

Multimodal sensor medical image fusion based on mutual‐structure for joint filtering using sparse representation

Multimodal sensor medical image fusion has been widely reported in recent years, but the fused image by the existing methods introduces low contrast information and little detail information. To overcome this problem, the new image fusion method is proposed based on mutual‐structure for joint filtering and sparse representation in this article. First, the source image is decomposed into a series of detail images and coarse images by mutual‐structure for joint filtering. Second, sparse representation is adopted to fuse coarse images and then local contrast is applied for fusing detail images. Finally, the fused image is reconstructed by the addition of the fused coarse images and the fused detail images. By experimental results, the proposed method shows the best performance on preserving detail information and contrast information in the views of subjective and objective evaluations.     

Analysis of unsupervised learning techniques for face recognition

Face recognition has always been a potential research area because of its demand for reliable identification of a human being especially in government and commercial sectors, such as security systems, criminal identification, border control, etc. where a large number of people interact with each other and/or with the system. The last two decades have witnessed many supervised and unsupervised learning techniques proposed by different researchers for the face recognition system. Principal component analysis (PCA), self‐organizing map (SOM), and independent component analysis (ICA) are the most widely used unsupervised learning techniques reported by research community. This article presents an analysis and comparison of these techniques. The article also includes two SOM processing methods global SOM (GSOM) and local SOM (LSOM) for performance evaluation along with PCA and ICA. We have used two different databases for our analysis. The simulation result establishes the supremacy of GSOM in general among all the unsupervised techniques. © 2010 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 20, 261–267, 2010     

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

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

Probabilistic approach to face recognition

Faces are highly deformable objects which may easily change their appearance over time. Not all face areas are subject to the same variability. Therefore, decoupling of the information from independent areas of the face is of paramount importance to improve the robustness of any face recognition technique. The aim of this article is to present a robust face recognition technique based on the extraction and matching of probabilistic graphs drawn on scale invariant feature transform (SIFT) features related to independent face areas. The face matching strategy is based on matching individual salient facial graphs characterized by SIFT features as connected to facial landmarks such as the eyes and the mouth. In order to reduce the face matching errors, the Dempster–Shafer decision theory is applied to fuse the individual matching scores obtained from each pair of salient facial features. The proposed algorithm is evaluated with the Olivetti Research Lab (ORL) and the Indian Institute of Technology Kanpur (IITK) face databases. The experimental results demonstrate the effectiveness and potential of the proposed face recognition technique, even in the case of partially occluded faces.     

Feature extraction based on sparse representation with application to epileptic EEG classification

Epilepsy seizure detection in electroencephalogram (EEG) is a major issue in the diagnosis of epilepsy, and it can be considered as a classification problem. Considering the particular property of EEG, which is sparse in Garbor dictionary, a feature extraction method based on sparse representation has been applied to epilepsy detection. To improve classification accuracy, in this article, a novel feature vector is developed, which not only can reflect the main structure, but also can give expression to the relation between main structure and residual information. Classification accuracy, efficiency, and robustness to noise of the new feature are explored and analyzed with publicly available data set. It is demonstrated by experiments that the classification accuracy and the efficiency are simultaneously enhanced with this new feature extraction method, and that the novel classification feature proposed in this work greatly improves the classification performance of epilepsy detection. © 2013 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 23, 104–113, 2013     

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