# Crossing Fibers Detection with an Analytical High Order Tensor Decomposition

Authors: T. Megherbi; M. Kachouane; F. Oulebsir-Boumghar; R. Deriche
Journal: Computational and Mathematical Methods in Medicine
 (2014)

---

## Abstract

Diffusion magnetic resonance imaging (dMRI) is the only technique to probein vivo and noninvasively the fiber structure of human brain white matter. Detecting the crossing of neuronal fibers remains an exciting challenge with an important impact in tractography. In this work,
we tackle this challenging problem and propose an original and efficient technique to extract all
crossing fibers from diffusion signals. To this end, we start by estimating, from the dMRI signal,
the so-called Cartesian tensor fiber orientation distribution (CT-FOD) function, whose maxima
correspond exactly to the orientations of the fibers. The fourth order symmetric positive definite
tensor that represents the CT-FOD is then analytically decomposed via the application of a new
theoretical approach and this decomposition is used to accurately extract all the fibers orientations.
Our proposed high order tensor decomposition based approach is minimal and allows recovering
the whole crossing fibers without any a priori information on the total number of fibers. Various
experiments performed on noisy synthetic data, on phantom diffusion, data and on human brain
data validate our approach and clearly demonstrate that it is efficient, robust to noise and performs
favorably in terms of angular resolution and accuracy when compared to some classical and state-of-the-art approaches.


---

## Body

## 1. Introduction

The diffusion magnetic resonance imaging or dMRI [1] is a magnetic resonance imaging (MRI) modality which is particularly suited to study and characterize the white matter neuronal architecture of the brainin vivo and noninvasively. The diffusion tensor model (DTI) introduced by Basser et al. in 1994 [2] was the first technique used for the fiber bundles reconstruction. However, due to the assumption of single fiber bundle per voxel, this technique is ineffective in regions where the fiber bundles intersect. Therefore, the fiber bundles reconstructed by tractography algorithms based on DTI are unreliable. To overcome the limitations of the DTI model, new high angular resolution techniques (HARDI) have been proposed, such as the diffusion spectrum imaging (DSI), the Q-ball imaging (QBI) [3, 4], or the symmetric high order tensors (SHOT) [5]. These techniques allow estimating the diffusion orientation distribution function (ODF) whose maxima are aligned with the orientations of the underlying fibers. The DSI technique provides the real ODF by measuring the diffusion signal on a whole 3D Cartesian grid in the q-space. However, this method is impractical in clinical studies because it requires an important acquisition time due to the huge number of samples and it requires too a very high gradient magnitude. The QBI model approximates the diffusion ODF function directly from the raw HARDI diffusion signal acquired from a spherical sampling of the diffusion space [3, 4]. Although the QBI-ODF contains the angular information by having its maxima aligned on the orientations of the underlying fibers, it has a low angular resolution by failing to reconstruct correctly the fibers crossing with angles less than 63∘ [3, 6]. A sharper function called fiber ODF or FOD function can be calculated from the ODF by using the spherical deconvolution techniques [7]. The FOD function has also its maxima aligned on the underlying fiber orientations; the FOD allows a gain in the angular resolution up to 15∘. Traditionally the ODF and FOD functions are described in spherical harmonics (SH) basis; the angular resolution of these functions directly depends on the order of the SH basis: an acute angular resolution requires a high order of the SH basis. However, in case of higher orders, these ODF and FOD functions are prone to negative lobes due to noise. The high order symmetric tensors or equivalently the homogeneous polynomials have been proposed to model and reconstruct the FOD function [8] called CT-FOD for Cartesian tensor-FOD, whose maxima correspond exactly to the orientations of the underlying fibers. By imposing efficiently the positivity constraint, the CT-FOD function appears as an alternative to the FOD described in the SH basis. Furthermore, thanks to its polynomial form, the maxima of the CT-FOD function can be easily located. Therefore, in our work we start by estimating the CT-FOD function to reconstruct the symmetric high order tensor from the diffusion weighted-MRI (DW-MRI) data. Due to the importance of tractography and its increasing interest in clinical practice, it is important to accurately extract the fiber orientations to perform a reliable and accurate tractography. An efficient and accurate approach to perform this crucial and necessary preprocessing step is to extract the fibers orientations as the CT-FOD maxima. Different methods for extracting maxima of high order tensors exist in the literature; in [9], Bloy and Verma proposed to determine the fiber directions using the concept of Z-eigenvalues introduced by Qi in 2005 [10]. This maxima localization method, the so-called traditional method, suffers from a low angular resolution and does not allow recovering crossing fibers at angles below 60∘ [11]. The high order tensor decomposition in rank-1 tensor has been proposed to the maxima extraction issue in [12], and the low-rank decomposition approximation method known as CANDCOMP/PARAFAC (CP) [13] was used. It was proved in previous works [11, 12] that the tensor decomposition approaches recover the crossing fibers with a better angular resolution than the traditional methods of maxima localization. However, the CP-decomposition approximation requires predefining the tensor rank, that is, knowing the number of fibers in a voxel, which is impossible apriority. Furthermore, PARAFAC uses the alternating least squares (ALS) algorithm, which is a nonlinear optimization algorithm whose convergence is not guaranteed and depends on the initialization. In this paper, we propose to find the orientations of the fiber bundles from diffusion signals using an analytical decomposition of symmetric high order tensor; for lightness and clarity of the paper we will use the abbreviation Adecomp-SHOT for analytical decomposition of symmetric high order tensor. This Adecomp-SHOT method was initially proposed by Brachat et al. in 2010 [14] but remains in the theoretical field. However, the Adecomp-SHOT seems a priori interesting for the fiber orientations issue because, unlike the suboptimal CP-decomposition approximation, the Adecomp-SHOT is an analytical one and not restricted to subgeneric ranks. Thus, rather than CP-decomposition, Adecomp-SHOT would provide a minimal decomposition; this aspect is particularly interesting in the fiber orientations search since it would give the whole underlying fiber orientations without any apriority. Therefore, in the following we propose an original and efficient Adecomp-SHOT based approach to extract the fiber orientations from diffusion weighted-MRI data and we prove through many validations tests the effectiveness of the proposed method. The Adecom-SHOT is based on the SHOT; therefore we propose to use the CT-FOD for reconstructing the SHOT from the DW-MRI signal, since the CT-FOD constitutes the state-of-the-art. We begin this paper by presenting first the CT-FOD algorithm, before explaining the CP-decomposition and providing a detailed version of the Adecomp-SHOT algorithm; in this section we will also present the results of the intrinsic study done on both of Adecomp-SHOT algorithm and CP-decomposition. Then we describe our Adecomp-SHOT based approach to the fiber orientations search. Finally, we finish by presenting our validations and results on synthetic, phantom, andin vivo human brain data and our conclusions.


## 2. Materials and Methods

### 2.1. Symmetric Fourth Order Tensor Coefficients from the Diffusion Data

The diffusion signalS=(gi,bi) corresponding to the acquisition parameters, gi, bi, is given by the convolution of the CT-FOD function F, modeled by a Cartesian and positive definite symmetric high order tensor of 3 dimensions, with a Watson function Ω [7, 8]:
(1)S(g,b)=Ω(g,b)⊗F(g,b)(2)S(gi,bi)=∫‍Ω(gi,bi,v)F(v)dvΩ(gi,bi,v)=e-biD(giTv)2, with D being the diffusivity coefficient calculated from a 2nd order tensor, that we estimate from a single fiber response having a high fractional anisotropy (FA>0.8); gi is the gradient of magnetic fields, bi stands for the weightsb-values, and v represents a set of unit vectors sampling the diffusion space. Algorithm 1 describes the estimation of unique coefficients of the symmetric tensor FOD from the diffusion data.Algorithm 1
Data: Diffusion signal S(g,b); acquisition parameters
(
g
,
b
); vectors v sampling the unit sphere.
Result: The unique coefficients of the symmetric
positive definite tensor CT-FOD.
(1) Modeling the FOD function by symmetric
cartesian tensor of orderd and dimension 3.
F(g)=∑a+b+c=dCa,b,cg1ag2bg3c                    (i)
withCa,b,c the coefficients of the tensor, and
[g1,g2,g3] the components of the gradient
vectorg.
To impose the positivity constraint, the homogeneous
polynomialF(g) of order d in 3 variables, is
re-parameterized by a sum of squares of polynomials
of orderd/2 according to the Ternary quartics
theorem [8], we notice that in our work d=4:
F(g)=∑j=1Mljp(g1,g2,g3,;cj)2                    (ii)
withlj real and positive weights; cj vectors
containing the coefficients of thedth order rank-1
polynomials constructed from theM unit vectors
v sampling the unit sphere.
(2) By substitutingF(g) given by (ii) in
(2), the signal S can be approximated by
S
^ as following:
S^(gi,bi)≈∑j=1Mlj∫S2‍p(v1,v2,v3,;cj)2×Ω(gi,bi,v)dv      (iii)
cj is constructed for each vector or rank-1
tensorvj=[v1, v2, v3] sampling the unit sphere, and
contains the coefficients of these symmetric fourth
order tensors. The unknowns are then the weights
lj; the values lj are simply obtained by minimizing
the following functional equation E:
E=∑i=1L(SiS0-∑j=1Mlj∫S2‍p(v1,v2,v3,;cj)2×Ω(gi,bi,v)dv)2    (iv)
withlj∈R+, and S normalized.
To ensure the positivity of thelj values,
the problem (iv) is solved using the efficient
constrained optimization algorithm Non Negative
Least Squares (NNLS) [8, 15].
(3) TheN coefficients Ca,b,c of the FOD tensor are
then estimated simply by multiplying the matrixC,
of sizeN×M containing the monomials of the rank-1
symmetric fourth order tensor formed from vectors
c
j, by the resultant vector l of length M.In the following we are interested to decompose symmetric fourth order tensors of dimension 3 (d=4 and n=3).


### 2.2.  Symmetric Tensor Decomposition

