# An Efficient Method for Detection of Outliers in Tracer Curves Derived from Dynamic Contrast-Enhanced Imaging

Authors: Linning Ye; Zujun Hou
Journal: Mathematical Problems in Engineering
 (2018)

---

## Abstract

Presence of outliers in tracer concentration-time curves derived from dynamic contrast-enhanced imaging can adversely affect the analysis of the tracer curves by model-fitting. A computationally efficient method for detecting outliers in tracer concentration-time curves is presented in this study. The proposed method is based on a piecewise linear model and implemented using a robust clustering algorithm. The method is noniterative and all the parameters are automatically estimated. To compare the proposed method with existing Gaussian model based and robust regression-based methods, simulation studies were performed by simulating tracer concentration-time curves using the generalized Tofts model and kinetic parameters derived from different tissue types. Results show that the proposed method and the robust regression-based method achieve better detection performance than the Gaussian model based method. Compared with the robust regression-based method, the proposed method can achieve similar detection performance with much faster computation speed.


---

## Body

## 1. Introduction

Dynamic contrast-enhanced imaging using computed tomography (DCE-CT) or magnetic resonance imaging (DCE-MRI) is a functional imaging method that can be used for in vivo assessment of tumor perfusion and allows for quantitative estimation of physiological parameters pertaining to tumor microcirculation [1, 2]. Analysis of DCE imaging data can be performed by fitting a tracer kinetic model to the tissue tracer concentration-time curves estimated from the DCE images.It is well-recognized that noise in the DCE imaging dataset poses a major problem for model-fitting. This is often further compounded by movement artefacts as the dynamic images are acquired over a period of time. Sudden body movements during imaging can result in distinct spikes in the sampled tracer concentration-time curve, on top of the smaller background fluctuations due to image noise. Such spikes in the data points are called outliers (Figure1) and they can affect the outcome of model-fitting dramatically. Outliers could also appear in the tracer concentration curves as artefacts due to prior data processing steps, for example, image registration error. In DCE-MRI, tracer concentration is estimated by additional calculations performed on the MR signal and outliers could appear due to certain computational operations, such as division by small numbers contaminated by noise. Outliers are commonly encountered in tracer concentration-time curves sampled from DCE imaging and screening of concentration curves for outliers before model-fitting should be recommended.Figure 1
Example of an outlier in a tissue tracer concentration-time curve sampled from DCE-CT images (HU: Hounsfield unit).Visually, an outlier appears to be “out-of-place” and does not conform to the mass of the data. If one has prior knowledge of the data, then a model can be used to describe the majority of data and outlier detection can be carried out by the approach of hypothesis testing of the suspicious data point against the model. For example, a frequently used model for hypothesis testing of outliers is the Gaussian model [3, 4]. Let y
t
i
∣
i
=
1
,
…
,
n denote a set of data at timepoints t
i. The Gaussian model assumes that the data is sampled from a Gaussian distribution, G
μ
,
σ
2, with mean μ and standard deviation σ:(1)
y
t
i
~
1
σ
2
π
e
-
y
-
μ
2
/
2
σ
2
.For a random variable following the Gaussian distribution, the probability of sampling a value outside the intervalμ
±
σ
z
p would be 2
1
-
p, where z
p
=
2
e
r
f
-
1
2
p
-
1, and p
∈
0,1 is the p-quantile function of the standard normal distribution. Hence, hypothesis testing for outlier detection can be constructed simply as a thresholding step:(2)
y
t
i
-
μ
σ
>
z
p
,and y
(
t
i
) would be considered an outlier if (2) holds true.In practice, the Gaussian model would be oversimplified as the observed data could be derived from a physical process and the underlying dynamics could be more complex than being constant over time (approximated by meanμ). A natural extension is the truncated power series:(3)
y
t
=
β
0
+
β
1
t
+
⋯
+
β
r
t
r
+
ϵ
,where β
0
,
…
,
β
r are the model parameters and ϵ is the error term which follows the Gaussian distribution G
0
,
σ
2. Although the model in (3) describes a polynomial of power r, it is a linear model with respect to the model parameters β
0
,
…
,
β
r. If the model parameters could be estimated from the observed data, then this model will predict a value y
^
t
i at time t
i, and the residue e
i
=
y
t
i
-
y
^
t
i follows G
0
,
σ
2. Thus, hypothesis testing for outlier detection can similarly be constructed as(4)
y
t
i
-
y
^
t
i
σ
>
z
p
.To estimate the model parametersβ
=
β
0
,
…
,
β
r, one can proceed to minimize(5)
m
i
n
β
∑
i
=
1
n
y
t
i
-
β
0
-
β
1
t
i
-
⋯
-
β
r
t
i
r
2
.Setting the derivatives to zero and solving the resulting linear equations would yield the well-known ordinary least squares (OLS) solution. However, the OLS estimator would be biased if the data is heavily tailed or contains outliers. An unbiased solution can be derived through the inclusion of weights:(6)
m
i
n
β
∑
i
=
1
n
w
e
i
y
t
i
-
β
0
-
β
1
t
i
-
⋯
-
β
r
t
i
r
2
,where w
e
i is a weight function of the residue which is designed to be small for large residues. By this design, outliers would have less influence in determining the solution. This technique has been referred to as the weighted least squares (WLS) method, and, in robust statistics, it is more commonly called robust regression [5–8]. Previous studies have been performed on the design of the weight function and an example is the Welsch function:(7)
w
W
e
l
s
c
h
=
exp
⁡
-
e
δ
2
,where δ is a scaling parameter stipulated by the user.Computation is a major issue in practical implementation of robust regression because of the need to iteratively alternate between the steps of least squares estimation and weight calculation, until convergence of solution. In a DCE imaging dataset, multiple concentration-time curves have to be processed in order to generate parametric maps of physiological parameters. A more efficient outlier detection method is warranted.In this study, a new method for outlier detection is presented, which assumes that the underlying data dynamics can be approximated using a piecewise linear model. A robust clustering algorithm is designed to efficiently construct the piecewise linear model, which is subjected to hypothesis testing to determine the presence of outliers. As the piecewise linear model is derived in a nonrepetitive manner, the proposed method becomes much more efficacious than conventional robust regression-based methods.


