multi-level 思想在图形分割的应用的应用
ornegative(outside)awayfromthedatapoints.Theapproximatenormalsofthepointsareusedtodistinguishthisinside/outsideori-entationlocally.Iftheshapefunctionapproximationisnotaccurateenough(doesn’tmatchthepointswell),thecellissubdividedandtheprocedureisrepeateduntilacertainaccuracyisachieved.Fig-ure1showshowtheoctree-levelsadaptaccordingtotherelationbetweenlocalshapecomplexityanddesiredaccuracy.Inlocationsnearthecommonboundaryoftwoormorecells,theshapefunc-tionsareblendedtogetheraccordingtoweightsfromthepartitionofunityfunctions.Theglobalimplicitfunctionofthesurfaceisgivenbythispartitionofunityblendingofthelocalshapeapproxi-mationsattheoctreeleafs.
MPUimplicitsareconceptuallysimple,easytoimplement,andarecapableofprovidingafast,accurate,andadaptivereconstruc-tionsofcomplexshapesfromscatteredpointdatacontainingmil-lionsofpoints.Thecomplexityoftheapproachisoutputsensi-tiveinthesensethatthecreationtimeandmemoryconsumptiondependonthecomplexityofthereconstructedshaperatherthanthenumberofdatapoints.SinceMPUimplicitscandeliverhigh-accuracyshapeapproximations,function-basedoperationssuchasshapeblending,offsets,deformationsandCSGcaneasilybeap-plied.Allofthesesameoperationscanbeperformedfordatathatwasoriginallyinaparametricorpolygonalformsimplybycon-vertingtheseshapedescriptionstotheMPUrepresentation.Previouswork.Implicitshaperepresentationsareattractivebe-causetheyallowacomplexshapetobedescribedbyonefor-mula,theyunifysurfaceandvolumemodeling,andseveralcom-plexshapeeditingoperationsareeasytoperformonsuchmodels[Bloomenthaletal.1997].Ontheotherhand,traditionalpureim-plicitsurfacemodelingtechniqueslacklocalshapecontrol.Thisdrawbackhasbecomeespeciallynoticeablewiththedevelopmentofmodernshapeacquisitiontechniquesthatcangeneratedatasetsconsistingofthousands,millions,orevenbillionsofpoints(see,e.g.,[Levoyetal.2000]).Themainadvantagesofusingimplicitsforshapereconstructionfromscattereddataaredatarepairingcapa-bilitiesandopportunitiestoedittheresultingobjectsusingstandardimplicitmodelingoperations.
MostimplicitshapereconstructionsfrompointsetsarebasedonBlinn’sideaofblendinglocalimplicitprimitives[Blinn1982].Muraki[1991]usesalinearcombinationofGaussianblobsto tanimplicitsurfacetoapointset.Hoppeetal.[1992]locallyes-timatethesigneddistancefunctionasthedistancetothetangentplaneoftheclosestpoint.Limetal.[1995]useblendedunionofspheresforimplicitreconstructionofsolidsfromscattereddata.Theyobtainaninitialcon gurationofspheresfromtheDelaunaytetrahedralizationandanonlinearoptimizationisthenapplied.Ba-jajetal.[1995]andBernardinietal.[1999]combinealgebraic ttingwithpointdatatriangulationbyadaptiveα-shapes[Edels-brunnerandM¨ucke1994].AvolumetricapproachofCurlessandLevoy[1996]introducedforshapereconstructionfromrangescansisbasedonestimatingthedistancefunctionfromareconstructedmodel.Savchenkoetal.[1995],Carretal.[2001],andTurkandO’Brien[2002]usegloballysupportedradialbasisfunctions(RBFs)whileMorseetal.[2001],Kojekineetal.[2003],andOhtakeetal.[2003]employcompactlysupportedRBFstorecon-structsmoothsurfacesfrompointclouddata.Itseemsthatthestate-of-the-artinconstructingimplicitfunctionsfromlargesetsofscat-teredpointsareRBF-basedmethods[Carretal.2001;Dinhetal.2002;TurkandO’Brien2002].WhileRBF-basedmethodsarees-peciallyusefulfortherepairofincompletedata,theyfaceseriousdif cultiesinaccuratereconstructionofsharpfeatures[Dinhetal.2001],mayrequireauserinterventionlikechoosinganappropriatecarriersolid[Kojekineetal.2003],andcangenerateextrazero-levelsets[Ohtakeetal.2003].Inaddition,sinceRBFsolutionsareglobalinnature,processingmillionsofpointsseemstobebeyondthecapabilitiesofmostpresentdayPCs.
Thelevelsetmethod[ZhaoandOsher2002]isanothergoodcan-didateforreconstructingthesigneddistancefunction.However,itscurrentimplementationbecomesexpensiveintimeandmemoryifhighaccuracyreconstructionisrequired(althoughthismightbeim-provedifadaptivegridsareused).Projection-basedapproachestoshapeapproximation[Alexaetal.2001;Fleishmanetal.2003]havetheadvantagethattheyarelocal(i.e.independentofthenumberofdatapoints)anddirectlyyieldapointonthesurface.However,theprojectionsteprequiresthesolutionofanon-linearmovingleastsquaresproblem,whichmakesmostpracticalshapeoperationsex-pensive.
Ourapproachcanbeseenasablendofseveralknowntechniquesthat,together,resultinanattractivemethodforreconstructinganimplicitfunction.OnecommonRBFtechniqueisto rstdividethedatadomainintoseveralcellssothatthedataisbrokenintomanageablepieces[Beatsonetal.2000;SchabackandWendland2000;Iske2001;IskeandLevesley2002;Wendland2002].Asaparticularmethodfordomaindecomposition,thepartitionofunityapproach(PU)ofFrankeandNielson[1980]hasbeenusedasageneralFEMmethodincomputationalmechanics[BabuˇskaandOsborn1994]andrecentlyhasbecomepopularbecauseitavoidsthetopologicaloverheadofconstructingamesh[BabuˇskaandMe-lenk1997;GriebelandSchweitzer2000;GriebelandSchweitzer2002].Ourstrategyforavoidingextrazerolevelsetsisreminiscentof[MooreandWarren1991;Warren1992],whereanadaptiveandrecursivevolumetricsubdivisionwasused.OnecouldviewourMPUrepresentationsasbeingsimilartoadaptivelysampleddis-tance elds[Friskenetal.2000],withthedifferencethattheMPUapproachusescontinuousratherthansampledfunctions.
Whenusedwithanappropriatechoiceoflocalshapeapprox-imations,ourapproachhasthefollowingattractivefeatures:theabilitytocreatehighqualityimplicitsurfacesfromverylargepointdatasets,theaccuratereconstructionofsharpfeatures,andfastandeasylocalshapeaccess.
2PartitionofUnityApproach
Thepartitionofunityapproachistypicallyusedtointegratelo-callyde nedapproximantsintoaglobalapproximation.Importantpropertiessuchasthemaximumerrorandconvergenceorderareinheritedfromthelocalbehavior.Thebasicideaofthepartitionofunityapproachistobreakthedatadomainintoseveralpieces,approximatethedataineachsubdomainseparately,andthenblendthelocalsolutionstogetherusingsmooth,localweightsthatsumuptooneeverywhereonthedomain.
Morespeci cally,consideraboundeddomain inaEuclideanspace(wewillworkin3D)andasetofnonnegativecompactlysupportedfunctions{ i}suchthat
∑i i≡1on .
Letusassociatea local approximationsetoffunctionsViwitheachsubdomainsupp i.Nowanapproximationofafunctionf(x)de nedon isgivenby
whereQi∈Vi.
Givenasetofnonnegativecompactlysupportedfunctions{wi(x)}suchthat
suppwi,
i
f(x)≈∑i i(x)Qi(x),
(1)
partitionofunityfunctions{ i}canbegeneratedby
i(x)=
wi(x)
.
∑j=1wj(x)
(2)
ApproximationbymeansofEqs.1and2constitutesthecoreof
thepartitionofunity niteelementmethods[BabuˇskaandOsborn1994].TheyresembletheModi edShepard’smethodofFranke
Multi-level Partition of Unity Implicits Di e go S a l ume Octob e r 2 3 rd , 2 0 1 3 A u t h o r: O hta ke , et . a l . Over...
Partition of Unity for a Class of Nonlinear Parabolic Equation on Overlapping Non-Matching Grids_专业资料。维普资讯 http://www.cqvip.com NUMERICAL ATHEMATI...
Two-grid partition of unity method for second order elliptic problems 隐藏>> 维普资讯 http://www.cqvip.com Ap1MahMeh一n1E.20,94:2—3 p.t.c.Eg.d...
Multi-level Partition of... 8页 2财富值 辞职后五险一金怎么处理? 11页 ...a partition of unity method to solve large-scale, scattered data problems....
免费 The partition of unity m... 暂无评价 24页 免费 A Method for the Horizon... 暂无评价 20页 免费 Multi-level Partition of... 8页 2财富值喜欢...
Integrated importance measure for multi-state coherent systems of k level_数学_自然科学_专业资料。Journal of Systems Engineering and Electronics Vo1.24,NJour...
Overview of Partition ... 20页 免费 Multi-level Partition ... 8页 1下载...Engng 2003; 00:1–44 PARTITION OF UNITY ENRICHMENT FOR BIMATERIAL INTERFACE...
Multi-level Partition ... 8页 1下载券 A Particle-Partition o... 暂无评价...'Partition of Unity' RBF Networks are Universal Function Approximators y Dept...
Teleportation of Three-Level Multi-partite Entangled State by a Partial Three-Level Bipartite En_专业资料。维普资讯 http://www.cqvip.com Cmmu.ho.hs(eigCi...
The coupling of partition of unity techniques to level set methods is an ...of natural neighbors that was intro- nodal discretizations in multi-dimensions...
热门文档