Symmetric high order tensors appear mostly as multivariate functions (more than two variables), and high order tensors decomposition allows deducing the geometric and invariance properties of a tensor. Therefore, the tensor decomposition raises interest in many practical domains, first in chemometrics [13] and psychometrics fields and then in electrical engineering and electronics [16], in particular for the antenna array processing [17], or else in telecommunication field [18]. Also, tensor decomposition appears very useful in data analysis and in the arithmetic complexity area [19]. Recently the interest in tensor decompositions has expanded to the neurosciences field; we cite among several applications the use of the symmetric tensor decomposition to the problem of extracting the fiber orientations of the white matter in dMRI. However, to date, in dMRI the decomposition problem is still solved with a low-rank approximation method known as CANDCOMP/PARAFAC (CP).In the following two subsections, we first start by describing the classical CANDECOMP/PARAFAC (CP) method to decompose symmetric high order tensors and then present in detail the Adecomp-SHOT approach we propose to analytically decompose a symmetric tensor of any order and any dimension in a minimal sum of rank-1 terms.


#### 2.2.1. Numerical Method: CP Low-Rank Approximation

The tensor decomposition problem consists in writing a given tensor, in sum of outer product of vectors, that is, rank-1 tensor, and that with a minimal number of terms, the number of terms corresponding to the minimal tensor rank. Considering a symmetric tensorT of order d and dimension n, the minimal decomposition of this tensor should be in the following form:
(3)T=∑r=1R‍Vr1∘Vr2∘⋯∘Vrd
with R: the rank of T, “∘”: the outer product, and Vr: the rank-1 tensors (vectors).However, determining the rank of high order tensors (order>2) is a hard mathematical and NP-complet problem. Therefore, a low-rank numerical approximation of the decomposition (4) has been proposed in [13], where the authors approximate the tensor by another tensor whose rank is inferior to the minimal or generic tensor rank; this numerical decomposition method is known as CANDECOMP/PARAFAC (CP):
(4)T^≈∑r=1k‍λr(vr1∘vr2∘⋯∘vrd)
with ∥vr∥ = 1 and λr: the weights of the rank-1 tensors vr.k
<
R is the subgeneric rank of the tensor T, for symmetric tensors vr1=vr2=⋯=vrd. Thus, the CP-decomposition of the tensor T of order d and of an unknown minimal rank R is done by a nonlinear minimization in T^ of (5) for a given subgeneric rank k; the nonlinear minimization problem is solved using the alternating least squares algorithm (ALS):
(5)min⁡T^∥T^-T∥.Inverse Problem. To evaluate the intrinsic behavior of the CP method, we have simulated an inverse problem by generating fourth order symmetric tensors of rank-2 according to (3). These tensors are constructed from two crossing vectors with variable angles from 90∘ to 0∘ and weighted by the same weight λ=0.5. The purpose is the evaluation of both the ability of the method to render the correct solutions and the angular resolution in such ideal case where data perfectly satisfy the decomposition model.The results of the intrinsic study are illustrated in Figure1; Figure 1(a) represents the mean error between the simulated vectors or rank-1 tensors and the CP-decomposition solutions, and Figure 1(b) gives the rank-1 tensors weights found by the CP-decomposition, according to the separation angles.Rank-2 symmetric fourth order. (a) The mean error. (b) The weightsλ of the rank-1 tensors. Horizontal axes (a-b): the separation angles from 90∘ to 0∘.
(a)
(b)From Figure1(a) we notice that although the tensors to decompose are constructed as to satisfy the decomposition model described in (3), the CP-decomposition begins to give an incorrect decomposition when the solutions are separated with small angles (<30∘); thus, Figure 1(b) shows that only one vector of the two simulated is detected with the weights λ1=1 and λ2=0 for crossing angles inferior to 10∘. We conclude that the accuracy and the angular resolution of the CP-decomposition are intrinsically limited. Furthermore, the CP-decomposition has another important limit which is the requirement to predefine the rank of the decomposition.The use of the CP-decomposition algorithm in dMRI to detect the fiber orientations was proposed in 2011 by Jiao et al. [12]. The authors considered an approximation of the decomposition with a low-rank value (rank =2) in order to extract two crossing fiber orientations. The extracted fiber orientations correspond to the rank-1 vectors obtained from the decomposition. Although tensors decomposition is more efficient in terms of angular resolution and accuracy than the traditional maxima localization methods [11, 12], the CP-decomposition could not guarantee the recovering of the whole underlying fiber orientations since the minimal rank of the tensor is not a priori known. Moreover, the convergence of the ALS algorithm is not guaranteed and depends on the initialization.In 2010, Brachat et al. proposed [14] to solve the symmetric high order tensor decomposition problem analytically; in the remainder of the paper we denote this method: Adecomp-SHOT. Rather than the CP numerical approach, the Adecomp-SHOT method gives a minimal decomposition without any apriority. However, to date the Adecomp-SHOT remains theoretical and not yet expanded to the practical issues or evaluated on physical phenomenons. Due to its ability to render a minimal decomposition, we naturally expect that the Adecomp-SHOT applied to the fiber orientations search in dMRI would be more interesting than the CP low-rank approximation method.


#### 2.2.2.  Analytical Method: Adecomp-SHOT

The Adecomp-SHOT method initially proposed by the authors Brachat et al. [14] is a generalization of the Sylvesters theorem [14], initially introduced for binary cases and extended to larger dimensions. Thus, the Adecomp-SHOT algorithm is able to decompose a symmetric tensor of any order and any dimension, in a minimal sum of rank-1 terms.Consider a symmetric tensor of orderd and dimension n given in the following polynomial form:
(6)f(x0,x1,…,xn)=∑j0+j1+⋯+jn=d‍Cj0,j1,…,jnx0j0x1j1…xnjn
with f(x0,x1,…,xn)∈Rd a homogenous polynomial of order d in n variables, and Cj0,j1,…,jn the coefficients of the homogenous polynomial f.An affine decomposition off consists in writing f as a sum of dth powers of rank-1 linear forms [14] as follows:
(7)f(X)=∑i=1‍λiKi(X)d,f(X)=λ1K1(X)d+λ2K2(X)d+⋯IIIIIIIIII+λrKr(X)d
with λi representing scalars weights, Ki(X) rank-1 linear forms in X=[x0,x1,…,xn] with the coefficients (ki,0,ki,1,…,ki,n), and r the minimal rank of f, that is, of the tensor.K
i
(
X
) is a rank-1 linear form of n dimensions [14]:
(8)Ki(X)=ki,0·x0+ki,1·x1+⋯+ki,n·xn
with ki,0≠0 for 1≤i≤r.An affine decomposition off exists, if and only if an affine decomposition of f*_ exists; thus, the decomposition of f is equivalent to decomposing f*_; with f* being the linear form associated with f in the dual space Rd*, the coefficients C* of f* are then calculated from the coefficients C of f [14] as follows:
(9)Cj0,j1,…,jn*=j0!j1!…jn!d!×Cj0,j1,…,jn.f*_ is obtained by unhomogenizing f* according to the variable x0; this is done by dividing each monomial of the homogenous polynomial f* by an appropriate power of x0. Thus, f*_ is a nonhomogenous polynomial of degree d.The necessary and sufficient existence conditions of the decomposition are based on the rank conditions of the Hankel matrix and the commutation properties. The Hankel matrix is aN×N matrix with
(10)N=(n+(d-1))!d!(n-1)!.N corresponds to the number of unique coefficients of a d-order symmetric tensor of n dimensions. The elements of the Hankel matrix are computed from the coefficients C* of f*; we note that the elements corresponding to monomials with total degree higher than the polynomial degree d are unknown. We provide an appendix (Appendix section) where we give an example of a step by step decomposition of a 3 dimensional 4th order tensor of rank-4, illustrating how the Adecomp-SHOT algorithm works and particularly we show in Step 2 of the Appendix section how the Hankel matrix is constructed from a homogenous polynomial.To obtain the pointski of (8), we calculate from the Hankel matrix the multiplication matrix Mi as described in Step  5 of Algorithm 2, with i=1,…,r, for a given rank r; then we resolve the generalized eigenvalue problem and we deduce the weights λi by simply resolving a linear system. The readers can refer to the example given in the Appendix section for much more details. The critical part of Algorithm 2 is the step of extending the Hankel matrix, Step  6 of Algorithm 2, to verify the stability of the rank in case of higher ranks. Indeed, when the Hankel matrix is not totally defined, the extension requires finding the unknown parameters h of the Hankel matrix satisfying the commutation properties of the multiplication matrix Ml·Mm-Mm·Ml=∅ with l,m=1,…,n; this leads to solving a nonlinear equations system. Therefore, for higher ranks the uniqueness of the decomposition is not guaranteed.Algorithm 2
Data: An homogenous polynomial f(X) of degree d.
Result: f(X)=∑j=1r‍λjK(X)d with r minimal.
(1) Calculate coefficients off*_∈Rd* from those of
f
∈
R
d.
(2) Construct the Hankel matrixH(N×N) from the
coefficients off*_.
(3)if  all the  (2×2)  minors of  H  are zero  then
r=1 (tensors rank)
else
r=2.
Repeat
(4) Compute fromH a square sub-matrix Δ of
dimension(r×r) corresponding to a monomials
basisB of degree ≤d connected one
of size|B|=r. and its extension Δ+ of dimension
((r+1)×(r+1)) corresponding to
the monomials basisB+ of size |B+|=r+1,
which is the extension ofB.
(5) Compute the matrixΔxi corresponding to
the monomials basisB multiplied by xi for
i=1,…,n and the multiplication matrix
Mi=Δxi(Δ)-1
(6) Find the parametersh such that det⁡(Δ)≠0
and the matrixMi commute.
if  solutionshexistthen
Calculate the rankRΔ of Δ and RΔ+
the rank ofΔ+.
if  RΔ==RΔ+  then
r=RΔ
else
r=r+1; Repeat Step 4.
else
r=r+1; Repeat Step 4.
Until  the eigenvalues of  ∑i=1n‍aiMi  are simples
with arbitrary realai;
(7) Calculate then×r eigenvalues ki,j of the common
eigenvectorsvj of the multiplication matrix Mi such
thatMi·vj=ki,j·vj, i=1,…,n,j=1,…,r.
(8) Then solving the linear system in(λj)j=1,…,r:
f(x0,x1,…,xn)=∑j=1r‍λj(k0,j·x0+⋯+kn,j·xn)d
wherekj are the eigenvalues found in Step 7.Inverse Problem. Once again, we have simulated an inverse problem, this time for the Adecomp-SHOT algorithm; thus, rank-2 fourth order tensors were constructed from a sum of two rank-1 linear forms of order four, as described in (7). We have simulated the same configuration as in Section 2.2.1 by constructing the fourth order tensors from two crossing rank-1 linear forms at varying angles from 90∘ to 0∘ and weighted by the same weight λ=0.5. Our results of the intrinsic study of the analytical decomposition method are thus given in Figure 2.Rank-2 symmetric fourth order. (a) Blue: the mean error. (a) Red: the number of detected rank-1 tensors. (b) The weightsλ of the rank-1 tensors. Horizontal axes (a-b): the separation angles from 90∘ to 0∘.
(a)
(b)Contrarily to the CP-decomposition, the analytical approach clearly renders the correct decomposition whatever the separation angles. As shown in Figure2(a) the obtained mean error is zero, and the two rank-1 tensors are recovered with the correct weights λ1=λ2=0.5 as represented in Figure 2(b). Furthermore, the analytical decomposition is minimal; that is, the rank of the tensor is automatically found without any assumption such that it is required for the CP-decomposition. To confirm the ability of the method to give always a minimal decomposition regardless of the rank of the tensor, further tests on higher rank tensor have been conducted; Figure 3 shows the results of decomposing a rank-3 symmetric fourth order tensor constructed from 3 crossing rank-1 tensors, according to (7), at angles decreasing from 90∘ to 0∘. Figure 3 shows that the Adecomp-SHOT method gives once again a correct decomposition with a zero mean error whatever the separation angles between the 3 origin rank-1 tensors. Other tests on symmetric fourth order tensors of rank-4 and rank-5 have been conducted; the results of these experiences show that the Adecomp-SHOT method still gives the correct decomposition in case of rank-4 while for a rank-5 fourth order tensors the decomposition is found with insignificant angular error not exceeding 0.5∘. However, by increasing the order of the tensor from 4 to 6 the error drops to zero.Rank-3 symmetric fourth order. (a) Blue: the mean error. (a) Red: the number of detected rank-1 tensors. (b) The weightsλ of the rank-1 tensors. Horizontal axes (a-b): the separation angles from 90∘ to 0∘.
(a)
(b)


