Maximum-Likelihood Image Matching Zheng Lu. Introduction SSD(sum of squared difference) –Is not so robust A new image matching measure –Based on maximum-likelihood.

Slides:



Advertisements
Similar presentations
Object Recognition Using Locality-Sensitive Hashing of Shape Contexts Andrea Frome, Jitendra Malik Presented by Ilias Apostolopoulos.
Advertisements

Clustering.
Component Analysis (Review)
Human Identity Recognition in Aerial Images Omar Oreifej Ramin Mehran Mubarak Shah CVPR 2010, June Computer Vision Lab of UCF.
MASKS © 2004 Invitation to 3D vision Lecture 7 Step-by-Step Model Buidling.
Geo479/579: Geostatistics Ch14. Search Strategies.
Lecture 5 Template matching
Robust and large-scale alignment Image from
Non-Rigid Registration. Why Non-Rigid Registration  In many applications a rigid transformation is sufficient. (Brain)  Other applications: Intra-subject:
Pattern Classification, Chapter 3 Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P.
Project 4 out today –help session today –photo session today Project 2 winners Announcements.
Geometric Optimization Problems in Computer Vision.
Fitting a Model to Data Reading: 15.1,
Fitting. Choose a parametric object/some objects to represent a set of tokens Most interesting case is when criterion is not local –can’t tell whether.
Computer Vision I Instructor: Prof. Ko Nishino. Today How do we recognize objects in images?
Pattern Recognition. Introduction. Definitions.. Recognition process. Recognition process relates input signal to the stored concepts about the object.
Dorin Comaniciu Visvanathan Ramesh (Imaging & Visualization Dept., Siemens Corp. Res. Inc.) Peter Meer (Rutgers University) Real-Time Tracking of Non-Rigid.
Probability Review (many slides from Octavia Camps)
Robust estimation Problem: we want to determine the displacement (u,v) between pairs of images. We are given 100 points with a correlation score computed.
Chapter 3 (part 1): Maximum-Likelihood & Bayesian Parameter Estimation  Introduction  Maximum-Likelihood Estimation  Example of a Specific Case  The.
Computing transformations Prof. Noah Snavely CS1114
כמה מהתעשייה? מבנה הקורס השתנה Computer vision.
Robust fitting Prof. Noah Snavely CS1114
Computer Vision James Hays, Brown
Efficient Algorithms for Robust Feature Matching Mount, Netanyahu and Le Moigne November 7, 2000 Presented by Doe-Wan Kim.
Advanced Computer Vision Feature-based Alignment Lecturer: Lu Yi & Prof. Fuh CSIE NTU.
1 Interest Operators Harris Corner Detector: the first and most basic interest operator Kadir Entropy Detector and its use in object recognition SIFT interest.
COMMON EVALUATION FINAL PROJECT Vira Oleksyuk ECE 8110: Introduction to machine Learning and Pattern Recognition.
Clustering Spatial Data Using Random Walk David Harel and Yehuda Koren KDD 2001.
CSCE 643 Computer Vision: Structure from Motion
MACHINE LEARNING 8. Clustering. Motivation Based on E ALPAYDIN 2004 Introduction to Machine Learning © The MIT Press (V1.1) 2  Classification problem:
Intensity Transformations (Histogram Processing)
Computer Vision : CISC 4/689 Going Back a little Cameras.ppt.
Image Registration with Hierarchical B-Splines Z. Xie and G. Farin.
EECS 274 Computer Vision Model Fitting. Fitting Choose a parametric object/some objects to represent a set of points Three main questions: –what object.
A B C D E F A ABSTRACT A novel, efficient, robust, feature-based algorithm is presented for intramodality and multimodality medical image registration.
Looking at people and Image-based Localisation Roberto Cipolla Department of Engineering Research team
Computer Vision Set: Object Recognition Slides by C.F. Olson 1 Object Recognition.
Fitting image transformations Prof. Noah Snavely CS1114
1 Energy-Efficient Mobile Robot Exploration Yongguo Mei, Yung-Hsiang Lu Purdue University ICRA06.
Stereo Vision Local Map Alignment for Robot Environment Mapping Computer Vision Center Dept. Ciències de la Computació UAB Ricardo Toledo Morales (CVC)
EE591f Digital Video Processing
Robust Estimation Course web page: vision.cis.udel.edu/~cv April 23, 2003  Lecture 25.
COS 429 PS3: Stitching a Panorama Due November 10 th.
1 Shape Descriptors for Maximally Stable Extremal Regions Per-Erik Forss´en and David G. Lowe Department of Computer Science University of British Columbia.
CSCI 631 – Foundations of Computer Vision March 15, 2016 Ashwini Imran Image Stitching.
EE 7730 Parametric Motion Estimation. Bahadir K. Gunturk2 Parametric (Global) Motion Affine Flow.
南台科技大學 資訊工程系 Region partition and feature matching based color recognition of tongue image 指導教授:李育強 報告者 :楊智雁 日期 : 2010/04/19 Pattern Recognition Letters,
University of Ioannina
Exercise Class 11: Robust Tecuniques RANSAC, Hough Transform
RANSAC and mosaic wrap-up
Homography From Wikipedia In the field of computer vision, any
A segmentation and tracking algorithm
A special case of calibration
Lecture 25: Introduction to Recognition
Object recognition Prof. Graeme Bailey
Lecture 26: Faces and probabilities
Feature Matching and RANSAC
POINT ESTIMATOR OF PARAMETERS
برنامج التميز في خدمة عملاء السادة موظفي مكاتب المساعدة القانونية
Announcements Project 2 artifacts Project 3 due Thursday night
Announcements Project 4 out today Project 2 winners help session today
Announcements Artifact due Thursday
Introduction to Sensor Interpretation
The Image The pixels in the image The mask The resulting image 255 X
Introduction to Sensor Interpretation
Calibration and homographies
Back to equations of geometric transformations
Announcements Artifact due Thursday
The “Margaret Thatcher Illusion”, by Peter Thompson
Presentation transcript:

Maximum-Likelihood Image Matching Zheng Lu

Introduction SSD(sum of squared difference) –Is not so robust A new image matching measure –Based on maximum-likelihood estimation of position –More robust

Maximum-Likelihood Matching Set of template feature Set of image feature The position of template in the image –t a random variable

Maximum-Likelihood Matching Distance from each template pixel to the closest image pixel. Probability density function(PDF) for the distance Find the t that can maximize this function

Estimating the PDF The density can be modeled by inliers and outliers

Estimating the PDF The second term should also decrease as d increases In practice, expected probability density for a random outlier is excellent

Search Strategy

multi-resolution technique divides the space of model positions into cells and determines which cells could contain a position satisfying the criterion Can find the best location, If a conservative test is used

c is the center of cell distance between the location to template edge pixel template mapped by c and any other pose in the cell.

The criterion will be