Semi-supervised classification via discriminative sparse manifold regularization

In this paper, a newly semi-supervised manifold learning algorithm named Discriminative Sparse Manifold Regularization (DSMR) is proposed. In DSMR, the whole unlabeled sample set is used to reconstruct the mean vector of each class, then obtains the sparse coefficient. For each sample of labeled samples, the new dictionary is composed of samples from the same class and the samples from the unlabeled sample set according to the corresponding rows of the sparse coefficient. For each unlabeled sample, the new dictionary is composed of samples from the whole unlabeled samples and the samples from the labeled class according to the corresponding columns of the sparse coefficient. Additionally, a discriminative term is added to stabilize performance of the algorithm. Extensive experiments on the several UCI datasets and face datasets demonstrate the effectiveness of the proposed DSMR.     

A novel semi-supervised canonical correlation analysis and extensions for multi-view dimensionality reduction

Canonical correlation analysis (CCA) is an efficient method for dimensionality reduction on two-view data. However, as an unsupervised learning method, CCA cannot utilize partly given label information in multi-view semi-supervised scenarios. In this paper, we propose a novel two-view semi-supervised learning method, called semi-supervised canonical correlation analysis based on label propagation (LPbSCCA). LPbSCCA incorporates a new sparse representation based label propagation algorithm to infer label information for unlabeled data. Specifically, it firstly constructs dictionaries consisting of all labeled samples; and then obtains reconstruction coefficients of unlabeled samples using sparse representation technique; at last, by combining given labels of labeled samples, estimates label information for unlabeled ones. After that, it constructs soft label matrices of all samples and probabilistic within-class scatter matrices in each view. Finally, in order to enhance discriminative power of features, it is formulated to maximize the correlations between samples of the same class from cross views, while minimizing within-class variations in the low-dimensional feature space of each view simultaneously. Furthermore, we also extend a general model called LPbSMCCA to handle data from multiple (more than two) views. Extensive experimental results from several well-known datasets demonstrate that the proposed methods can achieve better recognition performances and robustness than existing related methods.     

Support vector machine active learning by Hessian regularization

It is time-consuming and expensive to gather and label the growing multimedia data that is easily accessible with the prodigious development of Internet technology and digital sensors. Hence, it is essential to develop a technique that can efficiently be utilized for the large-scale multimedia data especially when labeled data is rare. Active learning is showing to be one useful approach that greedily chooses queries from unlabeled data to be labeled for further learning and then minimizes the estimated expected learning error. However, most active learning methods only take into account the labeled data in the training of the classifier. In this paper, we introduce a semi-supervised algorithm to learn the classifier and then perform active learning scheme on top of the semi-supervised scheme. Particularly, we employ Hessian regularization into support vector machine to boost the classifier. Hessian regularization exploits the potential geometry structure of data space (including labeled and unlabeled data) and then significantly leverages the performance in each round. To evaluate the proposed algorithm, we carefully conduct extensive experiments including image segmentation and human activity recognition on popular datasets respectively. The experimental results demonstrate that our method can achieve a better performance than the traditional active learning methods.     

A weakly supervised large margin domain adaptation method for isolated handwritten digit recognition

Learning handwriting categories fail to perform well when trained and tested on data from different databases. In this paper, we propose a novel large margin domain adaptation algorithm which is able to learn a transformation between training and test datasets in addition to adapting the parameters of classifier using a few or even no training labeled samples from target handwriting dataset. Additionally, we developed a framework of ensemble projection feature learning for datasets representation as a front end for our algorithm to utilize the abundant unlabeled samples in target domain. Experiments on different handwritten digit datasets adaptations demonstrate that the proposed large margin domain adaptation algorithm achieves superior classification accuracy comparing with the state of the art methods. Quantitative evaluation of the proposed algorithm shows that semi-supervised adaptation utilizing one sample per class of target domain set reduces the error rates by 64.72% comparing with a corresponding SVM classifier.     

基于半监督学习的SVM-Wishart极化SAR图像分类方法