## 2. Methods

### 2.1. Piecewise Linear Model

Graphically, a piecewise linear function in one dimension consists of line segments and a simple piecewise linear function (Figure2) is given as follows: (8)
φ
t
=
l
1
t
for
t
≤
t
0
l
2
t
for
t
>
t
0
,where l
k
t
=
β
0
,
k
+
β
1
,
k
t
,
k
=
1,2 is a line segment with slope β
1
,
k and intercept β
0
,
k. The function could be either continuous or discontinuous at the point t
0 (Figure 2). In this study, as the detection process runs in the manner similar to a moving window filter which analyzes the local neighborhood of each data point, a piecewise linear model would be a reasonable (sufficient) approximation of the underlying dynamics in a local neighborhood of the studied point, and hence the piecewise linear model forms the basic assumption of the observed data: (9)
y
t
=
φ
t
+
ϵ
+
o
t
,where ϵ
~
G
0
,
σ
2 and o
t models the outlier. It should be pointed out that (9) is just one way to model the non-Gaussian noise arising from practice for which the true generation mechanism as well as the true distribution of the noise is unknown. There exist other approaches to non-Gaussian noise modeling, for example, the mixture Gaussian model [9] and the Laplacian distribution model [10].Figure 2
Examples of discontinuous (a) and continuous (b) piecewise linear functions.
(a)
(b)


### 2.2. Numerical Implementation for Outlier Detection: A Clustering Approach

If one was to follow the conventional approach for outlier detection based on regression analysis, one would proceed to fit the data with the piecewise linear model and perform hypothesis testing by comparing the discrepancy between observed data and predicted value by the fitted model. In the following a clustering approach is presented so that regression and outlier detection is carried out in one sweep.The basic idea of data analysis using piecewise linear models is that the data can be classified into two or more groups or clusters, each consisting of elements which share similar features. For example, if the deviation of a data point from a particular cluster centroid is smaller than a threshold, the data point can be assigned to that cluster. For outlier detection, the most interesting part would be to find the cluster to which the suspicious data likely belongs, after which a simple linear fitting would suffice for the desired hypothesis testing. Bearing this in mind, the detection process would consist of two stages: clustering and testing.


#### 2.2.1. Clustering

As the local neighborhood of each data point is assumed to follow the piecewise linear model which is composed of two line segments, the local neighborhood could be classified into two groups or two clusters. To account for the presence of possible outliers, an additional cluster is allocated, leading to three possible clusters in total. The elements in each cluster are arranged in ascending order of time. To estimate signal deviation within cluster, the average value of the absolute first-order difference of the cluster elements is computed and denoted asδ
i
,
i
=
1,2
,
3. If in cluster C
i, the kth element is t
k
i
,
y
k
i, then the absolute first-order difference between the kth and the (
k
+
1
)th element is defined as(10)
y
k
+
1
i
-
y
k
i
t
k
+
1
i
-
t
k
i
.Each cluster,C
i, consists of the following three records:(11)
C
i
⟶
y
1
i
,
…
,
y
n
i
i
t
1
i
,
…
,
t
n
i
i
δ
i
.A key consideration in the clustering process is to determine whether a new datay
t
k complies with the existing elements of a cluster. If y
t
k is assigned to a particular cluster C
i, the incremental absolute deviation of the cluster would be(12)
δ
a
=
y
t
k
-
y
n
i
i
t
k
-
t
n
i
i
.It is utilized for calculating a distance metric from the original cluster deviation δ
i: (13)
d
i
s
t
k
i
=
δ
i
-
δ
a
.If the distance is less than a predetermined threshold T
n
b
s,(14)
d
i
s
t
k
i
<
T
n
b
s
,then y
t
k is assigned to C
i and the records of the cluster are updated accordingly. In the situation that (14) holds true for multiple clusters, the decision would be to choose the cluster which contains the element with the nearest temporal distance (i.e., minimum t
k
-
t
n
i
i) from y
t
k.An example is given in Figure3 to illustrate the clustering process. The data of interest is marked with a cross and eight neighboring points (i.e., half-window size is four) are selected to assist in the inference of whether the data of interest is an outlier. The clustering starts with assigning the first data from the left to the first cluster as shown in Figure 3(a). After that, the clustering proceeds from left to right and the next three points are found to be close to the first cluster; thus they are classified into the same cluster, as shown in Figure 3(b). When the fifth point (i.e., the point of interest) is encountered, it is found that its distance to the first cluster is too large; therefore, a new cluster is generated to accommodate this point, as shown in Figure 3(c). Similarly, the 4 points to the right of the point of interest are found to be close to the first cluster. Consequently, there are two clusters in this example and the final clustering result is shown in Figure 3(d).Figure 3
An example to illustrate the clustering process, where “x” stands for the data point of interest with the local neighborhood consisting of 4 points to the left and right of “x” and circles and squares represent the two clusters: (a) initialization of the first cluster, (b) next three datasets classified into the first cluster, (c) the fifth data initialized to the second cluster, and (d) the rest classified into the first cluster.
(a)
(b)
(c)
(d)The pseudocode of the clustering algorithm is described as shown in Pseudocode1.Pseudocode 1
Initialization: three empty clusters with deviation 0;
Loop over all data_k from 1 to n
if C
1 is empty, then assign to C
1
elseif C
2 is empty
if data_k complies with C
1, then assign to C
1
else assign to C
2
elseif C
3 is empty
if data_k complies with C
1 or C
2, then assign accordingly to C
1 or C
2
else assign to C
3
else assign data_k accordingly among C
1, C
2 or C
3
End of loop


