基于半监督稀疏流形嵌入的高光谱影像特征提取

高光谱影像具有波段数多、冗余度高的特点,因此特征提取成为高光谱影像分类的研究热点。针对此问题,该文提出一种半监督稀疏流形嵌入(S3ME)算法,该方法充分利用标记样本和无标记样本,通过基于切空间的稀疏流形表示来自适应地揭示数据间的相似关系,并利用稀疏系数构建一个半监督相似图。在此基础上,增加了图中同类标记样本的权重,然后在低维空间中保持图的相似关系不变,并最小化加权距离和,获得投影矩阵实现特征提取。S3ME方法不仅能揭示数据间的稀疏流形结构,而且增强了同类数据的集聚性,能有效提取出鉴别特征,改善分类效果。该文提出的S3ME方法在PaviaU和Salinas高光谱数据集上的总体分类精度分别达到84.62%和88.07%,相比传统特征提取方法提升了地物分类性能。     

基于Sinkhorn距离特征缩放的多约束非负矩阵分解算法

为了减少原始特征对非负矩阵分解(NMF)算法的共适应性干扰,并提高NMF的子空间学习能力与聚类性能,该文提出一种基于Sinkhorn距离特征缩放的多约束半监督非负矩阵分解算法。首先该算法通过Sinkhorn距离对原始输入矩阵进行特征缩放,提高空间内同类数据特征之间的关联性,然后结合样本标签信息的双图流形结构与范数稀疏约束作为双正则项,使分解后的基矩阵具有稀疏特性和较强的空间表达能力,最后,通过KKT条件对所提算法目标函数的进行优化推导,得到有效的乘法更新规则。通过在多个图像数据集以及平移噪声数据上的聚类实验结果对比分析,该文所提算法具有较强的子空间学习能力,且对平移噪声有更强的鲁棒性。     

基于三元采样图卷积网络的半监督遥感图像检索

该文提出了一种基于三元采样图卷积网络的度量学习方法,以实现遥感图像的半监督检索。所提方法由三元图卷积网络(TGCN)和基于图的三元组采样(GTS)两部分组成。TGCN由3个具有共享权重的并行卷积神经网络和图卷积网络组成,用以提取图像的初始特征以及学习图像的图嵌入。通过同时学习图像特征以及图嵌入,TGCN能够得到用于半监督图像检索的有效图结构。接着,通过提出的GTS算法对图结构内隐含的图像相似性信息进行评价,以选择合适的困难三元组(Hard Triplet),并利用困难三元组组成的样本集合对模型进行有效快速的模型训练。通过TGCN和GTS的组合,提出的度量学习方法在两个遥感数据集上进行了测试。实验结果表明,TGCN-GTS具有以下两方面的优越性：TGCN能够根据图像及图结构学习到有效的图嵌入特征及度量空间;GTS有效评估图结构内隐含的图像相似性信息选择合适的困难三元组,显著提升了半监督遥感图像检索效果。     

基于局部行为搜索策略的半监督学习算法及其应用研究

近年来,半监督学习在模式识别和机器学习领域引起了广泛关注。在这些方法中,半监督支持向量机是非常主流的一类方法。然而,学习过程中热核函数的参数选择问题一直困扰着研究人员,若选取不当,学习性能会显著下降。为了解决该问题,本文提出一种新颖的基于局部行为搜索策略的半监督学习算法。新算法基于人类行为搜索策略,传统的支持向量机被正则化为拉普拉斯图。在搜索到特征空间的局部分布后,行为因子能够映射到样本邻域的潜在概率分布。为验证新算法有效性,本文分别进行了UCI数据集和实际通信辐射源特征数据集实验。实验结果显示与传统方法相比,新算法的分类结果能够更加有效和稳定。      

基于图卷积半监督学习的论文作者同名消歧方法研究

