Lior Shapira Tel Aviv University Shy Shalom Bar Ilan University Ariel Shamir The Interdisciplinary Center Daniel Cohen Or Tel Aviv University 1 H.Zhang.

Slides:



Advertisements
Similar presentations
Complex Networks for Representation and Characterization of Images For CS790g Project Bingdong Li 9/23/2009.
Advertisements

O(N 1.5 ) divide-and-conquer technique for Minimum Spanning Tree problem Step 1: Divide the graph into  N sub-graph by clustering. Step 2: Solve each.
電腦視覺 Computer and Robot Vision I
November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
Sources of the Magnetic Field
REU Project 4D Efficient Real-Time Graph Based Temporal Point Cloud Segmentation Steven Hickson.
Semantic Texton Forests for Image Categorization and Segmentation We would like to thank Amnon Drory for this deck הבהרה : החומר המחייב הוא החומר הנלמד.
Extended Gaussian Images
Clustering (1) Clustering Similarity measure Hierarchical clustering Model-based clustering Figures from the book Data Clustering by Gan et al.
Data Clustering Methods
Shape and Dynamics in Human Movement Analysis Ashok Veeraraghavan.
Lecture 6 Image Segmentation
Agenda Seam-carving: finish up “Mid-term review” (a look back) Main topic: Feature detection.
Thresholding Otsu’s Thresholding Method Threshold Detection Methods Optimal Thresholding Multi-Spectral Thresholding 6.2. Edge-based.
Region Segmentation. Find sets of pixels, such that All pixels in region i satisfy some constraint of similarity.
HCS Clustering Algorithm
Randomized Cuts for 3D Mesh Analysis
CSE 222 Systems Programming Graph Theory Basics Dr. Jim Holten.
Slide 1 EE3J2 Data Mining EE3J2 Data Mining - revision Martin Russell.
What is Cluster Analysis?
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.
Multiple Object Class Detection with a Generative Model K. Mikolajczyk, B. Leibe and B. Schiele Carolina Galleguillos.
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.
Computer Vision - A Modern Approach Set: Segmentation Slides by D.A. Forsyth Segmentation and Grouping Motivation: not information is evidence Obtain a.
3D Models and Matching representations for 3D object models
Image Segmentation Image segmentation is the operation of partitioning an image into a collection of connected sets of pixels. 1. into regions, which usually.
05 - Feature Detection Overview Feature Detection –Intensity Extrema –Blob Detection –Corner Detection Feature Descriptors Feature Matching Conclusion.
06 - Boundary Models Overview Edge Tracking Active Contours Conclusion.
Interactive Graph Cuts for Optimal Boundary & Region Segmentation of Objects in N-D Images (Fri) Young Ki Baik, Computer Vision Lab.
An Efficient Approach to Clustering in Large Multimedia Databases with Noise Alexander Hinneburg and Daniel A. Keim.
Jeopardy Introductory Geometry Vocabulary Polygon 1 Circles 2 Lines 3 Measure 4 Angles 5 Pot Luck
PMLAB Finding Similar Image Quickly Using Object Shapes Heng Tao Shen Dept. of Computer Science National University of Singapore Presented by Chin-Yi Tsai.
Organizing Heterogeneous Scene Collections through Contextual Focal Points Kai Xu, Rui Ma, Hao Zhang, Chenyang Zhu, Ariel Shamir, Daniel Cohen-Or, Hui.
Medical Imaging Dr. Mohammad Dawood Department of Computer Science University of Münster Germany.
Video Google: A Text Retrieval Approach to Object Matching in Videos Josef Sivic and Andrew Zisserman.
1 Statistical Techniques Chapter Linear Regression Analysis Simple Linear Regression.
Automatic Minirhizotron Root Image Analysis Using Two-Dimensional Matched Filtering and Local Entropy Thresholding Presented by Guang Zeng.
Roee Litman, Alexander Bronstein, Michael Bronstein
A Baseline System for Speaker Recognition C. Mokbel, H. Greige, R. Zantout, H. Abi Akl A. Ghaoui, J. Chalhoub, R. Bayeh University Of Balamand - ELISA.
Object Recognition Based on Shape Similarity Longin Jan Latecki Computer and Information Sciences Dept. Temple Univ.,
David Levin Tel-Aviv University Afrigraph 2009 Shape Preserving Deformation David Levin Tel-Aviv University Afrigraph 2009 Based on joint works with Yaron.
Gaussian Mixture Models and Expectation-Maximization Algorithm.
Mining Dependency Relations for Query Expansion in Passage Retrieval Renxu Sun, Chai-Huat Ong, Tat-Seng Chua National University of Singapore SIGIR2006.
1 Approximate XML Query Answers Presenter: Hongyu Guo Authors: N. polyzotis, M. Garofalakis, Y. Ioannidis.
Thresholding Foundation:. Thresholding In A: light objects in dark background To extract the objects: –Select a T that separates the objects from the.
A Part-aware Surface Metric for Shape Analysis Rong Liu 1, Hao Zhang 1, Ariel Shamir 2, and Daniel Cohen-Or 3 1 Simon Fraser University, Canada 2 The Interdisciplinary.
SUMMERY 1. VOLUMETRIC FEATURES FOR EVENT DETECTION IN VIDEO correlate spatio-temporal shapes to video clips that have been automatically segmented we.
1 Review and Summary We have covered a LOT of material, spending more time and more detail on 2D image segmentation and analysis, but hopefully giving.
Unit 4D:2-3 Dimensional Shapes LT5: I can identify three-dimensional figures. LT6: I can calculate the volume of a cube. LT7: I can calculate the surface.
May 2003 SUT Color image segmentation – an innovative approach Amin Fazel May 2003 Sharif University of Technology Course Presentation base on a paper.
Real-Time Hierarchical Scene Segmentation and Classification Andre Uckermann, Christof Elbrechter, Robert Haschke and Helge Ritter John Grossmann.
DATA MINING: CLUSTER ANALYSIS Instructor: Dr. Chun Yu School of Statistics Jiangxi University of Finance and Economics Fall 2015.
Clustering (1) Clustering Similarity measure Hierarchical clustering
Prior Knowledge for Part Correspondence
IMAGE PROCESSING RECOGNITION AND CLASSIFICATION
Prisms & Cylinders Base Face- flat surfaces
Nonparametric Semantic Segmentation
Slope and Curvature Density Functions
Multiple Alignment and Phylogenetic Trees
3D Models and Matching particular matching techniques
Critical Issues with Respect to Clustering
Computer Vision Lecture 16: Texture II
Scale-Space Representation of 3D Models and Topological Matching
12-4: Area and volume of Spheres
“grabcut”- Interactive Foreground Extraction using Iterated Graph Cuts
Scale-Space Representation for Matching of 3D Models
Clustering The process of grouping samples so that the samples are similar within each group.
Presentation transcript:

