new topology. Finally, section 5 explains the conclu-
sions and the future work.
2 MODEL
A Topological Active Volume (TAV) is a three-
dimensional structure composed of interrelated nodes
located at the vertices of a polyhedron (Barreira and
Penedo, 2005). This polyhedron is repeated through-
out the mesh and defines the neighbouring relation-
ships among nodes. There are two types of nodes:
internal, inside the mesh, and external, on the sur-
faces. Each type of node represents different object
features. The external nodes fit the surface of the ob-
ject whereas the internal nodes model its inner topol-
ogy. Figure 1 depicts a TAV where the repeated poly-
hedron is a cube.
Parametrically, a TAV is defined as v(r, s, t) =
(x(r, s, t), y(r, s, t), z(r, s, t)), where (r, s, t) ∈ ([0, 1] ×
[0, 1] × [0, 1]). The state of the model is governed by
an energy function defined as follows:
E(v) =
R
1
0
R
1
0
R
1
0
E
int
(v(r, s, t)) + E
ext
(v(r, s, t))drdsdt
(1)
where E
int
and E
ext
are the internal and the external
energy of the TAV, respectively. The former controls
the shape and the structure of the net. Its calculus
depends on first and second order derivatives which
control contraction and bending, respectively. The in-
ternal energy term is defined by:
E
int
(v(r, s, t)) =
α(|v
r
(r, s, t)|
2
+ |v
s
(r, s, t)|
2
+ |v
t
(r, s, t)|
2
) +
β(|v
rr
(r, s, t)|
2
+ |v
ss
(r, s, t)|
2
+ |v
tt
(r, s, t)|
2
) +
2γ(|v
rs
(r, s, t)|
2
+ |v
rt
(r, s, t)|
2
+ |v
st
(r, s, t)|
2
)
(2)
where subscripts represent partial derivatives and α,
β and γ are coefficients that control the smoothness of
the net. In order to compute the energy, the parameter
domain [0, 1] × [0, 1] × [0, 1] is discretized as a regu-
lar grid defined by the internode spacing (k, l, m) and
the first and second derivativesare estimated using the
finite differences technique in 3D.
E
ext
represents the characteristics of the scene that
guide the adjustment process and is defined as fol-
lows:
E
ext
(v(r, s, t)) = ωf[I(v(r, s, t))]
+
ρ
|ℵ(r,s,t)|
∑
p∈ℵ(r,s,t)
1
||v(r,s,t)−v(p)||
f[I(v(p))]
(3)
where ω and ρ are weights, I(v(r, s, t)) is the intensity
value of the original image in the position v(r, s, t),
f is a function related to the image intensity, and
ℵ(r, s, t) is the neighbourhood of the node (r, s, t).
This way, given that the repeated polyhedron in the
mesh defines the node neighbourhoods, the shape of
Figure 1: A 4 × 4 × 3 TAV mesh where the base polyhe-
dron is a cube. The dark nodes represent the external nodes
whereas the light ones are the internal nodes.
the polyhedron influences not only the flexibility of
the mesh, but also the way the nodes are adjusted to
the objects.
Since the internal and external nodes model differ-
ent parts of the objects, f should be adapted for both
types of nodes. On one hand, if the objects to detect
are dark and the background is light, the energy of an
internal node will be minimum when it is on a point
with a low grey level. On the other hand, the energy
of an external node will be minimum when it is on a
discontinuity and on a light point outside the object.
In this situation, function f is defined as:
f[I(v)] =
h[I(v)
n
] for internal nodes
h[I
max
− I(v)
n
+ ξ(G
max
− G(v))]
+GD(v) for external nodes
(4)
where ξ is a weighting term, I
max
and G
max
are the
maximum intensity values of image I and the gradient
image G, respectively, I(v) and G(v) are the intensity
values of the original image and the gradient image in
the node position v(r, s, t), I(v)
n
is the mean intensity
in a n× n × n cube, h is an appropriate scaling func-
tion, and GD(v) is the gradient distance, this is, the
distance from the node position v(r, s, t) to its nearest
edge.
Otherwise, if the objects are bright and the back-
ground is dark, the energy of an internal node will be
minimum when it is on a point with a high grey level
and the energy of an external node will be minimum
when it is on a discontinuity and on a dark point out-
side the object. In such a case, function f is defined
as:
f[I(v)] =
h[I
max
− I(v)
n
] for internal nodes
h[I(v)
n
+ ξ(G
max
− G(v))]
+GD(v) for external nodes
(5)
where the symbols have the same meaning as in equa-
tion 4.
The segmentation process consists of several
stages. First, a mesh with an homogeneous distribu-
VISAPP 2008 - International Conference on Computer Vision Theory and Applications
530