Feature-based methods

Slides:



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

Distinctive Image Features from Scale-Invariant Keypoints David Lowe.
BRIEF: Binary Robust Independent Elementary Features
Shape Analysis and Retrieval D2 Shape Distributions Notes courtesy of Funk et al., SIGGRAPH 2004.
Presented by Xinyu Chang
1 Michael Bronstein Heat diffusion descriptors deformable Michael Bronstein Weizmann Institute of Science, 4 November 2010 Institute of Computational Science.
Semi-Supervised Hierarchical Models for 3D Human Pose Reconstruction Atul Kanaujia, CBIM, Rutgers Cristian Sminchisescu, TTI-C Dimitris Metaxas,CBIM, Rutgers.
Topology-Invariant Similarity and Diffusion Geometry
1 Numerical Geometry of Non-Rigid Shapes Diffusion Geometry Diffusion geometry © Alexander & Michael Bronstein, © Michael Bronstein, 2010 tosca.cs.technion.ac.il/book.
Discrete Geometry Tutorial 2 1
Isometry-Invariant Similarity
Special Topic on Image Retrieval Local Feature Matching Verification.
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
1 Numerical Geometry of Non-Rigid Shapes Feature-based methods & shape retrieval problems Feature-based methods and shape retrieval problems © Alexander.
Robust and large-scale alignment Image from
1 Michael Bronstein Computational metric geometry Computational metric geometry Michael Bronstein Department of Computer Science Technion – Israel Institute.
Optimal invariant metrics for shape retrieval
Isometry invariant similarity
Spectral embedding Lecture 6 1 © Alexander & Michael Bronstein
Iterative closest point algorithms
Numerical geometry of objects
A Study of Approaches for Object Recognition
1 Bronstein 2 and Kimmel Extrinsic and intrinsic similarity of nonrigid shapes Michael M. Bronstein Department of Computer Science Technion – Israel Institute.
Video Google: Text Retrieval Approach to Object Matching in Videos Authors: Josef Sivic and Andrew Zisserman ICCV 2003 Presented by: Indriyati Atmosukarto.
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.
Spectral Embedding Alexander Bronstein, Michael Bronstein
Video Google: Text Retrieval Approach to Object Matching in Videos Authors: Josef Sivic and Andrew Zisserman University of Oxford ICCV 2003.
Stepan Obdrzalek Jirı Matas
1 Bronstein, Bronstein, and Kimmel Joint extrinsic and intrinsic similarity of non-rigid shapes Rock, paper, and scissors Joint extrinsic and intrinsic.
Scale Invariant Feature Transform (SIFT)
1 Numerical geometry of non-rigid shapes Introduction Numerical geometry of non-rigid shapes Introduction Alexander Bronstein, Michael Bronstein, Ron Kimmel.
CS292 Computational Vision and Language Visual Features - Colour and Texture.
Numerical geometry of non-rigid shapes
1 Invariant Local Feature for Object Recognition Presented by Wyman 2/05/2006.
Multiple Object Class Detection with a Generative Model K. Mikolajczyk, B. Leibe and B. Schiele Carolina Galleguillos.
1 Numerical geometry of non-rigid shapes Non-Euclidean Embedding Non-Euclidean Embedding Lecture 6 © Alexander & Michael Bronstein tosca.cs.technion.ac.il/book.
1 Numerical geometry of non-rigid shapes Expression-invariant face recognition Expression-invariant face recognition Lecture 8 © Alexander & Michael Bronstein.
1 Numerical geometry of non-rigid shapes Three-Dimensional Face Recognition Three Dimensional Face Recognition “And in stature he is small, chest broad,
1 Numerical geometry of non-rigid shapes A journey to non-rigid world objects Introduction non-rigid Alexander Bronstein Michael Bronstein Numerical geometry.
Final Exam Review CS485/685 Computer Vision Prof. Bebis.
Internet-scale Imagery for Graphics and Vision James Hays cs195g Computational Photography Brown University, Spring 2010.
Recognition and Matching based on local invariant features Cordelia Schmid INRIA, Grenoble David Lowe Univ. of British Columbia.
Local invariant features Cordelia Schmid INRIA, Grenoble.
Shape Analysis and Retrieval Statistical Shape Descriptors Notes courtesy of Funk et al., SIGGRAPH 2004.
Features-based Object Recognition P. Moreels, P. Perona California Institute of Technology.
Roee Litman, Alexander Bronstein, Michael Bronstein
A Sparse Texture Representation Using Affine-Invariant Regions Svetlana Lazebnik, Jean Ponce Svetlana Lazebnik, Jean Ponce Beckman Institute University.
Local invariant features Cordelia Schmid INRIA, Grenoble.
Distinctive Image Features from Scale-Invariant Keypoints Ronnie Bajwa Sameer Pawar * * Adapted from slides found online by Michael Kowalski, Lehigh University.
Visual Categorization With Bags of Keypoints Original Authors: G. Csurka, C.R. Dance, L. Fan, J. Willamowski, C. Bray ECCV Workshop on Statistical Learning.
Department of Computer Science Center for Visual Computing Bag-of-Feature-Graphs: A New Paradigm for Non-rigid Shape Retrieval Tingbo HOU, Xiaohua HOU,
CENG 789 – Digital Geometry Processing 04- Distances, Descriptors and Sampling on Meshes Asst. Prof. Yusuf Sahillioğlu Computer Eng. Dept,, Turkey.
Methods for 3D Shape Matching and Retrieval
Distinctive Image Features from Scale-Invariant Keypoints
Bundling Features for Large Scale Partial-Duplicate Web Image Search Zhong Wu ∗, Qifa Ke, Michael Isard, and Jian Sun Microsoft Research.
1 Numerical geometry of non-rigid shapes Projects Quasi-isometries Project 1 © Alexander & Michael Bronstein tosca.cs.technion.ac.il/book Numerical geometry.
776 Computer Vision Jan-Michael Frahm Spring 2012.
Video Google: Text Retrieval Approach to Object Matching in Videos Authors: Josef Sivic and Andrew Zisserman University of Oxford ICCV 2003.
Rongjie Lai University of Southern California Joint work with: Jian Liang, Alvin Wong, Hongkai Zhao 1 Geometric Understanding of Point Clouds using Laplace-Beltrami.
Intrinsic Data Geometry from a Training Set
Video Google: Text Retrieval Approach to Object Matching in Videos
Spectral Methods Tutorial 6 1 © Maks Ovsjanikov
Feature description and matching
Cheng-Ming Huang, Wen-Hung Liao Department of Computer Science
Brief Review of Recognition + Context
KFC: Keypoints, Features and Correspondences
Video Google: Text Retrieval Approach to Object Matching in Videos
Presented by Xu Miao April 20, 2005
Recognition and Matching based on local invariant features
Presentation transcript:

Feature-based methods Numerical geometry of non-rigid objects Feature-based methods Alexander Bronstein Michael Bronstein 1

Two perspectives Metric geometry Computer vision Features and local descriptors Metric geometry Shapes as metric spaces 2

Invariant retrieval Illumination View Missing data Deformation Topology Missing data 3

Bags of words Notre Dame de Paris is a Gothic cathedral in the fourth quarter of Paris, France. It was the first Gothic architecture cathedral, and its construction spanned the Gothic period. Notre Dame de Paris is a Gothic cathedral in the fourth quarter of Paris, France. It was the first Gothic architecture cathedral, and its construction spanned the Gothic period. construction architecture Italy France cathedral church basilica Paris Rome Gothic Roman St. Peter’s basilica is the largest church in world, located in Rome, Italy. As a work of architecture, it is regarded as the best building of its age in Italy. St. Peter’s basilica is the largest church in world, located in Rome, Italy. As a work of architecture, it is regarded as the best building of its age in Italy. 4

Feature detector + descriptor Bags of features Visual vocabulary Feature detector + descriptor Invariant to changes of the image Discriminative (tells different images apart) 5

Images vs shapes Images Shapes Many prominent features Few prominent features Affine transforms, illumination, occlusions, resolution Non-rigid deformations, topology, missing parts, triangulation SIFT, SURF, MSER, DAISY, … Curvature, conformal factor, local distance histograms 6

Diffusion scale space can be interpreted as probability of Brownian motion to remain at the same point after time (represents “stability” of the point) Multiscale descriptor Time (scale) J. Sun, M. Ovsjanikov, L. Guibas, SGP 2009 M. Ovsjanikov, BB, L. Guibas, 2009 7

Heat kernel descriptor represented in RGB space Heat kernel descriptors Heat kernel descriptor represented in RGB space J. Sun, M. Ovsjanikov, L. Guibas, SGP 2009 M. Ovsjanikov, BB, L. Guibas, 2009 8

Our descriptor is… Dense Defined at every point of the shape No feature detection Statistical weighting (reduce the influence of “dull” points) Intrinsic Based on diffusion geometry, hence intrinsic Invariant to isometric deformations Insensitive to topological noise Consistent Uses a geometrically consistent discretization of the Laplace-Beltrami operator Insensitive to different sampling and triangulations M. Ovsjanikov, BB, L. Guibas, 2009