该文针对极化SAR (Synthetic Aperture Radar)图像分类中的小样本问题,提出了一种新的半监督分类算法。考虑到极化SAR数据反映了地物的散射特性,该方法首先利用目标分解方法提取了多种极化散射特征;其次,在协同训练框架下结合SVM分类器构建了协同半监督模型,该模型可以同时利用有标记和无标记样本对极化SAR图像进行分类,从而在小样本时可以获得更好的分类精度;最后,为进一步改善分类结果,在协同训练分类完成后,该方法又利用Wishart分类器对分类结果进行修正。理论分析与实验表明,该算法在只有少量标记样本的情况下优于传统算法。      

Online semi-supervised compressive coding for robust visual tracking

In this paper we propose an online semi-supervised compressive coding algorithm, termed SCC, for robust visual tracking. The first contribution of this work is a novel adaptive compressive sensing based appearance model, which adopts the weighted random projection to exploit both local and discriminative information of the object. The second contribution is a semi-supervised coding technique for online sample labeling, which iteratively updates the distributions of positive and negative samples during tracking. Under such a circumstance, the pseudo-labels of unlabeled samples from the current frame are predicted according to the local smoothness regularizer and the similarity between the prior and the current model. To effectively track the object, a discriminative classifier is online updated by using the unlabeled samples with pseudo-labels in the weighted compressed domain. Experimental results demonstrate that our proposed algorithm outperforms the state-of-the-art tracking methods on challenging video sequences.     

一种改进的局部保持投影高光谱特征提取算法

局部保持投影算法仅能保持近邻样本的局部结构,无法保证提取的特征有利于后续分类识别。为此,提出一种半监督保持投影特征提取算法。SPP算法能够利用标记样本所携带的类别信息来约束未标记样本,从而提高样本的可分性;同时,还在目标函数中加入一正则项,避免了因矩阵奇异导致算法无法求解的问题。利用实际高光谱数据进行对比实验,结果表明,用SPP算法进行特征提取后的分类精度较LPP算法有显著提升,验证了它的有效性。     

一种基于证据理论的多类半监督分类算法

为了提高多类半监督分类的性能,提出了一种基于证据理论的多类协同森林算法（DSM-Co-Forest）.首先,通过"多对多"模式将有标记的多类数据随机拆分为多个二类数据集,并以此训练二类基分类器;然后,利用多个基分类器同时对未标记样本进行预测,并利用证据组合算法挑选出可信度较高的未标记样本;最后,将高可信度的未标记样本加入到原训练样本中,以迭代更新其他的基分类器,从而提高分类器的整体性能.通过在一些公共数据集上进行实验,并与其他半监督分类算法进行对比,验证了所提算法的可行性和有效性.     

基于邻域最小生成树的半监督极化SAR图像分类方法

该文针对极化SAR图像分类中只有少量标记样本的问题,提出了一种基于邻域最小生成树的半监督极化SAR图像分类方法。该方法针对极化SAR图像以像素为分类对象的特点,结合自训练方法的思想,利用极化SAR图像像素点的空间信息,提出了基于邻域最小生成树辅助学习的样本选择策略,增加自训练过程中被选择无标记样本的可靠性,扩充标记样本数量,训练更好的分类器。最终用训练好的分类器对极化SAR图像进行测试。对3组真实的极化SAR图像进行测试,实验结果表明,该方法在只有少量标记样本的情况下能获得满意的分类结果,且分类正确率明显优于传统的分类算法。      

基于改进TSVM的通信辐射源个体识别

为了解决通信辐射源个体中标签获取难问题,引入半监督机器学习理论,提出了一种基于预测置信度进行迭代的半监督学习算法(Improved Transductive Support Vector Machine Iterative Algorithm Based on the Confidence of Prediction,CP-TSVM)。该方法在TSVM算法的基础上,充分利用无标签样本,根据预测结果置信度进行迭代,能够大幅度减少分类器的运算量。计算机仿真表明,在有标签样本数目占总样本2%的情况下,CP-TSVM较TSVM算法在保证识别准确率的同时,模型训练时间缩短近60 s。     