### 2.3.  Fiber Directions from Diffusion Data Using the Analytical Decomposition of Fourth Order Tensor

In this section we propose to extract the fibers orientations from the dMRI signal by decomposing analytically the three dimensional fourth order CT-FOD using the Adecomp-SHOT. The coefficients of the fourth order FOD are estimated from the dMRI data as described in Section2.1. Thus, we are interested to decompose the Cartesian FOD tensor in sum of powers of rank-1 linear forms:
(11)f(g)=∑i=1r‍λiKi(g)4
with r minimal representing the tensor rank; Ki are rank-1 linear forms in 3 variables with the real normalized coefficients [ki,0,ki,1,ki,2], and λi are the real positive weights.The normalized coefficients ofKi represent the Cartesian coordinates of the fibers orientations, weighted by the scalar λi, and r represents the number of crossing fibers bundles in each voxel.However, as described in Section2.2.2 the affine decomposition of a homogenous polynomial of any order and any dimension is done assuming that all coefficients of the first Cartesian coordinate in the decomposition are nonzero; that is, ki,0≠0, for 1≤i≤r, with r the tensor rank. This constraint implies that only fiber orientations whose first coordinate coefficient is nonzero can be detected. To avoid missing fiber orientations, we propose to introduce a coordinate changing in case where maxima are located in undetectable area. Also, not doing this coordinate transformation systematically and imposing a stopping criterion, we propose to make a first exhaustive search on the FOD by discretizing it on unit sphere and then localize roughly its maxima. A given FOD function f(g), with g the gradient of the magnetic field, can be discretized on units sphere as follows:
(12)f(g)=∑j=1N′‍pjfj(v1j,v2j,v3j)
with N′ the number of samples; pjfj is a rank-1 fourth order tensor constructed in the orientation (v1j,v2j,v3j) and represents the value of the FOD in this orientation, and the 3 dimensional unit vectors vj are obtained by a uniform tessellation of unit sphere. Thus, the pj are found by solving the linear system B=WP, with W representing a vector of N′ weights pj, B vectors of 15 unique coefficients of the fourth order tensor FOD and P a (15×N′) matrix; P contains the 15 unique coefficients of the N′ rank-1 fourth order tensor constructed from unit vectors v. Once the FOD is discretized, we check the first coordinate of the FOD values weighted by pj<(0.5×pmax⁡) corresponding to the FOD lobes, and we make a coordinate changing before decomposing the tensor if these coordinates are close to zero. Obviously, after decomposition, the inverse coordinate transformation is required to bring back the resulted rank-1 tensor to the origin coordinate system. In order to preserve the angles between two vectors and their lengths, the transformation matrix should be orthogonal. Therefore, to preserve the fiber orientations we use a rotation transformation; considering the initial coordinates or variables X=[x0,x1,…,xn], X′=[x0′,x1′,…,xn′] is obtained from X by the following linear transformation:
(13)x0′=a11x0+a12x1+⋯+a1nxnx1′=a21x0+a22x1+⋯+a2nxniiiiiiiiiiiiiiiiii⋮xn′=an1x0+an2x1+⋯+annxnX′=M×X
As mentioned, the matrix M is an orthogonal matrix or a rotation matrix. This coordinate transformation can be done either on the homogenous polynomial as a change of variable using a rotation transformation or simply by rotating the fourth order tensor coefficients. This coordinate transformation insures recovering the entire crossing fibers whatever its locations in the Cartesian space.The Adecomp-SHOT as initially described in [14] would provide a minimal decomposition with a minimal analytical rank, without any constraints on the weights λi or Ki values; in theory this is not a problem, but when we are interested in detecting the fibers orientations, negatives values for the weights or complexes coefficients do not correspond to any physical meaning. To overcome this limit, we propose ignoring the Ki with complexes coefficients found at Step  7 of Algorithm 2 and then solve the linear system (14) with only the linear forms Ki with real coefficients:
(14)f(g)≈∑i=1r′‍λiKi(g)4r′≤r represents the tensor rank and Ki∈R4. This linear system can be written as a matrix equation B=WA, with W a vector of length r′ containing the fibers weights λi and A is a (r′×15) matrix containing the polynomials coefficients of the rank-1 linear forms Ki(g)4 of order 4 and B is a vector of length 15 containing the coefficients of the fourth order fiber orientation distribution function f(g). To impose the positivity constraint on the weights λi values, we propose to solve the minimization problem 2.17 using the well-known Lawson and Hansons NNLS algorithm [15]:
(15)min⁡w∥B-WA∥2.
However, to verify that a set of λi>0 such that f(g)≈∑i=1r′‍λiKi(g)4 exists we check the norm ∥B-WA∥2; if the residual norm is less than 1, we assert that it is sufficient to consider the resulted decomposition accurately and the Ki weighted by λi>0 correspond to the maxima of f(g); else, we propose to relaunch the decomposition by doing a change of coordinates. This trick allows imposing the positivity constraint and increasing the accuracy of the decomposition.Finally, to take into account the effect of the noise due to the diffusion model, we have introduced a heuristic cleaning that consists in removing all the fiber orientations weighted byλi≤0.1λmax⁡ and merging fibers separated by angle α≤15∘ [20].


## 2.1. Symmetric Fourth Order Tensor Coefficients from the Diffusion Data

The diffusion signalS=(gi,bi) corresponding to the acquisition parameters, gi, bi, is given by the convolution of the CT-FOD function F, modeled by a Cartesian and positive definite symmetric high order tensor of 3 dimensions, with a Watson function Ω [7, 8]:
(1)S(g,b)=Ω(g,b)⊗F(g,b)(2)S(gi,bi)=∫‍Ω(gi,bi,v)F(v)dvΩ(gi,bi,v)=e-biD(giTv)2, with D being the diffusivity coefficient calculated from a 2nd order tensor, that we estimate from a single fiber response having a high fractional anisotropy (FA>0.8); gi is the gradient of magnetic fields, bi stands for the weightsb-values, and v represents a set of unit vectors sampling the diffusion space. Algorithm 1 describes the estimation of unique coefficients of the symmetric tensor FOD from the diffusion data.Algorithm 1
Data: Diffusion signal S(g,b); acquisition parameters
(
g
,
b
); vectors v sampling the unit sphere.
Result: The unique coefficients of the symmetric
positive definite tensor CT-FOD.
(1) Modeling the FOD function by symmetric
cartesian tensor of orderd and dimension 3.
F(g)=∑a+b+c=dCa,b,cg1ag2bg3c                    (i)
withCa,b,c the coefficients of the tensor, and
[g1,g2,g3] the components of the gradient
vectorg.
To impose the positivity constraint, the homogeneous
polynomialF(g) of order d in 3 variables, is
re-parameterized by a sum of squares of polynomials
of orderd/2 according to the Ternary quartics
theorem [8], we notice that in our work d=4:
F(g)=∑j=1Mljp(g1,g2,g3,;cj)2                    (ii)
withlj real and positive weights; cj vectors
containing the coefficients of thedth order rank-1
polynomials constructed from theM unit vectors
v sampling the unit sphere.
(2) By substitutingF(g) given by (ii) in
(2), the signal S can be approximated by
S
^ as following:
S^(gi,bi)≈∑j=1Mlj∫S2‍p(v1,v2,v3,;cj)2×Ω(gi,bi,v)dv      (iii)
cj is constructed for each vector or rank-1
tensorvj=[v1, v2, v3] sampling the unit sphere, and
contains the coefficients of these symmetric fourth
order tensors. The unknowns are then the weights
lj; the values lj are simply obtained by minimizing
the following functional equation E:
E=∑i=1L(SiS0-∑j=1Mlj∫S2‍p(v1,v2,v3,;cj)2×Ω(gi,bi,v)dv)2    (iv)
withlj∈R+, and S normalized.
To ensure the positivity of thelj values,
the problem (iv) is solved using the efficient
constrained optimization algorithm Non Negative
Least Squares (NNLS) [8, 15].
(3) TheN coefficients Ca,b,c of the FOD tensor are
then estimated simply by multiplying the matrixC,
of sizeN×M containing the monomials of the rank-1
symmetric fourth order tensor formed from vectors
c
j, by the resultant vector l of length M.In the following we are interested to decompose symmetric fourth order tensors of dimension 3 (d=4 and n=3).


