CSCI 631 – Foundations of Computer Vision March 15, 2016 Ashwini Imran Image Stitching Link: singhashwini.mesinghashwini.me.

Slides:



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

Recognising Panoramas M. Brown and D. Lowe, University of British Columbia.
Distinctive Image Features from Scale-Invariant Keypoints David Lowe.
Object Recognition from Local Scale-Invariant Features David G. Lowe Presented by Ashley L. Kapron.
Presented by Xinyu Chang
Object Recognition using Invariant Local Features Applications l Mobile robots, driver assistance l Cell phone location or object recognition l Panoramas,
Computer Vision Detecting the existence, pose and position of known objects within an image Michael Horne, Philip Sterne (Supervisor)
Neurocomputing,Neurocomputing, Haojie Li Jinhui Tang Yi Wang Bin Liu School of Software, Dalian University of Technology School of Computer Science,
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.
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.
Recognising Panoramas
Direct Methods for Visual Scene Reconstruction Paper by Richard Szeliski & Sing Bing Kang Presented by Kristin Branson November 7, 2002.
Feature extraction: Corners and blobs
Object Recognition Using Distinctive Image Feature From Scale-Invariant Key point D. Lowe, IJCV 2004 Presenting – Anat Kaspi.
Scale Invariant Feature Transform (SIFT)
Automatic Image Alignment (feature-based) : Computational Photography Alexei Efros, CMU, Fall 2006 with a lot of slides stolen from Steve Seitz and.
Scale-Invariant Feature Transform (SIFT) Jinxiang Chai.
כמה מהתעשייה? מבנה הקורס השתנה Computer vision.
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
Chapter 6 Feature-based alignment Advanced Computer Vision.
Distinctive Image Features from Scale-Invariant Keypoints By David G. Lowe, University of British Columbia Presented by: Tim Havinga, Joël van Neerbos.
Computer vision.
Internet-scale Imagery for Graphics and Vision James Hays cs195g Computational Photography Brown University, Spring 2010.
Advanced Computer Vision Feature-based Alignment Lecturer: Lu Yi & Prof. Fuh CSIE NTU.
Object Tracking/Recognition using Invariant Local Features Applications l Mobile robots, driver assistance l Cell phone location or object recognition.
Image Stitching Shangliang Jiang Kate Harrison. What is image stitching?
IMAGE MOSAICING Summer School on Document Image Processing
CVPR 2003 Tutorial Recognition and Matching Based on Local Invariant Features David Lowe Computer Science Department University of British Columbia.
CSCE 643 Computer Vision: Extractions of Image Features Jinxiang Chai.
Wenqi Zhu 3D Reconstruction From Multiple Views Based on Scale-Invariant Feature Transform.
Distinctive Image Features from Scale-Invariant Keypoints David Lowe Presented by Tony X. Han March 11, 2008.
Jack Pinches INFO410 & INFO350 S INFORMATION SCIENCE Computer Vision I.
Computer Vision - Fitting and Alignment (Slides borrowed from various presentations)
CSE 185 Introduction to Computer Vision Feature Matching.
A Tutorial on using SIFT Presented by Jimmy Huff (Slightly modified by Josiah Yoder for Winter )
Course14 Dynamic Vision. Biological vision can cope with changing world Moving and changing objects Change illumination Change View-point.
3D Reconstruction Using Image Sequence
Presented by David Lee 3/20/2006
776 Computer Vision Jan-Michael Frahm Spring 2012.
COS 429 PS3: Stitching a Panorama Due November 10 th.
Recognizing specific objects Matching with SIFT Original suggestion Lowe, 1999,2004.
CSCI 631 – Foundations of Computer Vision March 15, 2016 Ashwini Imran Image Stitching.
SIFT.
776 Computer Vision Jan-Michael Frahm Spring 2012.
SIFT Scale-Invariant Feature Transform David Lowe
Presented by David Lee 3/20/2006
Lecture 07 13/12/2011 Shai Avidan הבהרה: החומר המחייב הוא החומר הנלמד בכיתה ולא זה המופיע / לא מופיע במצגת.
Distinctive Image Features from Scale-Invariant Keypoints
CS 4501: Introduction to Computer Vision Sparse Feature Detectors: Harris Corner, Difference of Gaussian Connelly Barnes Slides from Jason Lawrence, Fei.
Paper – Stephen Se, David Lowe, Jim Little
Scale Invariant Feature Transform (SIFT)
Capturing, Processing and Experiencing Indian Monuments
Homography From Wikipedia In the field of computer vision, any
Features Readings All is Vanity, by C. Allan Gilbert,
Object recognition Prof. Graeme Bailey
CAP 5415 Computer Vision Fall 2012 Dr. Mubarak Shah Lecture-5
The SIFT (Scale Invariant Feature Transform) Detector and Descriptor
Image Stitching Computer Vision CS 678
SIFT.
Paper Reading Dalong Du April.08, 2011.
CSE 185 Introduction to Computer Vision
ECE734 Project-Scale Invariant Feature Transform Algorithm
Computational Photography
Multi-Information Based GCPs Selection Method
SIFT SIFT is an carefully designed procedure with empirically determined parameters for the invariant and distinctive features.
Presented by Xu Miao April 20, 2005
CS5760: Computer Vision Lecture 9: RANSAC Noah Snavely
Presentation transcript:

CSCI 631 – Foundations of Computer Vision March 15, 2016 Ashwini Imran Image Stitching Link: singhashwini.mesinghashwini.me

 Scope  Introduction  Image Stitching Approaches  Image Stitching Model  SIFT  RANSAC  Challenges  Future Scope Overview

To develop an image stitching algorithm which will create a panoramic image from a set of images by using feature extraction method Scope

 Image stitching is also known as mosaicking  It is a process of combining multiple pictures of the same scene into a single high resolution image  There are two techniques of achieving image stitching:  Direct Technique  Feature Based Technique Introduction

 It compares all pixels in the images with each other  Advantages:  They make optimal use of information available in image alignment  They measure contribution of every pixel in the images  Disadvantages:  Computationally complex  Time consuming  Examples:  Fourier Analysis Technique  A Unifying Framework Direct Technique

 It aims to determine similarity between images by comparing features  They establish correspondence between lines, edges, corners, points and other geometric entities  Steps in these techniques:  Feature Extraction  Registration  Blending  Advantages: Robust against scene movement, faster, ability to detect panoramas etc  Examples: SIFT, SURF, ORB etc Feature Based Technique

Image Stitching Model Image Acquisition Feature Detection and Matching Image Matching Global Alignment Blending

 Image Acquisition : it involves retrieving an image from the source  Feature Detection & Matching : it compares features between images in order to determine translation  Image Matching : it finds which image is neighbor of other image  Global Alignment : the aim is to find a set of parameters which minimize mis-registration between images  Blending : it selects final surface for the image and blends the images to form a single smooth image Image Stitching Model

The SIFT technique is one of the most robust and widely used image matching algorithm based on local features. SIFT is a feature detection and description technique. SIFT produces key point descriptors which describes the image features.

Construct Scale space DoG Locate DoG Extrema Potential feature points Filter edge Assign key points orientations Build key point descriptors Store the vector descriptor Do the matching

Gaussian Kernel is used to create Scale space. Down sample every time by a factor of 2. Take the difference of last Gaussian and store it.

Scan all DoG images obtained from previous process. Take top 2 images from the stack. Look at all neighboring points and decide the maxima and minima. For each pixel, marked as X there will be 26 points to compare.

Find the orientation of each feasible potential points. Calculate gradient dx and dy. Calculate direction theta. For each 16x16 block, we register direction in 8 different views.

Random sample consensus ( RANSAC ) is an iterative method to estimate parameters of a mathematical model from a set of observed data which contains outliers. RANSAC Algorithm Repeat N times 1.Randomly select a sample Select just enough points to recover the parameters 2.Fit the model with random sample 3.See how many other points agree Best estimate is one with most agreement

Initial Matched Points

Final Matched Points

 An image is often corrupted with noise during its acquisition which in turn hampers feature extraction  Image stitching on large set of data requires more time  Small scene motion such as waving tree branch and large scene motion like people moving in and out of the pictures  Images must be taken from the same spot i.e. without moving the camera Challenges

 Photosynth: stitching many images into one large composite image  Video Stitching Future Scope

 Ebtsam Adel Mohammad Elmogy Hazem Elbakry. “Image Stitching Based on Feature Extraction Techniques: A survey”. International Journal of Computer Applications, volume 99, August  Shikha Arya. “A Review on Image Stitching and its Different Methods”. International Journal of Advanced Research in Computer Science and Software Engineering, Volume-5, Issue-5, May  Image Stitching Wikipedia: References

Please feel free to ask any questions or concerns THANK YOU Questions & Discussion