112008 4-Points Congruent Sets for Robust-Linux大棚

admin 管理员组

文章数量: 1184232

2024年4月16日发(作者：郑州本轮疫情为何难以控制这是)

-PointsCongruentSetsforRobustPairwiseSurfaceRegistration

DrorAiger

DepartmentofComputerScience,

BenGurionUniversity

IITDelhi

TUVienna

DanielCohen-Or

SchoolofComputerScience,

TelAvivUniversity

(a)(b)(c)(d)

Figure1:tructionresultsfromnineinputscansofashinnywaterjug.

Neighboringscanshave40%overlaporless,andrequiredanaverageof16secondsforfullyautomaticalignmentstartingfromarbitrary

lpairwisealignmentsareshownin(a)and(b),wherefor

ﬁnalalignmentresult,(c)and(d),isobtainedwithoutanydatasmoothing,

outlierremoval,localICPreﬁnement,globalerrordistribution,oranyassumptionaboutstartingalignment.

Abstract

Weintroduce4PCS,afastandrobustalignmentschemefor3D

pointsetsthatuseswidebases,whichareknowntoberesilientto

orithmallowsregisteringrawnoisydata,

possiblycontaminatedwithoutliers,withoutpre-ﬁlteringordenois-

r,themethodsigniﬁcantlyreducesthenumber

oftrialsrequiredtoestablishareliableregistrationbetweentheun-

derlyingsurfacesinthepresenceofnoise,withoutanyassumptions

hodisbasedonanoveltech-

niquetoextractallcoplanar4-pointssetsfroma3Dpointsetthat

areapproximatelycongruent,underrigidtransformation,toagiven

tractionprocedurerunsinroughly

O(n

+k)time,wherenisthenumberofcandidatepointsand

tice,whennoise

levelislowandthereissufﬁcientoverlap,usinglocaldescriptors

thetimecomplexityreducestoO(n+k).Wealsoproposeanex-

tensiontohandlesimilarityandafﬁhnique

achievesanorderofmagnitudeasymptoticaccelerationcompared

nstratethe

robustnessofouralgorithmonseveralsetsofmultiplerangescans

withvaryingdegreeofnoise,outliers,andextentofoverlap.

Keywords:computationalgeometry,pairwisesurfaceregistration,

scanalignment,partialshapematching,largestcommonpointset

(LCP)measure,afﬁneinvariantratio

1Introduction

Surfaceregistrationistheprocessofidentifyingandmatchingcor-

respondingregionsacrossmultiplescansgiveninarbitraryinitial

positions,andestimatingthecorrespondingrigidtransformsthat

ntyears,advancesin

geometryscanningtechnologyhaveleadtoagrowinginterestin

surfaceacquisitiontechniqueswheremultiplescansarerequiredto

beregisteredintoacoherentcoordinateframeusingrigidtransfor-

mations[Callierietal.2004,Gelfandetal.2005,LiandGuskov

2005],orusingnon-rigidalignment[Paulyetal.2005,Brownand

Rusinkiewicz2007].Theregistrationproblemisaninstanceof

partialmatchingof3Dpointsets,alargerandmoregeneralfunda-

mentalproblemincomputationalgeometryandcomputervision.

Onepopularphilosophybehindregistrationtechniquesistouse

robustlocalshapedescriptors[LiandGuskov2005]todeﬁnean

approximatetransformation,followedbyanIteratedClosestPoint

(ICP)method[BeslandMcKay1992,ChenandMedioni1992]to

reﬁransformations,beinglowdimensional

entities,canbeuniquelyrecoveredifthecorrectcorrespondenceis

escriptors,invariant

underrigidtransforms,arecommonlyusedtoextractsuchasmall

rtosuch

asetofpointsasabase.

GiventwopartsPandQinarbitraryinitialposes,matching

pairsofbases,onefromPandonefromQ,generatesasetofcan-

artech-

niquecalledgeometrichashingcanbeusedtopickagoodaligning

transformation[WolfsonandRigoutsos1997]fromsuchacandi-

izedalgorithms,likeRANSAC(RANdomSAm-

pleConsensus)[FischlerandBolles1981],repeatthevotingpro-

cessforanumberofbasecandidatesenoughtimestoensurethatit

ﬁnds,withhighprobability,ementsofthis

basicparadigmhavebeenproposedbyChenandco-authors[1999]

withtradeoffbetweenspeedandrobustnesstonoise.

GlobalquantitieslikeobjectcentroidsandPrincipalComponent

Analysis(PCA)areoftenusedtoroughlyalignobjectstotrans-

r,incaseofpartialoverlap,such

Figure2:entwithwide-base(top)ismorestablethanalignmentusingnarrow-base(bottom).Thegray

andthegoldencurvesweregeneratedfromacommoncurve,ustnesswepreferthewidestpossible

base[Goodrichetal.1994],wherethemaximumwidthislimitedbytheextentofoverlapbetweentheshapes.

escriptors[Johnson1997,Li

andGuskov2005],computedfromlocalsurfacegeometryandin-

varianttorigidtransforms,havebeenusedasanefﬁcienttoolfor

ghundernoisyconditionsitispossible

torobustlycomputesuchlocaldescriptors[Pottmannetal.2007],

inpresenceofsigniﬁcantnoiseandoutliers,deﬁningareliablelo-

scenarios,

insteadofusinglocaldescriptors,aneffectivealternativeistorely

proachrequiressolving

theLargestCommonPointset(LCP)problem:Giventwopointsets

PandQ,LCPunderδ-congruencesolvesforasubsetP

本文标签：疫情郑州作者控制

版权声明：本文标题：112008 4-Points Congruent Sets for Robust 内容由网友自发贡献，该文观点仅代表作者本人，转载请联系作者并注明出处：http://roclinux.cn/p/1713243400a625634.html，本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌抄袭侵权/违法违规的内容，一经查实，本站将立刻删除。