改进的ICP算法在三维模型配准中的研究

TP391.4; 针对整体与部分3D模型间的配准问题,提出了一种基于自适应最优阈值的迭代最近点(iterative closest point,ICP)算法.首先使用主成分分析法将模型进行初始配准,并使用三维缩放变换调整模型的大小;然后采用KD-tree进行最近邻搜索以提高对应点的查找速度,计算在不同的阈值下对两模型执行ICP算法的配准误差,并记录误差最小时所对应的阈值Kbest;再以Kbest为阈值重新对两模型执行ICP算法,将目标模型和源模型配准;最后执行三维目标重合度检测算法,根据重合度再进行最后的反转调整.实验结果表明,改进的ICP算法既能配准整体与部分模型,也适用于两个完整模型间的配...

Full description

Saved in:
Bibliographic Details
Published in计算机科学与探索 Vol. 12; no. 1; pp. 153 - 162
Main Authors 杨军, 张瑶, 黄亮
Format Journal Article
LanguageChinese
Published 兰州交通大学 电子与信息工程学院,兰州,730070%兰州交通大学 自动化与电气工程学院,兰州,730070 2018
Subjects
Online AccessGet full text
ISSN1673-9418
DOI10.3778/j.issn.1673-9418.1610033

Cover

Abstract TP391.4; 针对整体与部分3D模型间的配准问题,提出了一种基于自适应最优阈值的迭代最近点(iterative closest point,ICP)算法.首先使用主成分分析法将模型进行初始配准,并使用三维缩放变换调整模型的大小;然后采用KD-tree进行最近邻搜索以提高对应点的查找速度,计算在不同的阈值下对两模型执行ICP算法的配准误差,并记录误差最小时所对应的阈值Kbest;再以Kbest为阈值重新对两模型执行ICP算法,将目标模型和源模型配准;最后执行三维目标重合度检测算法,根据重合度再进行最后的反转调整.实验结果表明,改进的ICP算法既能配准整体与部分模型,也适用于两个完整模型间的配准,提高了ICP算法的精确度.
AbstractList TP391.4; 针对整体与部分3D模型间的配准问题,提出了一种基于自适应最优阈值的迭代最近点(iterative closest point,ICP)算法.首先使用主成分分析法将模型进行初始配准,并使用三维缩放变换调整模型的大小;然后采用KD-tree进行最近邻搜索以提高对应点的查找速度,计算在不同的阈值下对两模型执行ICP算法的配准误差,并记录误差最小时所对应的阈值Kbest;再以Kbest为阈值重新对两模型执行ICP算法,将目标模型和源模型配准;最后执行三维目标重合度检测算法,根据重合度再进行最后的反转调整.实验结果表明,改进的ICP算法既能配准整体与部分模型,也适用于两个完整模型间的配准,提高了ICP算法的精确度.
Abstract_FL This paper proposes an improved ICP(iterative closest point)algorithm based on adaptive optimal thres-hold to align two shape models.These shape models can either be partial or complete.First,the models are pre-aligned using PCA(principal component analysis) roughly, then their size are adjusted using a three-dimensional scaling transformation.Second,the nearest neighbor search is carried out using KD-tree.This improves the speed of searching the corresponding points.Using ICP,the aligning error of the source and target model is calculated with respect to a set of threshold,then the threshold Kbestcorresponding to the minimum error is recorded.And then, Kbestis taken as a new threshold to align the two models using ICP again. Finally, an algorithm for detecting coincidence degree between 3D shapes is executed, thereafter, the source model is adjusted according to the resulting coincidence de-gree. The experimental results show that the proposed algorithm can align two models, especially for partial and complete models and clearly improves the accuracy of ICP algorithm.
Author 黄亮
张瑶
杨军
AuthorAffiliation 兰州交通大学 电子与信息工程学院,兰州,730070%兰州交通大学 自动化与电气工程学院,兰州,730070
AuthorAffiliation_xml – name: 兰州交通大学 电子与信息工程学院,兰州,730070%兰州交通大学 自动化与电气工程学院,兰州,730070
Author_FL ZHANG Yao
HUANG Liang
YANG Jun
Author_FL_xml – sequence: 1
  fullname: YANG Jun
– sequence: 2
  fullname: ZHANG Yao
