Westin (Friman, 2005) with the Stochastic Draw-
ing Sampling Selection (SDSS) scheme developed
in (San Jos´e, 2005) for complexity limitation. This
Bayesian algorithm is next described.
The goal of the Bayesian modelling is to find a pdf
of the local fiber orientation
1
p(
ˆ
v
k
|
ˆ
v
k−1
, D), where
vectors
ˆ
v
k
and
ˆ
v
k−1
contain the path samples up to
time k or k− 1, respectively, and D denotes the mea-
sured diffusion data. If a model that relates the diffu-
sion measurements D with the underlying tissue prop-
erties and architecture is assumed, then it must con-
tain at least one fiber direction
ˆ
v
k
and a set of nui-
sance parameters denoted by θ. Thus, applying the
Bayes theorem,
p(
ˆ
v
k
, θ|
ˆ
v
k−1
, D) =
p(D|
ˆ
v
k
, θ)p(
ˆ
v
k
|
ˆ
v
k−1
)p(θ)
p(D)
(1)
where we have assumed that the prior distribution can
be factorized p(
ˆ
v
k
, θ|
ˆ
v
k−1
) = p(
ˆ
v
k
|
ˆ
v
k−1
)p(θ). The
main problems found are (Friman, 2005): (i) the cal-
culation of p(
ˆ
v
k
|
ˆ
v
k−1
, D) needs to marginalize Eq. (1)
over θ, and (ii) the normalizing factor
p(D) =
Z
ˆ
v
k
,θ
p(D|
ˆ
v
k
, θ)p(
ˆ
v
k
|
ˆ
v
k−1
)p(θ) (2)
is difficult to evaluate due to the high-dimensional in-
tegral and the intractable integrand. Eq. (1) has to be
calculated in every step in the sequential sampling of
the fiber paths and, unless an approximation for the
integral in Eq. (2) is found, the cost is prohibitive.
Some attempts have been made to approach this
problem. In (Friman, 2005), a solution based on
drawing samples from a pdf defined on the unit sphere
is proposed. This is accomplished by evaluating the
pdf at a sufficiently large number of points evenly
spaced over the unit sphere, effectively approximating
the continuous pdf with a discrete pdf, from which it
is straightforward to draw the random samples. How-
ever, the continuous pdf must be densely enough sam-
pled, specifically, Friman proposes to use 2,562 pre-
defined points thus involving an important computa-
tional burden. At this point, we propose to use a sam-
pling strategy where those points (hypotheses, in the
Bayesian terminology of (San Jos´e, 2005)) with the
largest probabilities have more chances to be selected.
However, notice that some randomness is introduced
in the selection procedure. This way, those direc-
tions with the highest probability to prolong the cur-
rent fiber path will probably be selected. Specifically,
we have implemented the Stochastic Drawing Sam-
pling Selection (SDSS) algorithm in order to reduce
the number of sampled points in the above-mentioned
unit sphere.
1
Using the notation found in (Friman, 2005).
3 COMPARISON BETWEEN
BAYESIAN AND MHT
A fuzzy version of Reid’s classical Multiple Hypothe-
ses Tracking (MHT) algorithm (Reid, 1979) was pro-
posed in (Alberola, 1999). This system is based
on the likelihood discrimination and it was applied
to the tracking of natural language text-based mes-
sages. It shows the possibility of handling informa-
tion about any time-varying phenomenon, as long as
the phenomenon can be described by means of a few
keywords, and the phenomenon itself is statistically
causal in the sense that the distribution of future states
is statistically dependent on the past observed states.
It is not difficult to see the following parallelism
that leads to the possibility of a tract probability es-
timation based on text-messages (fuzzy-messages):
(i) the natural-language messages in (Alberola, 1999)
and the noisy DT-MR image constitute, in both cases,
the source of noisy or ambiguous information, (ii) the
tracks used in the MHT algorithm, which are defined
as sequences of associated symbols, can be clearly as-
sociated to the possible sequences of points in the 3D
space, in the tracking context, (iii) the MHT system
associates multiple messages generated along time by
using a specific stochastic model for the applications’
dynamics. In our case, this model can be the infor-
mation provided by the measured anisotropy, (iv) the
term target denotes some condition that generates ob-
servable phenomena. In our context, these targets are
the sequences of points that define a tract.
As a consequence, the MHT system can be viewed
as a Bayesian approach for multiple targets track-
ing. Theoretically, this algorithm conserves all the
hypotheses that explain the observation until certain
time, together with an estimation of the probability
of each hypothesis. At the end, the hypothesis with
the highest likelihood is taken as the solution. On
the other hand, the Bayesian tracking algorithm main-
tains a finite set of hypotheses (section 2) with their
associated probabilities, and a tract is coloured and
visualized based on these data.
4 PROPOSED FUZZY SYSTEM
In this section we propose a recursive SAM (Standard
Additive Model) fuzzy subsystem that allows to mon-
itor the performance of a DT-MRI tracking system.
The SAM model allows to work with linguistic de-
scriptions and ambiguities. This kind of description
allows to fuzzy-quantify the errors in the tractogra-
phy problem. On the other hand, the uncertainty in the
prediction of the future positions found in the MHT of
ICINCO 2009 - 6th International Conference on Informatics in Control, Automation and Robotics
446