Escolar Documentos
Profissional Documentos
Cultura Documentos
Cameras.ppt
Assignment
Program-1
info-Link Data
Computing a Homography
Lets Side-track
8 degrees of freedom in 3 x 3 matrix H, so at least n points are sufficient to determine it
to compute H
Now stacked matrix A is 2n x 9 vs. 2n x 12 for camera matrix P estimation because all points are 2-D
= 4 pairs of 2-D
Use same basic algorithm for P (aka Direct Linear Transformation, or DLT)
See Hartley & Zisserman, Chapter 3.1-3.1.1 (linked on course page) for details
Texture Mapping
Needed for nice display when applying transformations (like a homography H) to a whole image
Simple approach: Iterate over source image coordinates and apply x0 get destination pixel location
Problem: Some destination pixels may not be hit, leaving holes
= H x to
= H-1
Easy solution: Iterate over destination image and apply inverse transform x
x0
Round off H-1 x0 to address nearest source pixel value This ensures every destination pixel is filled in
268 matched features (over SSD threshold) in left image pointing to locations of corresponding right image features
Computer Vision : CISC 4/689
s=4
Choice Pick SSD threshold conservatively to minimize bad matches Disregard degenerate configurations Ensure points have good spatial distribution over image
Distance measure
Obvious choice is symmetric transfer error:
117 outliers (
= 0.44)
151 inliers
Focal length
Camera center/ pinhole Camera point Image point
Computer Vision : CISC 4/689
Calibration
Slides (calibration.ppt)