## 2.2.  Symmetric Tensor Decomposition

Symmetric high order tensors appear mostly as multivariate functions (more than two variables), and high order tensors decomposition allows deducing the geometric and invariance properties of a tensor. Therefore, the tensor decomposition raises interest in many practical domains, first in chemometrics [13] and psychometrics fields and then in electrical engineering and electronics [16], in particular for the antenna array processing [17], or else in telecommunication field [18]. Also, tensor decomposition appears very useful in data analysis and in the arithmetic complexity area [19]. Recently the interest in tensor decompositions has expanded to the neurosciences field; we cite among several applications the use of the symmetric tensor decomposition to the problem of extracting the fiber orientations of the white matter in dMRI. However, to date, in dMRI the decomposition problem is still solved with a low-rank approximation method known as CANDCOMP/PARAFAC (CP).In the following two subsections, we first start by describing the classical CANDECOMP/PARAFAC (CP) method to decompose symmetric high order tensors and then present in detail the Adecomp-SHOT approach we propose to analytically decompose a symmetric tensor of any order and any dimension in a minimal sum of rank-1 terms.


### 2.2.1. Numerical Method: CP Low-Rank Approximation

The tensor decomposition problem consists in writing a given tensor, in sum of outer product of vectors, that is, rank-1 tensor, and that with a minimal number of terms, the number of terms corresponding to the minimal tensor rank. Considering a symmetric tensorT of order d and dimension n, the minimal decomposition of this tensor should be in the following form:
(3)T=∑r=1R‍Vr1∘Vr2∘⋯∘Vrd
with R: the rank of T, “∘”: the outer product, and Vr: the rank-1 tensors (vectors).However, determining the rank of high order tensors (order>2) is a hard mathematical and NP-complet problem. Therefore, a low-rank numerical approximation of the decomposition (4) has been proposed in [13], where the authors approximate the tensor by another tensor whose rank is inferior to the minimal or generic tensor rank; this numerical decomposition method is known as CANDECOMP/PARAFAC (CP):
(4)T^≈∑r=1k‍λr(vr1∘vr2∘⋯∘vrd)
with ∥vr∥ = 1 and λr: the weights of the rank-1 tensors vr.k
<
R is the subgeneric rank of the tensor T, for symmetric tensors vr1=vr2=⋯=vrd. Thus, the CP-decomposition of the tensor T of order d and of an unknown minimal rank R is done by a nonlinear minimization in T^ of (5) for a given subgeneric rank k; the nonlinear minimization problem is solved using the alternating least squares algorithm (ALS):
(5)min⁡T^∥T^-T∥.Inverse Problem. To evaluate the intrinsic behavior of the CP method, we have simulated an inverse problem by generating fourth order symmetric tensors of rank-2 according to (3). These tensors are constructed from two crossing vectors with variable angles from 90∘ to 0∘ and weighted by the same weight λ=0.5. The purpose is the evaluation of both the ability of the method to render the correct solutions and the angular resolution in such ideal case where data perfectly satisfy the decomposition model.The results of the intrinsic study are illustrated in Figure1; Figure 1(a) represents the mean error between the simulated vectors or rank-1 tensors and the CP-decomposition solutions, and Figure 1(b) gives the rank-1 tensors weights found by the CP-decomposition, according to the separation angles.Rank-2 symmetric fourth order. (a) The mean error. (b) The weightsλ of the rank-1 tensors. Horizontal axes (a-b): the separation angles from 90∘ to 0∘.
(a)
(b)From Figure1(a) we notice that although the tensors to decompose are constructed as to satisfy the decomposition model described in (3), the CP-decomposition begins to give an incorrect decomposition when the solutions are separated with small angles (<30∘); thus, Figure 1(b) shows that only one vector of the two simulated is detected with the weights λ1=1 and λ2=0 for crossing angles inferior to 10∘. We conclude that the accuracy and the angular resolution of the CP-decomposition are intrinsically limited. Furthermore, the CP-decomposition has another important limit which is the requirement to predefine the rank of the decomposition.The use of the CP-decomposition algorithm in dMRI to detect the fiber orientations was proposed in 2011 by Jiao et al. [12]. The authors considered an approximation of the decomposition with a low-rank value (rank =2) in order to extract two crossing fiber orientations. The extracted fiber orientations correspond to the rank-1 vectors obtained from the decomposition. Although tensors decomposition is more efficient in terms of angular resolution and accuracy than the traditional maxima localization methods [11, 12], the CP-decomposition could not guarantee the recovering of the whole underlying fiber orientations since the minimal rank of the tensor is not a priori known. Moreover, the convergence of the ALS algorithm is not guaranteed and depends on the initialization.In 2010, Brachat et al. proposed [14] to solve the symmetric high order tensor decomposition problem analytically; in the remainder of the paper we denote this method: Adecomp-SHOT. Rather than the CP numerical approach, the Adecomp-SHOT method gives a minimal decomposition without any apriority. However, to date the Adecomp-SHOT remains theoretical and not yet expanded to the practical issues or evaluated on physical phenomenons. Due to its ability to render a minimal decomposition, we naturally expect that the Adecomp-SHOT applied to the fiber orientations search in dMRI would be more interesting than the CP low-rank approximation method.


### 2.2.2.  Analytical Method: Adecomp-SHOT

The Adecomp-SHOT method initially proposed by the authors Brachat et al. [14] is a generalization of the Sylvesters theorem [14], initially introduced for binary cases and extended to larger dimensions. Thus, the Adecomp-SHOT algorithm is able to decompose a symmetric tensor of any order and any dimension, in a minimal sum of rank-1 terms.Consider a symmetric tensor of orderd and dimension n given in the following polynomial form:
(6)f(x0,x1,…,xn)=∑j0+j1+⋯+jn=d‍Cj0,j1,…,jnx0j0x1j1…xnjn
with f(x0,x1,…,xn)∈Rd a homogenous polynomial of order d in n variables, and Cj0,j1,…,jn the coefficients of the homogenous polynomial f.An affine decomposition off consists in writing f as a sum of dth powers of rank-1 linear forms [14] as follows:
(7)f(X)=∑i=1‍λiKi(X)d,f(X)=λ1K1(X)d+λ2K2(X)d+⋯IIIIIIIIII+λrKr(X)d
with λi representing scalars weights, Ki(X) rank-1 linear forms in X=[x0,x1,…,xn] with the coefficients (ki,0,ki,1,…,ki,n), and r the minimal rank of f, that is, of the tensor.K
i
(
X
) is a rank-1 linear form of n dimensions [14]:
(8)Ki(X)=ki,0·x0+ki,1·x1+⋯+ki,n·xn
with ki,0≠0 for 1≤i≤r.An affine decomposition off exists, if and only if an affine decomposition of f*_ exists; thus, the decomposition of f is equivalent to decomposing f*_; with f* being the linear form associated with f in the dual space Rd*, the coefficients C* of f* are then calculated from the coefficients C of f [14] as follows:
(9)Cj0,j1,…,jn*=j0!j1!…jn!d!×Cj0,j1,…,jn.f*_ is obtained by unhomogenizing f* according to the variable x0; this is done by dividing each monomial of the homogenous polynomial f* by an appropriate power of x0. Thus, f*_ is a nonhomogenous polynomial of degree d.The necessary and sufficient existence conditions of the decomposition are based on the rank conditions of the Hankel matrix and the commutation properties. The Hankel matrix is aN×N matrix with
(10)N=(n+(d-1))!d!(n-1)!.N corresponds to the number of unique coefficients of a d-order symmetric tensor of n dimensions. The elements of the Hankel matrix are computed from the coefficients C* of f*; we note that the elements corresponding to monomials with total degree higher than the polynomial degree d are unknown. We provide an appendix (Appendix section) where we give an example of a step by step decomposition of a 3 dimensional 4th order tensor of rank-4, illustrating how the Adecomp-SHOT algorithm works and particularly we show in Step 2 of the Appendix section how the Hankel matrix is constructed from a homogenous polynomial.To obtain the pointski of (8), we calculate from the Hankel matrix the multiplication matrix Mi as described in Step  5 of Algorithm 2, with i=1,…,r, for a given rank r; then we resolve the generalized eigenvalue problem and we deduce the weights λi by simply resolving a linear system. The readers can refer to the example given in the Appendix section for much more details. The critical part of Algorithm 2 is the step of extending the Hankel matrix, Step  6 of Algorithm 2, to verify the stability of the rank in case of higher ranks. Indeed, when the Hankel matrix is not totally defined, the extension requires finding the unknown parameters h of the Hankel matrix satisfying the commutation properties of the multiplication matrix Ml·Mm-Mm·Ml=∅ with l,m=1,…,n; this leads to solving a nonlinear equations system. Therefore, for higher ranks the uniqueness of the decomposition is not guaranteed.Algorithm 2
Data: An homogenous polynomial f(X) of degree d.
Result: f(X)=∑j=1r‍λjK(X)d with r minimal.
(1) Calculate coefficients off*_∈Rd* from those of
f
∈
R
d.
(2) Construct the Hankel matrixH(N×N) from the
coefficients off*_.
(3)if  all the  (2×2)  minors of  H  are zero  then
r=1 (tensors rank)
else
r=2.
Repeat
(4) Compute fromH a square sub-matrix Δ of
dimension(r×r) corresponding to a monomials
basisB of degree ≤d connected one
of size|B|=r. and its extension Δ+ of dimension
((r+1)×(r+1)) corresponding to
the monomials basisB+ of size |B+|=r+1,
which is the extension ofB.
(5) Compute the matrixΔxi corresponding to
the monomials basisB multiplied by xi for
i=1,…,n and the multiplication matrix
Mi=Δxi(Δ)-1
(6) Find the parametersh such that det⁡(Δ)≠0
and the matrixMi commute.
if  solutionshexistthen
Calculate the rankRΔ of Δ and RΔ+
the rank ofΔ+.
if  RΔ==RΔ+  then
r=RΔ
else
r=r+1; Repeat Step 4.
else
r=r+1; Repeat Step 4.
Until  the eigenvalues of  ∑i=1n‍aiMi  are simples
with arbitrary realai;
(7) Calculate then×r eigenvalues ki,j of the common
eigenvectorsvj of the multiplication matrix Mi such
thatMi·vj=ki,j·vj, i=1,…,n,j=1,…,r.
(8) Then solving the linear system in(λj)j=1,…,r:
f(x0,x1,…,xn)=∑j=1r‍λj(k0,j·x0+⋯+kn,j·xn)d
wherekj are the eigenvalues found in Step 7.Inverse Problem. Once again, we have simulated an inverse problem, this time for the Adecomp-SHOT algorithm; thus, rank-2 fourth order tensors were constructed from a sum of two rank-1 linear forms of order four, as described in (7). We have simulated the same configuration as in Section 2.2.1 by constructing the fourth order tensors from two crossing rank-1 linear forms at varying angles from 90∘ to 0∘ and weighted by the same weight λ=0.5. Our results of the intrinsic study of the analytical decomposition method are thus given in Figure 2.Rank-2 symmetric fourth order. (a) Blue: the mean error. (a) Red: the number of detected rank-1 tensors. (b) The weightsλ of the rank-1 tensors. Horizontal axes (a-b): the separation angles from 90∘ to 0∘.
(a)
(b)Contrarily to the CP-decomposition, the analytical approach clearly renders the correct decomposition whatever the separation angles. As shown in Figure2(a) the obtained mean error is zero, and the two rank-1 tensors are recovered with the correct weights λ1=λ2=0.5 as represented in Figure 2(b). Furthermore, the analytical decomposition is minimal; that is, the rank of the tensor is automatically found without any assumption such that it is required for the CP-decomposition. To confirm the ability of the method to give always a minimal decomposition regardless of the rank of the tensor, further tests on higher rank tensor have been conducted; Figure 3 shows the results of decomposing a rank-3 symmetric fourth order tensor constructed from 3 crossing rank-1 tensors, according to (7), at angles decreasing from 90∘ to 0∘. Figure 3 shows that the Adecomp-SHOT method gives once again a correct decomposition with a zero mean error whatever the separation angles between the 3 origin rank-1 tensors. Other tests on symmetric fourth order tensors of rank-4 and rank-5 have been conducted; the results of these experiences show that the Adecomp-SHOT method still gives the correct decomposition in case of rank-4 while for a rank-5 fourth order tensors the decomposition is found with insignificant angular error not exceeding 0.5∘. However, by increasing the order of the tensor from 4 to 6 the error drops to zero.Rank-3 symmetric fourth order. (a) Blue: the mean error. (a) Red: the number of detected rank-1 tensors. (b) The weightsλ of the rank-1 tensors. Horizontal axes (a-b): the separation angles from 90∘ to 0∘.
(a)
(b)


