Detection of Symmetries and Repeated Patterns in 3D Point Cloud Data

author:Leonidas J. Guibas, Stanford University
published: Dec. 5, 2008,   recorded: November 2008,   views: 325
You might be experiencing some problems with Your Video player.

Slides

Slides
0:00 Detection of Symmetries and Repeated Patterns in 3D Point Cloud Data
0:39 Symmetries and Regular Patterns in Natural and Man-Made Objects
1:11 Structure Discovery in 3D PCD
2:16 Point Cloud Data (PCD) Pose Particular Challenges
3:00 Shared Structure Across Distributed Data Sets
3:29 Computational Symmetry: Detecting Self-Similarity
4:07 I. Symmetry Extraction and Symmetrization
4:21 Partial/Approximate
4:42 An Example: Reflective Symmetry
4:55 Reflective Symmetry: A Pair Votes
5:16 Reflective Symmetry: Voting Continues (1)
5:22 Reflective Symmetry: Voting Continues (2)
5:25 Reflective Symmetry: Largest Cluster
6:13 A Typical Density Plot
6:33 Pipeline
7:09 Pruning: Local Signatures
7:39 Reflection: Normal-Based Pruning
8:00 Point Pair Pruning
8:20 Transformations
8:36 Mean-Shift Clustering
8:50 Verification
9:15 Random Sampling
9:33 Compression: Chambord (1)
10:06 Compression: Chambord (2)
10:31 Sidney Opera
10:39 Approximate Symmetry: Dragon
10:57 Extrinsic vs. Intrinsic Symmetries
11:33 Global Intrinsic Symmetries (1)
12:25 Global Intrinsic Symmetries (2)
12:37 Partial Intrinsic Symmetries (3)
14:01 Extrinsic Symmetrization
14:13 Cluster Enhancement and Contraction
14:39 Symmetrization Demo
15:23 Key Points and Issues
15:41 II. Distributed Congruence Discovery
15:50 Probabilistic Fingerprints
16:33 Insight
16:47 Input Shapes
16:51 Sample Points
16:52 Shingles: Overlapping Patches (1)
17:01 Shingles: Overlapping Patches (2)
17:09 Bag of Patches: Ordering Discarded
17:31 Fingerprint Pipeline
17:41 Pipeline: Uniform Sampling
17:44 Pipeline: Shingle Generation
17:54 Pipeline: Signatures
18:06 Pipeline: Resemblance
18:33 How to Compare Point Sets
19:04 Reduce sample Size
19:09 Min-Hashing I: Using Random 'Experts'
20:10 Min-Hashing II
20:34 Pipeline: Min-Hashing
20:45 Data Reduction
21:09 Applications (1)
21:36 Applications (2)
21:41 Applications (3)
21:52 Applications (4)
21:59 Key Points and Issues
22:30 III. Repeated Pattern Detection
22:36 Structure Discovery
23:15 Algorithm Overview (1)
23:33 Algorithm Overview (2)
23:42 Repetitive Structures
24:01 Similarity Sets
24:23 Transform Analysis
25:10 Density Plots in Transform Space
25:37 Model Estimation: Where is the Grid?
25:56 Grid Fitting with Clutter and Outliers
26:44 Aggregation
27:36 The Math
28:00 Scanned Building Facade
28:20 Back to Chambord (30 - 100K Sample Points)
28:59 Amphitheater (1)
29:03 Amphitheater (2)
29:08 Robustnes to Missing Data
29:51 Nautilus: Similarity Transform (1)
30:04 Nautilus: Similarity Transform (2)
30:08 Key Points and Issues
31:09 Geometric Structure extraction as a Paradigm for Data Analysis
32:08 Challenge: From 3-D to Any-D
32:44 Acknowledgements

Related content

Visitors who watched this lecture also watched...

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.

Description

Digital models of physical shapes are becoming ubiquitous in our economy and life. Such models are sometimes designed ab initio using CAD tools, but more and more often they are based on existing real objects whose shape is acquired using various 3D scanning technologies. In most instances, the original scanner data is just a set, but a very large set, of points sampled from the surface of the object. We are interested in tools for understanding the local and global structure of such large-scale scanned geometry for a variety of tasks, including model completion, reverse engineering, shape comparison and retrieval, shape editing, inclusion in virtual worlds and simulations, etc. This talk will present a number of point-based techniques for discovering global structure in 3D data sets, including partial and approximate symmetries, shared parts, repeated patterns, etc. It is also of interest to perform such structure discovery across multiple data sets distributed in a network, without actually ever bring them all to the same host.

Link this page  

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: