Algorithm 1 Algorithm for generating n-CSD-maps

Require:  Consecutive silhouette images: $I[w,h,n]$.  Parameter w and h represent the width and height of the silhouette images respectively. Parameter n represents the number of consecutive silhouette images. Ensure:  The CSD-map: $\mathsf{\Gamma }$ 1: for$i=1$ to w do 2:  for $j=1$ to h do 3:   $t=I(i,j,:)$; 4:   $value=0$; 5:   for $k=1$ to n do 6:    $value=value+2^{(k-1)}\ast t(k)$; 7:   end for 8:   $\mathsf{\Gamma }(i,j)=value$; 9:  end for 10: end for 11: return $\mathsf{\Gamma }$;