Download presentation

Presentation is loading. Please wait.

Published byConrad Jones Modified over 3 years ago

1
A Probabilistic Model for Component-Based Shape Synthesis Evangelos Kalogerakis, Siddhartha Chaudhuri, Daphne Koller, Vladlen Koltun Stanford University

2
SP2-2 Bayesian networks Directed acyclic graph (DAG) – Nodes – random variables – Edges – direct influence (“causation”) X i ? X ancestors | X parents e.g., C ? {R,B,E} | A Simplifies chain rule by using conditional independencies EarthquakeBurglary AlarmRadio Pearl, 1988 Call

3
Goal A tool that automatically synthesizes a variety of new, distinct shapes from a given domain.

4
Sailing ships vary in: - Size - Type of hull, keel and mast - The number and configuration of masts. Various geometric, stylistic and functional relationships inﬂuence the selection and placement of individual components to ensure that the ﬁnal shape forms a coherent whole.

5
Probabilistic Reasoning for Assembly- Based 3D Modeling Siddhartha Chaudhuri, Evangelos Kalogerakis, Leonidas Guibas, and Vladlen Koltun ACM Transactions on Graphics 30(4) (Proc. SIGGRAPH), 2011

7
The probabilistic model is flat!!!! It describes the relationship among components, but it does NOT tells us how these components form the whole structure.

8
Offline Learning Online shape synthesis

9
The input shapes have two component categories: Legs and tabletops learns four-legged tablesone-legged tables # tabletop: 1 # leg: 1 # tabletop: 1 or 2 # leg: 4 Offline Learning

10
Synthesize one-leg tables Step 1: synthesize a set of components (1 leg & 1 tabletop) … Step 2: optimize component placement …

11
The model structure R - shape style S = {Sl} - component style per category l N = {Nl} - number of components from category l. C = {Cl} - continuous geometric feature vector for components from category l. ( curvature histograms, shape diameter histograms, scale parameters, spin images, PCA-based descriptors, and lightﬁeld descriptors ) D = {Dl} - discrete geometric feature vector for components from category l. ( encode adjacency information.)

12
For 4-legged table: N top =1 or 2; N leg =4; S top =rectangular tabletops S leg =narrow column-like legs For 1-legged table N top =1 N leg =1 S top =roughly circular tabletops S leg =split legs

13
Learning The input: – A set of K compatibly segmented shapes. – For each component, we compute its geometric attributes. – The training data is thus a set of feature vectors: – O = {O 1, O 2,...,O k }, where O k = {N k,D k,C k }. The goal – learn the structure of the model (domain sizes of latent variables and lateral edges between observed variables) and the parameters of all CPDs in the model.

14
The desired structure G is the one that has highest probability given input data O [Koller and Friedman 2009]. By Bayes’ rule, this probability can be expressed as Max P(G|O) -- > Max P (O | G)

15
Assume prior distributions over the parameters Θ of the model. parameter priors summing over all possible assignments to the latent variables R and S: the number of integrals is exponentially large !!!

16
To make the learning procedure computationally tractable, they use an effective approximation of the marginal likelihood known as the Cheeseman-Stutz score [Cheeseman and Stutz 1996]: a ﬁctitious dataset that comprises the training data O and approximate statistics for the values of the latent variables. the parameters estimated for a given G The score defines a metric to measure how good a model is. The goal is to search a G maximize the score!

17
What does the G mean? The number of table styles (R) Whether a category of components belongs to a specific style? What is the number? (S)

18
Greedy Structure search Initially, set the domain size of 1 for R (a single shape style). for each category l, – Set the component style as 1, compute the score, then 2, 3, …, stop when the score decreases. The local maximal value is the style number of l. Move the next category. After the search iterates over all variables in S, increase the domain size of R and repeat the procedure. terminates when the score reaches a local maximum that does not improve over 10 subsequent iterations;

19
Domain size of R =1 All tables belong to the same style. For leg: – Compute the score for case 1: all legs are of the same style; – Compute the score for case 2: narrow column-like legs and split legs. – Compute the score for case 3: three styles of legs. Score decreases so stop. For table-top: – …

20
CPT of R 1 2 5/127/12 CPT of S top (R=1) 1 2 1.00.0 CPT of S top (R=2) 1 2 0.01.0 CPT of S leg (R=1) 1 2 1.00.0 CPT of S leg (R=2) 1 2 0.01.0 …

21
Shape Synthesis Step 1: Synthesizing a set of components 1-legged or 4-legged Rect or circular? column-like or split Pruning: Branches that contain assignments that have extremely low probability density

22
Shape Synthesis Step 1: Synthesizing a set of components Step 2: Optimizing component placement “slots” specify where this component can be attached to other components.

23
Shape Synthesis Step 1: Synthesizing a set of components Step 2: Optimizing component placement penalizes discrepancies of position and relative size between each pair of adjacent slots

24
Shape Synthesis Step 1: Synthesizing a set of components Step 2: Optimizing component placement

25
Application: Shape database ampliﬁcation synthesize all instantiations of the model that have non-negligible probability – identify and reject instantiations that are very similar to shapes in the input dataset or to previous instantiations. (by measuring the feature vectors of corresponding components)

26
Application: Constrained shape synthesis Give partial assignments to constrained random variables assume values only from the range corresponding to the speciﬁed constraints. 4-leg split

27
Results Learning took about 0.5 hours for construction vehicles, 3 hours for creatures, 8 hours for chairs, 20 hours for planes, and 70 hours for ships. For shape synthesis, enumerating all possible instantiations of a learned model takes less than an hour in all cases, and ﬁnal assembly of each shape takes a few seconds.

33
Can it generate models like below? or The probability should be very low. or

34
Inspiration- Variability vs plausibility To maintain plausibility: should be similar to the existing ones; To increase variability: should be as different as possible from the existing ones. This work is good for maintaining plausibility but the variability seems low. How to pursue large variability while maintaining plausibility? or

35
Topic? Generating shape variation by variability transfer learn the varying model in the dataset rather than the shape model. Use the varying model to synthesize new shape in another dataset.

36
Topic? function-preserved shape synthesize The function of a component is not taken into account in the current model… By considering function, we can create variations with high dissimilarity on geometric looking while preserve the function.

Similar presentations

Presentation is loading. Please wait....

OK

Slides for “Data Mining” by I. H. Witten and E. Frank.

Slides for “Data Mining” by I. H. Witten and E. Frank.

© 2018 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on kingdom monera Ppt on conceptual article Ppt on rc phase shift oscillator circuit Ppt on supply chain management of nokia cell Ppt on types of forests found in india Ppt on producers consumers and decomposers poem Ppt on cognizant technology solutions Viewer ppt online shopping Ppt on blood stain pattern analysis software Ppt on object-oriented programming advantages