#### 2.2.2. Hypothesis Testing for Outlier Detection

After data clustering, the next step is to select the right cluster for data fitting. Usually the one with the largest number of elements would be selected. In the situation of two clusters with equal number of elements, then the cluster containing the element with the nearest temporal distance would be chosen. After data fitting, a valuey
^
t
k can be predicted and compared with the observed data. If the distance is larger than a threshold T
e
r
r,(15)
y
t
k
-
y
^
t
k
>
T
e
r
r
,then an outlier would be detected.


### 2.3. Threshold Parameters

There are two threshold parameters,T
n
b
s and T
e
r
r, involved in the algorithm. These threshold parameters can be determined from the statistics of the dataset, as follows. T
n
b
s is used for assessing cluster compliance by comparing the incremental deviation due to each additional data point with the overall cluster deviation. Note that the underlying signal is usually not constant over time, adding to signal intrinsic deviation, δ
s
i
g
n
a
l, on top of deviation due to noise, δ
n
o
i
s
e. Let y
′
t
k denote the first-order difference of the input signal. Then δ
s
i
g
n
a
l is estimated by (16)
δ
s
i
g
n
a
l
=
m
e
d
i
a
n
y
′
t
k
.As forδ
n
o
i
s
e, it is related to the standard deviation of noise σ. In a similar fashion to [11], the estimation of σ is based on the median of absolute deviation (MAD) of y
′
t
k:(17)
σ
^
=
1.4826
∗
M
A
D
y
′
t
k
2
,where the value of 1.4826 ensures an unbiased estimate when the noise follows a Gaussian distribution, and division by 2 transforms the estimation of standard deviation of noise in y
′
t
k to the standard deviation of noise in y
t
k. For convenience, let σ
^
′ denote the standard deviation of noise in y
′
t
k, which relates to σ
^ by(18)
σ
^
′
=
2
σ
^
.Then, an estimate ofT
n
b
s goes as follows:(19)
T
n
b
s
=
δ
s
i
g
n
a
l
+
λ
n
b
s
σ
^
′
,where λ
n
b
s plays the same role as z
p, as mentioned earlier in the hypothesis testing approach. λ
n
b
s is set to 1.5 in this study, which implies the assumption that about 93.3% of the noisy data in y
′
t
k could be inliers.AsT
e
r
r is used for characterizing y
t
k
-
y
^
t
k, which pertains to the noise in y
t
k, the estimation of T
e
r
r is straightforward:(20)
T
e
r
r
=
λ
e
r
r
σ
^
,where λ
e
r
r is set to 2.5
2.As pointed out in [12, 13], statistical methods tend to be oversensitive to noise in signal hypothesis testing, particularly when the sample size is limited. In such cases, a simple solution is to add a small positive number γ to the threshold parameter. Then (19) and (20) are modified as follows:(21)
T
n
b
s
=
δ
signal
+
λ
nbs
σ
^
′
,
if
σ
^
′
>
σ
^
c
′
δ
signal
+
λ
nbs
σ
^
′
+
γ
,
otherwise
,
T
e
r
r
=
λ
e
r
r
σ
^
if
σ
^
>
σ
^
c
λ
e
r
r
σ
^
+
γ
otherwise
,where the cut-off noise scale σ
^
c
′ is set to 0.5 and γ is a small percentage of the average signal intensity, that is, 5
%.


## 2.1. Piecewise Linear Model

Graphically, a piecewise linear function in one dimension consists of line segments and a simple piecewise linear function (Figure2) is given as follows: (8)
φ
t
=
l
1
t
for
t
≤
t
0
l
2
t
for
t
>
t
0
,where l
k
t
=
β
0
,
k
+
β
1
,
k
t
,
k
=
1,2 is a line segment with slope β
1
,
k and intercept β
0
,
k. The function could be either continuous or discontinuous at the point t
0 (Figure 2). In this study, as the detection process runs in the manner similar to a moving window filter which analyzes the local neighborhood of each data point, a piecewise linear model would be a reasonable (sufficient) approximation of the underlying dynamics in a local neighborhood of the studied point, and hence the piecewise linear model forms the basic assumption of the observed data: (9)
y
t
=
φ
t
+
ϵ
+
o
t
,where ϵ
~
G
0
,
σ
2 and o
t models the outlier. It should be pointed out that (9) is just one way to model the non-Gaussian noise arising from practice for which the true generation mechanism as well as the true distribution of the noise is unknown. There exist other approaches to non-Gaussian noise modeling, for example, the mixture Gaussian model [9] and the Laplacian distribution model [10].Figure 2
Examples of discontinuous (a) and continuous (b) piecewise linear functions.
(a)
(b)


