Object Recognition Using Geometric Hashing

Slides:



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

Distinctive Image Features from Scale-Invariant Keypoints David Lowe.
Object Recognition from Local Scale-Invariant Features David G. Lowe Presented by Ashley L. Kapron.
Image Registration  Mapping of Evolution. Registration Goals Assume the correspondences are known Find such f() and g() such that the images are best.
Alignment Visual Recognition “Straighten your paths” Isaiah.
Caroline Rougier, Jean Meunier, Alain St-Arnaud, and Jacqueline Rousseau IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 21, NO. 5,
Geometric Hashing Visual Recognition Lecture 9 “Answer me speedily” Psalm, 17.
Computer vision: models, learning and inference Chapter 13 Image preprocessing and feature extraction.
Fitting: The Hough transform. Voting schemes Let each feature vote for all the models that are compatible with it Hopefully the noise features will not.
Computer Vision - A Modern Approach Set: Model-based Vision Slides by D.A. Forsyth Recognition by Hypothesize and Test General idea –Hypothesize object.
A 3-D reference frame can be uniquely defined by the ordered vertices of a non- degenerate triangle p1p1 p2p2 p3p3.
Image alignment Image from
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
Object Recognition with Invariant Features n Definition: Identify objects or scenes and determine their pose and model parameters n Applications l Industrial.
Image alignment Image from
Fitting: The Hough transform
Robust and large-scale alignment Image from
1 Image Recognition - I. Global appearance patterns Slides by K. Grauman, B. Leibe.
Object Recognition Using Genetic Algorithms CS773C Advanced Machine Intelligence Applications Spring 2008: Object Recognition.
A Study of Approaches for Object Recognition
Object Recognition with Invariant Features n Definition: Identify objects or scenes and determine their pose and model parameters n Applications l Industrial.
2D/3D Geometric Transformations CS485/685 Computer Vision Dr. George Bebis.
Object Recognition CS485/685 Computer Vision Dr. George Bebis.
CS485/685 Computer Vision Prof. George Bebis
Automatic Image Alignment (feature-based) : Computational Photography Alexei Efros, CMU, Fall 2005 with a lot of slides stolen from Steve Seitz and.
Introduction to Object Recognition CS773C Machine Intelligence Advanced Applications Spring 2008: Object Recognition.
Algebraic Functions of Views for 3D Object Recognition CS773C Advanced Machine Intelligence Applications Spring 2008: Object Recognition.
Fitting a Model to Data Reading: 15.1,
Scale Invariant Feature Transform (SIFT)
Object Recognition. Geometric Task : find those rotations and translations of one of the point sets which produce “large” superimpositions of corresponding.
Camera Calibration CS485/685 Computer Vision Prof. Bebis.
Automatic Image Alignment (feature-based) : Computational Photography Alexei Efros, CMU, Fall 2006 with a lot of slides stolen from Steve Seitz and.
Fitting: The Hough transform
Recognition of object by finding correspondences between features of a model and an image. Alignment repeatedly hypothesize correspondences between minimal.
Geometric Hashing Visual Recognition Lecture 9 “Answer me speedily” Psalm, 17.
Fitting.
כמה מהתעשייה? מבנה הקורס השתנה Computer vision.
1 Fingerprint Classification sections Fingerprint matching using transformation parameter clustering R. Germain et al, IEEE And Fingerprint Identification.
Image alignment.
CSE 185 Introduction to Computer Vision
Distinctive Image Features from Scale-Invariant Keypoints By David G. Lowe, University of British Columbia Presented by: Tim Havinga, Joël van Neerbos.
Final Exam Review CS485/685 Computer Vision Prof. Bebis.
CS 376b Introduction to Computer Vision 04 / 29 / 2008 Instructor: Michael Eckmann.
Mean-shift and its application for object tracking
Local invariant features Cordelia Schmid INRIA, Grenoble.
Fitting: The Hough transform. Voting schemes Let each feature vote for all the models that are compatible with it Hopefully the noise features will not.
Intelligent Vision Systems ENT 496 Object Shape Identification and Representation Hema C.R. Lecture 7.
Object Detection 01 – Advance Hough Transformation JJCAO.
Generalized Hough Transform
Object Detection with Discriminatively Trained Part Based Models
CS654: Digital Image Analysis Lecture 25: Hough Transform Slide credits: Guillermo Sapiro, Mubarak Shah, Derek Hoiem.
Fitting: The Hough transform
Expectation-Maximization (EM) Case Studies
Raquel A. Romano 1 Scientific Computing Seminar May 12, 2004 Projective Geometry for Computer Vision Projective Geometry for Computer Vision Raquel A.
Geometric Hashing: A General and Efficient Model-Based Recognition Scheme Yehezkel Lamdan and Haim J. Wolfson ICCV 1988 Presented by Budi Purnomo Nov 23rd.
CS 376b Introduction to Computer Vision 04 / 28 / 2008 Instructor: Michael Eckmann.
Distinctive Image Features from Scale-Invariant Keypoints
Lecture 9 Feature Extraction and Motion Estimation Slides by: Michael Black Clark F. Olson Jean Ponce.
776 Computer Vision Jan-Michael Frahm Spring 2012.
Instructor: Mircea Nicolescu Lecture 10 CS 485 / 685 Computer Vision.
Recognizing specific objects Matching with SIFT Original suggestion Lowe, 1999,2004.
Hough Transform CS 691 E Spring Outline Hough transform Homography Reading: FP Chapter 15.1 (text) Some slides from Lazebnik.
776 Computer Vision Jan-Michael Frahm Spring 2012.
SIFT Scale-Invariant Feature Transform David Lowe
Nearest-neighbor matching to feature database
Fitting: The Hough transform
Nearest-neighbor matching to feature database
Application: Geometric Hashing
Geometric Hashing: An Overview
George Bebis and Wenjing Li Computer Vision Laboratory
Presentation transcript:

