Jianke Zhu From Haibin Ling’s ICCV talk Fast Marching Method and Deformation Invariant Features.

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.
3D Model Matching with Viewpoint-Invariant Patches(VIP) Reporter :鄒嘉恆 Date : 10/06/2009.
Context-based object-class recognition and retrieval by generalized correlograms by J. Amores, N. Sebe and P. Radeva Discussion led by Qi An Duke University.
MIT CSAIL Vision interfaces Approximate Correspondences in High Dimensions Kristen Grauman* Trevor Darrell MIT CSAIL (*) UT Austin…
1 Deformation Invariant Shape and Image Matching Polikovsky Senya Advanced Topics in Computer Vision Seminar Faculty of Mathematics and Computer Science.
Instructor: Mircea Nicolescu Lecture 15 CS 485 / 685 Computer Vision.
Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.
Deformable Contours Dr. E. Ribeiro.
SURF: Speeded-Up Robust Features
Patch Descriptors CSE P 576 Larry Zitnick
Asst. Prof. Yusuf Sahillioğlu
1 Learning to Detect Objects in Images via a Sparse, Part-Based Representation S. Agarwal, A. Awan and D. Roth IEEE Transactions on Pattern Analysis and.
A Study of Approaches for Object Recognition
Recognising Panoramas
Local Affine Feature Tracking in Films/Sitcoms Chunhui Gu CS Final Presentation Dec. 13, 2006.
Automatic Panoramic Image Stitching using Local Features Matthew Brown and David Lowe, University of British Columbia.
Distinctive Image Feature from Scale-Invariant KeyPoints
1 Diffusion Distance for Histogram Comparison, CVPR06. Haibin Ling, Kazunori Okada Group Meeting Presented by Wyman 3/14/2006.
Scale Invariant Feature Transform (SIFT)
Automatic Matching of Multi-View Images
Evaluation of features detectors and descriptors based on 3D objects P. Moreels - P. Perona California Institute of Technology.
A Global Geometric Framework for Nonlinear Dimensionality Reduction Joshua B. Tenenbaum, Vin de Silva, John C. Langford Presented by Napat Triroj.
1 Invariant Local Feature for Object Recognition Presented by Wyman 2/05/2006.
CS4670: Computer Vision Kavita Bala Lecture 8: Scale invariance.
Multiple Object Class Detection with a Generative Model K. Mikolajczyk, B. Leibe and B. Schiele Carolina Galleguillos.
Shape Classification Using the Inner-Distance Haibin Ling David W. Jacobs IEEE TRANSACTION ON PATTERN ANAYSIS AND MACHINE INTELLIGENCE FEBRUARY 2007.
Multi-Scale Surface Descriptors Gregory Cipriano, George N. Phillips Jr., and Michael Gleicher.
Matthew Brown University of British Columbia (prev.) Microsoft Research [ Collaborators: † Simon Winder, *Gang Hua, † Rick Szeliski † =MS Research, *=MS.
Overview Introduction to local features
The Beauty of Local Invariant Features
Distinctive Image Features from Scale-Invariant Keypoints By David G. Lowe, University of British Columbia Presented by: Tim Havinga, Joël van Neerbos.
Stereo Matching Information Permeability For Stereo Matching – Cevahir Cigla and A.Aydın Alatan – Signal Processing: Image Communication, 2013 Radiometric.
Rongxiang Hu, Wei Jia, Haibin ling, and Deshuang Huang Multiscale Distance Matrix for Fast Plant Leaf Recognition.
Overview Harris interest points Comparing interest points (SSD, ZNCC, SIFT) Scale & affine invariant interest points Evaluation and comparison of different.
Local invariant features Cordelia Schmid INRIA, Grenoble.
Building local part models for category-level recognition C. Schmid, INRIA Grenoble Joint work with G. Dorko, S. Lazebnik, J. Ponce.
Learning Decompositional Shape Models from Examples Alex Levinshtein Cristian Sminchisescu Sven Dickinson Sven Dickinson University of Toronto.
Evaluation of interest points and descriptors. Introduction Quantitative evaluation of interest point detectors –points / regions at the same relative.
Haibin Ling and David Jacobs, Deformation Invariant Image Matching, ICCV, Oct. 20, 2005 Deformation Invariant Image Matching Haibin Ling and David W. Jacobs.
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.
P ROBING THE L OCAL -F EATURE S PACE OF I NTEREST P OINTS Wei-Ting Lee, Hwann-Tzong Chen Department of Computer Science National Tsing Hua University,
1 Image Matching using Local Symmetry Features Daniel Cabrini Hauagge Noah Snavely Cornell University.
CS654: Digital Image Analysis Lecture 36: Feature Extraction and Analysis.
Overview Introduction to local features Harris interest points + SSD, ZNCC, SIFT Scale & affine invariant interest point detectors Evaluation and comparison.
CENG 789 – Digital Geometry Processing 04- Distances, Descriptors and Sampling on Meshes Asst. Prof. Yusuf Sahillioğlu Computer Eng. Dept,, Turkey.
Scale Invariant Feature Transform (SIFT)
Presented by David Lee 3/20/2006
Video Google: Text Retrieval Approach to Object Matching in Videos Authors: Josef Sivic and Andrew Zisserman University of Oxford ICCV 2003.
Multi-view Synchronization of Human Actions and Dynamic Scenes Emilie Dexter, Patrick Pérez, Ivan Laptev INRIA Rennes - Bretagne Atlantique
CSE 185 Introduction to Computer Vision Local Invariant Features.
1 Shape Descriptors for Maximally Stable Extremal Regions Per-Erik Forss´en and David G. Lowe Department of Computer Science University of British Columbia.
Distinctive Image Features from Scale-Invariant Keypoints Presenter :JIA-HONG,DONG Advisor : Yen- Ting, Chen 1 David G. Lowe International Journal of Computer.
Deformation Modeling for Robust 3D Face Matching Xioguang Lu and Anil K. Jain Dept. of Computer Science & Engineering Michigan State University.
SIFT Scale-Invariant Feature Transform David Lowe
Interest Points EE/CSE 576 Linda Shapiro.
Presented by David Lee 3/20/2006
Assoc. Prof. Yusuf Sahillioğlu
Video Google: Text Retrieval Approach to Object Matching in Videos
Paper Presentation: Shape and Matching
Fast and Robust Object Tracking with Adaptive Detection
Cheng-Ming Huang, Wen-Hung Liao Department of Computer Science
RGB-D Image for Scene Recognition by Jiaqi Guo
CSDD Features: Center-Surround Distribution Distance
SIFT keypoint detection
Video Google: Text Retrieval Approach to Object Matching in Videos
Multi-Information Based GCPs Selection Method
Presentation transcript:

Jianke Zhu From Haibin Ling’s ICCV talk Fast Marching Method and Deformation Invariant Features

Outline  Introduction  Fast Marching Method  Deformation Invariant Framework  Experiments  Conclusion and Future Work

General Deformation One-to-one, continuous mapping. Intensity values are deformation invariant.  (their positions may change)

Our Solution A deformation invariant framework  Embed images as surfaces in 3D  Geodesic distance is made deformation invariant by adjusting an embedding parameter  Build deformation invariant descriptors using geodesic distances

Related Work Embedding and geodesics  Beltrami framework [Sochen&etal98]  Bending invariant [Elad&Kimmel03]  Articulation invariant [Ling&Jacobs05] Histogram-based descriptors  Shape context [Belongie&etal02]  SIFT [Lowe04]  Spin Image [Lazebnik&etal05, Johnson&Hebert99] Invariant descriptors  Scale invariant descriptors [Lindeberg98, Lowe04]  Affine invariant [Mikolajczyk&Schmid04, Kadir04, Petrou&Kadyrov04]  MSER [Matas&etal02]

Outline  Introduction  Deformation Invariant Framework  Intuition through 1D images  2D images  Experiments  Conclusion and Future Work

1D Image Embedding 1D Image I(x) EMBEDDING I(x)  ( (1-α)x, αI ) αIαI (1-α)x Aspect weight α : measures the importance of the intensity

Geodesic Distance αIαI (1-α)x p q g(p,q) Length of the shortest path along surface

Geodesic Distance and α I1I1 I2I2 Geodesic distance becomes deformation invariant for α close to 1 embed

Image Embedding & Curve Lengths Depends only on intensity I  Deformation Invariant Image I Embedded Surface Curve on Length of Take limit

Computing Geodesic Distances Fast Marching [Sethian96] Geodesic level curves  Moving front Varying speed p

Deformation Invariant Sampling Geodesic Sampling 1. Fast marching: get geodesic level curves with sampling interval Δ 2. Sampling along level curves with Δ p sparse dense Δ Δ Δ Δ Δ

Deformation Invariant Sampling Geodesic Level Curves Geodesic Sampling 1. Fast marching: get geodesic level curves with sampling gap Δ 2. Sampling along level curves with Δ p

Geodesic Distance & Fast Marching

Deformation Invariant Descriptor p q p q Geodesic-Intensity Histogram (GIH) geodesic distance intensity geodesic distance intensity

Real Example p q

Deformation Invariant Framework Image Embedding ( close to 1) Deformation Invariant Sampling Geodesic Sampling Build Deformation Invariant Descriptors (GIH)

Practical Issues Lighting change  Affine lighting model  Normalize the intensity Interest-Point  No special interest-point is required  Extreme point (LoG, MSER etc.) is more reliable and effective

Invariant vs. Descriminative

Outline  Introduction  Deformation Invariance for Images  Experiments  Interest-point matching  Conclusion and Future Work

Data Sets Synthetic Deformation & Lighting Change (8 pairs) Real Deformation (3 pairs)

Interest-Points * Courtesy of Mikolajczyk, Interest-point Matching Harris-affine points [Mikolajczyk&Schmid04] * Affine invariant support regions Not required by GIH 200 points per image Ground-truth labeling Automatically for synthetic image pairs Manually for real image pairs

Descriptors and Performance Evaluation Descriptors We compared GIH with following descriptors: Steerable filter [Freeman&Adelson91], SIFT [Lowe04], moments [VanGool&etal96], complex filter [Schaffalitzky&Zisserman02], spin image [Lazebnik&etal05] * Performance Evaluation ROC curve: detection rate among top N matches. Detection rate * Courtesy of Mikolajczyk,

Synthetic Image Pairs

Real Image Pairs

Study of Interest-Points

Outline  Introduction  Deformation Invariance for Images  Experiments  Conclusion and Future Work

Thank You!