## 2.2. Numerical Implementation for Outlier Detection: A Clustering Approach

If one was to follow the conventional approach for outlier detection based on regression analysis, one would proceed to fit the data with the piecewise linear model and perform hypothesis testing by comparing the discrepancy between observed data and predicted value by the fitted model. In the following a clustering approach is presented so that regression and outlier detection is carried out in one sweep.The basic idea of data analysis using piecewise linear models is that the data can be classified into two or more groups or clusters, each consisting of elements which share similar features. For example, if the deviation of a data point from a particular cluster centroid is smaller than a threshold, the data point can be assigned to that cluster. For outlier detection, the most interesting part would be to find the cluster to which the suspicious data likely belongs, after which a simple linear fitting would suffice for the desired hypothesis testing. Bearing this in mind, the detection process would consist of two stages: clustering and testing.


### 2.2.1. Clustering

As the local neighborhood of each data point is assumed to follow the piecewise linear model which is composed of two line segments, the local neighborhood could be classified into two groups or two clusters. To account for the presence of possible outliers, an additional cluster is allocated, leading to three possible clusters in total. The elements in each cluster are arranged in ascending order of time. To estimate signal deviation within cluster, the average value of the absolute first-order difference of the cluster elements is computed and denoted asδ
i
,
i
=
1,2
,
3. If in cluster C
i, the kth element is t
k
i
,
y
k
i, then the absolute first-order difference between the kth and the (
k
+
1
)th element is defined as(10)
y
k
+
1
i
-
y
k
i
t
k
+
1
i
-
t
k
i
.Each cluster,C
i, consists of the following three records:(11)
C
i
⟶
y
1
i
,
…
,
y
n
i
i
t
1
i
,
…
,
t
n
i
i
δ
i
.A key consideration in the clustering process is to determine whether a new datay
t
k complies with the existing elements of a cluster. If y
t
k is assigned to a particular cluster C
i, the incremental absolute deviation of the cluster would be(12)
δ
a
=
y
t
k
-
y
n
i
i
t
k
-
t
n
i
i
.It is utilized for calculating a distance metric from the original cluster deviation δ
i: (13)
d
i
s
t
k
i
=
δ
i
-
δ
a
.If the distance is less than a predetermined threshold T
n
b
s,(14)
d
i
s
t
k
i
<
T
n
b
s
,then y
t
k is assigned to C
i and the records of the cluster are updated accordingly. In the situation that (14) holds true for multiple clusters, the decision would be to choose the cluster which contains the element with the nearest temporal distance (i.e., minimum t
k
-
t
n
i
i) from y
t
k.An example is given in Figure3 to illustrate the clustering process. The data of interest is marked with a cross and eight neighboring points (i.e., half-window size is four) are selected to assist in the inference of whether the data of interest is an outlier. The clustering starts with assigning the first data from the left to the first cluster as shown in Figure 3(a). After that, the clustering proceeds from left to right and the next three points are found to be close to the first cluster; thus they are classified into the same cluster, as shown in Figure 3(b). When the fifth point (i.e., the point of interest) is encountered, it is found that its distance to the first cluster is too large; therefore, a new cluster is generated to accommodate this point, as shown in Figure 3(c). Similarly, the 4 points to the right of the point of interest are found to be close to the first cluster. Consequently, there are two clusters in this example and the final clustering result is shown in Figure 3(d).Figure 3
An example to illustrate the clustering process, where “x” stands for the data point of interest with the local neighborhood consisting of 4 points to the left and right of “x” and circles and squares represent the two clusters: (a) initialization of the first cluster, (b) next three datasets classified into the first cluster, (c) the fifth data initialized to the second cluster, and (d) the rest classified into the first cluster.
(a)
(b)
(c)
(d)The pseudocode of the clustering algorithm is described as shown in Pseudocode1.Pseudocode 1
Initialization: three empty clusters with deviation 0;
Loop over all data_k from 1 to n
if C
1 is empty, then assign to C
1
elseif C
2 is empty
if data_k complies with C
1, then assign to C
1
else assign to C
2
elseif C
3 is empty
if data_k complies with C
1 or C
2, then assign accordingly to C
1 or C
2
else assign to C
3
else assign data_k accordingly among C
1, C
2 or C
3
End of loop


### 2.2.2. Hypothesis Testing for Outlier Detection

After data clustering, the next step is to select the right cluster for data fitting. Usually the one with the largest number of elements would be selected. In the situation of two clusters with equal number of elements, then the cluster containing the element with the nearest temporal distance would be chosen. After data fitting, a valuey
^
t
k can be predicted and compared with the observed data. If the distance is larger than a threshold T
e
r
r,(15)
y
t
k
-
y
^
t
k
>
T
e
r
r
,then an outlier would be detected.


## 2.2.1. Clustering

