denote resp. by γ
0
(t) and γ
00
(t) the first and second and
derivatives of C with respect to t. The local curvature
of the curve C is defined by
κ(t) =
kγ
0
(t) ×γ
00
(t)k
kγ
0
(t)k
3
, (2)
where k.k and × are respectively the L
2
norm and
the cross product, both in R
3
. In what follows, we
briefly discuss some numerical considerations. First,
to avoid division by zero, Eq. 2 is set to zero when
the denominator is smaller than some ε > 0
5
. Sec-
ond, the derivatives are approximated by standard fi-
nite central differences. Due to the presence of noise,
estimating small values of curvatures is however a
delicate problem. Nevertheless, under the assump-
tion that the strands cannot mechanically bend over
some limit value, the finite differences are computed
using a grid spacing (denoted by ∆h) proportional to
the strand diameter S
dr
. A large value of ∆h allow
us to assess small curvature values despite the noise.
Also, we choose not to consider extremities of cen-
terlines. Finally, to yet increase the robustness, the
centerlines are first smoothed by a Gaussian filter of
standard deviation σ = 0.05 ×S
dr
.
4.3 Void Fraction
It is the ratio of area not occupied by the strands over
the area delimited by the inner part of the conduit.
A large void fraction means that strands are likely to
move and bend. Once the cables are segmented, it can
be obtained without difficulty.
4.4 Twist-pitch
The twist-pitch refers to the stranding periodicity of a
cable. Unlike the power cables or the Rutherford ca-
bles, the cables-in-conduit are wired and compacted
so that some (limited though) randomness is injected
in the architecture. As a consequence, the estima-
tion of twist-pitches only applies to cables-in-conduit.
Given the presence of some quantity of randomness,
we will estimate the twist-pitches using the autocor-
relation of the strand centerlines. Recall that differ-
ent stages are wired with different twist-pitches (see
Tab. 1). The estimation of these twist-pitches thus im-
plies to identify the stages of the cable.
The identification of the petals at different stages
can be seen as a hierarchical clustering problem, con-
strained by the pattern of the cable. To form clusters at
a given stage, a possible choice is to use pairwise dis-
tances of all strands. Indeed, closely running strands
are more likely to belong to the same petal.
5
ε is w.r.t. the precision of the implementation.
Let us formalize the above problem. We denote
the set of N centerlines of length K by {c
i
}
N
i=1
, where
c
i
∈ R
3K
. For any couple (i, j) ∈ {1,. ..,N}
2
, we de-
fine d(c
i
,c
j
) as the distances between c
i
and c
j
. The
distance is different depending of the norm. A rea-
sonable choice for d is the mean distance, based on
the L
2
norm. Additionally, for a given number of
stages (denoted by M), we denote by P
m
the num-
ber of petals, for any m ∈ {1,. ..,M}. We also de-
note by {ϕ
m
}
M
m=1
a set of applications where ϕ
m
:
{1,.. . ,N} → {1,.. . ,P
m
} assigns a label to each cen-
terline of the stage m, for any m ∈ {1,.. ., M}. Last,
we denote by 1
{.}
the indicator function returning 1 if
its argument is true, 0 otherwise. Then, we propose to
solve the constrained hierarchical clustering problem
by finding a minimizer to
M
∑
m=1
∑
(i, j)∈{1,...,N}
2
1
{ϕ
m
(i)=ϕ
m
( j)}
d(c
i
,c
j
)
2P
m
KM
, (3)
subject to the following constraints:
1. {ϕ
m
}
M
m=1
is a hierarchy,
2. For each petal at M = 1, N
sc
/N
nsc
are fixed,
3. For any stage, the size of each petal is fixed.
For a single stage, Eq. 3 can be put under the form
of an integer linear program (with a number of vari-
ables and constraints both of O(N
2
P
1
)) and solved
exactly using an integer linear programming solver.
For this experiment, the last version of CPLEX has
been chosen for its good performances (Mittelmann,
2007). Even for a simplistic situation where a sin-
gle stage and a limited number of centerlines are con-
sidered (N=15), several days of calculus are needed.
This remains acceptable for this setting but becomes
intractable for large cables with hundreds of strands.
To overcome this situation, we use a greedy strat-
egy for solving Eq. 3 heuristically. An illustrative ex-
ample is provided in Fig. 6 for the N05 cable (cluster-
ings are superimposed on source images). For the first
stage, random triplets satisfying the above second and
third constraints, are formed (see Fig. 6(a)). A greedy
heuristic is then applied, that consist in swapping the
pairs of centerlines satisfying the above second con-
straint and making the strongest decrease of Eq. 3.
This process is iterated until no swaps can be per-
formed (see Fig. 6(b)). The next stages are optimized
in the same way, except that (i) the initialization is
based on the clustering obtained at the previous stage
and (ii) that pairs of groups of centerlines are swapped
instead of centerlines (see Fig. 6(c,d)). This allows
us to keep clusterings as a hierarchy (first above con-
straint). Finally, the overall approach is run 100 times
and the solution having Eq. 3 minimum is kept.
ICPRAM 2016 - International Conference on Pattern Recognition Applications and Methods
546