Conference PaperPDF Available

Abstract and Figures

We present a variational approach to simultaneously trace the axis and determine the thickness of 3-D (or 2-D) tubular structures defined by sparsely and unevenly sampled noisy surface points. Many existing approaches try to solve the axis-tracing and the precise fitting in two subsequent steps. In contrast to this our model is initialized with a small cylinder segment and converges to the final tubular structure in a single energy minimization using a gradient descent scheme. The energy is based on the error of fit and simultaneously penalizes strong curvature and thickness variations. We demonstrate the performance of this closed formulation on volumetric microscopic data sets of the Arabidopsis root tip, where only the nuclei of the cells are visible.
Content may be subject to copyright.
Modeling of Sparsely Sampled Tubular Surfaces
Using Coupled Curves
Thorsten Schmidt1,2, Margret Keuper1,2, Taras Pasternak3, Klaus Palme1,3,4
and Olaf Ronneberger1,2
1Lehrstuhl f¨ur Mustererkennung und Bildverabeitung, Institut f¨ur Informatik,
2Centre of Biological Signalling Studies (BIOSS),
3Institut f¨ur Biologie II, 4Freiburg Inst. for Advanced Studies (FRIAS),
Albert-Ludwigs-Universit¨at Freiburg
tschmidt@informatik.uni-freiburg.de
Abstract. We present a variational approach to simultaneously trace
the axis and determine the thickness of 3-D (or 2-D) tubular structures
defined by sparsely and unevenly sampled noisy surface points. Many
existing approaches try to solve the axis-tracing and the precise fitting
in two subsequent steps. In contrast to this our model is initialized with
a small cylinder segment and converges to the final tubular structure in a
single energy minimization using a gradient descent scheme. The energy
is based on the error of fit and simultaneously penalizes strong curvature
and thickness variations. We demonstrate the performance of this closed
formulation on volumetric microscopic data sets of the Arabidopsis root
tip, where only the nuclei of the cells are visible.
1 Introduction
The accurate tracing and segmentation of parallel-line (2D) or tubular structures
(3D) is an active research topic to solve problems coming from medicine, biol-
ogy, robotics, or aerial and satellite image analysis. Especially for biological and
medical applications, with their wide spectrum of imaging methods this mod-
eling is an important step towards data abstraction and quantification. With
the discovery of the green fluorescent protein, and the isolation of its gene, the
possibility of imaging organism development in-vivo has led to a revolution in
biological research and a tremendous increase in data volume to process.
One popular model organism in plant science is Arabidopsis thaliana, due
to its simple architecture and comparably small and fully sequenced genome.
Especially the stem cell niches in the root and shoot tips (root/shoot apical
meristems) are of high interest to understand plant development and signaling
within complex organs. The root apical meristem (RAM) consists of a set of
tissue layers around the root’s axis. Each of these layers can be described using
an axis-thickness model, leading to the continuous anatomical model needed to
localize events within the root. The simplest and most flexible way of imaging
the plant root with cellular resolution is to mark the cell nuclei and relate events
within the organs to a derived overall anatomical model. However, this practical
2 T. Schmidt, M. Keuper, T. Pasternak, K. Palme, O. Ronneberger
imaging advantage leads to a very sparse representation of the coaxial tubular
structures each cell layer represents, posing high demands onto the modeling.
Especially in microscopic data the light is attenuated by the specimen density
and scattered at interfaces between regions with different refractive indices lead-
ing to a significant loss of signal when imaging through thick tissues. Therefore
simple gray-value based approaches like thresholding and/or kernel smoothing to
estimate the root axis are biased towards the part of the root close to the objec-
tive and tend to fail. We therefore avoid direct use of the image gray values, and
instead extract the positions of the nuclei of a selected layer using the detection
scheme described in [10]. The detection quality is also biased due to the described
effects, and a direct fit to the resulting point cloud using kernel smoothing still
shows a systematic fitting error as we will show in the experiments section.
To avoid the described bias we employed a model consisting of a vector-valued
function describing the tube’s axis and a scalar function describing the variable
tube thickness. Both functions are coupled by a common curve parametrization
into a combined tubular model which is fit to the data in a robust variational
energy minimization scheme. The model is designed to work solely on the sparse
point positions, without the need for surface normal estimation. We will show
that it leads to very accurate fits even in the case of high noise and missing
surface points.
A key benefit of the proposed model is that it “grows” into a large and arbi-
trarily complex tubular structure from a small local initialization, i.e. it solves
the tracing and accurate fitting problem within a single energy minimization.
1.1 Related Work
In medical applications various approaches exist to analyze images of vascular
and neuronal networks based on different imaging methods ranging from low
resolution CT and MRT, through light microscopy down to electron microscopy
[7, 3]. All approaches have in common that they rely on densely imaged inter-
faces between the structures of interest and mainly depend on the gray values
and their derivatives to guide the model fitting. One possibility of robustly find-
ing the axis of a tubular structure is a symmetry analysis around the potential
axis [8]. Morphology-driven approaches try to find the axis by structure thin-
ning leading to a skeletonization. Filter based approaches first try to emphasize
the structures using filter banks or steerable filters and apply thresholding and
thinning afterwards. See [4] for an overview comparing the different approaches.
In the field of robotics approaches to fit parametric tubular structures to
point cloud data recorded using laser range scanners are of high interest [1].
Most existing approaches exploit the scanned dense mesh structure to estimate
local surface normals guiding the model fitting process. These approaches have
to cope with noisy data and therefore estimate the normals for each surface
position from relatively large neighborhoods. Others try to detect shapes using
Hough-like voting based approaches [9]. These are especially suited to detect
man-made rigid objects, but don’t perform well on deformable objects as they
are common in biological and medical applications.
Modeling of Sparsely Sampled Tubular Surfaces Using Coupled Curves 3
In [5] the coupling of two evolving splines describing the center-lines and
thicknesses of roads and rivers in aerial and satellite images was introduced.
Although the noise level in images of that kind is very high, the gradients are
still a valuable piece of information to guide the snake evolution. A different
approach using two coupled splines to describe the outlines of the biologically
highly interesting model organism C-Elegans was introduced in [11].
In [6] a non-self-intersecting 1-D line from unstructured and noisy 3D point
data was reconstructed using moving least-squares interpolation. For homoge-
neously distributed tube-surface data around its circumference this approach is
also applicable to solve the tube axis fitting task, although it does not determine
the tube thickness.
Our setting is different from the above-mentioned, since our approach has to
perform the task of simultaneously estimating the axis and variable thickness of a
tubular structure based on sparse surface points only. The low point density and
high data noise preclude the extraction of reliable surface normals. We formulate
the task of fitting the model to a point cloud as one closed energy minimization
problem, which incorporates all available points and a set of tubular models to
which on demand new tubes can be added.
2 Variational Coupled Curve Fitting
Fig. 1. A 2-D sketch of the tube model fit to a point set depicted as black circles.
The axis is shown as blue line, while the dashed lines indicate the estimated tube
incorporating the tube thickness. The distance shown in green is minimized during the
optimization.
We define a tube as a function mapping a curve parameter uRto the
(D+ 1)-dimensional vector a>(u), t (u)>, where a:RRDis the tube axis
function and t:RRis the corresponding tube thickness function. Fig. 1
sketches the tube model. To optimally map the model to a set of tube surface
4 T. Schmidt, M. Keuper, T. Pasternak, K. Palme, O. Ronneberger
points X={x1,...,xn},xiRDwe minimize the energy
Edata (a, t) :=
n
X
i=1
ψ(ka(ui)xik − t(ui))2(1)
where ui:= arg minukxia(u)kis the curve parameter projection of xiand
ψρ2is a robust distance measure.
To cope with sparse surface points and high data noise, we additionally intro-
duce smoothness terms penalizing axis curvature and tube thickness variations
Ea(a) = Z
−∞
d2
du2a(u)
2
duand Et(t) = Z
−∞ d
dut(u)2
du . (2)
For shorter notation we define ρi(u) := (ka(u)xik − t(u)) and get the overall
energy functional to minimize
E(a, t) :=
n
X
i=1
ψρ2+λZ
−∞
d2
du2a(u)
2
du+µZ
−∞ d
dut(u)2
du(3)
where λ, µ R+weigh the influence of the smoothness terms.
3 Parametrization Using B-Splines
We approximate the curves with open B-splines of degree p, therefore the nodes
at the spline endpoints are repeated p+ 1 times. W.l.o.g. we will restrict the
spline parameter uto the [0,1]-range. We obtain the B-spline approximation of
the general functions a(u) and t(u) as follows:
a(u) :=
m1
X
j=0
ca
jbj,p,s(u) and t(u) :=
m1
X
j=0
ct
jbj,p,s(u)
where Ca=ca
0,...,ca
m1and Ct=ct
0, . . . , ct
m1are the control points,
and bj,p,sare the basis functions with node-vector s= (s0, . . . , sm+p)>.
Lemma 1 (B-spline derivative). Let f(u) := Pm1
j=0 cjbj,p,s(u)be a B-spline
of degree pN0, with control points cj, j = 0, . . . , m 1defined over the knot
vector s= (s0, . . . , sm+p)>. Then the derivative
f0(u) = d
duf(u) =
m2
X
j=0
c0
jbj,p1,s0(u)
is another B-spline of degree p1defined over the knot vector s0= (s1, . . . , sm+p1)
with control points c0
j=p
sj+p+1sj+1 (cj+1 cj).
Modeling of Sparsely Sampled Tubular Surfaces Using Coupled Curves 5
More details to splines as well as this Lemma and its proof are detailed in [2].
The general energy from (3) changes to
Edata (a, t) =
n
X
i=1
ψ(ka(ui)xik − t(ui))2
+λ·
D
X
d=1 Z1
0
m3
X
j=0
c0a
j,dbj,p2,s0(u)
2
du
+µ·Z1
0
m2
X
j=0
c0t
jbj,p1,s0(u)
2
du . (4)
The primed variables are obtained applying Lemma 1 (for the axis twice) to the
original splines.
Using the spline parameterization the partial derivatives with respect to the
control points ca
jand ct
jare needed
∂ca
j,d
E(a, t)=2
n
X
i=1
ψ0ρ21t(ui)
ka(ui)xik(ad(ui)xi,d)bj,p,s(ui)
+2λ
m1
X
j0=0
ca
j0,d Z1
0
d2
du2bj0,p,s(u)d2
du2bj,p,s(u) du(5)
∂ct
j
E(a, t) = 2
n
X
i=1
ψ0ρ2(ka(ui)xik − t(ui)) bj,p,s(ui)
+2µ
m1
X
j0=0
ct
j0Z1
0
d
dubj0,p,s(u)d
dubj,p,s(u) du , (6)
finally leading to the following update rules for moving the control points in a
gradient descent manner when introducing an artificial discrete evolution time
kwith step τR+:
ca
j,d
k+1 =ca
j,d
kτ
∂ca
j,d
E(a, t) and ct
j
k+1 =ct
j,d
kτ
∂ct
j
E(a, t).(7)
Since all dimensions come into play during the control point updates in each
iteration, first the derivatives are computed for each control point, then the
update is applied and finally the uifor each point are recomputed.
We define the outlier-robust distance measure
ψρ2:= (ρ2ρ<η
η2ρηwith derivative ψ0ρ2=(1ρ<η
0ρη
and some user-defined threshold ηR(which should be chosen in the range of
the structure radius).
6 T. Schmidt, M. Keuper, T. Pasternak, K. Palme, O. Ronneberger
Algorithm 1 The Coupled B-spline fitting algorithm
Require: Point set X, initial cylinder, parameters λ,µ,τ
1: Initialize each model (a, t) with two knots fitting the initial cylinder
2: Compute the initial model energy E(a, t) using (4)
3: while not converged do
4: Minimize E(a, t) using (7)
5: Insert knot and re-parametrize the model
6: end while
7: return The coupled B-spline model (a, t)
Only points within a certain distance range defined by ηwill contribute to the
derivatives which allows to adapt the model fitting to the surface point density
and the data noise. We additionally linearly decrease λand µwith increasing
arc length of the current axis estimate to avoid a bias towards short curves and
update the thickness function only with points mapping orthogonally onto the
axis to avoid a thickness over-estimation at the tube end points.
We initialize the fit with a manually chosen short cylinder segment repre-
sented by a straight B-spline with two knots at the ends with the thickness
intialized to the cylinder radius. During the described optimization the number
of control points remains constant. Therefore the model will evolve until no more
data points can be described by one single degree ppolynomial. To allow more
complex tube shapes, we alternate between fitting and re-gridding step in which
an additional knot is inserted and distribute the knots equidistantly along the
curve leading to an intermediate curve length parametrization. The whole fitting
process is described in Alg. 1.
3.1 Extension to Multiple Tubes
To simultaneously trace multiple tubular structures, for each a seeding cylinder
can be placed. In each iteration step the point set is partitioned into subsets, so
that the points in subset Xmare best explained by the mth tubular model ac-
cording to the data energy term. The evolution of tube mis computed on subset
Xmonly. The Energy then becomes the sum over all single model Energies.
4 Experiments
4.1 Synthetic Data
We compared the proposed model (using cubic splines) to the axis estimates
obtained through Gaussian point cloud kernel smoothing (PKS), which resembles
the drawbacks of averaging techniques for curve fitting. For this we synthetically
generated data sets consisting of point clouds highlighting specific cases. We used
trigonometric functions to model the axis and thickness functions and generated
1000 equally distributed tube surface points around the axis. The point positions
were then moved in an arbitrary direction following a Gaussian distribution with
Modeling of Sparsely Sampled Tubular Surfaces Using Coupled Curves 7
standard deviation σleading to the synthetic ground truth (Fig. 2 left panels).
The PKS kernel width was empirically chosen to minimize the fitting error. The
error comparison between PKS and the proposed coupled curve model (CCM)
is shown in the right panels. For constant tube thickness Fig. 2(a) the axis error
of CCM in each direction stays below 20% of the tube thickness whereas PKS
already over-smooths the curve leading to undershoots. The thickness is a little
over-estimated by on average 5%. Pure thickness variations as in Fig. 2(b) do not
influence the axis localization accuracy, but they are reflected in the thickness
error, because the model is designed to favor a constant thickness. However,
the error stays below 10% for low noise and small µ(here µ= 0). Moderate
thickness variations on a bent model as shown in Fig. 2(c) affect the quality of
fit only marginally. Finally one of the big strengths of the model is highlighted in
−50050
−50
0
50
0
50
100
150
200
250
300
350
400
450
500
x
y
z
0 50 100 150 200 250 300 350 400 450 500
−10
−5
0
5
10
z
x
0 50 100 150 200 250 300 350 400 450 500
−10
−5
0
5
10
z
y
z
t
0
0
0
50
100
150
200
250
300
350
400
450
500
x
y
z
0 50 100 150 200 250 300 350 400 450 500
−10
−5
0
5
10
z
x
0 50 100 150 200 250 300 350 400 450 500
−10
−5
0
5
10
z
y
z
t
(a) curved (µ= 0.1) (b) variable thickness (µ= 0.0)
−50050
−50
0
50
0
50
100
150
200
250
300
350
400
450
500
x
y
z
0 50 100 150 200 250 300 350 400 450 500
−10
−5
0
5
10
z
x
0 50 100 150 200 250 300 350 400 450 500
−10
−5
0
5
10
z
y
z
t
−50050
−50
0
50
0
50
100
150
200
250
300
350
400
450
500
x
y
z
0 50 100 150 200 250 300 350 400 450 500
−10
−5
0
5
10
z
x
0 50 100 150 200 250 300 350 400 450 500
−10
−5
0
5
10
z
y
z
t
(c) curved + var. thickness (µ= 0.1) (d) “self-occlusion” (µ= 0.1)
Fig. 2. Sample fits to synthetically generated tubes and the fitting errors for each
model dimension (u= [0,500]). The left plots show the generated noisy point clouds
(blue crosses) and the axis estimate using the proposed coupled curves model (CCM).
The right plots show the axis mismatch in xand ydirection for point based
kernel smoothing (PKS) in green and for the CCM in red. The third plot shows
the CCM thickness mismatch. For all experiments we set λ= 0.1. (a) a(u) =
(50 sin(2πu/300),70 sin(2πu/800), u)>,t(u) = 10, σ= 4; (b) a(u) = (0,0, u)>,
t(u) = 20 + 10 sin(2πu/200), σ= 1; (c) a(u) = (50 sin(2πu/300),70 sin(2πu/800), u)>,
t(u) = 10 +5 sin(2πu/1000), σ= 4; (d) a(u) = (50 sin(2πu/300),70 sin(2πu/800), u)>,
t(u) = 10 + 5 sin(2πu/1000), σ= 4, with “self-occlusion”
8 T. Schmidt, M. Keuper, T. Pasternak, K. Palme, O. Ronneberger
Fig. 2(d), the robustness to biased point cloud distributions on the tube surface.
For this all sample points from Fig. 2(c) which are occluded when assuming a
solid tube and a fixed view angle were removed from the set. This resulted in an
axis position bias for PKS, whereas CCM still reliably estimates tube localization
and thickness.
4.2 Microscopic 3D Volumes of the Arabidopsis Root Tip
To highlight the practical applicability and robustness of our approach we es-
timated axis and thickness of Arabidopsis root tips using the cell nuclei. The
root tips were fixated and DAPI stained to mark the cellular DNA content. Af-
ter preparation they were recorded using a confocal laser scanning microscope
(CLSM) with a 63×water immersion objective. The data volume was recon-
structed from a sequence of images using optical sectioning, leading to a final
anisotropic voxel-size of 0.2µm in lateral (x-y) and 1µm in axial (z) direction.
Two orthogonal views of a sample root with superimposed axis fits are shown in
Fig. 3. The Coupled Curves model fit to sample root tip data sets. In gray the gamma
corrected DAPI signal is shown, the red line (left panels) depicts the estimated root axis,
the yellow mesh the estimated center of the epidermal cell layer and the cyan spheres
the noisy epidermis nucleus positions. The right panels show orthogonal cuts through
the data sets and the axis fits using gray-value-based kernel smoothing (GKS), point-
based kernel smoothing (PKS) and the proposed Coupled Curve Model (CCM). The
blue line indicates the cut shown in the different views. One expert annotation is shown
as white crosses. The parameters for the CCM model were set to λ= 0.1, µ = 0.1.
Modeling of Sparsely Sampled Tubular Surfaces Using Coupled Curves 9
Table 1. Minimum/Maximum/Average root mean squared axis fitting errors between
the expert annotations and the fitting approaches on ten sample roots. (GKS = gray-
value based kernel smoothing, PKS = surface point based kernel smoothing, CCM =
the proposed coupled curve model)
Expert 2 GKS PKS CCM
min/max/avg [µm] min/max/avg [µm] min/max/avg [µm] min/max/avg [µm]
Expert 1 1.78/5.32/3.09 5.52/17.30/10.68 3.69/16.94/8.46 3.18/11.22/6.07
Expert 2 N/A 6.38/14.66/11.38 3.37/17.36/8.65 4.55/12.65/7.32
Fig. 3(a) (panels 2 and 3). Although the images are gamma corrected, the signal
attenuation in z direction is still visible.
To evaluate the axis fits, two experts manually annotated axis points of ten
root tips. For this the data sets were first rotated to roughly align the root
axis with the Euclidean x-axis. This avoids elliptic distortions of the visible root
sections during annotation. Both experts picked the root center at every 100th
x-section of the data set guided by a circle of appropriate diameter. The average
annotation difference between the experts is 3µm, which is in the order of an
average nucleus radius.
We detect the nuclear center positions of a selected tissue layer based on
rotationally invariant volumetric gray value features, namely the magnitudes of
voxelwise solid harmonic spectra [10]. Based on these features a probabilistic
SVM model which was trained on two separate datasets is applied and local
probability maxima are used as nucleus candidate positions.
We again compared the CCM to Gaussian kernel smoothing approaches, this
time incorporating either the gray values directly (GKS) or the positions of the
nuclei (PKS). We chose a kernel width of 40µm to reach a smooth curve, that
still shows good localization properties. The estimated axes on sample roots are
shown in Fig. 3. Especially in Fig. 3(a) the bias of GKS towards regions with
higher gray values is clearly visible. As already seen in the synthetic results
PKS relies on homogeneously distributed points, and therefore on the detector
quality. In all samples (Fig. 3(a-c)) the detector reported many false positives
in low signal parts of the recording, leading to deformations of the PKS axis
estimate towards these points. Also CCM was affected by the false positives in
the root volume (Fig. 3(b) (xz panel)) resulting in a slight shift of the model
axis. In contrast to PKS, in which the points “attracted” the axis, for CCM false
detections in the root interior were explained by an erroneous model shift in the
opposite direction.
5 Conclusion
We presented a variational approach to robustly model tubular structures defined
by their axis and thickness functions based on sparse and noisy surface point
10 T. Schmidt, M. Keuper, T. Pasternak, K. Palme, O. Ronneberger
samples. The approach is able to follow tubes of very complex bending patterns
and also allows for moderate thickness variations. When exchanging the tube
thickness constancy penalizer by a penalizer on a higher derivative degree, the
approach can be adapted to find the axis of arbitrary objects of revolution.
The possibility to introduce arbitrarily many tube seeds into the model al-
lows to simultaneously match all tubes within a data set. Although branching
structures are not yet introduced in the model, its capability to simultaneously
model multiple tubes in a data set in one energy minimization allows to trace
the single branches up to the branching point.
Acknowledgements
We thank the members of our team for helpful comments on the manuscript. We
also gratefully acknowledge the excellent technical support from Roland Nitschke
(ZBSA). This work was supported by the DFG, the Excellence Initiative of the
German Federal and State Governments (EXC 294), European Space Agency,
Bundesministerium f¨ur Bildung und Forschung (BMBF), Deutsches Zentrum f¨ur
Luft und Raumfahrt, and the Freiburg Initiative for Systems Biology (FRISYS).
References
1. Bauer, U., Polthier, K.: Generating parametric models of tubes from laser scans.
Computer-Aided Design 41(10), 719–729 (2009)
2. de Boor, C.: A practical guide to splines, Applied Mathematical Sciences, vol. 27.
Springer-Verlag, 3rd edn. (1978)
3. Friman, O., Hindennach, M., K¨uhnel, C., Peitgen, H.O.: Multiple hypothesis tem-
plate tracking of small 3d vessel structures. Med. Image Anal. 14, 160–171 (2010)
4. Kirbas, C., Quek, F.: A review of vessel extraction techniques and algorithms.
ACM Comput. Surv. 36(2), 81–121 (2004)
5. Laptev, I., Mayer, H., Lindeberg, T., Eckstein, W., Steger, C., Baumgartner, A.:
Automatic extraction of roads from aerial images based on scale space and snakes.
In: Machine Vision and Applications. vol. 12, pp. 23–31 (2000)
6. Lee, I.K.: Curve reconstruction from unorganized points. Computer Aided Geo-
metric Design 17(2), 161–177 (2000)
7. Meijering, E., Jacob, M., Sarria, J.C., Steiner, P., Hirling, H., Unser, M.: Design
and validation of a tool for neurite tracing and analysis in fluorescence microscopy
images. Cytometry Part A 58A(2), 167–176 (2004)
8. Pock, T., Beichel, R., Bischof, H.: A novel robust tube detection filter for 3d cen-
terline extraction. In: Proc. SCIA. vol. 3540, pp. 481–490 (2005)
9. Schnabel, R., Wahl, R., Klein, R.: Efficient ransac for point-cloud shape detection.
Computer Graphics Forum 26(2), 214–226 (2007)
10. Skibbe, H., Reisert, M., Ronneberger, O., Burkhardt, H.: Increasing the dimension
of creativity in rotation invariant feature design using 3d tensorial harmonics.
LNCS 5748/2009, 141–150 (2009)
11. Wang, Q., Ronneberger, O., Burkhardt, H.: Using lateral coupled snakes for mod-
eling the contours of worms. LNCS 5748/2009, 542–551 (2009)
... In the later pipeline steps, the extracted features are re-used to classify the detected nucleus candidates into the classes 'epidermis', 'other nucleus' and 'background' using a multi-class support vector machine (Methods S1.4 andTable S1). A bent-cylinder coordinate system is fitted to the epidermis using the coupled curves model described by Schmidt et al. (2012) (Methods S2). A final classification assigns a layer label and a mitotic state to each cell. ...
... For definition of the bent-cylinder coordinate system, we used the coupled curves model described by Schmidt et al. (2012). The model was initialized using a seed cylinder. ...
Article
To achieve a detailed understanding of processes in biological systems, cellular features must be quantified in the three-dimensional (3D) context of cells and organs. We introduce the intrinsic Root Coordinate System (iRoCS) as a reference model for the root apical meristem (RAM) of plants. iRoCS enables direct and quantitative comparison between the root tips of plant populations at single cell resolution. The iRoCS Toolbox automatically fits standardised coordinates to raw 3D image data. It detects nuclei or segments cells, automatically fits the coordinate system, and groups the nuclei/cells into the root's tissue layers. The division status of each nucleus can also be determined. The only manual step required is to mark the quiescent centre, the origin of iRoCS. All intermediate outputs can be refined if necessary. The ability to learn the visual appearance of nuclei by example allows the iRoCS Toolbox to be easily adapted to different phenotypes. We provide the iRoCS Toolbox as open source software package, licensed under the GNU General Public License (GPL) to make it accessible to a broad community. To demonstrate the power of the technique, we measured subtle changes in cell division patterns caused by modified auxin flux within the Arabidopsis thaliana RAM. This article is protected by copyright. All rights reserved.
... The active contour model (i.e., a snake algorithm) has been employed in agricultural purposes for refinement in segmentation to improve the localisation and size accuracy of blemishes detected on apples (Yang and Marchant, 1996). However, for curvature determination purposes, there also have been several interesting applications, such as that proposed by Schmidt et al. (2012) as a variational approach for simultaneously tracing the axis of tubular surfaces or by Wang et al. (2009) for modelling the contours of worms, obtaining smoother and more accurate centre lines of worm forms than by skeletonising of binary masks. ...
... The active contour model (i.e., the snake algorithm) has been employed in various agricultural purposes, such as refinement of the image segmentation (Yang and Marchant, 1996) or the determination of the central line, the axis of tubular surfaces (Schmidt et al., 2012), or worm forms (Wang et al., 2009). However, this approach has never been used to determine the central line of agricultural products like cucumbers as a means of grading purposes. ...
Article
The cucumber is one of the most important consumer vegetables, and due to high freshness and appearance standards, it must be graded according to quality. One key metric for grading cucumbers is curvature (arch height) relative to length. To date, this classification standard has not been implemented in a commercial automatic system because the curvature of the cucumber is related to its length. This paper presents and tests a circular arc approximation algorithm for measuring the curvature of a cucumber using image processing. By fitting the central axis of each cucumber to establish a curve equation, the approximate eigenvalue radius, R, and the radius of the section perpendicular to the curvature of cucumber, r, could be obtained quickly and efficiently. The curve of the cucumber was then transformed into a new characteristic, R' (R' = R – r), which was used as a threshold to classify each cucumber. The method was verified by theory and experiment, and the average error of 0.71 % corresponding to the coefficient R² = 0.9958 of the similarity index between the curve and central axis of the cucumber was verified. It was found that the fitted curve and the central axis of the cucumber were coincident. Moreover, we designed an algorithm that can detect S-shaped cucumbers based on the analysis of the contour, which can avoid the influence of S-shaped cucumbers on the results. In our tests, 148 cucumbers were classified using the circular arc approximation method, the elliptic approximation method, and a manual method. The results of the classifications were compared. According to China's standard evaluation, the classification error rate of the circular arc approximation method was 10.1 % lower than that of the elliptic approximation method. The incidence of cucumbers being classified into an adjacent grade was 0.7 % using the circular approximation method, and there were no cases of cucumbers being classified into non-adjacent grades. The classification error rate of the elliptic approximation was 10.8 %, of which 2.7 % was classified into non-adjacent grades. Under the European standard, the cucumber classification accuracy using the circular arc approximation algorithm reached 100 %. Therefore, the proposed method offers a more accurate classifier than the elliptic approximation method, and the circular arc approximation algorithm can be fully applied in the commercial cucumber classification process.
Thesis
Biomedizinische Atlanten sind wichtige Werkzeuge, wenn es darum geht Populationsunterschiede basierend auf Bilddaten, wie zum Beispiel Mikroskop- oder MRT-Aufnahmen, zu quantifizieren. Die Kernidee hinter traditionellen Atlas-basierten Quantifikationstechniken ist es, ein repräsentatives Template für die Population zu generieren. Dieses Template wird dann auf jedes Individuum der Population registriert, was effektiv die Formvarianz innerhalb der Population normiert. Diese Normierung erlaubt es uns Ereignisse zwischen zwei Individuen quantitativ zu vergleichen, wie zum Beipiel die Kolokalisierungen von Genexpressionsmustern oder Hormongradienten. Ein einzelnes holistisches Template ist jedoch nicht ausreichend, wenn wir die Auflösung der Analyse auf einzelne Zellen vergrößern wollen. Der Grund ist, dass die Bildregistrierung nun nicht mehr wohldefiniert ist, was an den topologischen Unterschieden zwischen dem holistischen Atlas-Template und dem Bild eines Individuums liegt. In dieser Dissertation präsentieren wir einen Ansatz, einen Multi-Template Atlas automatisch zu generieren, der auf einzelne Zellen des Wurzel-Meristems von registriert werden kann. Die einzelnen Templates dieses Multi-Template Atlasses sind verbunden, so dass alle Analysetechniken von traditionellen Atlanten angewendet werden können. Die wissenschaftlichen Beiträge dieser Dissertation beschäftigen sich mit den Problemen, die auftreten, wenn man einen solchen Multi-Template Atlas erstellt. Wir stellen ein einfaches Distanzmaß vor, das es uns erlaubt annotierte Trainingsdaten automatisch zu gruppieren um anschließend mehrere verbundene Atlas-Templates daraus zu generieren. Die manuelle Initialisierung dieser Templates vor der Bildregistrierung ist nicht mehr praktikabel, da wir für jede Zelle eine grobe initiale Positionsschätzung benötigen, was auch die Auswahl des korrekten Templates beinhaltet. Wir erforschen Möglichkeiten, alle initialen Positionen für ein bestimmtes Template zu finden, die zu einer erfolgreichen Bildregistrierung führen. Schließlich präsentieren wir zwei auf diskriminativem maschinellem Lernen basierende Ansätze, welche die Qualität der Registrierung eines Templates validieren.
Conference Paper
In recent years, X-ray screening systems have been used to safeguard environments in which access control is of paramount importance. Security checkpoints have been placed at the entrances to many public places to detect prohibited items such as handguns and explosives. Human operators complete these tasks because automated recognition in baggage inspection is far from perfect. Research and development on X-ray testing is, however, ongoing into new approaches that can be used to aid human operators. This paper attempts to make a contribution to the field of object recognition by proposing a new approach called Adaptive Sparse Representation (XASR+). It consists of two stages: learning and testing. In the learning stage, for each object of training dataset, several random patches are extracted from its X-ray images in order to construct representative dictionaries. A stop-list is used to remove very common words of the dictionaries. In the testing stage, random test patches of the query image are extracted, and for each test patch a dictionary is built concatenating the ‘best’ representative dictionary of each object. Using this adapted dictionary, each test patch is classified following the Sparse Representation Classification (SRC) methodology. Finally, the query image is classified by patch voting. Thus, our approach is able to deal with less constrained conditions including some contrast variability, pose, intra-class variability, size of the image and focal distance. We tested the effectiveness of our method for the detection of four different objects. In our experiments, the recognition rate was more than 95 % in each class, and more than 85 % if the object is occluded less than 15 %. Results show that XASR+ deals well with unconstrained conditions, outperforming various representative methods in the literature.
Conference Paper
In this paper, we aim for detection and segmentation of Arabidopsis thaliana cells in volumetric image data. To this end, we cluster the training samples by their size and aspect ratio and learn a detector and a shape model for each cluster. While the detector yields good cell hypotheses, additionally aligning the shape model to the image allows to better localize the detections and to reconstruct the cells in case of low quality input data. We show that due to the more accurate localization, the alignment also improves the detection performance.
Thesis
Während der grundlegende Ansatz, wie mittels Fourieranalyse Rotationsinvarianz erreicht werden kann, hinlänglich bekannt ist, beschränkt sich die typische Nutzung auf die Berechnung der Absolutbeträge nachdem die Bilddaten oder Bildmerkmale auf eine Fourierbasis projiziert wurden. Der Hauptbeitrag dieser Doktorarbeit ist die Verbesserung der Beschreibung, bzw. der Diskriminationsfähgigkeit von Fourier-basierten invarianten Methoden, durch die Kombination mit anderen modernen Techniken aus dem Bereich der Musterekerkennung und der Computer Vision. Das "Histogram of Oriented Gradients (HOG)" wird vielfach für die Beschreibung von Bildern genutzt und hat sich als sehr leistungsfähig erwiesen (Felzenszwalb et al., 2010). Diese Doktorarbeit präsentiert eine Methode zur Berechnung von rotationsinvarianten HOG-Deskriptoren mittels Fourieranalyse in Polar- und Kugelkoordinaten. Dies wird erreicht durch die Interpretation eines Gradientenhistogramms als kontinuierliche Funktion auf dem Einheitskreis, bzw. der Einheitskugel, die mittels der Fourierbasis (2D) oder Kugelflächenfunktionen (3D) dargestellt wird. Da die Rotationsinvarianz hier analytisch erreicht wird, werden Quantisierungsartefakte vermieden und es wird eine kontinuierliche Abbildung vom Bild- in den Merkmalsraum erreicht, die die darauf folgende Klassifizierungsaufgabe erleichtert. In den Experimenten war unsere Methode anderen "state-of-the-art" Methoden auf einem öffentlich verfügbaren Datensatz zur Fahrzeugerkennung in Luftbildern klar überlegen. Auf dem "Princeton Shape Benchmark" und dem "SHREC 2009 Generic Shape Benchmark" zeigte unsere Methode ebenfalls eine hohe Leistungsfähigkeit als Ähnlichkeitsmaß für 3D Formen. Anstatt invariante Merkmale zu benutzen, können wir auch direkt die Endergebnisse einer Erkennung rotationsinvariant machen. Basierend auf den equivarianten Filtern (Reisert and Burkhardt, 2008) wurde ein neues Modell entworfen, dass hohe Lernfähigkeit unter der Randbedingung der Rotationsinvarianz gewährleistet. Durch die gleichzeitige Nutzung von Rohmerkmalen und rotationsinvarianten Merkmalen haben wir eine solide Lösung gefunden, um eine "Codebook"-ähnliche Methode unter der Randbedingung der Invarianz zu nutzen. Dieses neue Modell liefert einen einfachen und verlässlichen Lernmechanismus für die equivarianten Filter, der die Leistungsfähigkeit in anspruchsvollen Aufgabenstellungen signifikant erhöht. Seine Leistungsfähigkeit wurde in einer 2D Objektdetektionsaufgabe, bei der die Objekte innerhalb der Ebene rotiert sind, sowie in einer 3D-Landmarkendetektion in mikroskopischen Volumendaten demonstriert. Dieser effiziente rotationsinvariante Detektor ist ein wichtiger Beitrag für das Projekt "3D Virtual Brain Explorer for Zebrafish". Dieses Projekt stellt Biologen ein Werkzeug zur Verfügung, um große Mengen von Zebrafischlarven (einem Modellorganismus für Wirbeltiere) auf eine Referenzlarve auszurichten, so dass Koexpression von Genen detailliert analysiert werden kann. Kapitel 5 der Doktorarbeit ist meinen Arbeiten zur Zellsegmentierung und den dazugehörigen Techniken für biologische Forschungsprojekte, bei denen große Mengen an Proben quantitativ ausgewertet werden müssen, gewidmet. Das Bildverbesserungsverfahren auf der Basis von anisotroper Diffusion hat sich für viele verschiedene mikroskopische Datensätze als sehr effektiv erwiesen. Für die Pflanzenforschung wurde ein halbautomatischer Zellanalysenablauf entwickelt. Für die gleichzeitige Zellsegmentierung und -klassifikation wurde ein Ansatz basierend auf "Markov Random Fields" vorgeschlagen. Die Erkenntnisse, die in dieser Doktorarbeit gewonnen wurden, erweitern den Stand der Wissenschaft in der Fourier-basierten Rotationsinvarianz. Die Arbeit liefert Beispiele, wie in verschiedenen Anwendungen Rotationsinvarianz erreicht werden kann. Die vorgestellten Verfahren zur Kombination der analytischen Fourier-basierten Rotationsinvarianz mit anderen Techniken werden ein wertvolles Rezept für weitere Entwicklungen im Bereich der rotationsinvarianten Erkennung sein. Die vorgestellten Zellanalysenansätze zeigen ebenfalls vielversprechende Ergebnisse und erfüllen die Anforderungen in praktischen Anwendungen.
Article
The histogram of oriented gradients (HOG) is widely used for image description and proves to be very effective. In many vision problems, rotation-invariant analysis is necessary or preferred. Popular solutions are mainly based on pose normalization or learning, neglecting some intrinsic properties of rotations. This paper presents a method to build rotation-invariant HOG descriptors using Fourier analysis in polar/spherical coordinates, which are closely related to the irreducible representation of the 2D/3D rotation groups. This is achieved by considering a gradient histogram as a continuous angular signal which can be well represented by the Fourier basis (2D) or spherical harmonics (3D). As rotation-invariance is established in an analytical way, we can avoid discretization artifacts and create a continuous mapping from the image to the feature space. In the experiments, we first show that our method outperforms the state-of-the-art in a public dataset for a car detection task in aerial images. We further use the Princeton Shape Benchmark and the SHREC 2009 Generic Shape Benchmark to demonstrate the high performance of our method for similarity measures of 3D shapes. Finally, we show an application on microscopic volumetric data.
Conference Paper
Full-text available
A model called lateral coupled snakes is proposed to describe the contours of moving C. elegans worms on 2D images with high accuracy. The model comprises two curves with point correspondence between them. The line linking a corresponding pair is approximately perpendicular to the curves at the two points, which is ensured by shear restoring forces. Experimental proofs reveal that the model is a promising tool for locating and segmenting worms or objects with similar shapes.
Conference Paper
Full-text available
Centerline extraction of tubular structures such as blood ves- sels and airways in 3D volume data is of vital interest for applications involving registration, segmentation and surgical planing. In this paper, we propose a robust method for 3D centerline extraction of tubular struc- tures. The method is based on a novel multiscale medialness function and additionally provides an accurate estimate of tubular radius. In con- trast to other approaches, the method does not need any user selected thresholds and provides a high degree of robustness. For comparison and performance evaluation, we are using both synthetic images from a pub- lic database and a liver CT data set. Results show the advantages of the proposed method compared with the methods of Frangi et al. and Krissian et al.
Book
Full-text available
Article
Full-text available
Incluye bibliografía e índice
Book
This book is based on the author's experience with calculations involving polynomial splines. It presents those parts of the theory which are especially useful in calculations and stresses the representation of splines as linear combinations of B-splines. After two chapters summarizing polynomial approximation, a rigorous discussion of elementary spline theory is given involving linear, cubic and parabolic splines. The computational handling of piecewise polynomial functions (of one variable) of arbitrary order is the subject of chapters VII and VIII, while chapters IX, X, and XI are devoted to B-splines. The distances from splines with fixed and with variable knots is discussed in chapter XII. The remaining five chapters concern specific approximation methods, interpolation, smoothing and least-squares approximation, the solution of an ordinary differential equation by collocation, curve fitting, and surface fitting. The present text version differs from the original in several respects. The book is now typeset (in plain TeX), the Fortran programs now make use of Fortran 77 features. The figures have been redrawn with the aid of Matlab, various errors have been corrected, and many more formal statements have been provided with proofs. Further, all formal statements and equations have been numbered by the same numbering system, to make it easier to find any particular item. A major change has occured in Chapters IX-XI where the B-spline theory is now developed directly from the recurrence relations without recourse to divided differences. This has brought in knot insertion as a powerful tool for providing simple proofs concerning the shape-preserving properties of the B-spline series.
Article
Abstract. We propose a new approach for automatic road extraction from aerial imagery with a model and a strategy mainly based on the multi-scale detection of roads in combination with geometry-constrained edge extraction using snakes. A main advantage of our approach is, that it allows for the first time a bridging of shadows and partially occluded areas using the heavily disturbed evidence in the image. Additionally, it has only few parameters to be adjusted. The road network is constructed after extracting crossings with varying shape and topology. We show the feasibility of the approach not only by presenting reasonable results but also by evaluating them quantitatively based on ground truth.
Article
We present an automatic method for computing an accurate parametric model of a piecewise defined pipe surface, consisting of cylinder and torus segments, from an unorganized point set. Our main contributions are reconstruction of the spine curve of a pipe surface from surface samples, and approximation of the spine curve by G1 continuous circular arcs and line segments. Our algorithm accurately outputs the parametric data required for bending machines to create the reconstructed tube.
Conference Paper
Spherical harmonics are widely used in 3D image processing due to their compactness and rotation properties. For example, it is quite easy to obtain rotation invariance by taking the magnitudes of the representation, similar to the power spectrum known from Fourier analysis. We propose a novel approach extending the spherical harmonic representation to tensors of higher order in a very efficient manner. Our approach utilises the so called tensorial harmonics [1] to overcome the restrictions to scalar fields. In this way it is possible to represent vector and tensor fields with all the gentle properties known from spherical harmonic theory. In our experiments we have tested our system by using the most commonly used tensors in three dimensional image analysis, namely the gradient vector, the Hessian matrix and finally the structure tensor. For comparable results we have used the Princeton Shape Benchmark [2] and a database of airborne pollen, leading to very promising results.
Article
Abstract In this paper we present an automatic algorithm to detect basic shapes in unorganized point clouds. The algorithm decomposes the point cloud into a concise, hybrid structure of inherent shapes and a set of remaining points. Each detected shape serves as a proxy for a set of corresponding points. Our method is based on random sampling and detects planes, spheres, cylinders, cones and tori. For models with surfaces composed of these basic shapes only, for example, CAD models, we automatically obtain a representation solely consisting of shape proxies. We demonstrate that the algorithm is robust even in the presence of many outliers and a high degree of noise. The proposed method scales well with respect to the size of the input point cloud and the number and size of the shapes within the data. Even point sets with several millions of samples are robustly decomposed within less than a minute. Moreover, the algorithm is conceptually simple and easy to implement. Application areas include measurement of physical parameters, scan registration, surface compression, hybrid rendering, shape classification, meshing, simplification, approximation and reverse engineering.
Article
A multiple hypothesis tracking approach to the segmentation of small 3D vessel structures is presented. By simultaneously tracking multiple hypothetical vessel trajectories, low contrast passages can be traversed, leading to an improved tracking performance in areas of low contrast. This work also contributes a novel mathematical vessel template model, with which an accurate vessel centerline extraction is obtained. The tracking is fast enough for interactive segmentation and can be combined with other segmentation techniques to form robust hybrid methods. This is demonstrated by segmenting both the liver arteries in CT angiography data, which is known to pose great challenges, and the coronary arteries in 32 CT cardiac angiography data sets in the Rotterdam Coronary Artery Algorithm Evaluation Framework, for which ground-truth centerlines are available.