Heat kernel descriptors Invariant to isometric deformations Localized sensitivity to topological noise J. Sun, M. Ovsjanikov, L. Guibas, SGP 2009 M. Ovsjanikov, BB, L. Guibas, 2009 10

Geometric vocabulary M. Ovsjanikov, BB, L. Guibas, 2009 11

Nearest neighbor in the descriptor space Bags of features Given a geometric vocabulary for each point with local descriptor find representation Hard quantization Soft quantization Weighted distance to words in vocabulary Nearest neighbor in the descriptor space M. Ovsjanikov, BB, L. Guibas, 2009 12

Bags of features Statistics of different geometric words over the entire shape Shape distance = distance between bags of features M. Ovsjanikov, BB, L. Guibas, 2009 13

Bags of features 1 Index in vocabulary 64 14 M. Ovsjanikov, BB, L. Guibas, 2009 14

Expressions In math science, matrix decomposition is a factorization of a matrix into some canonical form. Each type of decomposition is used in a particular problem. In math science, matrix decomposition is a factorization of a matrix into some canonical form. Each type of decomposition is used in a particular problem. In math science, matrix decomposition is a factorization of a matrix into some canonical form. Each type of decomposition is used in a particular problem. In biological science, decomposition is the process of organisms to break down into simpler form of matter. Usually, decomposition occurs after death. In biological science, decomposition is the process of organisms to break down into simpler form of matter. Usually, decomposition occurs after death. Matrix is a science fiction movie released in 1999. Matrix refers to a simulated reality created by machines in order to subdue the human population. Matrix is a science fiction movie released in 1999. Matrix refers to a simulated reality created by machines in order to subdue the human population. Matrix is a science fiction movie released in 1999. Matrix refers to a simulated reality created by machines in order to subdue the human population. matrix decomposition is a the of in to by science form matrix decomposition matrix factorization science fiction canonical form M. Ovsjanikov, BB, L. Guibas, 2009 15

Expressions In math science, matrix decomposition is a factorization of a matrix into some canonical form. Each type of decomposition is used in a particular problem. In particular matrix used type a some science, decomposition form a factorization of is canonical. matrix math decomposition is in a Each problem. into of matrix decomposition is a the of in to by science form matrix decomposition matrix factorization science fiction canonical form M. Ovsjanikov, BB, L. Guibas, 2009 16

Visual expressions “Inquisitor King” Inquisitor, King Giuseppe Verdi, Don Carlo, Metropolitan Opera 17

Geometric expressions Yellow “Yellow Yellow” No total order between points (only “far” and “near”) Geometric expression = a pair of spatially close geometric words M. Ovsjanikov, BB, L. Guibas, 2009 18

Spatially-sensitive bags of features Distribution of pairs of geometric words is the probability to find word at point and word at point Proximity between points and is the statistic of geometric expressions of the form Shape distance M. Ovsjanikov, BB, L. Guibas, 2009 19

Spatially-sensitive bags of features M. Ovsjanikov, BB, L. Guibas, 2009 20

Query Positives Negatives Iso Topo Triang Part Query Positives Negatives

Shape Google Query Match 1 Match 2 Match 3 Match 25 Iso Iso 0.060 Null 0.072 Noise 0.382 Iso Iso+Topo 0.011 Iso 0.019 Iso+Topo 0.023 Iso 0.073 M. Ovsjanikov, BB, L. Guibas, 2009 22

Shape Google Query Match 1 Match 2 Match 3 Match 25 Part Part 0.292 Iso+Topo 0.372 Null 0.377 Triang 0.575 Iso+Topo Iso 0.014 Iso+Topo 0.108 Noise 0.114 Iso+Topo 0.459 M. Ovsjanikov, BB, L. Guibas, 2009 23

Bags of features 100% 98% 96% True Positive Rate (TPR) 90% 80% 0.1% 1% 10% 100% M. Ovsjanikov, BB, L. Guibas, 2009 False Positive Rate (FPR) 24

Spatially-sensitive bags of features 100% 98% 96% True Positive Rate (TPR) 90% 80% 0.1% 1% 10% 100% M. Ovsjanikov, BB, L. Guibas, 2009 False Positive Rate (FPR) 25

Comparison SS-BoF 8% BoF Shape DNA [Reuter et al.] Equal Error Rate (EER) 4% 0% All Null Iso. Part. Topo. Triang. Iso.+Topo. M. Reuter et al., 2006 M. Ovsjanikov, BB, L. Guibas, 2009 26