Robust automatic facial expression detection method based on sparse representation plus LBP map

Recently the sparse representation based classification (SRC) is successfully used to automatically recognize facial expression, well-known for its ability to solve occlusion and corruption problems. The results of those methods which using different features conjunction with SRC framework show state of the art performance on clean or noised facial expression images. Therefore, the role of feature extraction for SRC framework will greatly affect the success of facial expression recognition (FER). In this paper, we select a new feature which called LBP map. This feature is generated using local binary pattern (LBP) operator. It is not only robust to gray-scale variation, but also extracts sufficient texture information for SRC to deal with FER problem. Then we proposed a new method using the LBP map conjunction with the SRC framework. Firstly, we compared our method with state of the art published work. Then experiments on the Cohn–Kanade database show that the LBP map + SRC can reach the highest accuracy with the lowest time-consuming on clean face images than those methods which use different features such as raw image, Downsample image, Eigenfaces, Laplacianfaces and Gabor conjunction with SRC. We also experiment the LBP map + SRC to recognize face image with partial occluded and corrupted, the result shows that this method is more robust to occlusion and corruption than existing methods based on SRC framework.     

Modular Fisher Discriminant Sparse Representation for robust face recognition

This paper proposes a novel framework for robust face recognition based on sparse representation and discrimination ranking. This method consists of three stages. The first stage partitions each training sample into some overlapped modules and then computes each module's Fisher ratio, respectively. The second stage selects modules which have higher Fisher ratios to comprise a template to filter training and test images. The dictionary is constructed by the filtered training images. The third stage computes the sparse representation of filtered test sample on the dictionary to perform identification. The advantages of the proposed method are listed as follows: the first stage can preserve the local structure. The second stage removes the modules that have little contribution for classification. Then the method uses the retaining modules to classify the test sample by SRC which makes the method robust. Compared with the related methods, experimental results on benchmark face databases verify the advancement of the proposed method. The proposed method not only has a high accuracy but also can be clearly interpreted.     

Enhanced computational integral imaging system for partially occluded 3D objects using occlusion removal technique and recursive PCA reconstruction

In this paper, we propose an enhanced computational integral imaging system by both eliminating the occlusion in the elemental images recorded from the partially occluded 3D object and recovering the entire elemental images of the 3D object. In the proposed system, we first obtain the elemental images for partially occluded object using computational integral imaging system and it is transformed to sub-images. Then we eliminate the occlusion within the sub-images by use of an occlusion removal technique. To compensate the removed part from occlusion-removed sub-images, we use a recursive application of PCA reconstruction and error compensation. Finally, we generate the entire elemental images without a loss from the newly reconstructed sub-images and perform the process of object recognition. To show the usefulness of the proposed system, we carry out the computational experiments for face recognition and its results are presented. Our experimental results show that the proposed system might improve the recognition performance dramatically.     

基于边缘区域不变矩的缺损扩展目标识别方法

 该方法提出以基于边缘区域的局部不变矩作为识别特征,结合多神经网络实现对缺损扩展目标的有效识别。讨论了离散情况下基于边缘区域局部不变矩的平移、旋转和尺度不变性。在此基础上,建立目标多个处理区域的BP人工神经网络,利用各网络分类综合结果提高缺损目标的识别率。实验结果显示该方法能够对缺损扩展目标进行正确识别,特别对于有较大部分缺损的扩展目标识别有明显优势。     

Robust face recognition based on sparse representation in 2D Fisherface space

Sparse representation is being proved to be effective for many tasks in the field of face recognition. In this paper, we will propose an efficient face recognition algorithm via sparse representation in 2D Fisherface space. We firstly transformed the 2D image into 2D Fisherface in preprocessing, and classify the testing image via sparse representation in the 2D Fisherface space. Then we extend the proposed method using some supplementary matrices to deal with random pixels corruption. For face image with contiguous occlusion, we partition each image into some blocks, and define a new rule combining sparsity and reconstruction residual to discard the occluded blocks, the final result is aggregated by voting the classification result of the valid individual block. The experimental results have shown that the proposed algorithm achieves a satisfying performance in both accuracy and robustness.     

磁流体方腔槽道流整体线性稳定性数值方法研究

将Chebyshev谱配置法和基于非均匀网格的高阶FD-q差分格式运用于磁流体方腔槽道流整体线性稳定性研究,比较两类数值方法的优缺点.Chebyshev谱配置法收敛快且精度高,但需要构造非常庞大的满矩阵,存储量和计算开销巨大;高阶FD-q差分格式采用了基于Kosloff-Tal-Ezer变换的Chebyshev谱配置点作为离散网格,在保持较高网格收敛精度的同时,差分格式可以采用稀疏矩阵进行存储,显著降低了存储量和计算开销.相比传统的谱配置法,基于非均匀网格的高阶FD-q差分格式计算效率得到显著的提升,将高阶FD-q差分格式运用于非正则模线性最优瞬态增长的计算,计算效果良好.     

基于不变系数的光照不变最小二乘匹配