## 2.2.1. Numerical Method: CP Low-Rank Approximation

The tensor decomposition problem consists in writing a given tensor, in sum of outer product of vectors, that is, rank-1 tensor, and that with a minimal number of terms, the number of terms corresponding to the minimal tensor rank. Considering a symmetric tensorT of order d and dimension n, the minimal decomposition of this tensor should be in the following form:
(3)T=∑r=1R‍Vr1∘Vr2∘⋯∘Vrd
with R: the rank of T, “∘”: the outer product, and Vr: the rank-1 tensors (vectors).However, determining the rank of high order tensors (order>2) is a hard mathematical and NP-complet problem. Therefore, a low-rank numerical approximation of the decomposition (4) has been proposed in [13], where the authors approximate the tensor by another tensor whose rank is inferior to the minimal or generic tensor rank; this numerical decomposition method is known as CANDECOMP/PARAFAC (CP):
(4)T^≈∑r=1k‍λr(vr1∘vr2∘⋯∘vrd)
with ∥vr∥ = 1 and λr: the weights of the rank-1 tensors vr.k
<
R is the subgeneric rank of the tensor T, for symmetric tensors vr1=vr2=⋯=vrd. Thus, the CP-decomposition of the tensor T of order d and of an unknown minimal rank R is done by a nonlinear minimization in T^ of (5) for a given subgeneric rank k; the nonlinear minimization problem is solved using the alternating least squares algorithm (ALS):
(5)min⁡T^∥T^-T∥.Inverse Problem. To evaluate the intrinsic behavior of the CP method, we have simulated an inverse problem by generating fourth order symmetric tensors of rank-2 according to (3). These tensors are constructed from two crossing vectors with variable angles from 90∘ to 0∘ and weighted by the same weight λ=0.5. The purpose is the evaluation of both the ability of the method to render the correct solutions and the angular resolution in such ideal case where data perfectly satisfy the decomposition model.The results of the intrinsic study are illustrated in Figure1; Figure 1(a) represents the mean error between the simulated vectors or rank-1 tensors and the CP-decomposition solutions, and Figure 1(b) gives the rank-1 tensors weights found by the CP-decomposition, according to the separation angles.Rank-2 symmetric fourth order. (a) The mean error. (b) The weightsλ of the rank-1 tensors. Horizontal axes (a-b): the separation angles from 90∘ to 0∘.
(a)
(b)From Figure1(a) we notice that although the tensors to decompose are constructed as to satisfy the decomposition model described in (3), the CP-decomposition begins to give an incorrect decomposition when the solutions are separated with small angles (<30∘); thus, Figure 1(b) shows that only one vector of the two simulated is detected with the weights λ1=1 and λ2=0 for crossing angles inferior to 10∘. We conclude that the accuracy and the angular resolution of the CP-decomposition are intrinsically limited. Furthermore, the CP-decomposition has another important limit which is the requirement to predefine the rank of the decomposition.The use of the CP-decomposition algorithm in dMRI to detect the fiber orientations was proposed in 2011 by Jiao et al. [12]. The authors considered an approximation of the decomposition with a low-rank value (rank =2) in order to extract two crossing fiber orientations. The extracted fiber orientations correspond to the rank-1 vectors obtained from the decomposition. Although tensors decomposition is more efficient in terms of angular resolution and accuracy than the traditional maxima localization methods [11, 12], the CP-decomposition could not guarantee the recovering of the whole underlying fiber orientations since the minimal rank of the tensor is not a priori known. Moreover, the convergence of the ALS algorithm is not guaranteed and depends on the initialization.In 2010, Brachat et al. proposed [14] to solve the symmetric high order tensor decomposition problem analytically; in the remainder of the paper we denote this method: Adecomp-SHOT. Rather than the CP numerical approach, the Adecomp-SHOT method gives a minimal decomposition without any apriority. However, to date the Adecomp-SHOT remains theoretical and not yet expanded to the practical issues or evaluated on physical phenomenons. Due to its ability to render a minimal decomposition, we naturally expect that the Adecomp-SHOT applied to the fiber orientations search in dMRI would be more interesting than the CP low-rank approximation method.


## 2.2.2.  Analytical Method: Adecomp-SHOT