As the local neighborhood of each data point is assumed to follow the piecewise linear model which is composed of two line segments, the local neighborhood could be classified into two groups or two clusters. To account for the presence of possible outliers, an additional cluster is allocated, leading to three possible clusters in total. The elements in each cluster are arranged in ascending order of time. To estimate signal deviation within cluster, the average value of the absolute first-order difference of the cluster elements is computed and denoted asδ
i
,
i
=
1,2
,
3. If in cluster C
i, the kth element is t
k
i
,
y
k
i, then the absolute first-order difference between the kth and the (
k
+
1
)th element is defined as(10)
y
k
+
1
i
-
y
k
i
t
k
+
1
i
-
t
k
i
.Each cluster,C
i, consists of the following three records:(11)
C
i
⟶
y
1
i
,
…
,
y
n
i
i
t
1
i
,
…
,
t
n
i
i
δ
i
.A key consideration in the clustering process is to determine whether a new datay
t
k complies with the existing elements of a cluster. If y
t
k is assigned to a particular cluster C
i, the incremental absolute deviation of the cluster would be(12)
δ
a
=
y
t
k
-
y
n
i
i
t
k
-
t
n
i
i
.It is utilized for calculating a distance metric from the original cluster deviation δ
i: (13)
d
i
s
t
k
i
=
δ
i
-
δ
a
.If the distance is less than a predetermined threshold T
n
b
s,(14)
d
i
s
t
k
i
<
T
n
b
s
,then y
t
k is assigned to C
i and the records of the cluster are updated accordingly. In the situation that (14) holds true for multiple clusters, the decision would be to choose the cluster which contains the element with the nearest temporal distance (i.e., minimum t
k
-
t
n
i
i) from y
t
k.An example is given in Figure3 to illustrate the clustering process. The data of interest is marked with a cross and eight neighboring points (i.e., half-window size is four) are selected to assist in the inference of whether the data of interest is an outlier. The clustering starts with assigning the first data from the left to the first cluster as shown in Figure 3(a). After that, the clustering proceeds from left to right and the next three points are found to be close to the first cluster; thus they are classified into the same cluster, as shown in Figure 3(b). When the fifth point (i.e., the point of interest) is encountered, it is found that its distance to the first cluster is too large; therefore, a new cluster is generated to accommodate this point, as shown in Figure 3(c). Similarly, the 4 points to the right of the point of interest are found to be close to the first cluster. Consequently, there are two clusters in this example and the final clustering result is shown in Figure 3(d).Figure 3
An example to illustrate the clustering process, where “x” stands for the data point of interest with the local neighborhood consisting of 4 points to the left and right of “x” and circles and squares represent the two clusters: (a) initialization of the first cluster, (b) next three datasets classified into the first cluster, (c) the fifth data initialized to the second cluster, and (d) the rest classified into the first cluster.
(a)
(b)
(c)
(d)The pseudocode of the clustering algorithm is described as shown in Pseudocode1.Pseudocode 1
Initialization: three empty clusters with deviation 0;
Loop over all data_k from 1 to n
if C
1 is empty, then assign to C
1
elseif C
2 is empty
if data_k complies with C
1, then assign to C
1
else assign to C
2
elseif C
3 is empty
if data_k complies with C
1 or C
2, then assign accordingly to C
1 or C
2
else assign to C
3
else assign data_k accordingly among C
1, C
2 or C
3
End of loop


## 2.2.2. Hypothesis Testing for Outlier Detection

After data clustering, the next step is to select the right cluster for data fitting. Usually the one with the largest number of elements would be selected. In the situation of two clusters with equal number of elements, then the cluster containing the element with the nearest temporal distance would be chosen. After data fitting, a valuey
^
t
k can be predicted and compared with the observed data. If the distance is larger than a threshold T
e
r
r,(15)
y
t
k
-
y
^
t
k
>
T
e
r
r
,then an outlier would be detected.


## 2.3. Threshold Parameters

There are two threshold parameters,T
n
b
s and T
e
r
r, involved in the algorithm. These threshold parameters can be determined from the statistics of the dataset, as follows. T
n
b
s is used for assessing cluster compliance by comparing the incremental deviation due to each additional data point with the overall cluster deviation. Note that the underlying signal is usually not constant over time, adding to signal intrinsic deviation, δ
s
i
g
n
a
l, on top of deviation due to noise, δ
n
o
i
s
e. Let y
′
t
k denote the first-order difference of the input signal. Then δ
s
i
g
n
a
l is estimated by (16)
δ
s
i
g
n
a
l
=
m
e
d
i
a
n
y
′
t
k
.As forδ
n
o
i
s
e, it is related to the standard deviation of noise σ. In a similar fashion to [11], the estimation of σ is based on the median of absolute deviation (MAD) of y
′
t
k:(17)
σ
^
=
1.4826
∗
M
A
D
y
′
t
k
2
,where the value of 1.4826 ensures an unbiased estimate when the noise follows a Gaussian distribution, and division by 2 transforms the estimation of standard deviation of noise in y
′
t
k to the standard deviation of noise in y
t
k. For convenience, let σ
^
′ denote the standard deviation of noise in y
′
t
k, which relates to σ
^ by(18)
σ
^
′
=
2
σ
^
.Then, an estimate ofT
n
b
s goes as follows:(19)
T
n
b
s
=
δ
s
i
g
n
a
l
+
λ
n
b
s
σ
^
′
,where λ
n
b
s plays the same role as z
p, as mentioned earlier in the hypothesis testing approach. λ
n
b
s is set to 1.5 in this study, which implies the assumption that about 93.3% of the noisy data in y
′
t
k could be inliers.AsT
e
r
r is used for characterizing y
t
k
-
y
^
t
k, which pertains to the noise in y
t
k, the estimation of T
e
r
r is straightforward:(20)
T
e
r
r
=
λ
e
r
r
σ
^
,where λ
e
r
r is set to 2.5
2.As pointed out in [12, 13], statistical methods tend to be oversensitive to noise in signal hypothesis testing, particularly when the sample size is limited. In such cases, a simple solution is to add a small positive number γ to the threshold parameter. Then (19) and (20) are modified as follows:(21)
T
n
b
s
=
δ
signal
+
λ
nbs
σ
^
′
,
if
σ
^
′
>
σ
^
c
′
δ
signal
+
λ
nbs
σ
^
′
+
γ
,
otherwise
,
T
e
r
r
=
λ
e
r
r
σ
^
if
σ
^
>
σ
^
c
λ
e
r
r
σ
^
+
γ
otherwise
,where the cut-off noise scale σ
^
c
′ is set to 0.5 and γ is a small percentage of the average signal intensity, that is, 5
%.