Object Recognition Using Geometric Hashing CS773C Machine Intelligence Advanced Applications Spring 2008: Object Recognition

Affine Transformation Under the assumption that objects are “flat” and the camera is not very close to the objects, different 2D views of a 3D object can be related by an affine transformation

Affine Transformation (cont’d) Models translation, rotation, scaling and shearing or Six unknowns Need at least six equations to solve for the unknowns!

Affine Transformation Need to find at least three correspondences to solve for the affine transformation p2 p’3 p1 p’2 p’1 p3

Geometric Hashing Models are represented in a redundant affine invariant way and stored in a table (off-line). Hashing is used for organizing and searching the table.

Affine Invariants Each triplet of non-collinear model points forms a basis of a coordinate system that is invariant under affine transformations. Represent model points in an affine invariant way by rewriting them in terms of this coordinate system. (u,v) are affine invariant!

Preprocessing and Recognition

Preprocessing Step For each model do: (1) Extract model's point features. (2) For each ordered set of three, non-collinear, points (p1, p2, p3) (a) Compute the coordinates (u,v) of the remaining features in the coordinate frame defined by the model basis (p1, p2, p3) (b) After a proper quantization, use the computed coordinates (u,v) as an index to a two dimensional hash table, and record in the corresponding hash table bin the information (model, (p1, p2, p3)) Hash Function: h(Q(u), Q(v)) 

Preprocessing and Recognition

Recognition Step (2) Choose an arbitrary ordered pair (p’1, p’2, p’3) (1) Extract the image point features (2) Choose an arbitrary ordered pair (p’1, p’2, p’3) (3) Compute the coordinates (u’,v’), of the remaining feature points in the coordinate frame defined by the image basis (p’1, p’2, p’3) (4) After quantization, use the computed coordinates as an index to the hash table. For every entry (model, (p1, p2, p3)) found in the corresponding bin, cast a vote.

