Through-Wall Imaging With UWB Radar System - KEMT FEI TUKE
Through-Wall Imaging With UWB Radar System - KEMT FEI TUKE
Through-Wall Imaging With UWB Radar System - KEMT FEI TUKE
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
2.5 <strong>Radar</strong> <strong>Imaging</strong> Methods Overview 37<br />
from Iw(X, Y, Z) space to the real Ir(x, y, z) space can be done by:<br />
x = X −<br />
Z 2 − d 2 +<br />
�<br />
2Z 3 Zx<br />
(Z 2 − d 2 ) 2 + 4d 2 Z 2 Z 2 X<br />
y = Y + ZY<br />
� 2 2 4<br />
d (x − X) − Z � /Z 3<br />
�<br />
z = Z2 − d2 − (y − Y ) 2 − (Z2 − d2 ) (x − X) 2 /Z 2<br />
(2.5.56)<br />
where d is distance between transmitter and receiver.<br />
SEABED method was used for detecting the contours of object behind a<br />
wooden wall by Sebastian Hantscher et al. in [68] in 2006. The results from<br />
real measurement are compared with Kirchhoff migration and f-k migration on a<br />
very simple scenario. The cylinder was positioned behind the wooden wall with<br />
the smooth surface. The next practical 3 Dimensional (3D) measurement was<br />
done through the 5 cm concrete wall [69] in 2008. The SEABED reasonable saves<br />
a computational time. It is even ten times faster than f-k migration. A number of<br />
points with nonzero amplitudes in Iw(X, Y, Z) space is very small, therefore only<br />
a few points have to be processed. However, for practical scenarios through thick<br />
brick, or concrete walls the derivation of the wave front from the measured data<br />
will be a critical step.<br />
2.5.12 Fast Back Projection<br />
Fast back projection algorithm was developed for tomography [21, 148] and later<br />
modified for airplane SAR imaging in [144]. The main advantage of this method is<br />
the smaller computational complexity in comparison with classical back-projection<br />
described in Section 2.5.2. Classical back projection requires O(N 3 ) operations to<br />
generate N projections for N × N image whereas the fast back projection requires<br />
only O (N 2 log N) operations. The fast back projection algorithm is performed<br />
in two parts. First, the received data are recursively factorised into a number<br />
of decimated data-sets for subimages of the reconstructed image. An example<br />
of factorisation is shown on Fig. 2.5.7 (upper side), the resultant hierarchy of<br />
data-sets is shown on lower side.<br />
Secondly, each data-set is back-projected to the corresponding subimage. A<br />
computational gain is achieved through decimating the data in the factorisation<br />
step. However, this step introduces an error that degrades the image quality<br />
[73]. There were made lot of modifications in the fast projection algorithm, like<br />
filtered back-projection [15], fast factorised back-projection [50], [140], quadtree<br />
back projection [97], omega-k quadtree back projection [36], etc. However, none<br />
of these methods has better accuracy than classical back projection, or faster<br />
computational times than f-k migration.