为解决学者与成果的精确匹配问题,该文提出了一种基于图卷积半监督学习的论文作者同名消歧方法。该方法使用SciBERT预训练语言模型计算论文题目、关键字获得论文节点语义表示向量,利用论文的作者和机构信息获得论文的合作网络和机构关联网络邻接矩阵,并从论文合作网络中采集伪标签获得正样本集和负样本集,将这些作为输入利用图卷积神经网络进行半监督学习,获得论文节点嵌入表示进行论文节点向量聚类,实现对论文作者同名消歧。实验结果表明,与其他消歧方法相比,该方法在实验数据集上取得了更好的效果。     

基于接收信号强度非齐性分布特征的半监督学习室内定位指纹库构建

室内定位中半监督学习的指纹库构建方法能够降低人力开销,但忽略了高维接收信号强度(RSS)数据不均匀的非齐分布特点,影响定位精度,针对此问题该文提出一种基于RSS非齐性分布特征的半监督流形对齐指纹库构建方法。该算法运用局部RSS尺度参数以及共享近邻相似性构造权重矩阵,得到精确反映RSS数据流形结构的权重图,利用该权重图通过求解流形对齐的目标函数最优解,实现运用少量标记数据对大量未标记数据的位置标定。实验结果表明,该算法可以显著降低离线阶段数据采集的工作量,同时可以取得较高的定位精度。     

Discriminative low-rank embedding with manifold constraint for image feature extraction and classification

The robustness against noise, outliers, and corruption is a crucial issue in image feature extraction. To address this concern, this paper proposes a discriminative low-rank embedding image feature extraction algorithm. Firstly, to enhance the discriminative power of the extracted features, a discriminative term is introduced using label information, obtaining global discriminative information and learning an optimal projection matrix for data dimensionality reduction. Secondly, manifold constraints are incorporated, unifying low-rank embedding and manifold constraints into a single framework to capture the geometric structure of local manifolds while considering both local and global information. Finally, test samples are projected into a lower-dimensional space for classification. Experimental results demonstrate that the proposed method achieves classification accuracies of 95.62%, 95.22%, 86.38%, and 86.54% on the ORL, CMUPIE, AR, and COIL20 datasets, respectively, outperforming dimensionality reduction-based image feature extraction algorithms.     

基于无监督特征选择的高光谱图像分类方法

在高光谱图像分类中,丰富的数据提升了其地物 识别能力。然而,由于样本特 征数大且有标记训练样本点少,导致“维度灾难”问题。本文提出一种基于无监督特征选择 的高光谱图像分类方 法,该方法同时考虑数据的流形嵌入映射和稀疏表达,将特征选择问题转化为一个优 化问题,数据的流形嵌入和稀疏表达作为约束项加入目标函数。设计了三个目标函 数,第一个目标函数描述流形学习的局部性原则,第二个目标函数将原始样本点回归 到低维嵌入空间,第三个目标函数对回归系数进行正则化。针对目标函数非凸的问 题,用迭代的方法来解这个约束优化问题,给出了解该优化问题的算法。优选特征用 于参与后续的分类识别任务。在真实的高光谱数据集上的实验表明,新方法能够提高 分类的精度。     

Indoor localization via -graph regularized semi-supervised manifold learning

In this paper,a new l1-graph regularized semi-supervised manifold learning(LRSML) method is proposed for indoor localization.Due to noise corruption and non-linearity of received signal strength(RSS),traditional approaches always fail to deliver accurate positioning results.The l1-graph is constructed by sparse representation of each sample with respect to remaining samples.Noise factor is considered in the construction process of l1-graph,leading to more robustness compared to traditional k-nearest-neighbor graph(KNN-graph).The KNN-graph construction is supervised,while the l1-graph is assumed to be unsupervised without harnessing any data label information and uncovers the underlying sparse relationship of each data.Combining KNN-graph and l1-graph,both labeled and unlabeled information are utilized,so the LRSML method has the potential to convey more discriminative information compared to conventional methods.To overcome the non-linearity of RSS,kernel-based manifold learning method(K-LRSML) is employed through mapping the original signal data to a higher dimension Hilbert space.The efficiency and superiority of LRSML over current state of art methods are verified with extensive experiments on real data.     

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.     

Big-bang simulation for embedding network distances in Euclidean space

Embedding of a graph metric in Euclidean space efficiently and accurately is an important problem in general with applications in topology aggregation, closest mirror selection, and application level routing. We propose a new graph embedding scheme called Big-Bang Simulation (BBS), which simulates an explosion of particles under a force field derived from embedding error. BBS is shown to be significantly more accurate compared to all other embedding methods, including GNP. We report an extensive simulation study of BBS compared with several known embedding schemes and show its advantage for distance estimation (as in the IDMaps project), mirror selection, and topology aggregation.     

ERSearch:一种高效的子图查询算法

子图查询是图数据库研究中的一个重要问题,许多方法基于“过滤-验证”策略进行子图查询,算法研究的重点为快速找到有效的特征集.通过对特征模式在数据图集中的嵌入信息进行分析,离线建立基于重叠关系、邻接关系和近邻关系的嵌入关系索引,提出基于嵌入关系的子图查询算法ERSearch.在给定查询图后,利用特征共现关系与特征嵌入关系联合进行过滤操作,并将过滤阶段的嵌入关系比对结果用于验证过程,提高验证效率.在真实及模拟数据上的实验表明,通过与PathIndex等方法的对比,ERSearch算法有效缩减了候选集的规模,能有效提高过滤与验证阶段的执行效率.     

基于全局特征图的半监督微博文本情感分类