Lior Shapira Tel Aviv University Shy Shalom Bar Ilan University Ariel Shamir The Interdisciplinary Center Daniel Cohen Or Tel Aviv University 1 H.Zhang Presented by Dana Silverbush

 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 2

 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 3

 Given q find similar s in set S  Common technique:  define f() and calculate for q and S f(q) S f(s) 4

 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. - = ? 5

 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: Partition Test Cluster Smooth Measure Define f() Distance Dist() Contextual distance 6

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

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

Partition Test Cluster Smooth Measure Define f() Distance Dist() Contextual distance 9  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

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

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

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

Partition Test Cluster Smooth Measure Define f() Distance Dist() Contextual distance 13 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!

Partition Test Cluster Smooth Measure Define f() Distance Dist() Contextual distance 14

Partition Test Cluster Smooth Measure Define f() Distance Dist() Contextual distance 15

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

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

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

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

20

 Comparing local signature to a context-aware distance measure 21

 Preforming part queries in several categories (human leg, armadillo leg and airplane wing) 22

 Five distinct partitioning were inserted, making part hierarchy different for each model  Query the dinopet hand returns matching hand from all dinopet variants 23

 Five distinct partitioning were inserted, making part hierarchy different for each model  Query the dinopet hand returns matching hand from all dinopet variants 24

25

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

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

28