Multiple Object Class Detection with a Generative Model K. Mikolajczyk, B. Leibe and B. Schiele Carolina Galleguillos.

Slides:



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

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.
Group Meeting Presented by Wyman 10/14/2006
Aggregating local image descriptors into compact codes
Three things everyone should know to improve object retrieval
Presented by Xinyu Chang
Computer vision: models, learning and inference Chapter 13 Image preprocessing and feature extraction.
Clustering with k-means and mixture of Gaussian densities Jakob Verbeek December 3, 2010 Course website:
MIT CSAIL Vision interfaces Approximate Correspondences in High Dimensions Kristen Grauman* Trevor Darrell MIT CSAIL (*) UT Austin…
A NOVEL LOCAL FEATURE DESCRIPTOR FOR IMAGE MATCHING Heng Yang, Qing Wang ICME 2008.
Patch to the Future: Unsupervised Visual Prediction
Quadtrees, Octrees and their Applications in Digital Image Processing
Image alignment Image from
Nearest Neighbor. Predicting Bankruptcy Nearest Neighbor Remember all your data When someone asks a question –Find the nearest old data point –Return.
Object Recognition with Invariant Features n Definition: Identify objects or scenes and determine their pose and model parameters n Applications l Industrial.
Fast High-Dimensional Feature Matching for Object Recognition David Lowe Computer Science Department University of British Columbia.
Beyond bags of features: Part-based models Many slides adapted from Fei-Fei Li, Rob Fergus, and Antonio Torralba.
One-Shot Multi-Set Non-rigid Feature-Spatial Matching
Effective Image Database Search via Dimensionality Reduction Anders Bjorholm Dahl and Henrik Aanæs IEEE Computer Society Conference on Computer Vision.
Robust and large-scale alignment Image from
1 Image Recognition - I. Global appearance patterns Slides by K. Grauman, B. Leibe.
A Study of Approaches for Object Recognition
Video Google: Text Retrieval Approach to Object Matching in Videos Authors: Josef Sivic and Andrew Zisserman ICCV 2003 Presented by: Indriyati Atmosukarto.
Beyond bags of features: Adding spatial information Many slides adapted from Fei-Fei Li, Rob Fergus, and Antonio Torralba.
Quadtrees, Octrees and their Applications in Digital Image Processing
3D Hand Pose Estimation by Finding Appearance-Based Matches in a Large Database of Training Views
Distinctive Image Feature from Scale-Invariant KeyPoints
Video Google: Text Retrieval Approach to Object Matching in Videos Authors: Josef Sivic and Andrew Zisserman University of Oxford ICCV 2003.
Object Class Recognition Using Discriminative Local Features Gyuri Dorko and Cordelia Schmid.
Scale Invariant Feature Transform (SIFT)
Ranking by Odds Ratio A Probability Model Approach let be a Boolean random variable: document d is relevant to query q otherwise Consider document d as.
1 Invariant Local Feature for Object Recognition Presented by Wyman 2/05/2006.
Smart Traveller with Visual Translator for OCR and Face Recognition LYU0203 FYP.
CS4670: Computer Vision Kavita Bala Lecture 8: Scale invariance.
Overview Introduction to local features
Exercise Session 10 – Image Categorization
Distinctive Image Features from Scale-Invariant Keypoints By David G. Lowe, University of British Columbia Presented by: Tim Havinga, Joël van Neerbos.
Methods in Medical Image Analysis Statistics of Pattern Recognition: Classification and Clustering Some content provided by Milos Hauskrecht, University.
Computer vision.
Internet-scale Imagery for Graphics and Vision James Hays cs195g Computational Photography Brown University, Spring 2010.
Presented by Tienwei Tsai July, 2005
Local invariant features Cordelia Schmid INRIA, Grenoble.
Professor: S. J. Wang Student : Y. S. Wang
Building local part models for category-level recognition C. Schmid, INRIA Grenoble Joint work with G. Dorko, S. Lazebnik, J. Ponce.
A Statistical Approach to Speed Up Ranking/Re-Ranking Hong-Ming Chen Advisor: Professor Shih-Fu Chang.
Quadtrees, Octrees and their Applications in Digital Image Processing.
Beyond Sliding Windows: Object Localization by Efficient Subwindow Search The best paper prize at CVPR 2008.
Features-based Object Recognition P. Moreels, P. Perona California Institute of Technology.
Chapter 4: Pattern Recognition. Classification is a process that assigns a label to an object according to some representation of the object’s properties.
Wenqi Zhu 3D Reconstruction From Multiple Views Based on Scale-Invariant Feature Transform.
Lecture 7: Features Part 2 CS4670/5670: Computer Vision Noah Snavely.
Local invariant features Cordelia Schmid INRIA, Grenoble.
CVPR2013 Poster Detecting and Naming Actors in Movies using Generative Appearance Models.
Overview Introduction to local features Harris interest points + SSD, ZNCC, SIFT Scale & affine invariant interest point detectors Evaluation and comparison.
A Tutorial on using SIFT Presented by Jimmy Huff (Slightly modified by Josiah Yoder for Winter )
Scale Invariant Feature Transform (SIFT)
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.
Finding Clusters within a Class to Improve Classification Accuracy Literature Survey Yong Jae Lee 3/6/08.
CSCI 631 – Foundations of Computer Vision March 15, 2016 Ashwini Imran Image Stitching.
776 Computer Vision Jan-Michael Frahm Spring 2012.
Clustering (1) Clustering Similarity measure Hierarchical clustering
SIFT Scale-Invariant Feature Transform David Lowe
Feature description and matching
Cheng-Ming Huang, Wen-Hung Liao Department of Computer Science
CAP 5415 Computer Vision Fall 2012 Dr. Mubarak Shah Lecture-5
Aim of the project Take your image Submit it to the search engine
REU Week 1 Ivette Carreras UCF.
Feature descriptors and matching
Presentation transcript:

Multiple Object Class Detection with a Generative Model K. Mikolajczyk, B. Leibe and B. Schiele Carolina Galleguillos

Goal  Simultaneous recognition and localization of multiple object classes using a generative model.  Recognition Codebook (features are shared among several object classes).  Detection Probabilistic model for various objects in the same image.

Introduction Single Object class detection is a mature problem Multiple Object class detection performance is far from single object. Their approach: Fast and dense sampling of scale invariant features. Effective object representation. Efficient and reliable training and recognition.

Introduction Other approaches:  Based on feature detectors: Local features & several detectors.  Based on appearance clusters: Visual vocab., codebook, keywords.  Represent object classes: Star shape, graphical model, etc.

Features - Appearance  We can compute them efficiently:  Scale space pyramid with a Gaussian kernel.  For each level Canny edge detection with Laplacian automatic scale (position, scale and dominant orientation).  For each edge point we identify a region of interest (in the gradient orientation). This region is described by SIFT descriptors (128 dimensional vector).  Use of PCA for dimensionality reduction (to 40 dimensions).

Features - Geometry  Rotation invariance: Convert position of features in polar coordinates. d: distance to object center. φ: angle. θ: dominant gradient orientation.

Hierarchical Codebook  Tree structure Hierarchical tree of clusters: Appearance clusters (formed by similar features at first level) Each cluster has several geometric distributions that correspond to object classes (info about geom. relations between object centers and local appearance). Node is a hyperball

Building Tree Efficiently  Apply K-means to divide space (top-down).  Use reciprocal nearest neighbor in each k-means partition with a similarity threshold.  Apply agglomerative clustering (bottom up).  Euclidean distance to group clusters.  Clustering trace is used to construct the tree.

Building Tree Efficiently

Tree - Advantages  Appearance clusters are shared within one image and among different classes (and object parts).  Compact representation.  Represent individual objects or all object classes.  Efficient search.

Recognition  Bayesian rule approach F: features. A: appearance clusters. G: geometric distribution. Each feature likelihood is modeled by a mixture of distributions from appearance clusters which match to a query feature. Decision:

Recognition  Problem: Similar objects in the model have probabilities comparables in shared clusters.  Condition: each feature can contribute only to one hypothesis.  Average confusion factor between pairs of objects.  If approaches to 1, we remove from both hypothesis all info that come from those clusters.

Learning  Joint probability distributions are separated in two terms  To estimate de model: Extract features F from labeled training examples. Build appearance clusters & match the features back to the cluster centers (threshold β). Each feature that matches to contributes to the prob. estimates for the appearance and to its geometric distrib. at the position.

Fast Matching  Match features to cluster centers using a ball tree.  Represent query and model as tree structures.  Match two trees computing Euclidean distance between centroids of top nodes. If distance is smaller than the sum of their radii, then the first node is compared with all the children of the intersecting node. Same precision to exhaustive search and 200 times faster.

Experimental results 5 object classes: pedestrian, cars, motorbikes, bicycles and RPG shooter.

Experimental results Motorbike test data Recall is higher and the number of appearance clusters grow sub-linearly with increasing number of object classes

Conclusions  Approach capable of detecting multiple object classes simultaneously in images using a single codebook.  Performance comparable with state of the art discriminative approaches.  Efficient method for building object class representation and recognition.