1 / 19

Towards Globally Optimal Normal Orientations for Large Point Clouds

This paper proposes a method for determining globally optimal normal orientations for large point clouds. It addresses the problem of unoriented normals in point clouds and presents a solution using graph-based optimization techniques. The approach is demonstrated on various datasets and compared to other methods.

jkinsey
Download Presentation

Towards Globally Optimal Normal Orientations for Large Point Clouds

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Towards Globally Optimal Normal Orientations for Large Point Clouds Nico Schertler, Bogdan Savchynskyy, and Stefan Gumhold [CGF2016]

  2. Motivation Given an unstructuredpointcloudwithunorientednormals: Double-SidedLighting PoissonReconstruction Normal Orientation PoissonReconstruction Towards Globally Optimal Normal Orientations for Large Point Clouds

  3. Orientation from 3D Scans In many 3D-scanning applications, orientationcanbededucedfromthesensorposition. This approachis not alwayspossible: • ifsensorpositionis not available • if normal directions do not representtheacquiredgeometry Towards Globally Optimal Normal Orientations for Large Point Clouds

  4. Agenda Towards Globally Optimal Normal Orientations for Large Point Clouds

  5. Related Work Propagation-BasedMethods [Hoppe*92, Xie*03, …] Based on neighborgraph, uncertaintymeasure, andflipdecider. Propagate orientationalong MST thatminimizesuncertainty. VolumetricMethods Interpret pointcloudassamplesof an implicitsurface (e.g. distancefield). Find signofimplicitfunctionthroughray-shooting [Mullen*10] orconnected-componentanalysis [Gong*12]. Problems arisewith non-closedsurfaces. Other Methods Variationalapproaches find directionandorientationsimultaneously [Wang*12]. Use a coarsetriangulationtogathertopologicalinformation [Liu*10]. [Mullen*10] Towards Globally Optimal Normal Orientations for Large Point Clouds

  6. Problem Formulationas a Markov Random Field Start withsetofpointswithunorientednormals. Define a neighborgraph. Define a flipcriterion, such that:its absolute valuerepresentsthecriterionscertaintyanditssignrepresentstheflipdecision (positive forconsistentorientation). E.g. . Assign a labeltoeachpoint, such thattheoriented normal is. Define a pairwise potential foreachedge: Optimizethelabels: Towards Globally Optimal Normal Orientations for Large Point Clouds

  7. WhyShouldWe Care about Global Optimality? Distance-weightedoutputofflipcriterion MST solution, E=2.4 Optimal Solution, E=2.0 Towards Globally Optimal Normal Orientations for Large Point Clouds

  8. Solvingthe Orientation Problem The orientationproblemis NP-hard (unlessunorientednormalsarealreadyconsistent). Exactglobally optimal solvers: Exist, but areslowandrequire a lotofmemory. E.g. Multicut, General Integer Linear Programming Approximatesolvers: Spanningtree-based (Signed Union Find) Local Submodular Approximation (LSA-TR) Semi-approximatesolvers: Quadratic Pseudo-Boolean Optimization (QPBO) anditsvariants Towards Globally Optimal Normal Orientations for Large Point Clouds

  9. QPBO Generate a graphwithtwovertices per pointand find a minimumcut. Examplefromearlier (slightlymodified): 4 4 Additional assumption: Clearly: Clearly: Clearly: Unlabeled Towards Globally Optimal Normal Orientations for Large Point Clouds

  10. MST + QPBO-I QPBO needs at least one additional unaryterm per connectedcomponent (forsymmetricenergies). Still, mostpointsstayunlabeled. Therefore, weuse a combinationof MST and QPBO-I Fix randomlabelto MST solution No Repeat n times All labeled Solve MST Solve QPBO Return bestsolution Yes Revertfixing Towards Globally Optimal Normal Orientations for Large Point Clouds

  11. MST + QPBO-I Results Hoppe, MST Hoppe, MST + QPBO-I Xie, MST Xie, MST + QPBO-I Towards Globally Optimal Normal Orientations for Large Point Clouds

  12. Processing Large Point Clouds Additional Problems: Beyond-linear time complexityof QPBO. Data setmayexceedmainmemory. Point cloudscompriselocallyorientablesegments. Use simple propagationinsidesegments. Run orientationsolver on segment graph. Streaming out-of-core processing [Pajarola05]. One-the-flysegmentationandlocalorientation. Towards Globally Optimal Normal Orientations for Large Point Clouds

  13. Segment-Based Orientation Input Graph In-Segment Orientation Segment Graph Sumof original flipcriteria Towards Globally Optimal Normal Orientations for Large Point Clouds

  14. Streaming Segmentation Consideronlyleftneighbors, assignpointtothesegmentwiththehighest absolute vote: Intra-Segment Criterion: Ensure same signs in segment. Fulfilled: Not fulfilled: Inter-Segment Criterion: Ensure same signsacrosssegmentborders. Fulfilled: Not fulfilled: Voteforpurplesegment ? ? ? Voteforyellowsegment ? Positive flipcriterion Negative flipcriterion Towards Globally Optimal Normal Orientations for Large Point Clouds

  15. Results Gomantong Caves 261 M points 71 minutes Towards Globally Optimal Normal Orientations for Large Point Clouds

  16. Results St Matthew 187 M points 16 minutes Towards Globally Optimal Normal Orientations for Large Point Clouds

  17. ComparisonDirect – Streaming Approach Towards Globally Optimal Normal Orientations for Large Point Clouds

  18. Future Work Development of a possiblyhigher-order flipcriterion. Applicationofothersolvers. User-guidedfixing in the QPBO-I step. [Beyer*14] Towards Globally Optimal Normal Orientations for Large Point Clouds

  19. Questions?

More Related