2D Shape Matching (and Object Recognition)

Slides:



Advertisements
Similar presentations
Shape Matching and Object Recognition using Low Distortion Correspondence Alexander C. Berg, Tamara L. Berg, Jitendra Malik U.C. Berkeley.
Advertisements

Shape Context and Chamfer Matching in Cluttered Scenes
TP11 - Fitting: Deformable contours Computer Vision, FCUP, Miguel Coimbra Slides by Prof. Kristen Grauman.
Fitting: Deformable contours
Presented by Xinyu Chang
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.
TP14 - Local features: detection and description Computer Vision, FCUP, 2014 Miguel Coimbra Slides by Prof. Kristen Grauman.
Chapter 8 Content-Based Image Retrieval. Query By Keyword: Some textual attributes (keywords) should be maintained for each image. The image can be indexed.
Image and video descriptors
Announcements Final Exam May 13th, 8 am (not my idea).
Image alignment Image from
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
Computer Vision Group University of California Berkeley Estimating Human Body Configurations using Shape Context Matching Greg Mori and Jitendra Malik.
Shape and Dynamics in Human Movement Analysis Ashok Veeraraghavan.
Computer Vision Group University of California Berkeley Shape Matching and Object Recognition using Shape Contexts Jitendra Malik U.C. Berkeley (joint.
Fitting: The Hough transform
Robust and large-scale alignment Image from
Shape and Dynamics in Human Movement Analysis Ashok Veeraraghavan.
Announcements Final Exam May 16 th, 8 am (not my idea). Practice quiz handout 5/8. Review session: think about good times. PS5: For challenge problems,
1 Model Fitting Hao Jiang Computer Science Department Oct 6, 2009.
1 Interest Operators Find “interesting” pieces of the image –e.g. corners, salient regions –Focus attention of algorithms –Speed up computation Many possible.
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.
Automatic Image Alignment (feature-based) : Computational Photography Alexei Efros, CMU, Fall 2005 with a lot of slides stolen from Steve Seitz and.
Feature extraction: Corners and blobs
Announcements Take home quiz given out Thursday 10/23 –Due 10/30.
Object Recognition Using Geometric Hashing
Scale Invariant Feature Transform (SIFT)
Computer Vision Group University of California Berkeley Matching Shapes Serge Belongie *, Jitendra Malik and Jan Puzicha U.C. Berkeley * Present address:
Computer Vision Group University of California Berkeley Recognizing Objects in Adversarial Clutter: Breaking a Visual CAPTCHA Greg Mori and Jitendra Malik.
Automatic Image Alignment (feature-based) : Computational Photography Alexei Efros, CMU, Fall 2006 with a lot of slides stolen from Steve Seitz and.
CS4670: Computer Vision Kavita Bala Lecture 8: Scale invariance.
Shape Classification Using the Inner-Distance Haibin Ling David W. Jacobs IEEE TRANSACTION ON PATTERN ANAYSIS AND MACHINE INTELLIGENCE FEBRUARY 2007.
Robust fitting Prof. Noah Snavely CS1114
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
Distinctive Image Features from Scale-Invariant Keypoints By David G. Lowe, University of British Columbia Presented by: Tim Havinga, Joël van Neerbos.
Fitting: Deformable contours Tuesday, September 24 th 2013 Devi Parikh Virginia Tech 1 Slide credit: Kristen Grauman Disclaimer: Many slides have been.
Computer vision.
Internet-scale Imagery for Graphics and Vision James Hays cs195g Computational Photography Brown University, Spring 2010.
1 Interest Operators Harris Corner Detector: the first and most basic interest operator Kadir Entropy Detector and its use in object recognition SIFT interest.
Shape Matching for Model Alignment 3D Scan Matching and Registration, Part I ICCV 2005 Short Course Michael Kazhdan Johns Hopkins University.
Characterizing activity in video shots based on salient points Nicolas Moënne-Loccoz Viper group Computer vision & multimedia laboratory University of.
Local invariant features Cordelia Schmid INRIA, Grenoble.
Bag-of-features models. Origin 1: Texture recognition Texture is characterized by the repetition of basic elements or textons For stochastic textures,
Shape Matching Tuesday, Nov 18 Kristen Grauman UT-Austin.
Generalized Hough Transform
Fitting: The Hough transform
Lecture 7: Features Part 2 CS4670/5670: Computer Vision Noah Snavely.
Local invariant features Cordelia Schmid INRIA, Grenoble.
CS654: Digital Image Analysis Lecture 36: Feature Extraction and Analysis.
Pictorial Structures and Distance Transforms Computer Vision CS 543 / ECE 549 University of Illinois Ian Endres 03/31/11.
Local features: detection and description
Botany Image Retrieval Haibin Ling University of Maryland, College Park.
CS654: Digital Image Analysis
776 Computer Vision Jan-Michael Frahm Spring 2012.
Dynamic Programming (DP), Shortest Paths (SP)
Image features and properties. Image content representation The simplest representation of an image pattern is to list image pixels, one after the other.
Invariant Local Features Image content is transformed into local feature coordinates that are invariant to translation, rotation, scale, and other imaging.
Deformation Modeling for Robust 3D Face Matching Xioguang Lu and Anil K. Jain Dept. of Computer Science & Engineering Michigan State University.
776 Computer Vision Jan-Michael Frahm Spring 2012.
TP11 - Fitting: Deformable contours
Visual homing using PCA-SIFT
SIFT paper.
Paper Presentation: Shape and Matching
Feature description and matching
Shape matching and object recognition using shape contexts
CSE 455 – Guest Lectures 3 lectures Contact Interest points 1
Feature descriptors and matching
Lecture 5: Feature invariance
Lecture 5: Feature invariance
Presentation transcript:

2D Shape Matching (and Object Recognition) Raghuraman Gopalan Center for Automation Research University of Maryland, College Park

Outline What is a shape? Part 1: Matching/ Recognition Shape contexts [Belongie, Malik, Puzicha – TPAMI ’02] Indexing [Biswas, Aggarwal, Chellappa – TMM ’10] Part 2: General discussion Motivate PLS

Shape Some slides were adapted from Prof. Grauman’s course at Texas Austin, and Prof. Malik’s presentation at MIT

Where have we encountered shape before? Edges/ Contours Silhouettes

A definition of shape Defn 1: A set of points that collectively represent the object We are interested in their location information alone!! Defn 2: Mathematically, shape is an equivalence class under a group of transformations Given a set of points X representing an object O, and a set of transformations T, shape S={t(X)| t\in T} Issues? – Kendall ‘84

Applications of Shapes Analysis of anatomical structures Figure from Grimson & Golland Recognition, detection Fig from Opelt et al. Pose Morphology http://usuarios.lycos.es/lawebdelosfosiles/i Characteristic feature Fig from Belongie et al.

Part 1: 2D shape matching

Recognition using shapes – (eg. – model fitting) [Fig from Marszalek & Schmid, 2007] For example, the model could be a line, a circle, or an arbitrary shape.

Example: Deformable contours Visual Dynamics Group, Dept. Engineering Science, University of Oxford. Applications: Traffic monitoring Human-computer interaction Animation Surveillance Computer Assisted Diagnosis in medical imaging

Issues at stake Representation Matching Challenges in recognition Holistic Part-based Matching How to compute distance between shapes? Challenges in recognition Information loss in 3D to 2D projection Articulations Occlusion…. Invariance??? Any other issue?

Representation [Veltkamp ’00] Holistic Moments Fourier descriptors Computational geometry Curvature scale-space

Part-based medial axis transform – shock graphs

Matching: How to compare shapes?

Discussion for a set of points Hausdorff distance

Chamfer distance Average distance to nearest feature T: template shape a set of points I: image to search a set of points dI(t): min distance for point t to some point in I Average distance to nearest feature T: template shape a set of points I: image to search a set of points dI(t): min distance for point t to some point in I

Chamfer distance How is the measure different than just filtering with a mask having the shape points? Edge image

Distance Transform Image features (2D) 3 4 2 5 1 Distance Transform Distance Transform is a function that for each image pixel p assigns a non-negative number corresponding to distance from p to the nearest feature in the image I Features could be edge points, foreground points,… Source: Yuri Boykov

Distance transform edges original distance transform Value at (x,y) tells how far that position is from the nearest edge point (or other binary mage structure) >> help bwdist

Chamfer distance Average distance to nearest feature Edge image Distance transform image

Chamfer distance Edge image Distance transform image Fig from D. Gavrila, DAGM 1999

A limitation of active contours External energy: snake does not really “see” object boundaries in the image unless it gets very close to it. image gradients are large only directly on the boundary

What limitations might we have using only edge points to represent a shape? How descriptive is a point?

Comparing shapes What points on these two sampled contours are most similar? How do you know?

Shape context descriptor [Belongie et al ’02] Count the number of points inside each bin, e.g.: Count = 4 ... Count = 10 Compact representation of distribution of points relative to each point Shape context slides from Belongie et al.

Shape context descriptor

Comparing shape contexts Compute matching costs using Chi Squared distance: Recover correspondences by solving for least cost assignment, using costs Cij (Then use a deformable template match, given the correspondences.)

Invariance/ Robustness Translation Scaling Rotation Modeling transformations – thin plate splines (TPS) Generalization of cubic splines to 2D Matching cost = f(Shape context distances, bending energy of thin plate splines) Can add appearance information too Outliers?

An example of shape context-based matching

Some retrieval results

Efficient matching of shape contexts [Mori et al ’05] Fast-pruning randomly select a set of points Detailed matching

Efficient matching of shape contexts [Mori et al ’05] – contd’ Vector quantization

Are things clear so far?

Detour - Articulation [Ling, Jacobs ’07]

Inner distance vs. (2D) geodesic distance

The problem of junctions Is inner distance truly invariant to articulations?

Non-planar articulations? [Gopalan, Turaga, Chellappa ’10]

Indexing approach to shape matching [Biswas et al ’10] Why?

Indexing - framework Pair-wise Features: Inner distance, Contour length, relative angles etc.

Part 2 – Shapes as equivalence classes Kendall’s shape space Shape is all the geometric information that remains when the location, scale and rotation effects are filtered out from the object

Pre-shape Kendall’s Statistical Shape Theory used for the characterization of shape. Pre-shape accounts for location and scale invariance alone. k landmark points (X:k\times 2) Translational Invariance: Subtract mean Scale Invariance : Normalize the scale Some slides were adapted from Dr. Veeraraghavan’s website

Feature extraction Silhoutte Landmarks Centered Landmarks Pre-shape vector

[Veeraraghavan, Roy-Chowdhury, Chellappa ’05] Shape lies on a spherical manifold. Shape distance must incorporate the non-Euclidean nature of the shape space.

Affine subspaces [Turaga, Veeraraghavan, Chellappa ’08]

Other examples Space of Blur Modeling group trajectories etc..

Conclusion Shape as a set of points configuring the geometry of the object Representation, matching, recognition Shape contexts, Indexing, Articulation Shape as equivalence class under a group of transformations

Announcements HW 5 will be posted today; Turn in HW 4 On Stereo, and Shape matching Due Nov. 30 (Tuesday after Thanksgiving) Turn in HW 4 Midterms solutions by weekend

Questions?