基于一次投影子空间追踪的压缩感知信号重构

为了降低信号重构算法的复杂度,实现对稀疏度未知信号的重构,提出了一种基于一次投影子空间追踪(OPSP)的信号重构方法。首先根据约束等距性质确定信号稀疏度的上下界,并将最接近上下界中值的整数作为稀疏度的估计值;然后在子空间追踪(SP)算法的框架下,去掉了迭代中观测向量在支撑集上的投影过程,降低了算法的复杂度。为了更准确地衡量算法的重构性能,提出用完整信号的重构概率作为衡量算法重构性能的指标。与传统的SP算法相比,所提算法可以重构稀疏度未知的信号,且重构时间短,重构概率高。仿真结果验证了该算法的有效性。     

Preconditioning the solution of the time-dependent neutron diffusion equation by recycling Krylov subspaces

Spectral preconditioners are based on the fact that the convergence rate of the Krylov subspace methods is improved if the eigenvalues of the smallest magnitude of the system matrix are ‘removed’. In this paper, two preconditioning strategies are studied to solve a set of linear systems associated with the numerical integration of the time-dependent neutron diffusion equation. Both strategies can be implemented using the matrix–vector product as the main operation and succeed at reducing the total number of iterations needed to solve the set of systems.     

基于相关随机子空间的分类数据聚类集成

为了提升分类数据聚类集成的效果,提出了一种新的相关随机子空间聚类集成模型。该模型利用粗糙集理论将分类属性分解成相关和不相关子集,在相关属性子集上随机生成多个相关子空间并对分类数据进行聚类,通过集成多个较优且具差异性的聚类结果以获得最终的聚类划分。此外,将粗糙集约简概念应用于相关子空间属性数目的确定,有效地避免了参数对聚类结果的影响。UCI数据集实验表明,新模型的性能优于其他已有模型,说明了其有效性。     

人脸朝向检测中PCA子空间构造方法研究

研究了主分量分析(PCA)子空间在人脸朝向检测中的构造方法.首先,用训练集中的人脸样本构造主PCA空间;其次,根据4种不同的人脸朝向分别构造4个辅PCA空间;最后,对测试集中的人脸先经过主PCA空间判断是否为人脸,再对判定为人脸的测试样本用4个辅PCA空间进行人脸朝向检测.实验结果表明,测试样本先经过主PCA空间然后再经过辅PCA空间的分类结果好于只用4个辅PCA空间的分类结果,并且对表情变化、脸部饰物有良好的鲁棒性.     

基于核正交局部判别嵌入的人脸识别

针对人脸识别中的非线性特征提取问题,提出一种基于核正交局部判别嵌入(KOLDE,kernel orthogonal local discriminant embedding)的人脸识别算法。首先通过引入基向量正交约束,得到OLDE算法,并给出算法的推导过程。然后为了更好地处理高度复杂非线性结构数据,将OLDE向高维空间扩展,在核空间提取图像的高阶非线性信息,得到核空间OLDE算法。在ORL和PIE库上的人脸识别实验验证了算法的有效性。     

地下洞室开挖的并行计算

介绍了有限元分析的力学理论,提出开挖释放荷载的计算方法和模拟思路。基于Krylov子空间迭代法和预条件技术,采用基于区域分解思想的粗粒度并行策略开发了地下洞室群开挖模拟的并行有限元程序。最后,用算例说明并行计算的高效性。     

Adaptive detectors in the Krylov subspace

The validity of the application of the Krylov subspace techniques in adaptive filtering and detection is investigated. A new verification of the equivalence of two well-known methods in the Krylov subspace, namely the multistage Wiener filters （MWF） and the auxiliary-vector filtering （AVF）, is given in this paper. The MWF and AVF are incorporated into two well-known detectors, namely, the adaptive matched filter （AMF） and Kelly＇s generalized likelihood ratio test （CLRT） including their diagonally loaded versions, which form new detectors. Compared to the conventional AMF, CLRT, and their diagonally loaded versions as well as the reduced-rank AMF and GLRT, the probabilities of detection （PDs） of the new detectors are improved especially when the sample support is low. More importantly, the new detectors are robust of the rank selection of the clutter subspace compared to the reduced-rank AMF and GLRT. These new detectors all possess asymptotic constant false alarm rate （CFAR） property.     

基于随机子空间的多标签类属特征提取算法

目前多标签学习已广泛应用到很多场景中,在此类学习问题中,一个样本往往可以同时拥有多个类别标签。由于类别标签可能带有的特有属性（即类属属性）将更有助于标签分类,所以已经出现了一些基于类属属性的多标签学习算法。针对类属属性构造会导致属性空间存在冗余的问题,本文提出了一种多标签类属特征提取算法LIFT_RSM。该方法基于类属属性空间通过综合利用随机子空间模型及成对约束降维思想提取有效的特征信息,以达到提升分类性能的目的。在多个数据集上的实验结果表明：与若干经典的多标签算法相比,提出的LIFT_RSM算法能得到更好的分类效果。     

Registration based compensation method based on adaptive subspace tracking

The registration based compensation (RBC) method is an effective method to compensate the range-dependence of the main-lobe clutter and side-lobe clutter in the same time. However, the compensation performance of the RBC degrades because of the mismatch of prior information and the loss of degree of system freedom. Moreover, the RBC is not very suited for real-time implementation because of the enormous computational complexity and memory usage of eigenvalue decomposition. In this paper, a novel clutter range-dependence compensation method using the modified maximum likelihood adaptive subspace estimation algorithm, which is named the MRBC method for short, is proposed. The eigenvectors matrix and eigenvalues matrix of the clutter covariance matrix are estimated by iterative tracking instead of temporal and spatial smoothing, spectrum calculation and eigenvalue decomposition. Compared with the traditional RBC method, the proposed method can reduce the computational complexity significantly and maintain the performance of clutter range-dependence compensation. In addition, the proposed method can also achieve good performance when the system error exists because of no use of prior information. Experimental simulations demonstrate the validity of this method.     

基于图像的单样本人脸识别研究进展

基于单样本的人脸识别具有重要的应用价值,然而对仅有一个注册样本的人脸图像进行识别是一个具有极大挑战性的问题。对近年来提出的单样本人脸识别的算法进行分类和介绍,以识别率为指标对比了这些算法的实验结果,同时给出了这些实验针对的人脸数据库、数据库的规模和训练/测试样本集的划分;总结了影响单样本人脸识别率的关键因素及各算法的优缺点,分析了一些算法取得较优识别率的原因及未来可能的研究方向。