Shape Analysis and Retrieval

Slides:



Advertisements
Similar presentations
Object Recognition from Local Scale-Invariant Features David G. Lowe Presented by Ashley L. Kapron.
Advertisements

Surface Simplification using Quadric Error Metrics Guowei Wu.
November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
Overview of 3D Object Representations Thomas Funkhouser Princeton University C0S 597D, Fall 2003.
Computer vision: models, learning and inference Chapter 13 Image preprocessing and feature extraction.
Unconstrained Isosurface Extraction on Arbitrary Octrees
Chapter 8 Content-Based Image Retrieval. Query By Keyword: Some textual attributes (keywords) should be maintained for each image. The image can be indexed.
1 Numerical Geometry of Non-Rigid Shapes Diffusion Geometry Diffusion geometry © Alexander & Michael Bronstein, © Michael Bronstein, 2010 tosca.cs.technion.ac.il/book.
By: Bryan Bonvallet Nikolla Griffin Advisor: Dr. Jia Li
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.
Rotation Invariant Spherical Harmonic Representation of 3D Shape Descriptors Michael Kazhdan Thomas Funkhouser Szymon Rusinkiewicz Princeton University.
Iterative closest point algorithms
Pauly, Keiser, Kobbelt, Gross: Shape Modeling with Point-Sampled GeometrySIGGRAPH 2003 Shape Modeling with Point-Sampled Geometry Mark Pauly Richard Keiser.
Reflective Symmetry Detection in 3 Dimensions
Filling Holes in Complex Surfaces using Volumetric Diffusion James Davis, Stephen Marschner, Matt Garr, Marc Levoy Stanford University First International.
Texture Synthesis on Surfaces Paper by Greg Turk Presentation by Jon Super.
Harmonic 3D Shape Matching Michael Kazhdan Thomas Funkhouser Princeton University Michael Kazhdan Thomas Funkhouser Princeton University.
Shape Descriptors I Thomas Funkhouser CS597D, Fall 2003 Princeton University Thomas Funkhouser CS597D, Fall 2003 Princeton University.
CS443: Digital Imaging and Multimedia Filters Spring 2008 Ahmed Elgammal Dept. of Computer Science Rutgers University Spring 2008 Ahmed Elgammal Dept.
Shape Matching and Anisotropy Michael Kazhdan, Thomas Funkhouser, and Szymon Rusinkiewicz Princeton University Michael Kazhdan, Thomas Funkhouser, and.
Implicit Representations of Surfaces and Polygonalization Algorithms Dr. Scott Schaefer.
CS4670: Computer Vision Kavita Bala Lecture 7: Harris Corner Detection.
00/4/103DVIP-011 Part Three: Descriptions of 3-D Objects and Scenes.
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
Computer vision.
Alignment Introduction Notes courtesy of Funk et al., SIGGRAPH 2004.
Shape Matching for Model Alignment 3D Scan Matching and Registration, Part I ICCV 2005 Short Course Michael Kazhdan Johns Hopkins University.
Alignment and Matching
Local invariant features Cordelia Schmid INRIA, Grenoble.
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.
Signal Processing and Representation Theory Lecture 4.
Image Processing Edge detection Filtering: Noise suppresion.
Some Shape Descriptors for 3D Visual Objects
Shape Descriptors Thomas Funkhouser and Michael Kazhdan Princeton University Thomas Funkhouser and Michael Kazhdan Princeton University.
Solving Quadratics. Methods for Solving Quadratics Graphing Factoring Square Root Method Completing the Square Quadratic Formula.
EXAMPLE 3 Factor by grouping Factor the polynomial x 3 – 3x 2 – 16x + 48 completely. x 3 – 3x 2 – 16x + 48 Factor by grouping. = (x 2 – 16)(x – 3) Distributive.
Advanced Multimedia Image Content Analysis Tamara Berg.
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
Shape Analysis and Retrieval
3D Object Representations
Local invariant features Cordelia Schmid INRIA, Grenoble.
Event retrieval in large video collections with circulant temporal encoding CVPR 2013 Oral.
Geometric Modeling using Polygonal Meshes Lecture 3: Discrete Differential Geometry and its Application to Mesh Processing Office: South B-C Global.
Reconstruction of Solid Models from Oriented Point Sets Misha Kazhdan Johns Hopkins University.
Duy & Piotr. How to reconstruct a high quality image with the least amount of samples per pixel the least amount of resources And preserving the image.
Content-Based Image Retrieval QBIC Homepage The State Hermitage Museum db2www/qbicSearch.mac/qbic?selLang=English.
Solve by factoring. x² = - 4 – 5x 2,. Solve by factoring. n² = -30 – 11n -4 and -1.
Partial Shape Matching. Outline: Motivation Sum of Squared Distances.
Spherical Extent Functions. Spherical Extent Function.
Factor: 1. 2x 2 – 3x x 2 - 8x x 2 – 10x – 20.
Hough Transform Elegant method for direct object recognition
SOLVING QUADRATIC EQUATIONS BY COMPLETING THE SQUARE
- photometric aspects of image formation gray level images
Graph Representations
A Gentle Introduction to Bilateral Filtering and its Applications
Joshua Barczak CMSC435 UMBC
Shape Analysis and Retrieval
Polygons and Perimeter
1. Use the quadratic formula to find all real zeros of the second-degree polynomial
Grimm and Hughes Input: arbitrary mesh
Lesson 9-1 Area of 2-D Shapes.
Solving Quadratics Using Square Roots
CSE 554 Lecture 10: Extrinsic Deformations
Image Registration 박성진.
Quadratic Equations.
Lesson 9-1: Area of 2-D Shapes
Descriptions of 3-D Objects and Scenes
SIFT SIFT is an carefully designed procedure with empirically determined parameters for the invariant and distinctive features.
Presentation transcript:

Shape Analysis and Retrieval Shape Histograms Ankerst et al. 1999 Notes courtesy of Funk et al., SIGGRAPH 2004

Shape Histogram (Sectors + Shells) Shape descriptor stores a histogram of how much surface resides at different bins in space Model Shape Histogram (Sectors + Shells)

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

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

Histogram Representations Solution: Quadratic distance form:

Histogram Representations Solution: Quadratic distance form: M is a symmetric matrix and can be expressed as: O is a rotation and D is diagonal with positive entries. Taking the square root:

Histogram Representations Solution: Quadratic distance form factors: If v=(v1,…,vn), we have: That is, M1/2(v) is just the convolution of v with some filter.

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 Gaussian Gaussian 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 max Surface Gaussian Gaussian EDT [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

Retrieval Results