1 / 32

Uncalibrated Geometry & Stratification

Uncalibrated Geometry & Stratification. Stefano Soatto UCLA Yi Ma UIUC. Calibration with a rig Uncalibrated epipolar geometry Ambiguities in image formation Stratified reconstruction Autocalibration with partial scene knowledge. Overview. calibrated coordinates.

debra
Download Presentation

Uncalibrated Geometry & Stratification

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Uncalibrated Geometry & Stratification Stefano Soatto UCLA Yi Ma UIUC

  2. Calibration with a rig Uncalibrated epipolar geometry Ambiguities in image formation Stratified reconstruction Autocalibration with partial scene knowledge Overview ICRA2003, Taipei

  3. calibrated coordinates Linear transformation pixel coordinates Uncalibrated Camera ICRA2003, Taipei

  4. Calibrated camera • Image plane coordinates • Camera extrinsic parameters • Perspective projection Uncalibrated camera • Pixel coordinates • Projection matrix Uncalibrated Camera ICRA2003, Taipei

  5. is known, back to calibrated case • is unknown • Calibration with complete scene knowledge (a rig) – estimate • Uncalibrated reconstruction despite the lack of knowledge of • Autocalibration (recover from uncalibrated images) • Use partial knowledge • Parallel lines, vanishing points, planar motion, constant intrinsic • Ambiguities, stratification (multiple views) Taxonomy on Uncalibrated Reconstruction ICRA2003, Taipei

  6. Calibration with a Rig Use the fact that both 3-D and 2-D coordinates of feature points on a pre-fabricated object (e.g., a cube) are known. ICRA2003, Taipei

  7. Given 3-D coordinates on known object • Eliminate unknown scales • Recover projection matrix • Factor the into and using QR decomposition • Solve for translation Calibration with a Rig ICRA2003, Taipei

  8. Uncalibrated Camera vs. Distorted Space • Inner product in Euclidean space: compute distances and angles • Calibration transforming spatial coordinates • Transformation induced a new inner product • (the metric of the space) and are equivalent ICRA2003, Taipei

  9. Calibrated vs. Uncalibrated Space ICRA2003, Taipei

  10. Calibrated vs. Uncalibrated Space Distances and angles are modified by ICRA2003, Taipei

  11. Calibrated space Uncalibrated space • Uncalibrated coordinates are related by • Conjugate of the Euclidean group Motion in the Distorted Space ICRA2003, Taipei

  12. Uncalibrated Camera or Distorted Space Uncalibrated camera with a calibration matrix K viewing points in Euclidean space and moving with (R,T) is equivalent to a calibrated camera viewing points in distorted space governed by S and moving with a motion conjugate to (R,T) ICRA2003, Taipei

  13. Epipolar constraint • Fundamental matrix • Equivalent forms of Uncalibrated Epipolar Geometry ICRA2003, Taipei

  14. Properties of the Fundamental Matrix • Epipolar lines • Epipoles Image correspondences ICRA2003, Taipei

  15. Properties of the Fundamental Matrix A nonzero matrix is a fundamental matrix if has a singular value decomposition (SVD) with for some . There is little structure in the matrix except that ICRA2003, Taipei

  16. can be inferred from point matches (eight-point algorithm) Cannot extract motion, structure and calibration from one fundamental matrix (two views) allows reconstruction up to a projective transformation (as we will see soon) encodes all the geometric information among two views when no additional information is available What Does F Tell Us? ICRA2003, Taipei

  17. Decomposition of the fundamental matrix into a skew • symmetric matrix and a nonsingular matrix • Decomposition of is not unique • Unknown parameters - ambiguity • Corresponding projection matrix Decomposing the Fundamental Matrix ICRA2003, Taipei

  18. Ambiguities in Image Formation • Potential ambiguities • Ambiguity in (can be recovered uniquely – QR) • Structure of the motion parameters • Just an arbitrary choice of reference coordinate frame ICRA2003, Taipei

  19. Ambiguities in Image Formation Structure of motion parameters ICRA2003, Taipei

  20. Ambiguities in Image Formation Structure of the projection matrix • For any invertible 4 x 4 matrix • In the uncalibrated case we cannot distinguish between camera imaging word from camera imaging distorted world • In general, is of the following form • In order to preserve the choice of the first reference frame we can restrict some DOF of ICRA2003, Taipei

  21. can be further decomposed as Structure of the Projective Ambiguity • For i-th frame • 1st frame as reference • Choose the projective reference frame then ambiguity is ICRA2003, Taipei

  22. Geometric Stratification (cont) ICRA2003, Taipei

  23. Projective Reconstruction • From points, extract , from which extract and • Canonical decomposition • Projection matrices ICRA2003, Taipei

  24. Projective Reconstruction • Given projection matrices recover projective structure • This is a linear problem and can be solve using least-squares techniques. • Given 2 images and no prior information, the scene can be recovered up a 4-parameter family of solutions. This is the best one can do without knowing calibration! ICRA2003, Taipei

  25. Affine Upgrade • Upgrade projective structure to an affine structure • Exploit partial scene knowledge • Vanishing points, no skew, known principal point • Special motions • Pure rotation, pure translation, planar motion, rectilinear motion • Constant camera parameters (multi-view) ICRA2003, Taipei

  26. Affine Upgrade Using Vanishing Points maps points on the plane to points with affine coordinates ICRA2003, Taipei

  27. Vanishing Point Estimation from Parallelism ICRA2003, Taipei

  28. Exploit special motions (e.g. pure rotation) If Euclidean is the goal, perform Euclidean reconstruction directly (no stratification) Direct autocalibration (Kruppa’s equations) Multiple-view case (absolute quadric) Euclidean Upgrade ICRA2003, Taipei

  29. Direct Autocalibration Methods The fundamental matrix satisfies the Kruppa’s equations If the fundamental matrix is known up to scale Under special motions, Kruppa’s equations become linear. Solution to Kruppa’s equations is sensitive to noises. ICRA2003, Taipei

  30. Direct Stratification from Multiple Views From the recovered projective projection matrix we obtain the absolute quadric contraints Partial knowledge in (e.g. zero skew, square pixel) renders the above constraints linear and easier to solve. The projection matrices can be recovered from the multiple-view rank method to be introduced later. ICRA2003, Taipei

  31. Direct Methods - Summary ICRA2003, Taipei

  32. Summary of (Auto)calibration Methods ICRA2003, Taipei

More Related