– sequence: 3
  fullname: HUANG Liang
Author_xml – sequence: 1
  fullname: 杨军
– sequence: 2
  fullname: 张瑶
– sequence: 3
  fullname: 黄亮
BookMark eNo9jbtKA0EYhaeIYIx5B1uLXeefmf1ntpTFSyCgRfowu9mRrDIBR1F7L4jYJQgqol0stFEkYuHLZHf1LVxQrM7h4_CdOVKzA5sSsgDU51KqpczvO2d9QMm9UICqGlDKeY3U_9ksaTrXj2kgBAOJqk54MXz_-rwpr49b0Wb5fFW8jPLb8XRyXn68FuOH_O7i--QyPzudTp6qTXk_LB_f5smM0Tsubf5lg3RWVzrRutfeWGtFy20vQUBPYayN6KEBDAC4ZD2ltDHADNc81EkgE-RCg0IpY5nEBgMpeGpMwBAZhLxBFn-1B9oabbe62WB_11aH3cxl24dHe45RUBQoIP8B8phbiA
ClassificationCodes TP391.4
ContentType Journal Article
Copyright Copyright © Wanfang Data Co. Ltd. All Rights Reserved.
Copyright_xml – notice: Copyright © Wanfang Data Co. Ltd. All Rights Reserved.
DBID 2B.
4A8
92I
93N
PSX
TCJ
DOI 10.3778/j.issn.1673-9418.1610033
DatabaseName Wanfang Data Journals - Hong Kong
WANFANG Data Centre
Wanfang Data Journals
万方数据期刊 - 香港版
China Online Journals (COJ)
China Online Journals (COJ)
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
DocumentTitle_FL Research on 3D Model Registration by Improved ICP Algorithm
EndPage 162
ExternalDocumentID jsjkxyts201801016
GrantInformation_xml – fundername: The National Natural Science Foundation of China under Grant No.61462059; the Technology Foundation for Selected Overseas Chinese Scholar,Ministry of Human Resources and Social Security of China under Grant No.2013277; the Fundamental Research Funds for Gansu Provincial Universities under Grant No.214142
GroupedDBID 2B.
4A8
92I
93N
ALMA_UNASSIGNED_HOLDINGS
M~E
PSX
TCJ
ID FETCH-LOGICAL-c616-86baf4d6f16511372d88aff12f3a39ac57c634a18677b7cbf65743eff52662193
ISSN 1673-9418
IngestDate Thu May 29 04:00:17 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords iterative closest point
主成分分析法
模型配准
model registration
迭代最近点算法
principal component analysis
Language Chinese
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c616-86baf4d6f16511372d88aff12f3a39ac57c634a18677b7cbf65743eff52662193
PageCount 10
ParticipantIDs wanfang_journals_jsjkxyts201801016
PublicationCentury 2000
PublicationDate 2018
PublicationDateYYYYMMDD 2018-01-01
PublicationDate_xml – year: 2018
  text: 2018
