Persistent Heat Signature for Pose-oblivious Matching of Incomplete Models Tamal K. Dey, Kuiyu Li, Chuanjiang Luo, Pawas Ranjan, Issam Safa, Yusu Wang.

Slides:



Advertisements
Similar presentations
Distinctive Image Features from Scale-Invariant Keypoints
Advertisements

Coherent Laplacian 3D protrusion segmentation Oxford Brookes Vision Group Queen Mary, University of London, 11/12/2009 Fabio Cuzzolin.
Complex Networks for Representation and Characterization of Images For CS790g Project Bingdong Li 9/23/2009.
Distinctive Image Features from Scale-Invariant Keypoints David Lowe.
The economical eigen-computation is where the sufficient spanning set is The final updated LDA component is given by Motivation Incremental Linear Discriminant.
Presented by Xinyu Chang
RGB-D object recognition and localization with clutter and occlusions Federico Tombari, Samuele Salti, Luigi Di Stefano Computer Vision Lab – University.
BRISK (Presented by Josh Gleason)
CSE 473/573 Computer Vision and Image Processing (CVIP)
Feature-based 3D Reassembly Devi Parikh Mentor: Rahul Sukthankar September 14, 2006.
E IGEN D EFORMATION OF 3 D M ODELS Tamal K. Dey, Pawas Ranjan, Yusu Wang [The Ohio State University] (CGI 2012)
Robust Global Registration Natasha Gelfand Niloy Mitra Leonidas Guibas Helmut Pottmann.
Extreme Elevation on a 2- Manifold Pankaj K. Agarwal Joint Work with H. Edelsbrunner, J. Harer, Y. Wang Duke University.
Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.
Computing Stable and Compact Representation of Medial Axis Wenping Wang The University of Hong Kong.
Special Topic on Image Retrieval Local Feature Matching Verification.
6/26/2006CGI'06, Hangzhou China1 Sub-sampling for Efficient Spectral Mesh Processing Rong Liu, Varun Jain and Hao Zhang GrUVi lab, Simon Fraser University,
Optimal invariant metrics for shape retrieval
Shape-Based Retrieval of Articulated 3D Models Using Spectral Embedding GrUVi Lab, School of Computing Science Simon Fraser University, Burnaby, BC Canada.
Iterative closest point algorithms
Design of Optimal Multiple Spaced Seeds for Homology Search Jinbo Xu School of Computer Science, University of Waterloo Joint work with D. Brown, M. Li.
Correspondence & Symmetry
1 Numerical geometry of non-rigid shapes Spectral Methods Tutorial. Spectral Methods Tutorial 6 © Maks Ovsjanikov tosca.cs.technion.ac.il/book Numerical.
Automatic Image Alignment (feature-based) : Computational Photography Alexei Efros, CMU, Fall 2005 with a lot of slides stolen from Steve Seitz and.
Scale Invariant Feature Transform (SIFT)
Kyle Heath, Natasha Gelfand, Maks Ovsjanikov, Mridul Aanjaneya, Leo Guibas Image Webs Computing and Exploiting Connectivity in Image Collections.
Lecture 3a: Feature detection and matching CS6670: Computer Vision Noah Snavely.
Smart Traveller with Visual Translator for OCR and Face Recognition LYU0203 FYP.
Automatic Image Alignment (feature-based) : Computational Photography Alexei Efros, CMU, Fall 2006 with a lot of slides stolen from Steve Seitz and.
1 Interest Operators Find “interesting” pieces of the image Multiple possible uses –image matching stereo pairs tracking in videos creating panoramas –object.
Multi-Scale Surface Descriptors Gregory Cipriano, George N. Phillips Jr., and Michael Gleicher.
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
Description of 3D-Shape Using a Complex Function on the Sphere Dejan Vranić and Dietmar Saupe Slides prepared by Nat for CS
Modal Shape Analysis beyond Laplacian (CAGP 2012) Klaus Hildebrandt, Christian Schulz, Christoph von Tycowicz, Konrad Polthier (brief) Presenter: ShiHao.Wu.
Recognition and Matching based on local invariant features Cordelia Schmid INRIA, Grenoble David Lowe Univ. of British Columbia.
Shape Matching for Model Alignment 3D Scan Matching and Registration, Part I ICCV 2005 Short Course Michael Kazhdan Johns Hopkins University.
Alignment and Matching
Coarse-to-Fine Combinatorial Matching for Dense Isometric Shape Correspondence Yusuf Sahillioğlu and Yücel Yemez Computer Eng. Dept., Koç University, Istanbul,
CSE554AlignmentSlide 1 CSE 554 Lecture 5: Alignment Fall 2011.
Local invariant features Cordelia Schmid INRIA, Grenoble.
Content-Based Image Retrieval
Spectral Global Intrinsic Symmetry Invariant Functions Hui Wang Shijiazhuang Tiedao University Patricio Simari The Catholic University of America Zhixun.
Shape Analysis and Retrieval Statistical Shape Descriptors Notes courtesy of Funk et al., SIGGRAPH 2004.
Axial Flip Invariance and Fast Exhaustive Searching with Wavelets Matthew Bolitho.
A fast algorithm for the generalized k- keyword proximity problem given keyword offsets Sung-Ryul Kim, Inbok Lee, Kunsoo Park Information Processing Letters,
Shape Descriptors Thomas Funkhouser and Michael Kazhdan Princeton University Thomas Funkhouser and Michael Kazhdan Princeton University.
Phase Congruency Detects Corners and Edges Peter Kovesi School of Computer Science & Software Engineering The University of Western Australia.
Extended Grassfire Transform on Medial Axes of 2D Shapes
Roee Litman, Alexander Bronstein, Michael Bronstein
Lecture 7: Features Part 2 CS4670/5670: Computer Vision Noah Snavely.
Dengsheng Zhang and Melissa Chen Yi Lim
Local invariant features Cordelia Schmid INRIA, Grenoble.
Query Sensitive Embeddings Vassilis Athitsos, Marios Hadjieleftheriou, George Kollios, Stan Sclaroff.
Docking III: Matching via Critical Points Yusu Wang Joint Work with P. K. Agarwal, H. Edelsbrunner, J. Harer Duke University.
A Tutorial on using SIFT Presented by Jimmy Huff (Slightly modified by Josiah Yoder for Winter )
Paper presentation topics 2. More on feature detection and descriptors 3. Shape and Matching 4. Indexing and Retrieval 5. More on 3D reconstruction 1.
Ultra-high dimensional feature selection Yun Li
Introduction to Scale Space and Deep Structure. Importance of Scale Painting by Dali Objects exist at certain ranges of scale. It is not known a priory.
Image features and properties. Image content representation The simplest representation of an image pattern is to list image pixels, one after the other.
Mesh Segmentation via Spectral Embedding and Contour Analysis Speaker: Min Meng
Image Retrieval and Ranking using L.S.I and Cross View Learning Sumit Kumar Vivek Gupta
Lecture 07 13/12/2011 Shai Avidan הבהרה: החומר המחייב הוא החומר הנלמד בכיתה ולא זה המופיע / לא מופיע במצגת.
Spectral Methods Tutorial 6 1 © Maks Ovsjanikov
Benchmarking CAD Search Techniques
Car Recognition Through SIFT Keypoint Matching
SHREC’17 Track: Deformable Shape Retrieval with Missing Parts
Scale-Space Representation for Matching of 3D Models
Scale-Space Representation for Matching of 3D Models
Recognition and Matching based on local invariant features
Presentation transcript:

Persistent Heat Signature for Pose-oblivious Matching of Incomplete Models Tamal K. Dey, Kuiyu Li, Chuanjiang Luo, Pawas Ranjan, Issam Safa, Yusu Wang [The Ohio State University] (SGP 2010)

Problem Query and match partial, incomplete and pose-altered models

Previous Work [CTS03]; [OBBG09]; [KFR04]; [BCG08]; [L06]; [RSWN09] … No unified approach for pose-invariant matching of partial, incomplete models

Descriptor based Matching Represent shape with descriptor ‒ Compare descriptors Local vs Global descriptors Need a multi-scale descriptor to capture both local and global features

HKS [Sun-Ovsjanikov-Guibas 09]  Signifies the amount of heat left at a point x M at time t, if unit heat were placed at x when t=0 ‒ Isometry invariant ‒ Stable against noise, small topological changes ‒ Local changes at small t for incomplete models

HKS as Shape Descriptor Possible solutions: ‒ Choose the maxima values for some t Too many for small t Sensitive to incompleteness of shape for large t Need to choose a concise subset of HKS values

Persistent HKS

Persistence [Edelsbrunner et al 02] Tracks topological changes in sub-level sets Pairs point that created a component with one that destroyed it

Persistent Maxima with Region Merging Apply Persistence to HKS ‒ To obtain persistent maxima Region-merging algorithm

Persistent Maxima with Region Merging

Persistent Maxima

Feature Vector Assign a multi-scale feature vector to each persistent maximum ‒ HKS function values at multiple time scales A shape is represented by 15 feature vectors in 15D space

The Algorithm Compute the HKS function on input mesh for small t Find persistent maxima Compute HKS values for multiple t at the persistent maxima

Scalability Expensive to compute the eigenvalues and eigenvectors for large matrices Use an HKS-aware sub-sampling method

Scoring & Matching Pre-compute feature vectors for database Given a query ‒ Compute feature vectors of query ‒ Compare with feature vectors in database Score is based on L1-norm of feature vectors

Results 300 Database Models (22 Classes) ‒ 198 Complete ‒ 102 Incomplete 50 Query Models ‒ 18 Complete ‒ 32 Incomplete

Results

Comparison Eigen-Value Descriptor [JZ07] Light Field Distribution [CTSO03] Top-k Hit Rate ‒ Query hit if model of same class present in top-k results returned

Comparison

Conclusion Combine techniques from spectral theory and computational topology ‒ Fast database-style shape retrieval ‒ Unified method for pose-oblivious, incomplete shape matching Handling non-manifold meshes Matching feature-less shapes