Course: Structure-Aware Shape Processing Hao (Richard) Zhang Simon Fraser University (SFU), Canada Structural Hierarchies Course: Structure-Aware Shape.

Slides:



Advertisements
Similar presentations
DECISION TREES. Decision trees  One possible representation for hypotheses.
Advertisements

Hierarchical Clustering. Produces a set of nested clusters organized as a hierarchical tree Can be visualized as a dendrogram – A tree-like diagram that.
Learning Trajectory Patterns by Clustering: Comparative Evaluation Group D.
Quadtrees, Octrees and their Applications in Digital Image Processing
1 Minimum Ratio Contours For Meshes Andrew Clements Hao Zhang gruvi graphics + usability + visualization.
Graph Drawing Zsuzsanna Hollander. Reviewed Papers Effective Graph Visualization via Node Grouping Janet M. Six and Ioannis G. Tollis. Proc InfoVis 2001.
Clustering II.
Tabu Search for Model Selection in Multiple Regression Zvi Drezner California State University Fullerton.
GATE D Object Representations (GATE-540) Dr.Çağatay ÜNDEĞER Instructor Middle East Technical University, GameTechnologies & General Manager SimBT.
EE663 Image Processing Edge Detection 5 Dr. Samir H. Abdul-Jauwad Electrical Engineering Department King Fahd University of Petroleum & Minerals.
1 Lecture 5: Automatic cluster detection Lecture 6: Artificial neural networks Lecture 7: Evaluation of discovered knowledge Brief introduction to lectures.
Fast, Multiscale Image Segmentation: From Pixels to Semantics Ronen Basri The Weizmann Institute of Science Joint work with Achi Brandt, Meirav Galun,
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.
reconstruction process, RANSAC, primitive shapes, alpha-shapes
Force Directed Algorithm Adel Alshayji 4/28/2005.
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.
Radial Basis Function Networks
Clustering Unsupervised learning Generating “classes”
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.
Object Oriented Analysis and Design Introduction.
Globally Optimal Grouping for Symmetric Closed Boundaries with Stahl/ Wang Method Vida Movahedi September 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.
Xiaoguang Han Department of Computer Science Probation talk – D Human Reconstruction from Sparse Uncalibrated Views.
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,
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.
Quadtrees, Octrees and their Applications in Digital Image Processing.
Stylization and Abstraction of Photographs Doug Decarlo and Anthony Santella.
Mining various kinds of Association Rules
Information Retrieval Lecture 6 Introduction to Information Retrieval (Manning et al. 2007) Chapter 16 For the MSc Computer Science Programme Dell Zhang.
Extraction and remeshing of ellipsoidal representations from mesh data Patricio Simari Karan Singh.
Prepared by: Mahmoud Rafeek Al-Farra
Spectral Sequencing Based on Graph Distance Rong Liu, Hao Zhang, Oliver van Kaick {lrong, haoz, cs.sfu.ca {lrong, haoz, cs.sfu.ca.
1 Universidad de Buenos Aires Maestría en Data Mining y Knowledge Discovery Aprendizaje Automático 5-Inducción de árboles de decisión (2/2) Eduardo Poggi.
Information Retrieval and Organisation Chapter 16 Flat Clustering Dell Zhang Birkbeck, University of London.
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:
Technology Mapping. 2 Technology mapping is the phase of logic synthesis when gates are selected from a technology library to implement the circuit. Technology.
Review of Parnas’ Criteria for Decomposing Systems into Modules Zheng Wang, Yuan Zhang Michigan State University 04/19/2002.
Text Clustering Hongning Wang
Machine Vision ENT 273 Regions and Segmentation in Images Hema C.R. Lecture 4.
1 Overview (Part 1) Background notions A reference framework for multiresolution meshes Classification of multiresolution meshes An introduction to LOD.
Example Apply hierarchical clustering with d min to below data where c=3. Nearest neighbor clustering d min d max will form elongated clusters!
Hierarchical clustering approaches for high-throughput data Colin Dewey BMI/CS 576 Fall 2015.
Course: Structure-Aware Shape Processing Introduction to Geometric ‘Structure’ Extracting Structures –analysis of Individual Models –analysis of Shape.
Course: Structure-Aware Shape Processing Introduction to Geometric ‘Structure’ Extracting Structures –analysis of Individual Models –analysis of Shape.
3D Object Representations 2009, Fall. Introduction What is CG?  Imaging : Representing 2D images  Modeling : Representing 3D objects  Rendering : Constructing.
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
Machine Vision ENT 273 Lecture 4 Hema C.R.
Clustering CSC 600: Data Mining Class 21.
Layered Analysis of Irregular Facades via Symmetry Maximization
3D Object Representations
Mean Shift Segmentation
Outline Background Motivation Proposed Model Experimental Results
Scale-Space Representation for Matching of 3D Models
Hierarchical Modeling & Constructive Solid Geometry
Text Categorization Berlin Chen 2003 Reference:
Hierarchical Clustering
Data Mining CSCI 307, Spring 2019 Lecture 24
Unsupervised Learning
Presentation transcript:

Course: Structure-Aware Shape Processing Hao (Richard) Zhang Simon Fraser University (SFU), Canada Structural Hierarchies Course: Structure-Aware Shape Processing

Efficiency and flexibility: hierarchy offers *both* high- level abstraction and granularity, adaptable as desired Natural choice: human perception of structures *is* hierarchical [Palmer 1977, Hoffman & Richards 1984] Hierarchies are the right model to capture diversities in a set: coarse levels common; fine details vary 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 can disagree on what is ground truth Key question …

Course: Structure-Aware Shape Processing … not just any structural hierarchy … but one that best explains one or more structures Exploit power of symmetry for individual analysis [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 helps explain structures Symmetry leads to redundancy Discovering and removing redundancy leads to compactness A compact representation tends to be the right one Occam’s Razor: simplest, i.e., most compact, explanation tends to be the best explanation Works on minimal grammar and minimum description length Why symmetry?

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

Course: Structure-Aware Shape Processing Symmetry embeds semantic knowledge: Role in functional grouping Role in offering simplest (best) explanation Role in perceptual grouping However, symmetry is a purely geometric notion: explicitly detectable w/o training but requires more global analysis Semantics from geometry analysis

Course: Structure-Aware Shape Processing Detect major reflection symmetry Divide shape into symmetric part A (full dinosaur) and the rest B Recursively process B and half of A Top-down: folding mesh hierarchy Folding meshes [Simari et al. 2006] Key idea: “fold” reflection symmetries for compact shape representation

Course: Structure-Aware Shape Processing Key idea: symmetry guides grouping and assembly of shape parts for a meaningful hierarchical meaningful 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 Assembly by proximity Two operations: Bottom-up recursive graph contraction

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

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 A1A1 A1A1 A2A2 A2A2 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

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 reversed order of graph contractions Application: hierarchical segmentation

Course: Structure-Aware Shape Processing Application: structural editing

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

Course: Structure-Aware Shape Processing To explain irregular 2D facades Use hierarchical decomposition as generative model Decomposition stops when reaching a regular grid (maximal symmetry) as it requires no explanation Symmetry maximization [Zhang et al. 2013] Goal: a generative model that best explains a structure

Course: Structure-Aware Shape Processing Hierarchical 2-way decomposition Structural hierarchy

Course: Structure-Aware Shape Processing 2-way splits along two lateral directions Input + Two substructures Split Two operations

Course: Structure-Aware Shape Processing Input Layering + Two substructures (layers) Structure completion Layering: “split” along depth direction Two operations

Course: Structure-Aware Shape Processing Input Split only 8 ops. Split + Layering 4 ops. Layering leads to more compact (simpler) explanation Layering+split vs. split only

Course: Structure-Aware Shape Processing Key ideas: Best explanation = simplest explanation = fewest decompositions Decomposition should then maximize the symmetry (SYMAX) of the substructures obtained SYMAX is consistent with Gestalt law of symmetry min. # ops. Best explanation via SYMAX

Course: Structure-Aware Shape Processing Symmetry maximization at each decomposition How symmetric the two substructures are How good is the decomposition SYMAX

Course: Structure-Aware Shape Processing Sum of symmetry measures at all internal nodes Objective function

Course: Structure-Aware Shape Processing Difficult combinatorial search: genetic algorithm Technical details

Course: Structure-Aware Shape Processing Difficult combinatorial search: genetic algorithm Symmetry measure Continuous measure for a discrete 2D pattern Behaves well at both ends of the symmetry spectrum Perfectly symmetricasymmetric Technical details

Course: Structure-Aware Shape Processing Difficult combinatorial search: genetic algorithm Symmetry measure Continuous measure for a discrete 2D pattern Behaves well at both ends of the symmetry spectrum Integral symmetry: integrating 1D symmetry profiles X Y Technical details

Course: Structure-Aware Shape Processing SYMAX involves explicit optimization symmetry hierarchy with an objective function Both still confined to analyzing individual models SYMAX vs. symmetry hierarchy

Course: Structure-Aware Shape Processing Extends symmetry hierarchy to co-analysis of a set A unified explanation of the shape structures Co-hierarchical analysis 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 bypass geometry and analyze 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 illustrated

Course: Structure-Aware Shape Processing Compute symmetry hierarchies [Wang 2011] 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: cluster …

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 But 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. Repeat the process until little movement. Iterate cluster-select-resample

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

Course: Structure-Aware Shape Processing Functional correspondence A co-hierarchy implies correspondence between structures ---- 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 Supervised: symmetry measure is hard; ground truths for and comparison between hierarchical models are not easy Deep learning? Extension from 3D objects to more complex data, e.g., indoor scenes, and mixed object categories Toying with functionality analysis, but nothing explicit yet Short “now and beyond”

Course: Structure-Aware Shape Processing Go to: We welcome your feedback!