最小二乘匹配(LSM)对全局灰度和几何畸变有较好的适应性,得到了广泛应用和重视。但是该方法存在计算量大,难以实时应用,以及不能适应局部光照变化等问题。提出了不变系数光照不变最小二乘匹配,通过固定法方程式系数,大幅减少了单位迭代计算量。在实际中,由于成像场景和光照条件的复杂性,传统的以整体灰度变换模型近似图像间灰度变化往往会存在较大误差,由于真实灰度畸变模型不易获取和计算,该问题一直没有得到很好解决。提出了用光照不变描述替换原始灰度描述的方法,实现了对局部灰度畸变的适应,并将最小二乘匹配的迭代维数由8维降为6维,进一步提升了计算速度。理论分析和真实数据实验表明,该方法较之传统方法计算速度提升6.18倍;几何变化和局部光照变化仿真实验证明了此方法对局部光照变化有较好的适应性。     

Coarse-Grained Pruning of Neural Network Models Based on Blocky Sparse Structure

Deep neural networks may achieve excellent performance in many research fields. However, many deep neural network models are over-parameterized. The computation of weight matrices often consumes a lot of time, which requires plenty of computing resources. In order to solve these problems, a novel block-based division method and a special coarse-grained block pruning strategy are proposed in this paper to simplify and compress the fully connected structure, and the pruned weight matrices with a blocky structure are then stored in the format of Block Sparse Row (BSR) to accelerate the calculation of the weight matrices. First, the weight matrices are divided into square sub-blocks based on spatial aggregation. Second, a coarse-grained block pruning procedure is utilized to scale down the model parameters. Finally, the BSR storage format, which is much more friendly to block sparse matrix storage and computation, is employed to store these pruned dense weight blocks to speed up the calculation. In the following experiments on MNIST and Fashion-MNIST datasets, the trend of accuracies with different pruning granularities and different sparsity is explored in order to analyze our method. The experimental results show that our coarse-grained block pruning method can compress the network and can reduce the computational cost without greatly degrading the classification accuracy. The experiment on the CIFAR-10 dataset shows that our block pruning strategy can combine well with the convolutional networks.     

Digital system of invariant correlation to position and rotation

A new correlation digital system invariant to position and rotation is presented. This new algorithm requires low computational cost, because it uses uni-dimensional signatures (vectors). The signature of the target so like the signature of the object to be recognized in the problem image is obtained using a binary ring mask constructed based on the real positive values of the Fourier transform of the corresponding image. In this manner, each image will have one unique binary ring mask, avoiding in this form the relevant information leak. Using linear and non-linear correlations, this methodology is applied first in the identification of the alphabet letters in Arial font style and then in the classification of fossil diatoms images. Also, this system is tested using the diatom images with additive Gaussian noise. The non-linear correlation results were excellent, obtaining in this way a simple but efficient method to achieve rotation and translation invariance pattern recognition.     

基于蚁群算法的二维最大熵分割算法

由于二维最大熵分割法不仅考虑了像素的灰度信息,而且还充分利用了像素的空间邻域信息,因此能够取得较好的分割效果.但是,该方法的计算量巨大,不利于红外图像的快速处理.蚁群算法于20世纪90年代初提出,是受到蚁群集体行为的启发而提出的一种基于种群的模拟进化算法,属于随机搜索算法.该算法已经成功应用于旅行商等离散问题.将蚁群算法应用于二维最大熵法,提出了基于蚁群算法的二维最大熵分割算法.与传统的穷尽搜索法相比,求解速度提高了60倍左右.仿真实验表明,该方法快速、简单、有效.     

Occlusion removal technique for improved recognition of partially occluded 3D objects in computational integral imaging

In this paper, we propose an occlusion removal technique for improved recognition of 3D objects that are partially occluded in computational integral imaging (CII). In the reconstruction process of a 3D object which is partially occluded by other objects, occlusion degrades the resolution of reconstructed 3D images and thus this affects negatively the recognition of a 3D object in CII. To overcome this problem, we introduce a method to eliminate occluding objects in elemental image array (EIA) and the proposed method is applied to 3D object recognition by use of CII. To our best knowledge, this is the first time to remove occlusion in CII. In our method, we apply the elemental image to sub-image (ES) transform to EIA obtained by a pickup process and those sub-images are employed for occlusion removal. After the transformation, we correlate those sub-images with a reference sub-image to locate occluding objects and then we eliminate the objects. The inverse ES transform provides a modified EIA. Actually, the modified EIA is considered to be an EIA without the object that occludes the object to be reconstructed. This can provide a substantial gain in terms of the image quality of 3D objects and in terms of recognition performance. To verify the usefulness of the proposed technique, some experimental results are carried out and the results are presented.     

Fusion method for infrared and visible images by using non-negative sparse representation

In this paper, an interesting fusion method, named as NNSP, is developed for infrared and visible image fusion, where non-negative sparse representation is used to extract the features of source images. The characteristics of non-negative sparse representation coefficients are described according to their activity levels and sparseness levels. Multiple methods are developed to detect the salient features of the source images, which include the target and contour features in the infrared images and the texture features in the visible images. The regional consistency rule is proposed to obtain the fusion guide vector for determining the fused image automatically, where the features of the source images are seamlessly integrated into the fused image. Compared with the classical and state-of-the-art methods, our experimental results have indicated that our NNSP method has better fusion performance in both noiseless and noisy situations.     

