...
首页> 外文期刊>Engineering Applications of Artificial Intelligence >A regularized point-to-manifold distance metric for multi-view multi-manifold learning
【24h】

A regularized point-to-manifold distance metric for multi-view multi-manifold learning

机译:用于多视图多流形学习的正则化点到流形距离度量

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

In this paper, we propose a regularized point-to-manifold distance metric to measure the distance between the unknown query object and object-specific manifolds for the task multi-view multi-manifold learning. Our metric determine the class of query object based on the class of objects that have smallest average geodesic distance from it. To do this, we propose our proposed method with the two features: 1. We automatically discover the object-specific manifolds. In this section, we focus on the fundamental problem of efficiently selecting a uniform class-consistent neighbors from all available poses for graph-based multi-manifold learning methods in a supervised manner. Also, we extract the most distinctive exemplars from the manifold of each object that cover the possible variations on pose angles. To make a distinction between some object-specific pose-inconsistent and object-inconsistent pose-consistent that may be very close, we utilize the total variation regularized least squares problem to representing each object in a weighted sum of its class-consistent neighbors under different poses. 2. We use the information of k objects to decide about the class of query object. We measure the distance between the unknown object and k exemplars of each object-specific manifold to find the closest manifold as the class of query object. Numerical experiments on several benchmark multi-view datasets are reported, which provide excellent support to the proposed methods. In the mean, our neighborhood graph can improve the SH-NGC and UTDTV, as new supervised multi-manifold learning and unsupervised multi-view multi-manifold learning methods, more than 2.6 and 7%, respectively. Also, in object recognition, our proposed method achieves more than 5% better results respect to the best result of state-of-the-art graph-based manifold learning methods.
机译:在本文中,我们提出了一种正则化的点到流形距离度量,以测量未知查询对象与特定对象流形之间的距离,以进行任务多视图多流形学习。我们的度量标准基于与之具有最小平均测地距离的对象的类来确定查询对象的类。为此,我们提出了具有两个功能的建议方法:1.我们自动发现特定对象的歧管。在本节中,我们关注于以下基本问题:从所有可用姿势中有选择地以有监督的方式有效地选择一致的类一致邻居。同样,我们从每个对象的流形提取最独特的示例,这些示例涵盖了姿势角度的可能变化。为了区分可能非常接近的某些特定于对象的姿势不一致和对象不一致的姿势一致,我们利用总变化正则化最小二乘问题来表示每个对象在不同状态下其类一致邻居的加权和姿势。 2.我们使用k个对象的信息来决定查询对象的类别。我们测量未知对象与每个特定于对象的流形的k个样本之间的距离,以找到最接近的流形作为查询对象的类别。报告了几个基准多视图数据集上的数值实验,为所提出的方法提供了出色的支持。平均而言,我们的邻域图可以改善SH-NGC和UTDTV,因为新的监督多流形学习和无监督多视图多流形学习方法分别超过2.6和7%。同样,在对象识别中,相对于基于图的最先进流形学习方法的最佳结果,我们提出的方法可实现超过5%的更好结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号