Course: Structure-Aware Shape Processing Introduction to Geometric ‘Structure’ Extracting Structures –analysis of Individual Models –analysis of Shape.

Slides:



Advertisements
Similar presentations
Clustering II.
Advertisements

Feature Selection as Relevant Information Encoding Naftali Tishby School of Computer Science and Engineering The Hebrew University, Jerusalem, Israel NIPS.
Greedy Algorithms.
Hierarchical Clustering. Produces a set of nested clusters organized as a hierarchical tree Can be visualized as a dendrogram – A tree-like diagram that.
PARTITIONAL CLUSTERING
Computer Vision Laboratory 1 Unrestricted Recognition of 3-D Objects Using Multi-Level Triplet Invariants Gösta Granlund and Anders Moe Computer Vision.
Quadtrees, Octrees and their Applications in Digital Image Processing
1 Minimum Ratio Contours For Meshes Andrew Clements Hao Zhang gruvi graphics + usability + visualization.
Image Parsing: Unifying Segmentation and Detection Z. Tu, X. Chen, A.L. Yuille and S-C. Hz ICCV 2003 (Marr Prize) & IJCV 2005 Sanketh Shetty.
Multiple Criteria for Evaluating Land Cover Classification Algorithms Summary of a paper by R.S. DeFries and Jonathan Cheung-Wai Chan April, 2000 Remote.
Graph Drawing Zsuzsanna Hollander. Reviewed Papers Effective Graph Visualization via Node Grouping Janet M. Six and Ioannis G. Tollis. Proc InfoVis 2001.
Content Based Image Clustering and Image Retrieval Using Multiple Instance Learning Using Multiple Instance Learning Xin Chen Advisor: Chengcui Zhang Department.
Lecture 6 Image Segmentation
Clustering II.
EE663 Image Processing Edge Detection 5 Dr. Samir H. Abdul-Jauwad Electrical Engineering Department King Fahd University of Petroleum & Minerals.
Iterative Optimization of Hierarchical Clusterings Doug Fisher Department of Computer Science, Vanderbilt University Journal of Artificial Intelligence.
DAST, Spring © L. Joskowicz 1 Data Structures – LECTURE 1 Introduction Motivation: algorithms and abstract data types Easy problems, hard problems.
L16: Micro-array analysis Dimension reduction Unsupervised clustering.
Quadtrees, Octrees and their Applications in Digital Image Processing
Force Directed Algorithm Adel Alshayji 4/28/2005.
Force Directed Algorithm Adel Alshayji 4/28/2005.
Kyle Heath, Natasha Gelfand, Maks Ovsjanikov, Mridul Aanjaneya, Leo Guibas Image Webs Computing and Exploiting Connectivity in Image Collections.
Ranking by Odds Ratio A Probability Model Approach let be a Boolean random variable: document d is relevant to query q otherwise Consider document d as.
Prior Knowledge for Part Correspondence Oliver van Kaick 1, Andrea Tagliasacchi 1, Oana Sidi 2, Hao Zhang 1, Daniel Cohen-Or 2, Lior Wolf 2, Ghassan Hamarneh.
Dynamic Programming Introduction to Algorithms Dynamic Programming CSE 680 Prof. Roger Crawfis.
Radial Basis Function Networks
Clustering Unsupervised learning Generating “classes”
Teaching Teaching Discrete Mathematics and Algorithms & Data Structures Online G.MirkowskaPJIIT.
Symmetry Hierarchy of Man-Made Objects Yanzhen Wang 1,2, Kai Xu 1,2, Jun Li 2, Hao Zhang 1, Ariel Shamir 3, Ligang Liu 4, Zhiquan Cheng 2, Yueshan Xiong.
CSE 185 Introduction to Computer Vision Pattern Recognition.
Issues with Data Mining
Globally Optimal Grouping for Symmetric Closed Boundaries with Stahl/ Wang Method Vida Movahedi September 2007.
Niloy J. Mitra Leonidas J. Guibas Mark Pauly TU Vienna Stanford University ETH Zurich SIGGRAPH 2007.
Shape Matching for Model Alignment 3D Scan Matching and Registration, Part I ICCV 2005 Short Course Michael Kazhdan Johns Hopkins University.
FlowString: Partial Streamline Matching using Shape Invariant Similarity Measure for Exploratory Flow Visualization Jun Tao, Chaoli Wang, Ching-Kuang Shene.
Introduction to Data Mining Group Members: Karim C. El-Khazen Pascal Suria Lin Gui Philsou Lee Xiaoting Niu.
Multiscale Symmetric Part Detection and Grouping Alex Levinshtein, Sven Dickinson, University of Toronto and Cristian Sminchisescu, University of Bonn.
Hierarchical Distributed Genetic Algorithm for Image Segmentation Hanchuan Peng, Fuhui Long*, Zheru Chi, and Wanshi Siu {fhlong, phc,
Detecting Curved Symmetric Parts using a Deformable Disc Model Tom Sie Ho Lee, University of Toronto Sanja Fidler, TTI Chicago Sven Dickinson, University.
Chapter 8 The k-Means Algorithm and Genetic Algorithm.
Organizing Heterogeneous Scene Collections through Contextual Focal Points Kai Xu, Rui Ma, Hao Zhang, Chenyang Zhu, Ariel Shamir, Daniel Cohen-Or, Hui.
Clustering Supervised vs. Unsupervised Learning Examples of clustering in Web IR Characteristics of clustering Clustering algorithms Cluster Labeling 1.
Stylization and Abstraction of Photographs Doug Decarlo and Anthony Santella.
Mining various kinds of Association Rules
Expert Systems with Applications 34 (2008) 459–468 Multi-level fuzzy mining with multiple minimum supports Yeong-Chyi Lee, Tzung-Pei Hong, Tien-Chin Wang.
Digital Intuition Cluster, Smart Geometry 2013, Stylianos Dritsas, Mirco Becker, David Kosdruy, Juan Subercaseaux Welcome Notes Overview 1. Perspective.
1Ellen L. Walker Category Recognition Associating information extracted from images with categories (classes) of objects Requires prior knowledge about.
CS 8751 ML & KDDData Clustering1 Clustering Unsupervised learning Generating “classes” Distance/similarity measures Agglomerative methods Divisive methods.
Sponsored by Deformation-Driven Topology-Varying 3D Shape Correspondence Ibraheem Alhashim Kai Xu Yixin Zhuang Junjie Cao Patricio Simari Hao Zhang Presenter:
V. Clustering 인공지능 연구실 이승희 Text: Text mining Page:82-93.
Course: Structure-Aware Shape Processing Hao (Richard) Zhang Simon Fraser University (SFU), Canada Structural Hierarchies Course: Structure-Aware Shape.
Review of Parnas’ Criteria for Decomposing Systems into Modules Zheng Wang, Yuan Zhang Michigan State University 04/19/2002.
Basic Machine Learning: Clustering CS 315 – Web Search and Data Mining 1.
Instance Discovery and Schema Matching With Applications to Biological Deep Web Data Integration Tantan Liu, Fan Wang, Gagan Agrawal {liut, wangfa,
Course: Structure-Aware Shape Processing Introduction to Geometric ‘Structure’ Extracting Structures –analysis of Individual Models –analysis of Shape.
Shape2Pose: Human Centric Shape Analysis CMPT888 Vladimir G. Kim Siddhartha Chaudhuri Leonidas Guibas Thomas Funkhouser Stanford University Princeton University.
Methods of multivariate analysis Ing. Jozef Palkovič, PhD.
Co-Hierarchical Analysis of Shape Structures Oliver van Kaick 1,4 Kai Xu 2 Hao Zhang 1 Yanzhen Wang 2 Shuyang Sun 1 Ariel Shamir 3 Daniel Cohen-Or 4 4.
Unsupervised Learning
Prior Knowledge for Part Correspondence
Layered Analysis of Irregular Facades via Symmetry Maximization
Outline Perceptual organization, grouping, and segmentation
Outline Background Motivation Proposed Model Experimental Results
Hierarchical Modeling & Constructive Solid Geometry
Text Categorization Berlin Chen 2003 Reference:
Data Mining CSCI 307, Spring 2019 Lecture 24
Point Set Representation for Object Detection and Beyond
Unsupervised Learning
Presentation transcript:

Course: Structure-Aware Shape Processing Introduction to Geometric ‘Structure’ Extracting Structures –analysis of Individual Models –analysis of Shape Collections (co-analysis) –Structural Hierarchies Manipulating Structures –Modeling as Structural Variations –Structure-guided Design –Organization + Exploration of Shape Collections Future Directions Course structure

Course: Structure-Aware Shape Processing Structural Hierarchies Niloy J. MitraMichael Wand Hao Zhang Daniel Cohen-Or Vladimir KimQi-Xing Huang

Course: Structure-Aware Shape Processing Efficiency and flexibility: hierarchy offers BOTH high-level abstraction and granularity Natural choice: human perception of structures IS hierarchical [Palmer 1977, Hoffman & Richards 1984] Appropriate model to capture diversities in a set: coarse levels encode commonalities; finer details lower in the tree Why hierarchy?

Course: Structure-Aware Shape Processing Image pyramids Familiar examples Hierarchical segmentation

Course: Structure-Aware Shape Processing What is the right structural hierarchy? Challenges: –Many possible hierarchies for a given shape: larger search space than (flat) shape segmentation –Many possible criteria for “best” structural hierarchy –Even human observers may disagree on what is the ground truth Key question …

Course: Structure-Aware Shape Processing … not just any structural hierarchy … but one that best explains one or a set of structures Exploit power of symmetry for analyzing individual shapes [Martinet 2007, Simari 2006, Wang 2011, Zhang 2013] Exploit power of a set for co-hierarchical analysis [van Kaick 2013] We are interested in …

Course: Structure-Aware Shape Processing Two basic solution paradigms: Top-down –Recursively split or divide an input shape Bottom-up –Start with a fine segmentation into primitive parts –Then recursively group parts, e.g., via graph contraction Key ingredient: how to prioritize the operations Hierarchy construction

Course: Structure-Aware Shape Processing Symmetric parts tend to perform the same function Why symmetry?

Course: Structure-Aware Shape Processing Symmetry leads to “better explanation” of structures –With symmetry comes redundancy –Removing redundancy leads to more compact representations –A compact representation tends to be the right representation –Occam’s Razor: other things being equal, the simplest, which is likely the most compact, explanation tends to be the best explanation –Works on minimum description length (MDL) follows this line of thought Why symmetry?

Course: Structure-Aware Shape Processing Perceptual grouping via Gestalt law of symmetry Why symmetry?

Course: Structure-Aware Shape Processing Symmetry enables shape analysis at a semantic level: –Role in functional grouping –Role in offering the simplest (best) explanation –Role in perceptual grouping However, symmetry is –a purely geometric notion: explicit detection w/o training data –but requires more global analysis Semantics

Course: Structure-Aware Shape Processing Key idea: symmetry guides grouping and assembly of shape parts for a meaningful hierarchical part organization. Symmetry hierarchy [Wang et al. 2011]

Course: Structure-Aware Shape Processing Pre-segmentation Hierarchy construction Symmetry detection

Course: Structure-Aware Shape Processing Rotational symmetry Reflection symmetry Connectivity Initial graph

Course: Structure-Aware Shape Processing Grouping by symmetry Two operations: Bottom-up graph contraction

Course: Structure-Aware Shape Processing Two operations: Assembly by proximity Bottom-up graph contraction Grouping by symmetry

Course: Structure-Aware Shape Processing March 30, 2012, CSC Talk, SFU 17 Guiding principles –Perceptual grouping: Gestalt law of symmetry –Compactness of representation: Occam’s Razor –Results in a set of “precedence rules” How to order contractions?

Course: Structure-Aware Shape Processing Grouping-assembly mixing rules, e.g., –symmetry grouping takes precedence over assembly A 1 A 2 B B Example of precedence rules

Course: Structure-Aware Shape Processing Symmetry grouping rules, e.g., –rot-symmetry takes precedence over ref-symmetry A4A4 A4A4 A1A1 A2A2 A3A3 B Example of precedence rules unless

Course: Structure-Aware Shape Processing Symmetry grouping rules, e.g., –rot-symmetry takes precedence over ref-symmetry A4A4 A4A4 A1A1 A2A2 A3A3 B Example of precedence rules A4A4 A4A4 A1A1 A2A2 A3A3 B Assembly before grouping rule …

Course: Structure-Aware Shape Processing Assembly rules, e.g., –assemble parts that preserve more symmetries first A1A1 A2A2 B Example of precedence rules

Course: Structure-Aware Shape Processing Tree traversal following reverse order of graph contractions App: hierarchical segmentation

Course: Structure-Aware Shape Processing 23 Paper Project website: Eurographics 2011

Course: Structure-Aware Shape Processing Construction is not the result of an optimization, but based on hand-crafted precedence rules; see next week talk Inconsistent hierarchies for objects in same class Limitations

Course: Structure-Aware Shape Processing Extends symmetry hierarchy to co-analysis of a set A unified explanation of the shape structures Co-hierarchy [van Kaick et al. 2013] Goal: obtain a structural hierarchy that best explains a set of objects belonging to the same class

Course: Structure-Aware Shape Processing Similarity and diversity Coarse level: similarity across set Finer level: individual shape variations

Course: Structure-Aware Shape Processing Each object can have many possible hierarchies. Need to select one hierarchy per shape. … Challenges

Course: Structure-Aware Shape Processing There can be much geometric variability in the set. Need to go beyond geometry and focus on shape structures. Challenges

Course: Structure-Aware Shape Processing There can also be much structural variability; a single explanation cannot be sufficient We account for that by clustering the hierarchies. Challenges

Course: Structure-Aware Shape Processing Using a minimal set of four shapes Algorithm illustration

Course: Structure-Aware Shape Processing Compute symmetry hierarchies per shape Per-shape symmetry hierarchies

Course: Structure-Aware Shape Processing Sample from population of per-shape hierarchies Sampling

Course: Structure-Aware Shape Processing Multi-instance clustering: cluster the shapes while each shape has multiple instances (the samples) Key problem: clustering

Course: Structure-Aware Shape Processing Select one representative hierarchy per shape … and then select

Course: Structure-Aware Shape Processing Traditional clustering: maximize within-cluster similarity and between-cluster dissimilarity In our problem: all shapes in the set are related –So wish to discover maximal similarity among all shapes –But still allow clusters to characterize structural variability –Trick in representative selection: selections should maximize both within-cluster and between-cluster similarities –Then resample hierarchies (and then cluster-select) close to the selections so the clusters as a whole also get closer Objective of cluster-and-select

Course: Structure-Aware Shape Processing Selections maximize within-cluster similarity only Representative selection

Course: Structure-Aware Shape Processing Selections maximize both within- and between-cluster similarity Representative selection

Course: Structure-Aware Shape Processing New samples are closer to the representatives Resample per-shape hierarchies

Course: Structure-Aware Shape Processing New cluster-select result and repeat until convergence. Iterate cluster-select-resample

Course: Structure-Aware Shape Processing A co-hierarchy implies correspondence between structures --- towards functional correspondence. Structure correspondence

Course: Structure-Aware Shape Processing Functional correspondence A co-hierarchy implies correspondence between structures --- towards functional correspondence.

Course: Structure-Aware Shape Processing Still most works deal with flat structural organizations There is much to be done on hierarchical analysis: –All covered techniques are unsupervised –How about supervised: providing symmetry measures is hard; ground truths for and comparison between hierarchical models are not easy –Extension from 3D objects to more complex data, e.g., indoor scenes, and mixed object categories A short “now and beyond”

Course: Structure-Aware Shape Processing 43 From symmetry to asymmetry From “Symmetry and asymmetry in aesthetics and arts” by I. C. McManus, European Rev., 2005 There is a somewhat sterile rigidity about symmetry, which can make it less attractive than the more dynamic, less predictable beauty associated with asymmetry. Beauty is bound up with symmetry  Hermann Weyl Although a little asymmetry can be beautiful, an excess merely results in chaos. Asymmetry probably results most effectively in beauty when the underlying symmetry upon which it is built is still apparent.

Course: Structure-Aware Shape Processing 44 Asymmetry is beautiful!

Course: Structure-Aware Shape Processing 45 Symmetry in asymmetry

Course: Structure-Aware Shape Processing 46 Symmetry in asymmetry

Course: Structure-Aware Shape Processing 47 Without asymmetry Returns from Google search on “boring buildings”

Course: Structure-Aware Shape Processing 48 Asymmetrization! Generate interesting variations Key: how to measure asymmetry –Use asymmetry/symmetry measure to drive asymmetrization –Interested in structural symmetry –The measure is key Symmetrization Asymmetrization < <

Course: Structure-Aware Shape Processing 49 Asymmetrization!