网络社交的流行与普及,使得微博等短文本区别于以往传统文章,具有了独有的文学表达形式和情感发泄方式,导致基于短文本的机器学习情感分析工作难度逐渐增大.针对微博短文本的语言表达新特性,爬取收集大量无情感标记微博数据,建立微博短文本语料库,基于全局语料库构建词与短文本的全局关系图,使用BERT(Bidirectional E...     

Joint feature representation and classification via adaptive graph semi-supervised nonnegative matrix factorization

As an effective feature representation method, non-negative matrix factorization (NMF) cannot utilize the label information sufficiently, which makes it not be suitable for the classification task. In this paper, we propose a joint feature representation and classification framework named adaptive graph semi-supervised nonnegative matrix factorization (AGSSNMF). Firstly, to enhance the discriminative ability of feature representation and accomplish the classification task, a regression model with nonnegative matrix factorization (called as RNMF) is proposed, which exploits the relation between the label information and feature representation. Secondly, to overcome the drawback of insufficient labels, an adaptive graph-based label propagation (refereed as AGLP) model is established, which adopts a local constraint to reflect the local structure of data. Then, we integrate RNMF and AGLP into a unified framework for feature representation and classification. Finally, an iterative optimization algorithm is used to solve the objective function. Extensive experiments show that the proposed framework has excellent performance compared with some well-known methods.     

Noise‐Robust Speaker Recognition Using Subband Likelihoods and Reliable‐Feature Selection

We consider the feature recombination technique in a multiband approach to speaker identification and verification. To overcome the ineffectiveness of conventional feature recombination in broadband noisy environments, we propose a new subband feature recombination which uses subband likelihoods and a subband reliable‐feature selection technique with an adaptive noise model. In the decision step of speaker recognition, a few very low unreliable feature likelihood scores can cause a speaker recognition system to make an incorrect decision. To overcome this problem, reliable‐feature selection adjusts the likelihood scores of an unreliable feature by comparison with those of an adaptive noise model, which is estimated by the maximum a posteriori adaptation technique using noise features directly obtained from noisy test speech. To evaluate the effectiveness of the proposed methods in noisy environments, we use the TIMIT database and the NTIMIT database, which is the corresponding telephone version of TIMIT database. The proposed subband feature recombination with subband reliable‐feature selection achieves better performance than the conventional feature recombination system with reliable‐feature selection.     

一种新颖的通信辐射源个体细微特征提取方法

针对传统的方法难以有效提取通信辐射源个体鲁棒的细微特征, 将流形学习理论引入到通信辐射源细微特征提取, 提出了一种基于正交局部样条判别流形嵌入的通信辐射源个体细微特征提取方法.在实际采集的通信电台数据集上的实验结果验证了该方法的有效性与可行性.     

Kernel collaboration representation-based manifold regularized model for unconstrained face recognition

Most recent researches have demonstrated the effectiveness of using kernel function into sparse representation and collaborative representation, which can overcome the problem of ignoring the nonlinear relationship of samples in face recognition and other classification problems. Considering the fact that space structure information (i.e., manifold structure or spatial consistence) can help a lot in robust sparse coding by nonlinear kernel metrics. In our paper, we present a kernel collaborative representation-based manifold regularized method, where we apply kernel collaborative representation with \({{\ell }_{2}}\)-regularization-based classifier and add spatial similarity structure to collaborative representation for benefiting classification accuracy. Meanwhile, the local binary patterns feature is used to increase discrimination of classifier and reduce the sensitivity to unconstrained case (i.e., occlusion or noise). So our method is a joint model of linear and nonlinear, local feature and distance metrics, kernel subspace structure and manifold structure. Experiments show that the proposed method outperforms several similar state-of-the-art methods in terms of accuracy and time cost.     

Joint feature weighting and adaptive graph-based matrix regression for image supervised feature Selection

Matrix regression (MR) is a regression model that can directly perform on matrix data. However, the effect of each element in matrix data on regression model is different. Taking into consideration the relevance of every original feature in the matrix data and their influence on the final estimation of the regression model, we introduce an unknown weight matrix to encode the relevance of feature in matrix data and propose a feature weighting and graph-based matrix regression (FWGMR) model for image supervised feature selection. In this model, the feature weight matrix is used to select some important features from the matrix data and preserve the relative spatial location relationship of elements in the matrix data. In addition, in order to effectively and reasonably preserve the local manifold structure of the training matrix samples, a regularization term in the model is used to adaptively learn a graph matrix on low-dimensional space. An optimization algorithm is devised to solve FWGMR model and to provide the closed-form solutions of this model in each iteration. Extensive experiments on some public datasets demonstrate the superiority of FWGMR.     

空间一致性邻域保留嵌入的高光谱数据特征提取

局部线性嵌入(LLE)和邻域保留嵌入(NPE)等流形学习方法可以提取高光谱数据的主要结构特征,有助于对数据的理解和进一步处理。但是,这些方法忽视了高光谱图像中相邻像素之间的相关性。针对这个问题,提出一种基于空间一致性思想的邻域保留嵌入(SC-NPE)特征提取算法,通过一个优化的局部线性嵌入,并考虑相邻像素的相关特性,在高维空间建立数据的局部邻域结构。然后寻找一个优化的变换矩阵,将局部邻域结构投影到低维空间,实现数据的特征提取。与LLE和NPE算法相比,SC-NPE既考虑高光谱数据的流形结构,又考虑了其图像域空间信息,可以更好地应用在高光谱数据的特征提取过程中。实验结果表明,SC-NPE特征提取算法在高光谱图像分类方面的性能明显优于其他同类算法。     

Active contour evolved by joint probability classification on Riemannian manifold

In this paper, we present an active contour model for image segmentation based on a nonparametric distribution metric without any intensity a priori of the image. A novel nonparametric distance metric, which is called joint probability classification, is established to drive the active contour avoiding the instability induced by multimodal intensity distribution. Considering an image as a Riemannian manifold with spatial and intensity information, the contour evolution is performed on the image manifold by embedding geometric image feature into the active contour model. The experimental results on medical and texture images demonstrate the advantages of the proposed method.