IMAGE MOSAICING Summer School on Document Image Processing

Slides:



Advertisements
Similar presentations
The fundamental matrix F
Advertisements

The Trifocal Tensor Multiple View Geometry. Scene planes and homographies plane induces homography between two views.
MASKS © 2004 Invitation to 3D vision Lecture 7 Step-by-Step Model Buidling.
Robot Vision SS 2005 Matthias Rüther 1 ROBOT VISION Lesson 3: Projective Geometry Matthias Rüther Slides courtesy of Marc Pollefeys Department of Computer.
Mapping: Scaling Rotation Translation Warp
Neurocomputing,Neurocomputing, Haojie Li Jinhui Tang Yi Wang Bin Liu School of Software, Dalian University of Technology School of Computer Science,
Image alignment Image from
776 Computer Vision Jared Heinly Spring 2014 (slides borrowed from Jan-Michael Frahm, Svetlana Lazebnik, and others)
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
Mosaics con’t CSE 455, Winter 2010 February 10, 2010.
Multiple View Geometry
Affine Linear Transformations Prof. Graeme Bailey (notes modified from Noah Snavely, Spring 2009)
Object Recognition with Invariant Features n Definition: Identify objects or scenes and determine their pose and model parameters n Applications l Industrial.
Direct Methods for Visual Scene Reconstruction Paper by Richard Szeliski & Sing Bing Kang Presented by Kristin Branson November 7, 2002.
1 Interest Operator Lectures lecture topics –Interest points 1 (Linda) interest points, descriptors, Harris corners, correlation matching –Interest points.
Multiple View Geometry Marc Pollefeys University of North Carolina at Chapel Hill Modified by Philippos Mordohai.
Fitting a Model to Data Reading: 15.1,
Independent Motion Estimation Luv Kohli COMP Multiple View Geometry May 7, 2003.
Multiple View Geometry Marc Pollefeys University of North Carolina at Chapel Hill Modified by Philippos Mordohai.
Automatic Image Alignment (feature-based) : Computational Photography Alexei Efros, CMU, Fall 2006 with a lot of slides stolen from Steve Seitz and.
Lecture 10: Robust fitting CS4670: Computer Vision Noah Snavely.
Stockman MSU/CSE Math models 3D to 2D Affine transformations in 3D; Projections 3D to 2D; Derivation of camera matrix form.
Computing transformations Prof. Noah Snavely CS1114
1 Interest Operators Find “interesting” pieces of the image Multiple possible uses –image matching stereo pairs tracking in videos creating panoramas –object.
Structure Computation. How to compute the position of a point in 3- space given its image in two views and the camera matrices of those two views Use.
Robust fitting Prof. Noah Snavely CS1114
Automatic Camera Calibration
Computer vision: models, learning and inference
Image Stitching Ali Farhadi CSE 455
Yuping Lin and Gérard Medioni.  Introduction  Method  Register UAV streams to a global reference image ▪ Consecutive UAV image registration ▪ UAV to.
CSE 185 Introduction to Computer Vision
CSC 589 Lecture 22 Image Alignment and least square methods Bei Xiao American University April 13.
Projective geometry of 2-space DLT alg HZ 4.1 Rectification HZ 2.7 Hierarchy of maps Invariants HZ 2.4 Projective transform HZ 2.3 Behaviour at infinity.
1 Interest Operators Harris Corner Detector: the first and most basic interest operator Kadir Entropy Detector and its use in object recognition SIFT interest.
The Brightness Constraint
Homogeneous Coordinates (Projective Space) Let be a point in Euclidean space Change to homogeneous coordinates: Defined up to scale: Can go back to non-homogeneous.
University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction to computer vision Chapter 2: Image.
Mosaics Today’s Readings Szeliski, Ch 5.1, 8.1 StreetView.
Metrology 1.Perspective distortion. 2.Depth is lost.
Correspondence-Free Determination of the Affine Fundamental Matrix (Tue) Young Ki Baik, Computer Vision Lab.
Computer Vision : CISC 4/689 Going Back a little Cameras.ppt.
Geometric Transformations
Feature Matching. Feature Space Outlier Rejection.
Computer Vision - Fitting and Alignment (Slides borrowed from various presentations)
Fitting image transformations Prof. Noah Snavely CS1114
ELE 488 Fall 2006 Image Processing and Transmission ( )
3D Reconstruction Using Image Sequence
776 Computer Vision Jan-Michael Frahm Spring 2012.
CSCI 631 – Foundations of Computer Vision March 15, 2016 Ashwini Imran Image Stitching.
Invariant Local Features Image content is transformed into local feature coordinates that are invariant to translation, rotation, scale, and other imaging.
CSCI 631 – Foundations of Computer Vision March 15, 2016 Ashwini Imran Image Stitching Link: singhashwini.mesinghashwini.me.
776 Computer Vision Jan-Michael Frahm Spring 2012.
University of Ioannina
Fitting a transformation: feature-based alignment
The Brightness Constraint
A special case of calibration
Image Stitching Slides from Rick Szeliski, Steve Seitz, Derek Hoiem, Ira Kemelmacher, Ali Farhadi.
Features Readings All is Vanity, by C. Allan Gilbert,
The Brightness Constraint
CSE 455 – Guest Lectures 3 lectures Contact Interest points 1
The SIFT (Scale Invariant Feature Transform) Detector and Descriptor
SIFT.
Computational Photography
Calibration and homographies
Back to equations of geometric transformations
Local features and image matching May 7th, 2019
Image Stitching Linda Shapiro ECE/CSE 576.
Image Stitching Linda Shapiro ECE P 596.
Presentation transcript:

IMAGE MOSAICING Summer School on Document Image Processing Thotreingam Kasar MEDICAL INTELLIGENCE AND LANGUAGE ENGINEERING LAB, DEPARTMENT OF ELECTRICAL ENGINEERING, INDIAN INSTITUTE OF SCIENCE, BANGALORE, INDIA – 560 012

Image Mosaicing Given multiple images of a scene, with some degree of overlap, how do we seamlessly blend them into a single composite image? The basic ingredients Registration Warping Blending

Methods for Image Mosaicing Direct Method Preferred for images without many prominent details Windows of pre-defined size or even the entire images are used for the correspondence estimation Can handle only translation and small rotation Sensitive to intensity changes, due to noise, varying illumination, and/or by using different sensors Feature based Method Generally faster than direct methods More robust against scene movement Robust estimation algorithms available Suitable for fully automatic mosaicing The respective features might be hard to detect and/or unstable in time

Projective Geometry Set of rays in 3-D space with each point representing a projective point Planes through the origin are interpreted as lines

} are the same lines for any k ≠ 0 Homogeneous Co-ordinates A line in a plane (ax + by + c = 0) can be represented as (a, b, c)T ax + by + c = 0 (ka)x + (kb)y + kc = 0 Thus, (a, b, c)T and (ka, kb, kc)T are homogeneous vectors. A point X=(x,y)T lies on the line (a, b, c)T if or, (x, y,1)T · (a, b, c)T = 0 Thus, the point (x,y)T in R2 is represented as a 3-vector by adding a final co-ordinate of 1. Any arbitrary homogeneous point P=(x1, x2, x3)T represents the point (x1/x3, x2/x3) in R2 } are the same lines for any k ≠ 0

2-D Transformations Translation Rotation Scaling We can combine all the multiplicative and translation terms for 2-D geometric transformations into a single 3x3 matrix using Homogeneous Coordinates

Geometric Transformations RIGID AFFINE PERSPECTIVE

IMAGING GEOMETRY The general projective transformation of one projective plane to another is represented as y O X’ X x y’ x’ Image 1 Image2 For a pair of matching points (x, y) and (x’, y’) in the world and image plane respectively, the projective transformation in inhomogeneous form is 4 point correspondences lead to 8 such linear equations which can be solved up to an insignificant multiplicative factor.

Feature Detection Harris corner is widely used to localize interest points Small intensity change Large intensity change in one direction Large intensity change in both directions Local maxima of the Response function R gives the corners

Corner Detection

Feature Matching

RANdom SAmple Concensus (M. A. Fischler and R. C. Bolles,1981)

RANSAC Randomly select 4 point matches Estimate homography Hi Count the consensus set Si If |Si|> T, return Hi Repeat N times and return the model with max|Si| p = P(at least 1 of the random samples is free from outliers) w = P(any selected data point is an inlier) e = (1-w) is the probability that it is an outlier At least N selections are required where (1-w4)N = 1-p

RANSAC %age of outliers #Trials required 5 3 10 20 9 30 17 40 34 50 72 For a sample size of 4, the values of N required to ensure with a probability p =0.99 that at least 1 of the sample is free from outliers %age of outliers #Trials required 5 3 10 20 9 30 17 40 34 50 72

Feature Correspondence Target Image 1 Reference Image Target Image 2 Registered Image 1 Registered Image 2

BLENDING Simple Averaging Feathering - A weighting function is associated with each image decaying from a maximum at the centre to zero at the image boundary Where M and N represents the dimensions of the image and (x0, y0) is the image center

Mosaic Construction Target image 1 Reference Image Target image 2 Mosaic output

Why Mosaicing? To enhance the limited field of view of camera Some Applications Satellite image Analysis Medical image analysis 3-D Scene reconstruction and Robotic Navigation Creating Super-resolution images Video representation and indexing

Discussions Stable Feature Localization Invariant Feature Extraction Sub-pixel registration Blending

THANK YOU