The Adecomp-SHOT method initially proposed by the authors Brachat et al. [14] is a generalization of the Sylvesters theorem [14], initially introduced for binary cases and extended to larger dimensions. Thus, the Adecomp-SHOT algorithm is able to decompose a symmetric tensor of any order and any dimension, in a minimal sum of rank-1 terms.Consider a symmetric tensor of orderd and dimension n given in the following polynomial form:
(6)f(x0,x1,…,xn)=∑j0+j1+⋯+jn=d‍Cj0,j1,…,jnx0j0x1j1…xnjn
with f(x0,x1,…,xn)∈Rd a homogenous polynomial of order d in n variables, and Cj0,j1,…,jn the coefficients of the homogenous polynomial f.An affine decomposition off consists in writing f as a sum of dth powers of rank-1 linear forms [14] as follows:
(7)f(X)=∑i=1‍λiKi(X)d,f(X)=λ1K1(X)d+λ2K2(X)d+⋯IIIIIIIIII+λrKr(X)d
with λi representing scalars weights, Ki(X) rank-1 linear forms in X=[x0,x1,…,xn] with the coefficients (ki,0,ki,1,…,ki,n), and r the minimal rank of f, that is, of the tensor.K
i
(
X
) is a rank-1 linear form of n dimensions [14]:
(8)Ki(X)=ki,0·x0+ki,1·x1+⋯+ki,n·xn
with ki,0≠0 for 1≤i≤r.An affine decomposition off exists, if and only if an affine decomposition of f*_ exists; thus, the decomposition of f is equivalent to decomposing f*_; with f* being the linear form associated with f in the dual space Rd*, the coefficients C* of f* are then calculated from the coefficients C of f [14] as follows:
(9)Cj0,j1,…,jn*=j0!j1!…jn!d!×Cj0,j1,…,jn.f*_ is obtained by unhomogenizing f* according to the variable x0; this is done by dividing each monomial of the homogenous polynomial f* by an appropriate power of x0. Thus, f*_ is a nonhomogenous polynomial of degree d.The necessary and sufficient existence conditions of the decomposition are based on the rank conditions of the Hankel matrix and the commutation properties. The Hankel matrix is aN×N matrix with
(10)N=(n+(d-1))!d!(n-1)!.N corresponds to the number of unique coefficients of a d-order symmetric tensor of n dimensions. The elements of the Hankel matrix are computed from the coefficients C* of f*; we note that the elements corresponding to monomials with total degree higher than the polynomial degree d are unknown. We provide an appendix (Appendix section) where we give an example of a step by step decomposition of a 3 dimensional 4th order tensor of rank-4, illustrating how the Adecomp-SHOT algorithm works and particularly we show in Step 2 of the Appendix section how the Hankel matrix is constructed from a homogenous polynomial.To obtain the pointski of (8), we calculate from the Hankel matrix the multiplication matrix Mi as described in Step  5 of Algorithm 2, with i=1,…,r, for a given rank r; then we resolve the generalized eigenvalue problem and we deduce the weights λi by simply resolving a linear system. The readers can refer to the example given in the Appendix section for much more details. The critical part of Algorithm 2 is the step of extending the Hankel matrix, Step  6 of Algorithm 2, to verify the stability of the rank in case of higher ranks. Indeed, when the Hankel matrix is not totally defined, the extension requires finding the unknown parameters h of the Hankel matrix satisfying the commutation properties of the multiplication matrix Ml·Mm-Mm·Ml=∅ with l,m=1,…,n; this leads to solving a nonlinear equations system. Therefore, for higher ranks the uniqueness of the decomposition is not guaranteed.Algorithm 2
Data: An homogenous polynomial f(X) of degree d.
Result: f(X)=∑j=1r‍λjK(X)d with r minimal.
(1) Calculate coefficients off*_∈Rd* from those of
f
∈
R
d.
(2) Construct the Hankel matrixH(N×N) from the
coefficients off*_.
(3)if  all the  (2×2)  minors of  H  are zero  then
r=1 (tensors rank)
else
r=2.
Repeat
(4) Compute fromH a square sub-matrix Δ of
dimension(r×r) corresponding to a monomials
basisB of degree ≤d connected one
of size|B|=r. and its extension Δ+ of dimension
((r+1)×(r+1)) corresponding to
the monomials basisB+ of size |B+|=r+1,
which is the extension ofB.
(5) Compute the matrixΔxi corresponding to
the monomials basisB multiplied by xi for
i=1,…,n and the multiplication matrix
Mi=Δxi(Δ)-1
(6) Find the parametersh such that det⁡(Δ)≠0
and the matrixMi commute.
if  solutionshexistthen
Calculate the rankRΔ of Δ and RΔ+
the rank ofΔ+.
if  RΔ==RΔ+  then
r=RΔ
else
r=r+1; Repeat Step 4.
else
r=r+1; Repeat Step 4.
Until  the eigenvalues of  ∑i=1n‍aiMi  are simples
with arbitrary realai;
(7) Calculate then×r eigenvalues ki,j of the common
eigenvectorsvj of the multiplication matrix Mi such
thatMi·vj=ki,j·vj, i=1,…,n,j=1,…,r.
(8) Then solving the linear system in(λj)j=1,…,r:
f(x0,x1,…,xn)=∑j=1r‍λj(k0,j·x0+⋯+kn,j·xn)d
wherekj are the eigenvalues found in Step 7.Inverse Problem. Once again, we have simulated an inverse problem, this time for the Adecomp-SHOT algorithm; thus, rank-2 fourth order tensors were constructed from a sum of two rank-1 linear forms of order four, as described in (7). We have simulated the same configuration as in Section 2.2.1 by constructing the fourth order tensors from two crossing rank-1 linear forms at varying angles from 90∘ to 0∘ and weighted by the same weight λ=0.5. Our results of the intrinsic study of the analytical decomposition method are thus given in Figure 2.Rank-2 symmetric fourth order. (a) Blue: the mean error. (a) Red: the number of detected rank-1 tensors. (b) The weightsλ of the rank-1 tensors. Horizontal axes (a-b): the separation angles from 90∘ to 0∘.
(a)
(b)Contrarily to the CP-decomposition, the analytical approach clearly renders the correct decomposition whatever the separation angles. As shown in Figure2(a) the obtained mean error is zero, and the two rank-1 tensors are recovered with the correct weights λ1=λ2=0.5 as represented in Figure 2(b). Furthermore, the analytical decomposition is minimal; that is, the rank of the tensor is automatically found without any assumption such that it is required for the CP-decomposition. To confirm the ability of the method to give always a minimal decomposition regardless of the rank of the tensor, further tests on higher rank tensor have been conducted; Figure 3 shows the results of decomposing a rank-3 symmetric fourth order tensor constructed from 3 crossing rank-1 tensors, according to (7), at angles decreasing from 90∘ to 0∘. Figure 3 shows that the Adecomp-SHOT method gives once again a correct decomposition with a zero mean error whatever the separation angles between the 3 origin rank-1 tensors. Other tests on symmetric fourth order tensors of rank-4 and rank-5 have been conducted; the results of these experiences show that the Adecomp-SHOT method still gives the correct decomposition in case of rank-4 while for a rank-5 fourth order tensors the decomposition is found with insignificant angular error not exceeding 0.5∘. However, by increasing the order of the tensor from 4 to 6 the error drops to zero.Rank-3 symmetric fourth order. (a) Blue: the mean error. (a) Red: the number of detected rank-1 tensors. (b) The weightsλ of the rank-1 tensors. Horizontal axes (a-b): the separation angles from 90∘ to 0∘.
(a)
(b)


## 2.3.  Fiber Directions from Diffusion Data Using the Analytical Decomposition of Fourth Order Tensor

In this section we propose to extract the fibers orientations from the dMRI signal by decomposing analytically the three dimensional fourth order CT-FOD using the Adecomp-SHOT. The coefficients of the fourth order FOD are estimated from the dMRI data as described in Section2.1. Thus, we are interested to decompose the Cartesian FOD tensor in sum of powers of rank-1 linear forms:
(11)f(g)=∑i=1r‍λiKi(g)4
with r minimal representing the tensor rank; Ki are rank-1 linear forms in 3 variables with the real normalized coefficients [ki,0,ki,1,ki,2], and λi are the real positive weights.The normalized coefficients ofKi represent the Cartesian coordinates of the fibers orientations, weighted by the scalar λi, and r represents the number of crossing fibers bundles in each voxel.However, as described in Section2.2.2 the affine decomposition of a homogenous polynomial of any order and any dimension is done assuming that all coefficients of the first Cartesian coordinate in the decomposition are nonzero; that is, ki,0≠0, for 1≤i≤r, with r the tensor rank. This constraint implies that only fiber orientations whose first coordinate coefficient is nonzero can be detected. To avoid missing fiber orientations, we propose to introduce a coordinate changing in case where maxima are located in undetectable area. Also, not doing this coordinate transformation systematically and imposing a stopping criterion, we propose to make a first exhaustive search on the FOD by discretizing it on unit sphere and then localize roughly its maxima. A given FOD function f(g), with g the gradient of the magnetic field, can be discretized on units sphere as follows:
(12)f(g)=∑j=1N′‍pjfj(v1j,v2j,v3j)
with N′ the number of samples; pjfj is a rank-1 fourth order tensor constructed in the orientation (v1j,v2j,v3j) and represents the value of the FOD in this orientation, and the 3 dimensional unit vectors vj are obtained by a uniform tessellation of unit sphere. Thus, the pj are found by solving the linear system B=WP, with W representing a vector of N′ weights pj, B vectors of 15 unique coefficients of the fourth order tensor FOD and P a (15×N′) matrix; P contains the 15 unique coefficients of the N′ rank-1 fourth order tensor constructed from unit vectors v. Once the FOD is discretized, we check the first coordinate of the FOD values weighted by pj<(0.5×pmax⁡) corresponding to the FOD lobes, and we make a coordinate changing before decomposing the tensor if these coordinates are close to zero. Obviously, after decomposition, the inverse coordinate transformation is required to bring back the resulted rank-1 tensor to the origin coordinate system. In order to preserve the angles between two vectors and their lengths, the transformation matrix should be orthogonal. Therefore, to preserve the fiber orientations we use a rotation transformation; considering the initial coordinates or variables X=[x0,x1,…,xn], X′=[x0′,x1′,…,xn′] is obtained from X by the following linear transformation:
(13)x0′=a11x0+a12x1+⋯+a1nxnx1′=a21x0+a22x1+⋯+a2nxniiiiiiiiiiiiiiiiii⋮xn′=an1x0+an2x1+⋯+annxnX′=M×X
As mentioned, the matrix M is an orthogonal matrix or a rotation matrix. This coordinate transformation can be done either on the homogenous polynomial as a change of variable using a rotation transformation or simply by rotating the fourth order tensor coefficients. This coordinate transformation insures recovering the entire crossing fibers whatever its locations in the Cartesian space.The Adecomp-SHOT as initially described in [14] would provide a minimal decomposition with a minimal analytical rank, without any constraints on the weights λi or Ki values; in theory this is not a problem, but when we are interested in detecting the fibers orientations, negatives values for the weights or complexes coefficients do not correspond to any physical meaning. To overcome this limit, we propose ignoring the Ki with complexes coefficients found at Step  7 of Algorithm 2 and then solve the linear system (14) with only the linear forms Ki with real coefficients:
(14)f(g)≈∑i=1r′‍λiKi(g)4r′≤r represents the tensor rank and Ki∈R4. This linear system can be written as a matrix equation B=WA, with W a vector of length r′ containing the fibers weights λi and A is a (r′×15) matrix containing the polynomials coefficients of the rank-1 linear forms Ki(g)4 of order 4 and B is a vector of length 15 containing the coefficients of the fourth order fiber orientation distribution function f(g). To impose the positivity constraint on the weights λi values, we propose to solve the minimization problem 2.17 using the well-known Lawson and Hansons NNLS algorithm [15]:
(15)min⁡w∥B-WA∥2.
However, to verify that a set of λi>0 such that f(g)≈∑i=1r′‍λiKi(g)4 exists we check the norm ∥B-WA∥2; if the residual norm is less than 1, we assert that it is sufficient to consider the resulted decomposition accurately and the Ki weighted by λi>0 correspond to the maxima of f(g); else, we propose to relaunch the decomposition by doing a change of coordinates. This trick allows imposing the positivity constraint and increasing the accuracy of the decomposition.Finally, to take into account the effect of the noise due to the diffusion model, we have introduced a heuristic cleaning that consists in removing all the fiber orientations weighted byλi≤0.1λmax⁡ and merging fibers separated by angle α≤15∘ [20].


## 3. Results and Discussion

