Добавил:
kiopkiopkiop18@yandex.ru t.me/Prokururor I Вовсе не секретарь, но почту проверяю Опубликованный материал нарушает ваши авторские права? Сообщите нам.
Вуз: Предмет: Файл:
Ординатура / Офтальмология / Английские материалы / Binocular Vision Development, Depth Perception and Disorders_McCoun, Reeves_2010.pdf
Скачиваний:
0
Добавлен:
28.03.2026
Размер:
9.88 Mб
Скачать

New Trends in Surface Reconstruction Using Space-Time Cameras

19

 

 

curve on surface of the object, and range of depth-variation across the curves, the representative curve length may be varied.

3. Rigid Motion Estimation by Tracking the Space Curves

The movement of a rigid object in space, can be expressed as the six rotation and translation parameters. Now, suppose that we have extracted a set of points on the surface of an object and the goal is to estimate 3D motion of the object across time. To estimate the motion parameters, an error function, which describes the difference of points before and after motion, should be minimized. To get rid of photometric information, we define the error function as a distance of unique points from the nearby curves after movement. To explain the problem mathematically, suppose that Wi is the ith unique point, Nu is the total number of

unique points, Pk (R Wi + T) is projection of Wi in camera plane k after movement, and contourk(m) is the curve number m in camera plane k. To estimate

the motion matrix, i.e. R and T, the error component for each unique point in each projected camera image is defined as the minimum distance of that point from nearby curves in that camera. The total error is also calculated by summing error components over all unique points and all cameras.

eik = minm

{distance (Pk (R Wi

+ T),contourk(m ) )}

(22)

 

 

 

e = iNu=1 Kk =1eik ; R,T = arg min{e}

Where K is the total number of cameras (K=2, for single stereo rig). To find the minimum distance of each point from nearby curve in the camera image, we use a circle based search area with increasing radius (figure 7). Therefore, the minimum distance is determined as the radius of the first osculating circle with

adjacent curves. R and T are parameterized as

 

 

where

Θ = ϕx ,ϕy

,ϕz ,tx ,ty ,tz

ϕx ,ϕy ,ϕz are the Euler angles of rotation

and tx ,ty ,tz

are the x, y, z

components of translation vector. The total error function defined in Eq.22 can be minimized by an iterative method similar to the Levenberg-Marquardt algorithm [8]:

20

Hossein Ebrahimnezhad and Hassan Ghassemian

 

 

Figure 7. To find the minimum distance of point from the adjacent curves in the camera image, a circle based search window, with increasing radius, is considered. The minimum distance is determined as the radius of the first touching circle with adjacent curves.

1. With an initial estimate Θˆ , calculate the Hessian matrix H and the difference vector d as:

 

 

 

eik

 

 

 

φx

 

 

 

 

 

 

e k

 

 

 

 

i

 

 

 

φy

 

 

 

eik

 

 

 

H

 

 

φ

 

 

=

 

z

 

ik

 

e k

 

 

 

 

i

 

 

 

tx

 

 

 

eik

 

 

 

 

 

 

t

y

 

 

 

 

 

 

 

eik

 

 

 

tz

 

 

 

 

e k

 

e k

 

e k

 

e k

 

e k

e k

 

e k

e k

 

e k

i

 

 

i

i

 

 

i

i

 

i

 

i

 

i

 

i

 

φx

 

φx

 

φy

 

φx

 

φz

φx

 

t x

φx

 

t y

 

e k

 

e k

 

e k

 

e k

 

e k

e k

 

e k

e k

 

e k

i

 

 

i

i

 

 

i

i

 

i

 

i

 

i

 

i

 

φx

 

φy

 

φy

 

φy

 

φz

φy

 

t x

φy

 

t y

 

e k

 

e k

 

e k

 

e k

 

e k

e k

 

e k

e k

 

e k

i

 

 

i

i

 

 

i

i

 

i

 

i

 

i

 

i

φ

x

 

φ

φ

y

 

φ

z

φ

z

φ

z

t

x

φ

z

t

y

 

 

 

 

 

 

 

 

 

 

 

z

 

 

 

 

 

 

 

 

 

 

 

 

 

e k

 

e k

 

e k

 

e k

 

e k

e k

 

e k

e k

 

e k

i

 

 

i

i

 

 

i

i

 

i

 

i

 

i

 

i

φx

 

tx

φy

 

tx

φz

tx

tx

tx

t y

 

 

 

 

 

 

 

 

e k

 

e k

 

e k

 

e k

 

e k

e k

 

e k

e k

 

e k

i

 

 

i

i

 

 

i

i

 

i

 

i

 

i

 

i

φ

x

 

t

y

φ

y

 

t

y

φ t

y

t

x

t

y

t

y

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

z

 

 

 

 

 

 

 

e k

 

e k

 

e k

 

e k

 

e k

e k

 

e k

e k

 

e k

i

 

t

i

i

 

t

i

i

t

i

t

i

t

i

t

i

 

φ

x

 

z

 

φ

y

 

z

 

φ

z

z

 

x

z

 

y

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

eik φx

eik φy

eik

φz

eik

tx

eik t y

eik tz

 

 

k

 

ei

 

 

t z

 

 

e k

 

 

 

i

 

t z

 

 

eik

 

 

 

t

z

 

 

 

 

 

e k

 

 

i

 

 

tz

 

 

eik

 

 

 

t

z

 

 

 

 

 

 

k

 

ei

 

 

tz

 

New Trends in Surface Reconstruction Using Space-Time Cameras

21

 

 

 

 

 

 

 

 

 

H =iNu=1kK=1Hik

 

 

 

 

 

 

 

d

 

 

e k

,e k

 

e k

 

e k

,e k

e k

 

 

e k

,e k

e k t

 

= e k

i

 

i

,e k

i

i

,e k

i

i

 

 

ik

i

φx

i

 

φy

 

i

φz

i

tx

 

i

 

t y

i

tz

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

d = −2 iNu=1kK=1dik

 

 

 

 

 

 

2. Update the parameter

ˆ

 

 

 

 

 

Θ :

 

 

 

 

 

 

Θ by an amount

 

 

 

 

 

 

 

 

 

ˆ

(n +1)

 

 

ˆ

(n )

 

 

ˆ (n )

 

1

 

1

 

 

 

 

 

 

 

Θ

=

Θ

 

+

Θ = Θ

+

 

H

 

d

 

 

 

 

 

 

 

λ

 

 

 

 

Where λ is a time-varying stabilization parameter.

(23)

(24)

(25)

3. Go back to step1 until the estimate of Θˆ converges.

Unless the object has periodic edge curves, the error function in Eq.22 usually has one minimum and convergence of the algorithm will be guaranteed. Outlier points have destructive effect on convergence of the algorithm. Naturally, projection of the outlier point in the camera planes will not be close to the tracking curves. As a result, minimization of the error function cannot be accomplished accurately. To explain the problem mathematically, consider the unique points in two groups, i.e. inliers and outliers. The error function can be rearranged as:

 

e =iN=inlier1 ei +Nj =outlier1 e j

where :

N inlier +N outlier =N u

(26)

In the

provision that Noutlier is

very

small

than Ninlier,

the

error

component

Nj=outlier1

ej has negligible effect

compared to iN=1inlier ei

and

estimation of the

motion will go in the true way. However, the unique points will not join to the tracking curves during convergence. To make the algorithm more efficient, the minimum distance of each unique point from nearby curve is checked after adequate number of iterations. The points that their distance is very greater than the average distance (i.e. ei >>eN u ), are distinguished as outliers. Such points

are excluded in calculation of the error function and hence the closer unique