approaches determine the correct translation and
rotation based on a similarity function, which
measures the degree of correspondence between the
fixed and the floating image. The similarity function
can rely on differences in intensity like cross
correlation (van den Elsen, 1994) or gradient
information (Maintz, et al., 1996). In multimodal
image alignment mutual information is mainly used
as similarity measurement (Maes, et al., 2003;
Pluim, et al., 2003). The combination of intensity
gradients and mutual information is also used in
medical image processing (Pluim, et al., 2000).
Implementations of alignment algorithms need
usually much computation time, therefore ways for
acceleration are searched. The upcoming of multi-
core processors motivates the exploitation of
inherent parallelisms in many algorithms dealing
with images. The Cell Broadband Engine (CBE)
Processor, developed by Sony, Toshiba and IBM, is
a heterogeneous multicore-processor, consisting of
one PowerPC Processor Element (PPE) and eight
Synergistic Processor Elements (SPE). The SPE are
optimized for calculations, whereas the PPE is more
suitable for running operating systems. By running
Linux on a Playstation® 3 console only six SPEs are
available, but this system gives the inexpensive
opportunity to unleash the power of an amazing
state-of-the-art multi-core processor. We have
implemented different 2D/3D multimodal alignment
algorithms on the Playstation® 3 and on standard
hardware and compared the computation times. The
algorithms were tested by registration of a cross-
section of a barley grain to a corresponding NMR
volume and the alignment results were compared to
a gold standard, which was obtained by manual
alignment.
2 MATERIAL & METHODS
For this study a 3D NMR dataset of a whole barley
grain at 7 days after flowering was obtained with a
Bruker DMX 400 spectrometer (Bruker,
Rheinstetten, Germany). The image resolution was
31 µm along the axial and 16 µm along the
transverse directions. The dimension of the dataset
was 256 x 175 x 512 voxels. The 2D cross-section
was obtained by standard histological procedures
and was digitized with an original dimension of
1600 x 1200 pixel. It was converted into grayvalues
and scaled to meet the pixelsize of the NMR dataset.
The backgrounds in both images were manually
corrected.
2.1 Alternative Preprocessing
The reduction of noise was realized by application
of a median filter with a filter radius of 2.0.
Alternatively, the contrast was enhanced by
histogram equalization. In case of the median-
filtered images, optionally the gradient information
was extracted to detect the contours of structures.
For this task a sobel filter with a 5 x 5 mask was
applied.
2.2 Similarity Functions
Most prominent in multimodal registration is the
application of mutual information as similarity
function. Mutual information measure the degree of
dependence of a random variable to another by
comparing the probability distributions. Given two
probability distributions p
T
(t) and p
F
(f) and the joint
probability p
TF
(t,f) of the target image T and the
floating image F, the normalized mutual information
NMI is defined as (Maes, et al., 2003):
∑
=
ft
FT
TF
TF
fptp
ftp
ftpFTNMI
,
)
)(*)(
),(
log(*),(),(
(1)
If image T and image F are perfectly aligned, this
function should give the highest signal.
The linear cross correlation coefficient CC
compares the similarity of the intensity distributions
g(t
i
) and g(f
i
) between both images T and F:
∑∑
=
i
i
i
i
i
ii
fgtg
fgtg
FTCC
22
)(*)(
)(*)(
),(
(2)
The index i denotes the position. The comparison of
the gray value images should lead to bad results,
because same structures in multimodal images tend
to be visualized by different gray values. If the
gradient information is used, contours are matched
and should improve the results.
The last similarity function used in this paper is
the overlap index OI, which describes the extent of
the image overlap and therefore quantifies the
geometric correspondence between both images:
FT
TF
NN
N
FTOI
+
=
*2
),(
(3)
VISAPP 2009 - International Conference on Computer Vision Theory and Applications
242