Multitask Multiscale Feature Selection for Point Cloud Registration

IF 11.7 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE IEEE Transactions on Evolutionary Computation Pub Date : 2025-01-06 DOI:10.1109/TEVC.2025.3526779
Yue Wu;Chuang Luo;Maoguo Gong;Hangqi Ding;Jinlong Sheng;Qiguang Miao;Hao Li;Wenping Ma;Hao He
{"title":"Multitask Multiscale Feature Selection for Point Cloud Registration","authors":"Yue Wu;Chuang Luo;Maoguo Gong;Hangqi Ding;Jinlong Sheng;Qiguang Miao;Hao Li;Wenping Ma;Hao He","doi":"10.1109/TEVC.2025.3526779","DOIUrl":null,"url":null,"abstract":"3-D point cloud registration is a process of solving the geometric transformation between two point clouds. This process is an important issue in computer vision and pattern recognition. The registration methods based on geometric features are highly sensitive to the scale of feature extraction. Changes in scale can introduce inaccuracies in feature descriptions, thereby compromising the reliability of the registration results. To mitigate the impact of feature scale on the outcomes and the high-dimensional issue arising from features of different scales, we propose a method for multiscale point cloud feature selection (FS). We solve the high-dimensional problem of FS by designing a multitask framework. By designing a mutual information dimensionality reduction method, we decomposed the high-dimensional FS task of different descriptors with multiscale features into multiple related low-dimensional FS tasks. Then, by means of the knowledge transfer among these low-dimensional FS tasks, we sought the best feature subset to obtain more robust feature information. We evaluate the effectiveness of our method by conducting extensive experiments on various datasets. The experimental results show that the method outperforms other feature descriptors in terms of descriptive power and robustness and improves the effectiveness of point cloud registration.","PeriodicalId":13206,"journal":{"name":"IEEE Transactions on Evolutionary Computation","volume":"29 6","pages":"2804-2818"},"PeriodicalIF":11.7000,"publicationDate":"2025-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10829809/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

3-D point cloud registration is a process of solving the geometric transformation between two point clouds. This process is an important issue in computer vision and pattern recognition. The registration methods based on geometric features are highly sensitive to the scale of feature extraction. Changes in scale can introduce inaccuracies in feature descriptions, thereby compromising the reliability of the registration results. To mitigate the impact of feature scale on the outcomes and the high-dimensional issue arising from features of different scales, we propose a method for multiscale point cloud feature selection (FS). We solve the high-dimensional problem of FS by designing a multitask framework. By designing a mutual information dimensionality reduction method, we decomposed the high-dimensional FS task of different descriptors with multiscale features into multiple related low-dimensional FS tasks. Then, by means of the knowledge transfer among these low-dimensional FS tasks, we sought the best feature subset to obtain more robust feature information. We evaluate the effectiveness of our method by conducting extensive experiments on various datasets. The experimental results show that the method outperforms other feature descriptors in terms of descriptive power and robustness and improves the effectiveness of point cloud registration.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
点云配准的多任务多尺度特征选择
三维点云配准是求解两个点云之间几何变换的过程。这个过程是计算机视觉和模式识别中的一个重要问题。基于几何特征的配准方法对特征提取的尺度高度敏感。尺度的变化会导致特征描述不准确,从而影响配准结果的可靠性。为了减轻特征尺度对结果的影响以及不同尺度特征引起的高维问题,我们提出了一种多尺度点云特征选择方法。我们通过设计一个多任务框架来解决FS的高维问题。通过设计一种互信息降维方法,将具有多尺度特征的不同描述符的高维FS任务分解为多个相关的低维FS任务。然后,通过这些低维FS任务之间的知识转移,寻求最佳特征子集,以获得更鲁棒的特征信息。我们通过在各种数据集上进行广泛的实验来评估我们方法的有效性。实验结果表明,该方法在描述能力和鲁棒性方面优于其他特征描述符,提高了点云配准的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation 工程技术-计算机:理论方法
CiteScore
21.90
自引率
9.80%
发文量
196
审稿时长
3.6 months
期刊介绍: The IEEE Transactions on Evolutionary Computation is published by the IEEE Computational Intelligence Society on behalf of 13 societies: Circuits and Systems; Computer; Control Systems; Engineering in Medicine and Biology; Industrial Electronics; Industry Applications; Lasers and Electro-Optics; Oceanic Engineering; Power Engineering; Robotics and Automation; Signal Processing; Social Implications of Technology; and Systems, Man, and Cybernetics. The journal publishes original papers in evolutionary computation and related areas such as nature-inspired algorithms, population-based methods, optimization, and hybrid systems. It welcomes both purely theoretical papers and application papers that provide general insights into these areas of computation.
期刊最新文献
Differential Evolution Algorithm Based on Spatial Partition Perturbation Mechanism Evolutionary Generative Optimization: Towards Fully Data-Driven Evolutionary Optimization via Generative Learning Enabling Population-Level Parallelism in Tree-Based Genetic Programming for GPU Acceleration Self-Guided Simulation-Driven Optimization for Expensive Filtering Patch Antenna Design and a Benchmark One-Step Diffusion Distillation Evolutionary Algorithm with Score Implicit Matching for Neural Architecture Search
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1