This page notes some supply materials about Graduated Non-Convexity for Robust Spatial Perception: From Non-Minimal Solvers to Global Outlier Rejection. The paper gives a new approach for least squares optimization with outliers. The main contributions are two points:
- The Black-Rangarajan duality gives a function to estimate the weight of each cost function.
- The graduated non-convexity makes non-convexity cost function convex by a specially value and let the cost function to the original version during optimization.
1. The Deduction of Geman Mclure(GM) Function
The orignal version of GM is
The paper defines its surrogate function with a control parameter :
where ,
become quadratic and
recovers
when
.
The outlier process of with penalty term is computed as:
is derived by scheme in Fig.10 of Black-Rangarajan Duality.
We give the deduction from to
.
1.1 Deviation
Step 1.
where .
Step 2. Compute and
with respect to
And
Step3. ,
and
, then the process can continue.
For GM, and
is ok.
Because is existed, thus
. Then
and
.
Step4.
Step5. Solve
Then
where is inverse operation of
.
Step6. The target function:
We process our functions as:
The value is z, thus we simplify with
The function is equivalent to (11) in Graduated Non-Convexity.
网友评论