To validate our proposed crossing fibers detection method, we conduct many tests, first on synthetic diffusion dataset simulated with a multitensor model with 60 gradient directions and ab-value of 3000 s/mm2; these data represent crossing fibers with variable separating angles from 90∘ to 0∘. On these synthetic diffusion data we have compared our method to other methods in literature such as CP-decomposition based method and the Z-eigenvalues based approach; the results of this comparison are illustrated in Figure 4. Then, the synthetic dataset is corrupted with a rician noise of different signal to noise ratio (SNR = 40, 30, 20, and 10); 100 trials of noise are performed for each SNR level and for each separating angle; the results of the effect of a rician noise are presented in Figures 5 and 6 and Table 1. Finally, our method is tested on phantom and onin vivo human brain diffusion data as illustrated in Figures 7 and 8.Table 1
Success rate (%) in detecting the number of crossing fiber bundles, results of 100 simulations of noise for each crossing angle and for each SNR level.
Separation angle
9
0
∘
8
4
∘
7
8
∘
7
2
∘
6
6
∘
6
0
∘
5
4
∘
4
8
∘
4
2
∘
3
6
∘
3
0
∘
SNR
Method
40
Adecomp-SHOT
100%
100%
100%
100%
100%
100%
100%
100%
100%
68%
3%
CP-decomp.
100%
100%
100%
100%
100%
100%
100%
100%
100%
61%
1%
Z-eigenvalues
100%
100%
99%
99%
90%
11%
0%
30
Adecomp-SHOT
100%
100%
100%
100%
100%
100%
100%
100%
95%
41%
4%
CP-decomp
100%
100%
100%
100%
100%
100%
100%
100%
94%
39%
3%
Z-eigenvalues
100%
100%
98%
100%
74%
11%
0%
20
Adecomp-SHOT
99%
99%
99%
99%
98%
99%
98%
99%
77%
33%
8%
CP-decomp
100%
100%
100%
100%
100%
100%
100%
99%
74%
34%
4%
Z-eigenvalues
99%
100%
100%
99%
72%
24%
0%
10
Adecomp-SHOT
96%
82%
88%
82%
80%
81%
72%
67%
54%
36%
27%
CP-decomp
100%
100%
100%
100%
100%
100%
99%
92%
80%
67%
55%
Z-eigenvalues
100%
99%
98%
95%
73%
47%
0%Free-noise synthetic diffusion data: (a) solid lines: mean error in degree; (a) black dot: the number of detected fibers by the Adecomp-SHOT based approach. (b) The weightsλ. (a-b) Red: the Z-eigenvalues based approach; green: the CP-decomposition based approach; blue: the Adecomp-SHOT based approach. Horizontal axes (a-b) represent the separation angles from 90∘ to 0∘.
(a)
(b)Noisy synthetic data with SNR 40 and 30: (a, b, and c) SNR 40 and (d, e, and f) SNR 30. (a, d) The mean and the standard deviation of the mean error; (b, e) the mean and the standard deviation of the fiber weightsλ; (c, f) the mean and the standard deviation of the number of detected fibers. Horizontal axes (a–f) the separation angles from 90∘ to 0∘.
(a)
(b)
(c)
(d)
(e)
(f)Noisy synthetic data with SNR 20 and 10: (a, b, and c) SNR 20 and (d, e, and f): SNR 10. (a, d) The mean and the standard deviation of the mean error; (b, e) the mean and the standard deviation of the fiber weightsλ; (c, f) the mean and the standard deviation of the number of detected fibers. Horizontal axes (a–f) the separation angles from 90∘ to 0∘.
(a)
(b)
(c)
(d)
(e)
(f)(a) Fourth order CT-FODs reconstructed from FiberCup data. (b) Fiber directions corresponding to the fourth order CT-FODs maxima extracted using the Adecomp-SHOT based approach.
(a)
(b)(a) Fourth order CT-FODs are reconstructed fromin vivo human cerebral dataset and represent the Corpus Collum (CC), the Corticospinal Tract (CST), the Cingulum (CG), and the Superior Longitudinal Fasciculus (SLF) on a coronal slice; the CT-FODs are superposed on the raw diffusion signal. (b) represents the fiber directions (colored according to their directions) extracted using the Adecomp-SHOT based approach. Yellow and red highlighted areas are, respectively, zoomed in (c) and (d).
(a)
(b)
(c)
(d)


### 3.1. Validations on Synthetic Diffusion Dataset

Comparison with CP-Decomposition and Z-Eigenvalues Based Approaches. In order to compare the angular resolution of our fiber extraction approach to the one of the CP-decomposition and the Z-eigenvalues based methods, we have conducted experiments on same noise-free synthetic diffusion dataset. From these data we reconstruct the fourth order CT-FODs and then we extract the maxima of the CT-FODs using the CP-decomposition, the Z-eigenvalues approach, and our proposed Adecomp-SHOT based approach. As it is required by the CP-decomposition, to decompose the fourth order CT-FOD we set the low-rank of the decomposition approximation to 2; that is, we assume that we know the number of fibers in the voxel. We recall that rather than the CP-decomposition our Adecomp-SHOT based approach does not require predefining the rank of the decomposition, that is, not require knowing a priori the number of fibers in the voxel. Moreover, to insure roughly the convergence of the ALS algorithm used by PARAFAC we initialize it by the eigenvectors of each mode of the fourth order tensor. This initialization is possible only for lower ranks up to 3, because the tensor is of dimension 3 and contains only 3 modes; for higher ranks, the initialization will be random which do not insure the convergence of the algorithm.Figure4 illustrates the results obtained by the CP-decomposition, the Z-eigenvectors, and the Adecomp-SHOT based approach. From Figure 4 we clearly notice that the tensor decomposition methods have a better angular resolution than the Z-eigenvalues classical method which is not able to recover crossing fibers orientations at angles below 60∘. The results show too that if we assume that the number of fibers is a priori known, then both of CP-decomposition and Adecomp-SHOT based method are equivalent in terms of angular resolution and accuracy. Nevertheless, the CP-decomposition remains limited by the constraint of predefining the rank and by the convergence of the ALS algorithm. The proposed Adecomp-SHOT based approach efficiently solves these problems without loss of angular resolution or accuracy. With an order of tensors not exceeding four and without predefining the number of fibers in a voxel, the fiber orientations are recovered with an angular resolution limit of 30∘ and a mean error less than 4∘ up to separation angles of 36∘.The Effect of a Rician Noise. The most important aspect of the Adecomp-SHOT based method is its ability to render the number of fibers automatically without any assumption; therefore, we evaluate in 100 experiences on noisy synthetic data the success rate of our approach in detecting the number of crossing fiber bundles for different crossing angles. The synthetic data are corrupted with a Rician noise with different SNR levels of 40, 30, 20, and 10; the results are summarized in Table 1. Furthermore, in order to compare our results with the state-of-the-art, we conduct the same experiences for each of the CP-decomposition and the Z-eigenvalue approaches. The results in Table 1 show that up to a crossing angle of 48∘ in case of SNR 30 the success rate of our method is of 100%; this rate slightly decreases for a crossing angle of 42∘ where the correct number of fibers is rendered at 95%, and for a crossing angle of 36∘ the success rate is of 41%. Notice that, even in case of low signal to noise ratio SNR = 20, the correct number of fibers is found with a rate of 99% up to crossing angle of 48∘, and for a really low SNR level of 10 the success rate is higher than 72% up to a separation angle of 54∘. These results prove that the ability of the Adecomp-SHOT method to find automatically the number of fibers is not highly sensitive to noise. Thus, our Adecomp-SHOT based method is really reliable when we aim to detect the number of underlying fibers, even in case of really low SNR levels. For comparison, results about the number of fibers rendered by the CP and the Z-eigenvalues methods are too represented in Table 1; we can notice from these results that even if the number of fibers is automatically recovered by the Adecomp-SHOT approach, the success rate does not highly differ from the success rate of the CP-decomposition where the number of fibers constitutes an input parameter.To evaluate the effect of noise on the accuracy of our Adecomp-SHOT based approach we represent on the left column of Figures5 and 6 the mean and the standard deviation of the mean error between the recovered fiber orientations and the ground truth fiber orientations, corresponding to different SNR levels, and on the right column of Figures 5 and 6 we represent the mean and standard deviation of the fiber weights λ; figures on the center column of Figures 5 and 6 represent the mean and the standard deviation of the number of detected fibers. Once again, in order to compare our approach to other classical and state-of-the-art methods, results for each of our Adecomp-SHOT based approach CP and Z-eigenvalues approaches are illustrated on Figures 5 and 6. As in the free-noise case, Figures 4(a) and 4(b), for SNR = 40, Figures 5(a)–5(c), the method recovers effectively the entire simulated fiber orientations with an angular resolution limit equal to 30∘ and up to a separation angle of 36∘ the two crossing fibers are detected with a slight increase in the mean error but the mean of the mean error remains less than 9∘ as it is shown by Figure 5(a). While, for SNR 30, Figures 5(d)–5(f), the angular resolution limit is somewhat reduced and its value is between 36∘ and 30∘ with a mean of the mean error not exceeding 8∘ for a separating angle of 42∘ as shown in Figure 5(d); we notice that even when the SNR level equals 30, the angular resolution limit is still better than the angular resolution limit of the classical maxima localization methods in the free-noise case. For a low signal to noise ratio of 20, Figures 6(a)–6(c), the method still recovers the fiber orientations with an angular limit between 36∘ and 42∘ and the mean error remains inferior to 8∘ for a crossing angle of 48∘. Up to SNR level of 20 the results of each of the Adecomp-SHOT and CP methods are equivalent in terms of angular resolution and accuracy if we assume the number of fiber known. Concerning the Z-eigenvalues approach, the results on Figure 5 confirm that even in case of a high SNR level the Z-eigenvalues method clearly fails to recovers crossing fiber orientations when the separation angle is lower than 60∘. Furthermore, additional tests are performed with really low SNR level of 10 to evaluate much more the robustness to noise. The results are represented in Figures 6(d)–6(f) and show that in case of SNR 10 the angular resolution of our method is between 48∘ and 54∘ where the correct number of fibers is rendered at more than 67% (Table 1) with a mean of the mean error not exceeding 16∘ for a separation angle of 48∘ while for the same separation angle the CP-decomposition method has a mean of the mean error higher than 21∘. These results prove that our proposed Adecomp-SHOT based approach is effective and robust to noise.


### 3.2. Phantom Diffusion Dataset

We conduct other experiments on the FiberCup phantom data acquired atb=2000 s/mm2 with 64 acquisitions [21, 22] downloaded from the computer-assisted neuroimaging laboratory (LNAO) link: http://www.lnao.fr/spip.php?article112. The fourth order tensor is estimated from the phantom data using the CT-FOD algorithm and represented by spherical function in Figure 7(a). The recovered fiber directions are plotted on Figure 7(b). The results show that our Adecomp-SHOT based approach is able to render the fiber bundle directions.


### 3.3.In Vivo Human Cerebral Dataset