基于测度优化Laplacian SVM的中文指代消解方法

相比于传统的基于半监督学习的指代消解方法,Laplacian SVM（Support Vector Machine）能有效的挖掘已标注样本和未标注样本的相似性和关联性,更好的推导模型的分类边界。而传统Laplacian SVM采用欧式距离度量样本之间的距离,使得异类样本之间的相似性可能过大,不利于样本的准确分类。对此,提出一种基于数据驱动学习最优测度Laplacian SVM算法以解决中文指代消解语料不足的问题。该方法通过优化样本对之间的相似性约束条件和引入Fisher判别项,增大同类样本间的相似性,并突出强判别能力的特征。此外,提出核嵌入的测度优化方法将以上线性测度优化推广到非线性空间,有利于Laplacian SVM利用核函数实现非线性分类。在ACE2005中文语料库上的测评结果表明,所提出测度优化的Laplacian SVM（包括线性和核嵌入两种形式）的方法只需少量标注样本就可以获得与经典的有监督学习模型相当甚至更好的消解性能,同时也优于其他传统的半监督学习方法。     

A dynamic constraint representation approach based on cross-domain dictionary learning for expression recognition

Facial expression recognition (FER) is an active research area that has attracted much attention from both academics and practitioners of different fields. In this paper, we investigate an interesting and challenging issue in FER, where the training and testing samples are from a cross-domain dictionary. In this context, the data and feature distribution are inconsistent, and thus most of the existing recognition methods may not perform well. Given this, we propose an effective dynamic constraint representation approach based on cross-domain dictionary learning for expression recognition. The proposed approach aims to dynamically represent testing samples from source and target domains, thereby fully considering the feature elasticity in a cross-domain dictionary. We are therefore able to use the proposed approach to predict class information of unlabeled testing samples. Comprehensive experiments carried out using several public datasets confirm that the proposed approach is superior compared to some state-of-the-art methods.     

Semi-supervised radio transmitter classification based on elastic sparsity regularized SVM

Non-collaborative radio transmitter recognition is a significant but challenging issue, since it is hard or costly to obtain labeled training data samples. In order to make effective use of the unlabeled samples which can be obtained much easier, a novel semi-supervised classification method named Elastic Sparsity Regularized Support Vector Machine (ESRSVM) is proposed for radio transmitter classification. ESRSVM first constructs an elastic-net graph over data samples to capture the robust and natural discriminating information and then incorporate the information into the manifold learning framework by an elastic sparsity regularization term. Experimental results on 10 GMSK modulated Automatic Identification System radios and 15 FM walkie-talkie radios show that ESRSVM achieves obviously better performance than KNN and SVM, which use only labeled samples for classification, and also outperforms semi-supervised classifier LapSVM based on manifold regularization.     

基于半监督协同训练的无人机对地目标跟踪

由于目标小、可区分性差,无人机对地目标跟踪较传统视频目标跟踪更容易丢失目标,提出一种基于l1图半监督协同训练的目标跟踪算法。算法首先提取样本的颜色和纹理特征构建两个充分冗余的视图,再以基于l1图的半监督学习算法取代传统协同训练中的监督学习方法构建单视图中的分类器,提高有限标记样本条件下的分类正确率,然后通过基于负类学习的协同训练算法协同更新两个视图的分类器,最后根据不同视图的相似度分布熵融合各分类器的分类结果实现目标跟踪。实验结果表明,该算法能够有效提高分类器的判别能力,具有良好的跟踪性能。     

一种基于半监督学习的应用层流量分类方法

基于应用层的流量分类在用户行为识别、网络带宽管理等方面有着十分重要的应用.将机器学习应用到应用层流量分类问题中.首先提出了一种基于熵函数的组合式特征选择算法,提取了5种TCP连接的特征.针对监督学习中无法识别新流量类型的问题,提出了一种基于半监督学习的流量分类算法.实验结果表明,算法的检测率优于Kmeans方法.在少量标记样本的情况下,随着未标记样本数增加,算法的检测率在增加.     

