Shape Descriptors Thomas Funkhouser and Michael Kazhdan Princeton University Thomas Funkhouser and Michael Kazhdan Princeton University.

Slides:



Advertisements
Similar presentations
Shape Analysis and Retrieval D2 Shape Distributions Notes courtesy of Funk et al., SIGGRAPH 2004.
Advertisements

Wavelets Fast Multiresolution Image Querying Jacobs et.al. SIGGRAPH95.
Evaluating Sketch Query Interfaces for a 3D Model Search Engine Patrick Min Joyce Chen, Tom Funkhouser Princeton Workshop on Shape-Based Retrieval and.
Overview of 3D Object Representations Thomas Funkhouser Princeton University C0S 597D, Fall 2003.
Extended Gaussian Images
Unconstrained Isosurface Extraction on Arbitrary Octrees
By: Bryan Bonvallet Nikolla Griffin Advisor: Dr. Jia Li
Discrete Geometry Tutorial 2 1
Xianfeng Gu, Yaling Wang, Tony Chan, Paul Thompson, Shing-Tung Yau
Recognizing Objects in Range Data Using Regional Point Descriptors A. Frome, D. Huber, R. Kolluri, T. Bulow, and J. Malik. Proceedings of the European.
3D Skeletons Using Graphics Hardware Jonathan Bilodeau Chris Niski.
Chapter 5 Raster –based algorithms in CAC. 5.1 area filling algorithm 5.2 distance transformation graph and skeleton graph generation algorithm 5.3 convolution.
Discrete Space, Voxelization and Distance Fields Jian Huang, CS 594, Spring 2002.
Lapped Textures Emil Praun and Adam Finkelstien (Princeton University) Huges Hoppe (Microsoft Research) SIGGRAPH 2000 Presented by Anteneh.
Shape Analysis and Retrieval ( ) (Michael) Misha Kazhdan.
GATE D Object Representations (GATE-540) Dr.Çağatay ÜNDEĞER Instructor Middle East Technical University, GameTechnologies & General Manager SimBT.
Rotation Invariant Spherical Harmonic Representation of 3D Shape Descriptors Michael Kazhdan Thomas Funkhouser Szymon Rusinkiewicz Princeton University.
Robert Osada, Tom Funkhouser Bernard Chazelle, and David Dobkin Princeton University Matching 3D Models With Shape Distributions.
Reflective Symmetry Detection in 3 Dimensions
Lapped Textures SIGGRAPH 2000 Emil Praun Adam Finkelstein Hugues Hoppe.
Implicit Surfaces Tom Ouyang January 29, Outline Properties of Implicit Surfaces Polygonization Ways of generating implicit surfaces Applications.
Harmonic 3D Shape Matching Michael Kazhdan Thomas Funkhouser Princeton University Michael Kazhdan Thomas Funkhouser Princeton University.
Selecting Distinctive 3D Shape Descriptors for Similarity Retrieval Philip Shilane and Thomas Funkhouser.
The Princeton Shape Benchmark Philip Shilane, Patrick Min, Michael Kazhdan, and Thomas Funkhouser.
Shape Descriptors I Thomas Funkhouser CS597D, Fall 2003 Princeton University Thomas Funkhouser CS597D, Fall 2003 Princeton University.
Shape Matching and Anisotropy Michael Kazhdan, Thomas Funkhouser, and Szymon Rusinkiewicz Princeton University Michael Kazhdan, Thomas Funkhouser, and.
Shape Classification Using the Inner-Distance Haibin Ling David W. Jacobs IEEE TRANSACTION ON PATTERN ANAYSIS AND MACHINE INTELLIGENCE FEBRUARY 2007.
The Story So Far The algorithms presented so far exploit: –Sparse sets of images (some data may not be available) –User help with correspondences (time.
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
Informatik VIII Computer Graphics & Multimedia Martin Marinov and Leif Kobbelt Direct Quad-Dominated Anisotropic Remeshing Martin Marinov and Leif Kobbelt.
Description of 3D-Shape Using a Complex Function on the Sphere Dejan Vranić and Dietmar Saupe Slides prepared by Nat for CS
05 - Feature Detection Overview Feature Detection –Intensity Extrema –Blob Detection –Corner Detection Feature Descriptors Feature Matching Conclusion.
Alignment Introduction Notes courtesy of Funk et al., SIGGRAPH 2004.
1 Faculty of Information Technology Generic Fourier Descriptor for Shape-based Image Retrieval Dengsheng Zhang, Guojun Lu Gippsland School of Comp. & Info.
TEMPLATE BASED SHAPE DESCRIPTOR Raif Rustamov Department of Mathematics and Computer Science Drew University, Madison, NJ, USA.
Shape Matching for Model Alignment 3D Scan Matching and Registration, Part I ICCV 2005 Short Course Michael Kazhdan Johns Hopkins University.
Alignment and Matching
Geometric Modeling using Polygonal Meshes Lecture 1: Introduction Hamid Laga Office: South.
University of Coimbra Reconstruction of Voxels from Sensor Data Ricardo Martins Coimbra, 19 th January 2010 Doctoral Programme in Electrical Engineering.
Shape Based Image Retrieval Using Fourier Descriptors Dengsheng Zhang and Guojun Lu Gippsland School of Computing and Information Technology Monash University.
Shape Analysis and Retrieval Statistical Shape Descriptors Notes courtesy of Funk et al., SIGGRAPH 2004.
Shape Analysis and Retrieval Structural Shape Descriptors Notes courtesy of Funk et al., SIGGRAPH 2004.
Axial Flip Invariance and Fast Exhaustive Searching with Wavelets Matthew Bolitho.
Signal Processing and Representation Theory Lecture 4.
1 Adding charts anywhere Assume a cow is a sphere Cindy Grimm and John Hughes, “Parameterizing n-holed tori”, Mathematics of Surfaces X, 2003 Cindy Grimm,
03/24/03© 2003 University of Wisconsin Last Time Image Based Rendering from Sparse Data.
Some Shape Descriptors for 3D Visual Objects
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
Shape Analysis and Retrieval
Dengsheng Zhang and Melissa Chen Yi Lim
3D Object Representations
Visual Categorization With Bags of Keypoints Original Authors: G. Csurka, C.R. Dance, L. Fan, J. Willamowski, C. Bray ECCV Workshop on Statistical Learning.
Event retrieval in large video collections with circulant temporal encoding CVPR 2013 Oral.
Reconstruction of Solid Models from Oriented Point Sets Misha Kazhdan Johns Hopkins University.
112/5/ :54 Graphics II Image Based Rendering Session 11.
2004/03/03Sheun-Huei Guan, CML, NTU1 3D Model Retrieval After Shape Distributions.
CSE 185 Introduction to Computer Vision Feature Matching.
Methods for 3D Shape Matching and Retrieval
Partial Shape Matching. Outline: Motivation Sum of Squared Distances.
CDS 301 Fall, 2008 Image Visualization Chap. 9 November 11, 2008 Jie Zhang Copyright ©
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.
Spherical Extent Functions. Spherical Extent Function.
Solid Modeling Dr. Scott Schaefer.
Hough Transform Elegant method for direct object recognition
Tutorial 2 Biological shape descriptors
By Pradeep C.Venkat Srinath Srinivasan
Shape Analysis and Retrieval
Shape Analysis and Retrieval
CSE 185 Introduction to Computer Vision
Presentation transcript:

Shape Descriptors Thomas Funkhouser and Michael Kazhdan Princeton University Thomas Funkhouser and Michael Kazhdan Princeton University

Outline Why shape descriptors? How do we represent shapes? Conclusion

Goal Find 3D models with similar shape 3D Query 3D Database Best Match(es)

Goal Shape Descriptor: Structured abstraction of a 3D model Capturing salient shape information 3D Query Shape Descriptor 3D Database Best Match(es)

Shape Descriptors Fixed dimensional vector Independent of model representation Easy to match

Shape Descriptors Representation: What can you represent? What are you representing? Matching: How do you align? Part or whole matching?

Shape Descriptors Representation: What can you represent? What are you representing? Matching: How do you align? Part or whole matching? Point Clouds Polygon Soups Closed Meshes Genus-0 Meshes Shape Spectrum

Shape Descriptors Representation: What can you represent? What are you representing? Matching: How do you align? Part or whole matching? Is the descriptor invertible?What is represented by the difference in descriptors?

Shape Descriptors Representation: What can you represent? What are you representing? Matching: How do you align? Part or whole matching? = How do you represent models across the space of transformations that don’t change the shape?

Shape Descriptors Representation: What can you represent? What are you representing? Matching: How do you align? Part or whole matching? Can you match part of a shape to the whole shape?

Outline Why shape descriptors? How do we represent shapes? Volumetric Representations Surface Representations View-Based Representations Conclusion

Volumetric Representations Represent models by the volume that they occupy: Rasterize the models into a binary voxel grid A voxel has value 1 if it is inside the model A voxel has value 0 if it is outside Model Voxel Grid

Volumetric Representations Compare models by measuring the overlaps of their volumes Similarity is measured by the size of the intersection Intersection Voxel Representation Model

Volumetric Representations Properties: Invertible 3D array of information Comparison gives the measure of overlap Limitations: Models need to be water-tight Point Clouds Polygon Soups Closed Meshes Genus-0 Meshes Shape Spectrum

Outline Why shape descriptors? How do we represent shapes? Volumetric Representations Surface Representations  Spherical Parameterization  Extended Gaussian Image  Shape Histograms (Sectors + Shells)  Gaussian EDT View-Based Representations Conclusion

Spherical Parameterization Create a 1-to-1 mapping between points on the surface of the model and points on the surface of the sphere. Compare two models by comparing the distances between two points on the models that map to the same point on the sphere Image courtesy of Praun, SIGGRAPH 2004 Spherical Parameterization Model

Spherical Parameterization Properties: Invertible 2D array of information Comparison gives the distance between surfaces Limitations: Models need to be genus-0 Point Clouds Polygon Soups Closed Meshes Genus-0 Meshes Shape Spectrum

Extended Gaussian Image Represent a model by a spherical function by binning surface normals ModelAngular BinsEGI [Horn, 1984]

Extended Gaussian Image Properties: Invertible for convex shapes 2D array of information Can be defined for most models [Horn, 1984] Point Clouds Polygon Soups Closed Meshes Genus-0 Meshes Shape Spectrum

Extended Gaussian Image Properties: Invertible for convex shapes 2D array of information Can be defined for most models Limitations: Too much information is lost Normals are sensitive to noise [Horn, 1984]

Extended Gaussian Image Properties: Invertible for convex shapes 2D array of information Can be defined for most models Limitations: Too much information is lost Normals are sensitive to noise Initial ModelNoisy Model [Horn, 1984]

Retrieval Results Princeton Shape Benchmark ~900 models, 90 classes 14 biplanes50 human bipeds7 dogs17 fish 16 swords6 skulls15 desk chairs13 electric guitars

Retrieval Results Recall Precision

Shape Histograms Shape descriptor stores a histogram of how much surface resides at different bins in space ModelShape Histogram (Sectors + Shells) [Ankerst et al., 1999]

Boundary Voxel Representation Represent a model as the (anti-aliased) rasterization of its surface into a regular grid: A voxel has value 1 (or area of intersection) if it intersects the boundary A voxel has value 0 if it doesn’t intersect Model Voxel Grid

Boundary Voxel Representation Properties: Invertible 3D array of information Can be defined for any model Point Clouds Polygon Soups Closed Meshes Genus-0 Meshes Shape Spectrum

Retrieval Results Recall Precision

Histogram Representations Challenge: Histogram comparisons measure overlap, not proximity.

Convolving with a Gaussian The value at a point is obtained by summing Gaussians distributed over the surface of the model. Distributes the surface into adjacent bins  Blurs the model, loses high frequency information Surface GaussianGaussian convolved surface

Gaussian EDT The value at a point is obtained by summing the Gaussian of the closest point on the model surface. Distributes the surface into adjacent bins Maintains high-frequency information Surface GaussianGaussian EDT max [Kazhdan et al., 2003]

Gaussian EDT Properties: Invertible 3D array of information Can be defined for any model Difference measures proximity between surfaces Point Clouds Polygon Soups Closed Meshes Genus-0 Meshes Shape Spectrum [Kazhdan et al., 2003]

Retrieval Results Recall Precision

Outline Why shape descriptors? How do we represent shapes? Volumetric Representations Surface Representations View-Based Representations  Spherical Extent Function  Light Field Descriptor Conclusion

Spherical Extent Function For every view direction, store the distance to the first point a viewer would see when looking at the origin. [Vranic et al. 2002]

Spherical Extent Function A model is represented by its star-shaped envelope: The minimal surface containing the model with the property that the center sees every point on the surface Transforms arbitrary genus models to genus-0 surfaces [Vranic et al. 2002]

Spherical Extent Function A model is represented by its star-shaped envelope: The minimal surface containing the model with the property that the center sees every point on the surface Transforms arbitrary genus models to genus-0 surfaces ModelStar-Shaped Envelope [Vranic et al. 2002]

Spherical Extent Function Properties: Invertible for star-shaped models 2D array of information Can be defined for most models Point Clouds Polygon Soups Closed Meshes Genus-0 Meshes Shape Spectrum [Vranic et al. 2002]

Spherical Extent Function Properties: Can be defined for most models Invertible for star-shaped models 2D array of information Limitations: Distance only measures angular proximity Spherical Extent MatchingNearest Point Matching [Vranic et al. 2002]

Retrieval Results Recall Precision

For every view direction, store the image the viewer would see when looking at the origin. [Chen et al. 2003] Light Field Descriptor

Hybrid boundary/volume representation Model Image BoundaryVolume [Chen et al. 2003]

Light Field Descriptor Properties: Represents the visual hull of the model 4D array of information Can be defined for most models Point Clouds Polygon Soups Closed Meshes Genus-0 Meshes Shape Spectrum [Chen et al. 2003]

Light Field Descriptor Properties: Can be defined for most models Invertible for star-shaped models 4D array of information Similarity = sum of area and contour similarities  There is a well defined interior  Can parameterize contours in 2D + Area ComparisonContour Comparison [Chen et al. 2003]

Retrieval Results Recall Precision

Conclusion Extended Gaussian Image  Differential properties are not always stable Gaussian Euclidean Distance Transform  Distributes surface across space without blurring Spherical Extent Function  Represents arbitrary genus shape by a genus-0 model Light Field Descriptors  2D matching allows for volumetric comparisons and silhouette parameterizations

Conclusion In designing a shape descriptor, you want to consider: What kind of models can be represented? What kind of shape metric is defined? Point Clouds Polygon Soups Closed Meshes Genus-0 Meshes Shape Spectrum