Image Primitives and Correspondence - PowerPoint PPT Presentation

About This Presentation
Title:

Image Primitives and Correspondence

Description:

Title: Omnidirectional and Immersive Systems Author: Kostas Daniilidis Last modified by: Jana Kosecka Created Date: 12/13/1999 4:32:29 AM Document presentation format – PowerPoint PPT presentation

Number of Views:80
Avg rating:3.0/5.0
Slides: 23
Provided by: Kosta92
Learn more at: http://ai.stanford.edu
Category:

less

Transcript and Presenter's Notes

Title: Image Primitives and Correspondence


1
Image Primitives and Correspondence
Jana Kosecka cs223b
2
Image Primitives and Correspondence
Given an image point in left image, what is the
(corresponding) point in the right image, which
is the projection of the same 3-D point
3
Image Primitives and Correspondence
Difficulties ambiguities, large changes of
appearance, due to change Of viewpoint,
non-uniquess
4
Matching - Correspondence
radiance
Lambertian assumption
Rigid body motion
Correspondence
5
Local Deformation Models
  • Translational model
  • Affine model
  • Transformation of the intensity values taking
    into account occlusions
  • and noise

6
Feature Tracking and Optical Flow
  • Translational model
  • Small baseline
  • RHS approximation by the first two terms of
    Taylor series
  • Brightness constancy constraint

7
Aperture Problem
  • Normal flow

Given brightness constancy constraint at single
point all we can recover is normal flow
8
Optical Flow
  • Integrate around over image patch
  • Solve

9
Optical Flow, Feature Tracking
Conceptually
rank(G) 0 blank wall problem rank(G) 1
aperture problem rank(G) 2 enough texture
good feature candidates
In reality choice of threshold is involved
10
Optical Flow
  • Previous method - assumption locally constant
    flow
  • Alternative regularization techniques (locally
    smooth flow fields,
  • integration along contours)
  • Qualitative properties of the motion fields

11
Point Feature Extraction
  • Compute eigenvalues of G
  • If smalest eigenvalue ? of G is bigger than ? -
    mark pixel as candidate
  • feature point
  • Alternatively feature quality function (Harris
    Corner Detector)

12
Harris Corner Detector - Example
13
Feature Selection
  • Compute Image Gradient
  • Compute Feature Quality measure for each
    pixel
  • Search for local maxima

Feature Quality Function
Local maxima of feature quality function
14
Feature Tracking
  • Translational motion model
  • Closed form solution
  • Build an image pyramid
  • Start from coarsest level
  • Estimate the displacement at the coarsest level
  • Iterate until finest level

15
Coarse to fine feature tracking
0
1
2
  1. compute
  2. warp the window in the second image by
  3. update the displacement
  4. go to finer level
  5. At the finest level repeat for several
    iterations

16
Affine feature tracking

Intensity offset
Contrast change
17
Tracked Features
18
Structure and Motion Recovery from Video
1. Use multiple image stream to compute the
information about camera motion and 3D structure
of the scene 2. Tracking image features over time
Tracked Features
Original sequence
19
Structure and Motion Recovery from Video
Computed model 3D coordinates of the feature
points
Original picture
20
Wide baseline matching
Point features detected by Harris Corner detector
21
Region based Similarity Metric
  • Sum of squared differences
  • Normalize cross-correlation
  • Sum of absolute differences

22
NCC score for two widely separated views
NCC score
Write a Comment
User Comments (0)
About PowerShow.com