基于蚁群优化与神经网络的坦克目标识别算法

为了对成像引信探测得到的变形严重的图像进行识别,提出了基于蚁群优化与人工神经网络相结合的坦克目标识别算法.采用SUSAN特征检测原则提取目标图像的角点特征,作为神经网络模式分类器的输入.针对BP网络收敛速度慢,易于陷入局部极小点等问题,利用蚁群优化算法训练网络权值,可兼有ANN的广泛映射能力和蚁群算法的全局收敛以及启发式学习等特点.仿真实验表明,新算法能够有效缩短网络训练时间,提高目标识别精度.     

Improvement in image resolution based on dispersive representation of data

A method for reconstructing the resolution of images, based on selection and optimization of significant local features and sparse representation of processed-image blocks (using optimized low- and high-resolution dictionaries), has been substantiated for the first time. This method, making it possible to improve significantly the resolution of images of various nature, is interpreted physically. A block diagram of the processing system corresponding to the new approach to image reconstruction has been developed. A simulation of the new method for reconstructing images of different physical natures and known algorithms showed an advantage of the new scheme for reconstructing resolution in terms of universally recognized criteria (peak signal-to-noise ratio, mean absolute error, and structural similarity index measure) and in visual comparison of the processed images.     

基于WSSRC单样本人脸识别及样本扩充方法研究

由于传统的SRC方法的实时性不强、单样本条件下算法性能低等缺点,提出了融合全局和局部特征的加权超级稀疏表示人脸识别方法(WSSRC),同时采用一种三层级联的虚拟样本产生方法获取冗余样本,将生成的多种表情和多种姿态的新样本当成训练样本,运用WSSRC算法进行人脸识别分类。在单样本的情况下,实验证实在ORL人脸库上该方法比传统的SRC方法提高了15.53%的识别率,使用在FERET 人脸库上则提高7.67%。这样的方法与RSRC 、SSRC、DMMA、DCT-based DMMA、I-DMMA相比,一样具备较好的识别性能。     

快速图符匹配方法及其在军标识别中的应用

为了加快在旋转及缩放情况下基于Hausdorff 距离的图符匹配方法的速度,提出了一种基于缩略模型的Hausdorff 距离形状匹配方法.该方法分为两个阶段,首先利用模型的稀疏版本在较大的距离阈值下进行粗匹配,然后再利用全模型在稍小的距离阈值和较大的重合率门限进行双阈值精确匹配.利用地图上叠加的图形符号进行了匹配实验.实验结果表明,该方法获得了较低漏检和虚警以及较短的匹配时间,同时该方法已被用于地图中的军标识别,效果良好.     

基于字典学习的稠密光场重建算法

相机阵列是获取空间中目标光场信息的重要手段,采用大规模密集相机阵列获取高角度分辨率光场的方法增加了采样难度和设备成本,同时产生的大量数据的同步和传输需求也限制了光场采样规模.为了实现稀疏光场采样的稠密重建,本文基于稀疏光场数据,分析同一场景多视角图像的空间、角度信息的关联性和冗余性,建立有效的光场字典学习和稀疏编码数学模型,并根据稀疏编码元素间的约束关系,建立虚拟角度图像稀疏编码恢复模型,提出变换域稀疏编码恢复方法,并结合多场景稠密重建实验,验证提出方法的有效性.实验结果表明,本文方法能够对场景中的遮挡、阴影以及复杂的光影变化信息进行高质量恢复,可以用于复杂场景的稀疏光场稠密重建.本研究实现了线性采集稀疏光场的稠密重建,未来将针对非线性采集稀疏光场的稠密重建进行研究,以推进光场成像在实际工程中的应用.     

基于粒子群优化的核匹配追踪目标识别

提出了一种基于粒子群优化的用于目标识别的核匹配追踪算法.该算法用粒子群优化算法在基函数字典中选择最优的基函数,大大降低了基匹配追踪算法的计算复杂度.通过与标准核匹配追踪算法及基于遗传算法的核匹配追踪算法对UCI数据集及纹理图像的识别试验表明,核匹配追踪算法优良的分类性能以及粒子群优化算法高效的全局搜索能力使新算法能有效识别目标数据.     

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.     

Infrared and visible image fusion method based on saliency detection in sparse domain

Infrared and visible image fusion is a key problem in the field of multi-sensor image fusion. To better preserve the significant information of the infrared and visible images in the final fused image, the saliency maps of the source images is introduced into the fusion procedure. Firstly, under the framework of the joint sparse representation (JSR) model, the global and local saliency maps of the source images are obtained based on sparse coefficients. Then, a saliency detection model is proposed, which combines the global and local saliency maps to generate an integrated saliency map. Finally, a weighted fusion algorithm based on the integrated saliency map is developed to achieve the fusion progress. The experimental results show that our method is superior to the state-of-the-art methods in terms of several universal quality evaluation indexes, as well as in the visual quality.