Parameter estimation

1 / 18

# Parameter estimation - PowerPoint PPT Presentation

Parameter estimation. Parameter estimation. 2D homography Given a set of (x i ,x i ’), compute H (x i ’=Hx i ) 3D to 2D camera projection Given a set of (X i ,x i ), compute P (x i =PX i ) Fundamental matrix Given a set of (x i ,x i ’), compute F (x i ’ T Fx i =0) Trifocal tensor

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## PowerPoint Slideshow about 'Parameter estimation' - kevina

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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

### Parameter estimation

Parameter estimation
• 2D homography

Given a set of (xi,xi’), compute H (xi’=Hxi)

• 3D to 2D camera projection

Given a set of (Xi,xi), compute P (xi=PXi)

• Fundamental matrix

Given a set of (xi,xi’), compute F (xi’TFxi=0)

• Trifocal tensor

Given a set of (xi,xi’,xi”), compute T

Number of measurements required
• At least as many independent equations as degrees of freedom required
• Example:

2 independent equations / point

8 degrees of freedom

4x2≥8

Approximate solutions
• Minimal solution

4 points yield an exact solution for H

• More points
• No exact solution, because measurements are inexact (“noise”)
• Search for “best” according to some cost function
• Algebraic or geometric/statistical cost
Gold Standard algorithm
• Cost function that is optimal for some assumptions
• Computational algorithm that minimizes it is called “Gold Standard” algorithm
• Other algorithms can then be compared to it
Direct Linear Transformation(DLT)
• Equations are linear in h
• Only 2 out of 3 are linearly independent
• (indeed, 2 eq/pt)

(only drop third row if wi’≠0)

• Holds for any homogeneous representation, e.g. (xi’,yi’,1)
Direct Linear Transformation(DLT)
• Solving for H

size A is 8x9 or 12x9, but rank 8

Trivial solution is h=09T is not interesting

pick for example the one with

Direct Linear Transformation(DLT)
• Over-determined solution

No exact solution because of inexact measurement

i.e. “noise”

• Find approximate solution
• Additional constraint needed to avoid 0, e.g.
• not possible, so minimize
Singular Value Decomposition

Homogeneous least-squares

DLT algorithm
• Objective
• Given n≥4 2D to 2D point correspondences {xi↔xi’}, determine the 2D homography matrix H such that xi’=Hxi
• Algorithm
• For each correspondence xi ↔xi’ compute Ai. Usually only two first rows needed.
• Assemble n 2x9 matrices Ai into a single 2nx9 matrix A
• Obtain SVD of A. Solution for h is last column of V
• Determine H from h

3D Homographies (15 dof)

Minimum of 5 points or 5 planes

2D affinities (6 dof)

Minimum of 3 points or lines

Solutions from lines, etc.

2D homographies from 2D lines

Minimum of 4 lines

Conic provides 5 constraints

Mixed configurations?

combination of points and lines ….

Cost functions
• Algebraic distance
• Geometric distance
• Reprojection error

algebraic distance

where

Algebraic distance

DLT minimizes

residual vector

partial vector for each (xi↔xi’)

algebraic error vector

Not geometrically/statistically meaningfull, but given good normalization it works fine and is very fast (use for initialization)

measured coordinates

estimated coordinates

true coordinates

Error in one image: assumes points in the first image are measured perfectly

Symmetric transfer error

Reprojection error

Geometric distance

d(.,.) Euclidean distance (in image)

e.g. calibration pattern

Note: we are minimizing over H AND corrected correspondence pair

Statistical cost function and Maximum Likelihood Estimation
• Optimal cost function related to noise model; assume in the absence of noise , perfect match
• Assume zero-mean isotropic Gaussian noise (assume outliers removed); x = measurement;

Error in one image: assume errors at each point independent

Maximum Likelihood Estimate minimizes:

Over both H and corrected correspondence 

identical to minimizing reprojection error

Statistical cost function and Maximum Likelihood Estimation
• Optimal cost function related to noise model
• Assume zero-mean isotropic Gaussian noise (assume outliers removed)

Error in both images