We conduct further tests, on real dataset obtained from the Stanford University [23] link: http://purl.stanford.edu/yx282xq2090. These data were acquired with 160 gradient directions with a b-value of 2000 s/mm2; the thickness of slice is 2 mm. The CT-FODs of fourth order are estimated from these data and decomposed with the Adecomp-SHOT; Figures 8(a) and 8(b) show the fourth order CT-FODs and the fiber directions, respectively. On a coronal slice, Figure 8 shows that the method reliably extracts the Corpus Collum (CC), the Corticospinal Tractu (CST), the Cingulum (CG), and the Superior Longitudinal Fasciculus (SLF). Two regions representing the CC, CST, and SLF intersections are highlighted on Figures 8(c) and 8(d) and show the ability of our approach to extract crossing fibers with a high angular resolution.


## 3.1. Validations on Synthetic Diffusion Dataset

Comparison with CP-Decomposition and Z-Eigenvalues Based Approaches. In order to compare the angular resolution of our fiber extraction approach to the one of the CP-decomposition and the Z-eigenvalues based methods, we have conducted experiments on same noise-free synthetic diffusion dataset. From these data we reconstruct the fourth order CT-FODs and then we extract the maxima of the CT-FODs using the CP-decomposition, the Z-eigenvalues approach, and our proposed Adecomp-SHOT based approach. As it is required by the CP-decomposition, to decompose the fourth order CT-FOD we set the low-rank of the decomposition approximation to 2; that is, we assume that we know the number of fibers in the voxel. We recall that rather than the CP-decomposition our Adecomp-SHOT based approach does not require predefining the rank of the decomposition, that is, not require knowing a priori the number of fibers in the voxel. Moreover, to insure roughly the convergence of the ALS algorithm used by PARAFAC we initialize it by the eigenvectors of each mode of the fourth order tensor. This initialization is possible only for lower ranks up to 3, because the tensor is of dimension 3 and contains only 3 modes; for higher ranks, the initialization will be random which do not insure the convergence of the algorithm.Figure4 illustrates the results obtained by the CP-decomposition, the Z-eigenvectors, and the Adecomp-SHOT based approach. From Figure 4 we clearly notice that the tensor decomposition methods have a better angular resolution than the Z-eigenvalues classical method which is not able to recover crossing fibers orientations at angles below 60∘. The results show too that if we assume that the number of fibers is a priori known, then both of CP-decomposition and Adecomp-SHOT based method are equivalent in terms of angular resolution and accuracy. Nevertheless, the CP-decomposition remains limited by the constraint of predefining the rank and by the convergence of the ALS algorithm. The proposed Adecomp-SHOT based approach efficiently solves these problems without loss of angular resolution or accuracy. With an order of tensors not exceeding four and without predefining the number of fibers in a voxel, the fiber orientations are recovered with an angular resolution limit of 30∘ and a mean error less than 4∘ up to separation angles of 36∘.The Effect of a Rician Noise. The most important aspect of the Adecomp-SHOT based method is its ability to render the number of fibers automatically without any assumption; therefore, we evaluate in 100 experiences on noisy synthetic data the success rate of our approach in detecting the number of crossing fiber bundles for different crossing angles. The synthetic data are corrupted with a Rician noise with different SNR levels of 40, 30, 20, and 10; the results are summarized in Table 1. Furthermore, in order to compare our results with the state-of-the-art, we conduct the same experiences for each of the CP-decomposition and the Z-eigenvalue approaches. The results in Table 1 show that up to a crossing angle of 48∘ in case of SNR 30 the success rate of our method is of 100%; this rate slightly decreases for a crossing angle of 42∘ where the correct number of fibers is rendered at 95%, and for a crossing angle of 36∘ the success rate is of 41%. Notice that, even in case of low signal to noise ratio SNR = 20, the correct number of fibers is found with a rate of 99% up to crossing angle of 48∘, and for a really low SNR level of 10 the success rate is higher than 72% up to a separation angle of 54∘. These results prove that the ability of the Adecomp-SHOT method to find automatically the number of fibers is not highly sensitive to noise. Thus, our Adecomp-SHOT based method is really reliable when we aim to detect the number of underlying fibers, even in case of really low SNR levels. For comparison, results about the number of fibers rendered by the CP and the Z-eigenvalues methods are too represented in Table 1; we can notice from these results that even if the number of fibers is automatically recovered by the Adecomp-SHOT approach, the success rate does not highly differ from the success rate of the CP-decomposition where the number of fibers constitutes an input parameter.To evaluate the effect of noise on the accuracy of our Adecomp-SHOT based approach we represent on the left column of Figures5 and 6 the mean and the standard deviation of the mean error between the recovered fiber orientations and the ground truth fiber orientations, corresponding to different SNR levels, and on the right column of Figures 5 and 6 we represent the mean and standard deviation of the fiber weights λ; figures on the center column of Figures 5 and 6 represent the mean and the standard deviation of the number of detected fibers. Once again, in order to compare our approach to other classical and state-of-the-art methods, results for each of our Adecomp-SHOT based approach CP and Z-eigenvalues approaches are illustrated on Figures 5 and 6. As in the free-noise case, Figures 4(a) and 4(b), for SNR = 40, Figures 5(a)–5(c), the method recovers effectively the entire simulated fiber orientations with an angular resolution limit equal to 30∘ and up to a separation angle of 36∘ the two crossing fibers are detected with a slight increase in the mean error but the mean of the mean error remains less than 9∘ as it is shown by Figure 5(a). While, for SNR 30, Figures 5(d)–5(f), the angular resolution limit is somewhat reduced and its value is between 36∘ and 30∘ with a mean of the mean error not exceeding 8∘ for a separating angle of 42∘ as shown in Figure 5(d); we notice that even when the SNR level equals 30, the angular resolution limit is still better than the angular resolution limit of the classical maxima localization methods in the free-noise case. For a low signal to noise ratio of 20, Figures 6(a)–6(c), the method still recovers the fiber orientations with an angular limit between 36∘ and 42∘ and the mean error remains inferior to 8∘ for a crossing angle of 48∘. Up to SNR level of 20 the results of each of the Adecomp-SHOT and CP methods are equivalent in terms of angular resolution and accuracy if we assume the number of fiber known. Concerning the Z-eigenvalues approach, the results on Figure 5 confirm that even in case of a high SNR level the Z-eigenvalues method clearly fails to recovers crossing fiber orientations when the separation angle is lower than 60∘. Furthermore, additional tests are performed with really low SNR level of 10 to evaluate much more the robustness to noise. The results are represented in Figures 6(d)–6(f) and show that in case of SNR 10 the angular resolution of our method is between 48∘ and 54∘ where the correct number of fibers is rendered at more than 67% (Table 1) with a mean of the mean error not exceeding 16∘ for a separation angle of 48∘ while for the same separation angle the CP-decomposition method has a mean of the mean error higher than 21∘. These results prove that our proposed Adecomp-SHOT based approach is effective and robust to noise.


## 3.2. Phantom Diffusion Dataset

We conduct other experiments on the FiberCup phantom data acquired atb=2000 s/mm2 with 64 acquisitions [21, 22] downloaded from the computer-assisted neuroimaging laboratory (LNAO) link: http://www.lnao.fr/spip.php?article112. The fourth order tensor is estimated from the phantom data using the CT-FOD algorithm and represented by spherical function in Figure 7(a). The recovered fiber directions are plotted on Figure 7(b). The results show that our Adecomp-SHOT based approach is able to render the fiber bundle directions.


## 3.3.In Vivo Human Cerebral Dataset

We conduct further tests, on real dataset obtained from the Stanford University [23] link: http://purl.stanford.edu/yx282xq2090. These data were acquired with 160 gradient directions with a b-value of 2000 s/mm2; the thickness of slice is 2 mm. The CT-FODs of fourth order are estimated from these data and decomposed with the Adecomp-SHOT; Figures 8(a) and 8(b) show the fourth order CT-FODs and the fiber directions, respectively. On a coronal slice, Figure 8 shows that the method reliably extracts the Corpus Collum (CC), the Corticospinal Tractu (CST), the Cingulum (CG), and the Superior Longitudinal Fasciculus (SLF). Two regions representing the CC, CST, and SLF intersections are highlighted on Figures 8(c) and 8(d) and show the ability of our approach to extract crossing fibers with a high angular resolution.


## 4.  Conclusion

In this paper, we have proposed an Adecomp-SHOT based approach to extract the fiber directions from DW-MRI data. Till now, the CP-decomposition approach constitutes the state-of-the-art of the tensor decomposition applied to the fiber directions search in dMRI. Although the CP-decomposition method provides a better angular resolution and accuracy than the classical methods of maxima localization, this numerical method is suboptimal and suffers from two important inconveniences: the inability to ensure the convergence of the algorithm and the requirement to predefining the rank of the decomposition, that is, the number of fibers in the voxel. Thus, to overcome the considerable limits related to the CP-decomposition approach in the diffusion MRI, we propose a novel approach based on an analytical decomposition of symmetric high order tensor to extract the fiber directions in dMRI. Unlike CP-decomposition, our proposed approach is able to recover the entire crossing fiber directions whatever its number and that without any assumption. To exploit the Adecomp-SHOT on diffusion dataset and to take into account the ground truth properties of the diffusion, we imposed a real and nonnegative constraint by using the NNLS algorithm and by introducing a change of variables. The change of variables was done by a rotation transformation to preserve the fiber directions. This coordinate transformation permitted to overcom a significant constraint imposed by the original Adecomp-SHOT. Indeed, the Adecomp-SHOT, as initially described, enables to extract directions in the affine space whose first Cartesian coordinates are zero, but by using optimally the transformation coordinates, the entire fibers directions are recovered whatever its positions in the affine space. Different validations tests were conducted on synthetic noisy diffusion data, phantom, and real data. The tests on synthetic dataset have shown three principal advantages. (1) The Adecomp-SHOT based approach overcomes the limits related to CP-decomposition without loss in the angular resolution and angular accuracy. (2) Our approach is efficient, accurate, and robust to noise: for SNR equal to 30 our Adecomp-SHOT based approach has an angular resolution limit <36∘ and up to 42∘ the mean of the mean error does not exceed 8∘. (3) The rician noise does not really affect the ability of the method to detect the number of fibers in a voxel; indeed, up to a crossing angle of 48∘ for a low SNR equal to 20 the correct number of fibers is found at 99%. Finally, the tests conducted on phantom and real data confirm the ability of the method to reliably extract the directions of fiber bundles especially in regions where many fiber bundles intersect.



---

*Source: 476837-2014-08-27.xml*