PublicationDecade 2010
PublicationTitle 计算机科学与探索
PublicationTitle_FL Journal of Frontiers of Computer Science & Technology
PublicationYear 2018
Publisher 兰州交通大学 电子与信息工程学院,兰州,730070%兰州交通大学 自动化与电气工程学院,兰州,730070
Publisher_xml – name: 兰州交通大学 电子与信息工程学院,兰州,730070%兰州交通大学 自动化与电气工程学院,兰州,730070
SSID ssib054421768
ssib002040941
ssib002423894
ssib051375751
ssib023646573
ssib036438069
ssib002040926
Score 2.1301718
Snippet TP391.4; 针对整体与部分3D模型间的配准问题,提出了一种基于自适应最优阈值的迭代最近点(iterative closest point,ICP)算法.首先使用主成分分析法将模型进行初始配准,并使...
SourceID wanfang
SourceType Aggregation Database
StartPage 153
Title 改进的ICP算法在三维模型配准中的研究
URI https://d.wanfangdata.com.cn/periodical/jsjkxyts201801016
Volume 12
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  issn: 1673-9418
  databaseCode: M~E
  dateStart: 20070101
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://road.issn.org
  omitProxy: true
  ssIdentifier: ssib054421768
  providerName: ISSN International Centre
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3Na9VAEA-1XryIn_hNEeckrybZ7-MmTakexEOF3kqSlygVnuB7Be3Bkx-IeKsIKqK3etCLIhUP_jNtn_4Xzmzy8qKtUOslbHZnZ34zk7czm7e78bwLqlQyk12cneSad3gh0g7myawjMp2XQdDF0dKd9nlVzl3nVxbEwsTkkdaqpeVBNp2v7LivZC9exTr0K-2S_QfPNkyxAsvoX7yih_G6Kx9DIsFwiAwkGqJZMBEkCowFzS_H16hsEzCKyCIGRkAiwMRgNSTYS4M2RBNFEHGiwXobOJoENLIyoAXoGarRCrSse9mZRooT4RMGKhiIZDvZJVQIgHi2kCCAyLoaZOLEIUM7Yq4TosGrDR02joXRQ-F6zzj4guCYaNwiIIoJSuKYRnLcYkhBgspJrk3a7znqQZmeSccTufiOlyIb1D24s4RPGhNYTsBHqC86gUgn6irjtxTh5BRSHzUKwM7WrK1w6mtn5EZ9A8aQ1mG8A5QwphP_lQ-h2DNQTV60rk3bkRVjMG3TN8pIEkB-_V_EragnFesYXtt8FBbDbT__KsYF1enOdboUVMH0z0jMlNIuEpOA6UYAlgL6fOA4-2jWhC71l27dvTfok-_dwYf7vP2hwvSR1uPeT8Y5JYYd054T0z3_bXM2JuFNkKEPJEgxztHxlmlfNjm8CJii_x6be85xll5toR2hrlYAkkqX_qaQ2_PXK9PejVZ6On_IO1jPK6dsNUgc9iZWbh712Nbq1x_fXw1fPsDhYPjxxdan55uv1zbWnwy_fd5ae7f55unPh882Hz_aWP-ANMO3q8P3X45587PJfDzXqb-S0sllIDtaZmnJu7IMJM6dmAq7WqdlGYQlS5lJc6FyyXjqzq3MVJ6VaAzOirIUmJpjusKOe5O9273ihDeVFcoEqlAyzQvuZyXOnTLhd6UsSjQL6570ztc6LtaDYH9xm9dO7YbotHeAytWrzDPe5ODOcnEWk_tBds45-xdGOa1n
linkProvider ISSN International Centre
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=%E6%94%B9%E8%BF%9B%E7%9A%84ICP%E7%AE%97%E6%B3%95%E5%9C%A8%E4%B8%89%E7%BB%B4%E6%A8%A1%E5%9E%8B%E9%85%8D%E5%87%86%E4%B8%AD%E7%9A%84%E7%A0%94%E7%A9%B6&rft.jtitle=%E8%AE%A1%E7%AE%97%E6%9C%BA%E7%A7%91%E5%AD%A6%E4%B8%8E%E6%8E%A2%E7%B4%A2&rft.au=%E6%9D%A8%E5%86%9B&rft.au=%E5%BC%A0%E7%91%B6&rft.au=%E9%BB%84%E4%BA%AE&rft.date=2018&rft.pub=%E5%85%B0%E5%B7%9E%E4%BA%A4%E9%80%9A%E5%A4%A7%E5%AD%A6+%E7%94%B5%E5%AD%90%E4%B8%8E%E4%BF%A1%E6%81%AF%E5%B7%A5%E7%A8%8B%E5%AD%A6%E9%99%A2%2C%E5%85%B0%E5%B7%9E%2C730070%25%E5%85%B0%E5%B7%9E%E4%BA%A4%E9%80%9A%E5%A4%A7%E5%AD%A6+%E8%87%AA%E5%8A%A8%E5%8C%96%E4%B8%8E%E7%94%B5%E6%B0%94%E5%B7%A5%E7%A8%8B%E5%AD%A6%E9%99%A2%2C%E5%85%B0%E5%B7%9E%2C730070&rft.issn=1673-9418&rft.volume=12&rft.issue=1&rft.spage=153&rft.epage=162&rft_id=info:doi/10.3778%2Fj.issn.1673-9418.1610033&rft.externalDocID=jsjkxyts201801016
thumbnail_s http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fwww.wanfangdata.com.cn%2Fimages%2FPeriodicalImages%2Fjsjkxyts%2Fjsjkxyts.jpg