1 / 28

Shy Shalom Bar Ilan U niversity

Contextual Part Analogies in 3D Objects. Shy Shalom Bar Ilan U niversity. Lior Shapira Tel Aviv University. Ariel Shamir The Interdisciplinary Center. Daniel Cohen Or Tel Aviv University. H.Zhang. Presented by Dana Silverbush. Overview. Motivation

mili
Download Presentation

Shy Shalom Bar Ilan U niversity

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. Contextual Part Analogies in 3D Objects Shy Shalom Bar IlanUniversity • LiorShapiraTel Aviv University Ariel Shamir The Interdisciplinary Center • Daniel Cohen Or Tel Aviv University • H.Zhang • Presented by Dana Silverbush

  2. Overview • Motivation • Why part analogies • The whole shape method (in a glimpse) • The Contextual Part Analogies Process • Partition • Measure • Determine distance • Results • Local vs. contextual • Robustness

  3. Motivation • Why find part analogies • Analogies in a set of objects • Partial match queries • Instrument to carry information from one to many (semantic information, tags, deformation, operations). dial Dial dial dial dial dial dial dial

  4. f(q) Whole Shape Analogy • Given q find similar s in set S • Common technique: • define f() and calculate for q and S f(s) S

  5. - = ? Whole Shape Analogy • Given q find similar s in set S • Common technique: • define f() and calculate for q and S • Similarity: Two shape Sa, Sb, are similar if f(Sa) is close to f(Sb) in some sense, i.e. Dist(Sa,Sb) is small.

  6. Part Analogy Process • Instead of using Dist(f(Sa),f(Sb) for the whole shapes, use it on sub parts! • Three main issues: • What sub-parts (segmentation)? • What descriptor f()? • What distance Dist(f(Sa), f(Sb))? • The process:

  7. Measure Through Volume • Partition • Measure • Distance • Test • Cluster • Smooth • Define f() • Dist() • Contextual distance • The Shape Diameter Function (SDF) • Connects volume to surface • Ray Shooting & Averaging

  8. Volume Normalization • Partition • Measure • Distance • Test • Cluster • Smooth • Define f() • Dist() • Contextual distance for different scales Move to log-space: enhance delicate parts Notice the horn and the nose separate better

  9. Segmentation • Partition • Measure • Distance • Test • Cluster • Smooth • Define f() • Dist() • Contextual distance • Fit Gaussian Mixture Model (GMM) of k Gaussians to the histogram of SDF. • Each face has a vector of length k signifying its probability to be in each cluster Normalized SDF faces

  10. Optimize Segmentation • Partition • Measure • Distance • Test • Cluster • Smooth • Define f() • Dist() • Contextual distance • find min-cut to optimize energy function • Employ an alpha expansion graph-cut algorithm to solve the k-way graph-cut • Get start segmentation • Swap alpha tags GMM Smoothing Probability (face f belongs to cluster Xf) Incorporates edge length + angle

  11. Local SDF Signature • Partition • Measure • Distance • Test • Cluster • Smooth • Define f() • Dist() • Contextual distance • Normalized histogram of SDF values within the part • The size of the part as a percentage of the whole model Compare relative size of part Compare volumetric measure

  12. Local SDF Signature • Partition • Measure • Distance • Test • Cluster • Smooth • Define f() • Dist() • Contextual distance • Normalized histogram of SDF values within the part • The size of the part as a percentage of the whole model Compare relative size of part

  13. Not Good Enough… • Partition • Measure • Distance • Test • Cluster • Smooth • Define f() • Dist() • Contextual distance • The part is not a separate shape • We want to think of it in its context. • A finger is closer to another finger than it is to a cylinder!

  14. Create Hierarchy • Partition • Measure • Distance • Test • Cluster • Smooth • Define f() • Dist() • Contextual distance

  15. Create Hierarchy • Partition • Measure • Distance • Test • Cluster • Smooth • Define f() • Dist() • Contextual distance

  16. Parts Contextual Distance • Partition • Measure • Distance • Test • Cluster • Smooth • Define f() • Dist() • Contextual distance Context of a part -> the path between the node representing the part, and the root of the object tree

  17. Parts Contextual Distance • Partition • Measure • Distance • Test • Cluster • Smooth • Define f() • Dist() • Contextual distance Context of a part -> the path between the node representing the part, and the root of the object tree

  18. Parts Contextual Distance • Partition • Measure • Distance • Test • Cluster • Smooth • Define f() • Dist() • Contextual distance Context of a part -> the path between the node representing the part, and the root of the object tree

  19. Parts Contextual Distance • Partition • Measure • Distance • Test • Cluster • Smooth • Define f() • Dist() • Contextual distance Context of a part -> the path between the node representing the part, and the root of the object tree

  20. RESULTS

  21. Advantage to context-awareness • Comparing local signature to a context-aware distance measure

  22. Advantage to context-awareness • Preforming part queries in several categories (human leg, armadillo leg and airplane wing)

  23. Robustness to K-Partitioning • Five distinct partitioning were inserted, making part hierarchy different for each model • Query the dinopet handreturns matching hand from all dinopet variants

  24. Robustness to K-Partitioning • Five distinct partitioning were inserted, making part hierarchy different for each model • Query the dinopet handreturns matching hand from all dinopet variants

  25. Analogies Between Parts

  26. Automatic Tagging All results marked with a yellow diamond have already been tagged ‘head’.

  27. Conclusion • Analogies based on parts • Utilizes Shape Diameter Function (SDF) • Segmentation + Distance • New Contextual Distance based on segmentation hierarchy

  28. Thank You!

More Related