## 3. Monte Carlo Simulation

Computer simulation experiments were performed to evaluate the performance of the proposed outlier detection method under various noise conditions. Similar to [14], the arterial input function C
a
t was modeled as a sum of gamma-variate functions:(22)
C
a
t
=
Γ
t
,
t
0
,
α
0
,
η
0
+
0.2
Γ
~
t
,
t
1
,
α
1
,
η
1
+
0.05
Γ
~
t
,
t
2
,
α
2
,
η
2
,where(23)
Γ
t
,
t
0
,
α
0
,
η
0
=
t
-
t
0
α
0
e
-
t
-
t
0
/
η
0
,
t
≥
t
0refers to the initial peak of the arterial input function. Γ
~ is a gamma-variate function normalized (i.e., scaled) to ensure equal maximal value with the initial peak Γ, such that the second term in (22) describes the first recirculation peak reaching a height about 20% of the initial peak. Following [14], values of the various parameters in the gamma-variate functions are listed in Table 1 and the sampling interval of the arterial input function was set as 1.6 s.Table 1
Parameters of gamma-variate functions for simulating the arterial input function.
Γ
t
,
t
0
,
α
0
,
η
0
t
0 = 32 s
α
0
=
3
η
0 = 5 s
Γ
~
t
,
t
1
,
α
1
,
η
1
t
1 = 60 s
α
1
=
3
η
1 = 10 s
Γ
~
t
,
t
2
,
α
2
,
η
2
t
2 = 90 s
α
2
=
3
η
2 = 20 sTissue concentration-time curvesC
t
i
s
s
t were generated using the generalized Tofts model [16]:(24)
C
t
i
s
s
t
=
C
a
t
⊗
K
t
r
a
n
s
e
-
K
t
r
a
n
s
t
/
v
e
+
v
p
δ
t
,where ⊗ denotes convolution and δ
t is the Dirac delta function. Values of kinetic parameters (K
t
r
a
n
s
,
v
e
,
v
p) used for simulating these tracer curves were shown in Table 2.Table 2
Kinetic parameters utilized in the simulation study.
Tissue type
K
t
r
a
n
s (m
i
n
-
1)
v
e (ml/ml)
v
p (ml/ml)
(#1) Breast tumor [15]
0.25
0.45
0.06
(#2) Acute multiple sclerosis lesion [16]
0.056
0.18
0.1
(#3) Chronic multiple sclerosis lesion [16]
0.012
0.41
0.06Gaussian noiseG
0
,
σ
G
2 was added to the C
t
i
s
s
t curves with σ
G varying from 0.3 to 2.1 (in steps of 0.3) to simulate various noise conditions. For each Gaussian noise level σ
G, 1000 simulation runs were performed. In each simulation run, the presence of outliers was simulated by adding salt-and-pepper noise [17] at randomly selected time points in C
t
i
s
s
t where the concentration values were increased or reduced (randomly) by 80% of the maximum concentration value in C
t
i
s
s
t. The percentage of the number of outliers in each simulated C
t
i
s
s
t curve was kept constant at 10%.Since the locations of the outliers are known in each simulation, one can study performance of a outlier detector by computing quantitative measures using the number of true positives #(TP), true negatives (TN), false positives (FP), and false negatives (FN) as follows [18].(1) Sensitivity is also called true positive rate:(25)
S
e
n
s
i
t
i
v
i
t
y
=
#
T
P
#
T
P
+
#
F
N
.(2) Specificity is also called true negative rate:(26)
S
p
e
c
i
f
i
c
i
t
y
=
#
T
N
#
T
N
+
#
F
P
.To compare the performance of the proposed outlier detection method with existing methods, two well-established outlier detectors were also implemented in the Monte Carlo simulations. These are, namely, the Hampel and Welsch methods [4, 11], which are, respectively, based on the Gaussian model and the robust regression approach mentioned before. The Hampel method replaces the parameters of mean and standard deviation in (2) with median and MAD, respectively, to make the inference more resistant against outliers. The Welsch method detects outliers using the thresholding condition (4) after a robust regression model is derived.All computations were performed by using Matlab™ (The MathWorks, Natick, MA, USA) and running on a desktop personal computer with 3 GHz CPU and 8 GB memory.


## 4. Results and Discussion

### 4.1. Simulation Results

Figure4(a) shows a simulated noisy tissue concentration-time C
t
i
s
s
t curve where outliers are marked with red squares, which represent the ground truth. The dashed line in Figure 4(a) shows the simulated C
t
i
s
s
t curve prior to the addition of noise. Figures 4(b)–4(d) present the outliers detected by the Hampel method, Welsch method, and the proposed piecewise linear method, respectively. Compared with the ground truth in Figure 4(a), all methods could successfully detect outliers located in the relatively flat regions of the C
t
i
s
s
t curve. However, among the six outliers in upslope region of C
t
i
s
s
t, the Hampel Gaussian-based method could not detect any of them, while the Welsch robust regression model succeeded in detecting five outliers with three false positives, and the proposed method also detected five of the outliers but with one false positive.Figure 4
Example of a simulation run with outlier detection by different methods.
(a)
Ground truth
(b)
Hampel
(c)
Welsch
(d)
Proposed methodFigures5–7 summarize the performance (i.e., sensitivity and specificity) of the Hampel, proposed, and Welsch methods for different tissue types. As illustrated in Figures 5–7, the proposed method generally achieved higher sensitivities than the Hampel method (by about 6~11%) with similar levels of specificity. The performance of the proposed method (in terms of sensitivity and specificity) is close to the performance of the Welsch method.Figure 5
Comparison of outlier detection with different Gaussian noise conditions, where the tracer concentration-time curves are simulated using kinetic parameters typical of breast tumors.Figure 6
Comparison of outlier detection with different Gaussian noise conditions, where the tracer concentration-time curves are simulated using kinetic parameters typical of acute multiple sclerosis.Figure 7
Comparison of outlier detection with different Gaussian noise conditions, where the tracer concentration-time curves are simulated using kinetic parameters typical of chronic multiple sclerosis.The average processing time of different methods is given in Table3. We can find that the Hampel and Welsch methods require about 5 and 130 ms, respectively, to process one C
t
i
s
s
t curve, while the proposed method takes about 10 ms. The results show that the computation speed of the Hampel method and the proposed method is much faster than the Welsch method.Table 3
Processing time (millisecond) by different outlier detection methods.
Hampel
Proposed method
Welsch
Processingtime (ms)
5
10
130


### 4.2. Parameter Sensitivity

For the proposed method, threshold parameters were fixed during simulation experiments. Here, we evaluate the sensitivity of different parameters. The tracer concentration-time curves utilized in the evaluation are simulated using kinetic parameters typical of acute multiple sclerosis. Figure8 plots the performance index (sensitivity on the left y-axis and specificity on the right y-axis) with respect to threshold T
e
r
r under noise conditions σ
G
=
0.3 and σ
G
=
2.1. We can find that both sensitivity and specificity vary in a tight range, between 0.996 and 1 for sensitivity and between 0.992 and close to 1 for specificity, respectively, when σ
G
=
0.3 (as shown in Figure 8(a)), which provides much freedom in determining the threshold. When σ
G
=
2.1, as shown in Figure 8(b), the sensitivity drops below 0.9 after the threshold is larger than 20, and the specificity is nearly monotonically increasing from 0.99 to 1, which suggests that a threshold in the wide range between 1.5 and 10 times of σ
G would be reasonable.Figure 8
Parameter sensitivity with respect to thresholdT
e
r
r for the proposed method under noise condition σ
G
=
0.3
o
r
2.1, where the left vertical axis represents the sensitivity and the right vertical axis represents the specificity.Figure9 shows the parameter sensitivity with respect to λ
n
b
s, which relates to the clustering process in the proposed method. When σ
G
=
0.3, either the sensitivity or the specificity is greater than 0.99 for λ
n
b
s
∈
0.5,3. In particular, both performance indexes are greater than 0.995 when λ
n
b
s
>
1.5. When σ
G
=
2.1, the specificity is greater than 0.994 for λ
n
b
s
∈
0.5,3, and the sensitivity drops below 0.95 for λ
n
b
s
>
2.9.Figure 9
Parameter sensitivity relating to the clustering threshold for the proposed method under noise conditionσ
G
=
0.3
o
r
2.1, where the left vertical axis represents the sensitivity and the right vertical axis represents the specificity.The effect of half-window size on the performance of the proposed method is shown in Figure10 for the same simulation condition in Figure 9, which suggests that the moving window size (2 times half-window size plus 1) 9 or 11 would be suitable.Figure 10
Parameter sensitivity with respect to half-window size for the proposed method under noise conditionσ
G
=
0.3
o
r
2.1, where the left vertical axis represents the sensitivity and the right vertical axis represents the specificity.


## 4.1. Simulation Results

Figure4(a) shows a simulated noisy tissue concentration-time C
t
i
s
s
t curve where outliers are marked with red squares, which represent the ground truth. The dashed line in Figure 4(a) shows the simulated C
t
i
s
s
t curve prior to the addition of noise. Figures 4(b)–4(d) present the outliers detected by the Hampel method, Welsch method, and the proposed piecewise linear method, respectively. Compared with the ground truth in Figure 4(a), all methods could successfully detect outliers located in the relatively flat regions of the C
t
i
s
s
t curve. However, among the six outliers in upslope region of C
t
i
s
s
t, the Hampel Gaussian-based method could not detect any of them, while the Welsch robust regression model succeeded in detecting five outliers with three false positives, and the proposed method also detected five of the outliers but with one false positive.Figure 4
Example of a simulation run with outlier detection by different methods.
(a)
Ground truth
(b)
Hampel
(c)
Welsch
(d)
Proposed methodFigures5–7 summarize the performance (i.e., sensitivity and specificity) of the Hampel, proposed, and Welsch methods for different tissue types. As illustrated in Figures 5–7, the proposed method generally achieved higher sensitivities than the Hampel method (by about 6~11%) with similar levels of specificity. The performance of the proposed method (in terms of sensitivity and specificity) is close to the performance of the Welsch method.Figure 5
Comparison of outlier detection with different Gaussian noise conditions, where the tracer concentration-time curves are simulated using kinetic parameters typical of breast tumors.Figure 6
Comparison of outlier detection with different Gaussian noise conditions, where the tracer concentration-time curves are simulated using kinetic parameters typical of acute multiple sclerosis.Figure 7
Comparison of outlier detection with different Gaussian noise conditions, where the tracer concentration-time curves are simulated using kinetic parameters typical of chronic multiple sclerosis.The average processing time of different methods is given in Table3. We can find that the Hampel and Welsch methods require about 5 and 130 ms, respectively, to process one C
t
i
s
s
t curve, while the proposed method takes about 10 ms. The results show that the computation speed of the Hampel method and the proposed method is much faster than the Welsch method.Table 3
Processing time (millisecond) by different outlier detection methods.
Hampel
Proposed method
Welsch
Processingtime (ms)
5
10
130


## 4.2. Parameter Sensitivity

For the proposed method, threshold parameters were fixed during simulation experiments. Here, we evaluate the sensitivity of different parameters. The tracer concentration-time curves utilized in the evaluation are simulated using kinetic parameters typical of acute multiple sclerosis. Figure8 plots the performance index (sensitivity on the left y-axis and specificity on the right y-axis) with respect to threshold T
e
r
r under noise conditions σ
G
=
0.3 and σ
G
=
2.1. We can find that both sensitivity and specificity vary in a tight range, between 0.996 and 1 for sensitivity and between 0.992 and close to 1 for specificity, respectively, when σ
G
=
0.3 (as shown in Figure 8(a)), which provides much freedom in determining the threshold. When σ
G
=
2.1, as shown in Figure 8(b), the sensitivity drops below 0.9 after the threshold is larger than 20, and the specificity is nearly monotonically increasing from 0.99 to 1, which suggests that a threshold in the wide range between 1.5 and 10 times of σ
G would be reasonable.Figure 8
Parameter sensitivity with respect to thresholdT
e
r
r for the proposed method under noise condition σ
G
=
0.3
o
r
2.1, where the left vertical axis represents the sensitivity and the right vertical axis represents the specificity.Figure9 shows the parameter sensitivity with respect to λ
n
b
s, which relates to the clustering process in the proposed method. When σ
G
=
0.3, either the sensitivity or the specificity is greater than 0.99 for λ
n
b
s
∈
0.5,3. In particular, both performance indexes are greater than 0.995 when λ
n
b
s
>
1.5. When σ
G
=
2.1, the specificity is greater than 0.994 for λ
n
b
s
∈
0.5,3, and the sensitivity drops below 0.95 for λ
n
b
s
>
2.9.Figure 9
Parameter sensitivity relating to the clustering threshold for the proposed method under noise conditionσ
G
=
0.3
o
r
2.1, where the left vertical axis represents the sensitivity and the right vertical axis represents the specificity.The effect of half-window size on the performance of the proposed method is shown in Figure10 for the same simulation condition in Figure 9, which suggests that the moving window size (2 times half-window size plus 1) 9 or 11 would be suitable.Figure 10
Parameter sensitivity with respect to half-window size for the proposed method under noise conditionσ
G
=
0.3
o
r
2.1, where the left vertical axis represents the sensitivity and the right vertical axis represents the specificity.


## 5. Concluding Remarks

This study presents a method for detection of outliers in tracer concentration-time curves derived from DCE imaging. Salient features of the proposed method include (1) a robust clustering method for classification of data, (2) a piecewise linear model being utilized to describe underlying data dynamics from which distance measures of individual data points can be derived, and (3) outlier detection being formulated as a hypothesis testing of distance measures based on objective statistical threshold metrics, allowing automation of the method under different noise conditions without user intervention. Monte Carlo simulation experiments of various tissue types show that the proposed method compares favorably with two well-established techniques in terms of computation speed and performance (sensitivity and specificity). Specifically, the proposed method achieves detection accuracy similar to the robust regression-based method at the computation speed close to the Gaussian model based method.Although the method has been designed to detect outliers in tracer curves from DCE imaging, it is expected to be also applicable in other scenarios where two main assumptions hold: (1) underlying data can be approximated by a piecewise linear model and (2) outliers are present with noise that follows the Gaussian distribution and is independent and identically distributed.



---

*Source: 5670165-2018-04-12.xml*