红外目标检测网络改进半监督迁移学习方法

针对红外数据集规模小,标记样本少的特点,提出了一种红外目标检测网络的半监督迁移学习方法,主要用于提高目标检测网络在小样本红外数据集上的训练效率和泛化能力,提高深度学习模型在训练样本较少的红外目标检测等场景当中的适应性。文中首先阐述了在标注样本较少时无标注样本对提高模型泛化能力、抑制过拟合方面的作用。然后提出了红外目标检测网络的半监督迁移学习流程:在大量的RGB图像数据集中训练预训练模型,后使用少量的有标注红外图像和无标注红外图像对网络进行半监督学习调优。另外,文中提出了一种特征相似度加权的伪监督损失函数,使用同一批次样本的预测结果相互作为标注,以充分利用无标注图像内相似目标的特征分布信息;为降低半监督训练的计算量,在伪监督损失函数的计算中,各目标仅将其特征向量邻域范围内的预测目标作为伪标注。实验结果表明,文中方法所训练的目标检测网络的测试准确率高于监督迁移学习所获得的网络,其在Faster R-CNN上实现了1.1%的提升,而在YOLO-v3上实现了4.8%的显著提升,验证了所提出方法的有效性。     

Semi-supervised cardiac MRI image of the left ventricle segmentation algorithm based on contrastive learning

A semi-supervised convolutional neural network segmentation method of medical images based on contrastive learning is proposed. The cardiac magnetic resonance imaging(MRI) images to be segmented are preprocessed to obtain positive and negative samples by labels. The U-Net shrinks network is applied to extract features of the positive samples, negative samples, and input samples. In addition, an unbalanced contrastive loss function is proposed, which is weighted with the binary cross-entropy loss...     

类不均衡的半监督高斯过程分类算法

针对传统的监督学习方法难以解决真实数据集标记信息少、训练样本集中存在类不均衡的问题,提出了类不均衡的半监督高斯过程分类算法。算法引入自训练的半监督学习思想,结合高斯过程分类算法计算后验概率,向未标记数据中注入类标记以获得更多准确可信的标记数据,使得训练样本的类分布相对平衡,分类器自适应优化以获得较好的分类效果。实验结果表明,在类不均衡的训练样本及标记信息过少的情况下,该算法通过自训练分类器获得了有效标记,使分类精度得到了有效提高,为解决类不均衡数据分类提供了一个新的思路。     

基于在线半监督boosting的协同训练目标跟踪算法

基于自训练的判别式目标跟踪算法使用分类器的预测结果更新分类器自身,容易累积分类错误,从而导致漂移问题。为了克服自训练跟踪算法的不足,该文提出一种基于在线半监督boosting的协同训练目标跟踪算法(简称Co-SemiBoost),其采用一种新的在线协同训练框架,利用未标记样本协同训练两个特征视图中的分类器,同时结合先验模型和在线分类器迭代预测未标记样本的类标记和权重。该算法能够有效提高分类器的判别能力,鲁棒地处理遮挡、光照变化等问题,从而较好地适应目标外观的变化。在若干个视频序列的实验结果表明,该算法具有良好的跟踪性能。     

基于图注意力网络的半监督SAR舰船目标检测

基于深度学习的合成孔径雷达(SAR)舰船目标检测近年得到了快速发展。然而,传统有监督学习需要大量的标记样本来训练网络。针对此问题,该文提出一种基于图注意力网络(GAT)的半监督SAR舰船目标检测方法。首先,设计了对称卷积神经网络用于海陆分割。随后,完成超像素分割并将超像素块建模为GAT的节点,利用感兴趣区域池化层提取节点的多尺度特征。GAT采用注意力机制自适应地汇聚邻接节点特征实现对无标记节点的分类。最后,将预测为舰船目标的超像素块定位到SAR图像中并获得精细检测结果。在实测高分辨SAR图像数据集上验证了所提方法。结果表明该方法可以在少量标记样本下,以低虚警率实现对舰船目标的可靠检测。