21.02.2013 Views

Single-sensor hand and footprint-based multimodal biometric ...

Single-sensor hand and footprint-based multimodal biometric ...

Single-sensor hand and footprint-based multimodal biometric ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

4 Preprocessing<br />

4.4 Silhouette extraction<br />

Having a binary m × n input image B with only one connected component as the <strong>h<strong>and</strong></strong><br />

or foot object, the counter-clockwise contour polygon 〈S0, . . . , Sn〉 is traced as follows:<br />

40<br />

1. Estimation of starting point S0: depending on whether <strong>h<strong>and</strong></strong>s or feet are processed,<br />

the starting point is found when intersecting the wrist or outside boundary<br />

line of the foot with lines parallel to y-axis (<strong>and</strong> x-axis, respectively) through the<br />

center of the (cropped) image. For <strong>h<strong>and</strong></strong>s, one can define:<br />

S0 =<br />

�<br />

m<br />

2<br />

max{y ∈ {1, . . . , n} : B( m<br />

m<br />

, y) = 1 ∧ B( 2 2<br />

For feet, the starting point is selected as:<br />

S0 =<br />

�<br />

min{x ∈ {1, . . . , m} : B(x − 1, n<br />

n<br />

2<br />

2<br />

, y + 1) = 0}<br />

n<br />

) = 0 ∧ B(x, ) = 1} 2<br />

�<br />

�<br />

; (4.13)<br />

. (4.14)<br />

2. Contour tracing: having selected S0, contour tracing involves a local decision of<br />

the next contour pixel Sk+1 <strong>based</strong> on Sk <strong>and</strong> the current direction index dk within the<br />

sequence 〈dm〉 referring to left-up, left, left-down, down, right-down, right, right-up,<br />

up directions in counter-clockwise order:<br />

〈dm〉 = 〈<br />

�<br />

−1<br />

−1<br />

�<br />

,<br />

�<br />

−1<br />

0<br />

�<br />

,<br />

�<br />

−1<br />

1<br />

�<br />

,<br />

�<br />

0<br />

1<br />

�<br />

,<br />

�<br />

1<br />

1<br />

�<br />

,<br />

�<br />

1<br />

0<br />

�<br />

,<br />

�<br />

1<br />

−1<br />

�<br />

,<br />

�<br />

0<br />

−1<br />

�<br />

〉.<br />

(4.15)<br />

Now, Sk+1 is selected with respect to the next counter-clockwise non-zero pixel within<br />

an eight-neighbourhood starting at the pixel in direction of dk, i.e. the predecessor of<br />

Sk. Finally, the resulting found direction is reversed, such that dk+1 points towards<br />

the new predecessor Sk of Sk+1.<br />

dk+1 = (dk + 4 + min{i ≥ 1 : B(Sk + d(dk+i) mod 8) = 1}) mod 8; (4.16)<br />

Sk+1 = Sk − ddk+1 . (4.17)<br />

The iteration stops, when Sn = S0 is reached. Initial directions are d0 = 3 = down<br />

for <strong>h<strong>and</strong></strong>s <strong>and</strong> d0 = 1 = left for feet.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!