Recognition Step (cont’d) (5) Histogram all the hash table entries that received one or more votes. Determine those entries that received more than a certain number of votes -- each such entry corresponds to a potential match (hypothesis generation). (6) For each potential match, consider all the model-image feature pairs which voted for a particular entry, and recover the affine transformation A that results in the best least-squares match between all the corresponding feature points.

Recognition Step (cont’d) (7) Map the model onto the image using the computed transform and compare the model edges with the image edges (verification step). (8) If the verification fails for all the models computed in step (5), go back to step (2) and repeat the procedure using a different image basis.

Recognition Example Bad hypothesis Good hypothesis

Complexity Preprocessing Step: O(Mm4) Recognition Step: worst case: O(i4Mm4) (M: #models, m: #model points, i: #scene points)

3D Geometric Hashing (Lamdan & Wolfson, "Geometric hashing: a general and efficient model-based recognition system", Inter. Conf. on Computer Vision, 1988, pp. 238-249). Looking for 4 point correspondences between the 3-D model and the 2-D image (3D hash table). Four non-coplanar points define a 3-D affine basis; the coordinates of any 3-D point can be computed in this coordinate frame. During recognition, we vote for all the bins lying on a given line in the 3D hash-table.

Comments on Geometric Hashing For the algorithm to be successful, it suffices to select an image basis triplet which belongs to some model. The goal of the voting scheme is to reduce the number of hypotheses that must verified (filtering). In the case where model points are missing from the image (i.e., due to occlusions), recognition is still possible as long as there is a sufficient number of points hashing into the correct hash table bins.

Unstable basis triplets (Costa, Haralick, and Shapiro "Optimal affine invariant point matching", 6th Israel Conf. on AI, 1990, pp. 35-61) “Skinny” triangles lead to instabilities in the computation of the affine transformation parameters. Avoid “skinny” triangles using an “area” criterion.

Non-uniform Distribution of Invariants The distribution of invariants might be non-uniform.

Rehashing (I. Rigoutsos and R Rehashing (I. Rigoutsos and R. Hummel, “Several Results on Affine Invariant Geometric Hashing, 8th Israeli Conf on Artificial Intell. And Comp. Vision, 1991) Map the distribution of invariants to a uniform distribution. Need to make assumptions about the distribution of invariants. (assuming similarity transformations) (assuming affine transformations)

“Learn” good geometric hash functions (G. Bebis et al “Learn” good geometric hash functions (G. Bebis et al., "Using Self-Organizing Maps to Learn Geometric Hashing Functions for Model-Based Object Recognition" , IEEE Transactions on Neural Networks Vol 9, No. 3, pp. 560-570, 1998). Make the size of the bins proportional to the density of the data. Learning is based on the “Kohonen” neural network.

“Learn” good geometric hash functions (cont’d) Think of the grid as an “elastic” net that deforms based on the density of the data. data distributions deformed grid

“Learn” good geometric hash functions (cont’d) data distributions deformed grid

“Learn” good geometric hash functions (cont’d) Similarity Affine Original Rehashing Learning

Noise (Grimson & Huttenlocher "On the sensitivity of Geometric hashing", 1990) (Lamdan & Wolfson "On the error analysis of Geometric hashing", 1991) The performance of Geometric hashing degrades rapidly for cluttered scenes or in the presence of moderate sensor noise (3-5 pixels). Possible solutions: Make additional entries during preprocessing (increases storage). Cast additional votes during recognition (increases time)

Neighborhood Size (Rigoutsos and Hummel, 1995) Size, shape and orientation of the regions that need to be accessed in the affine space depend on the selected basis triplet as well as on the computed hash locations. The larger the separation of the two basis points, the smaller the spread in the space of invariants. Adaptive weight voting Feature Space (Gaussian noise) Space of Invariants

Index Selectivity Recognition accuracy could be improved by increasing index selectivity. e.g., using higher-dimensional indices A. Califano and R. Mohan, “Multidimensional Indexing for Recognizing Visual Shapes”, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 16 ,  no. 4, pp. 373 – 392, 1994