Professional Documents
Culture Documents
\
|
=
[
O vi Pi
i jk i
p l w v s ,
(5)
International Journal of Scientific Research Engineering & Technology (IJSRET)
Volume 2 Issue 10 pp 642-646 January 2014 www.ijsret.org ISSN 2278 0882
IJSRET @ 2014
Thus, this algorithm cuts the graph G to independent
subgraphs for every seed, consisting of spanning trees
with seeds at root nodes.
If it set edge weights depending on similarity of image
, ) R R I 3 :
I e w
jk
B
jk
V =
(6)
where I
jk
V denotes a Euclidean norm on the
dierence between intensities of two adjacent vertices vj
and vk. Maximization the product of wjk s along the
path O becomes equivalent to minimization of the
summation of I
jk
V s along the same path.
, ) v p O I
jk
V is a discrete approximation to a
geodesic or I shortest path between the seed pi to a
voxel vi . Each voxel is then alloted to the foreground
label if there is a shorter path from that voxel to a
foreground seed than to any background seed, wherever
paths are weighted by image content. With this
interpretation, cellular automata algorithm solves the
shortest paths energy form formulated. The major
advantage of using CA algorithm is its capability to get a
multi-label solution in a concurrent iteration. Another
advantage is the local transition rules are simple to
interpret, and its probable to impose prior knowledge,
specic to the problem, into the segmentation algorithm.
Fig.1: (a) The graph is initialized with similarities as
edge weights and vertex values 1 for seeds, 0 elsewhere;
(b-c) intermediate propagation steps for CA; (d) shows
the nal vertex values obtained from CA that may also
be attained as the shortest path from every vertex to a
seed.
SEED SELECTION
As every path, dening the labeling of a vertex
ends at a seed, the eciency of the algorithm may be
increased by choosing the background seeds on a closed
surface around the volume of interest (VOI) as the result
of labeling inside the VOI are equivalent to using the
entire data set.
Robustness to seed selection is a vital property of a
segmentation algorithm, since it is natural to expect
similar results for identical tumor whereas allowing the
user to guide the segmentation process interactively by
imposing constraints in dierent way. In RECIST tumor
response criteria, a common procedure to follow-up
tumor progress is to compute the maximum observable
tumor diameter. The seed selection algorithm uses
identical idea to follow the known clinical routine to that
the clinicians are accustomed to follow the Step:
- Crop the line 15% from every end and thicken to
3 pixels wide to get f
g
seeds.
- Select bounding box of the sphere having 20%
longer of the line as VOI.
4. LEVEL SET ON THE STRENGTH MAP
Smoothing is an important prior in segmentation
of brain tumors from post contrast T1 images, due to
three major reasons: First, an area surrounded by tumor
tissue is considered as a tumor region even the intensity
characteristics probable to be healthy. Secondly, it is
potential to embrace misclassied necrotic regions to
tumor region that are typically surrounded by enhanced
tissue. Lastly, its possible to keep out nearby structures
like arteries that are enhanced by administration of the
contrast agent.
Cellular automata algorithm assigns a label l,
and a likelihood value xi in the interval (0,1] to every
voxel vi . The final indicates how much its probable to
assign one of the labels to the voxel. Remapping values
of the nal map { ; V i xi X e = to the interval (-1,1) for
all voxels in V, it obtain
, )
, ) , )
, )
, ) , )
=
background is l if
X X
X x
foreground is l if
X X
X x
M
i
i
i
i
i
min max
min
min max
min
(7)
with values Mi at a voxel i. Lastly, a level set snake is
evolved on map M with a piecewise constant region
assumption, though by using a local Gaussian kernel to
dene inner and outer regions about the propagating
surface, to get the nal tumor segmentation map.
Steps of the proposed cellular automata based
tumor segmentation algorithm is given in Fig. 2. First,
the user draws a line over the largest visible diameter of
International Journal of Scientific Research Engineering & Technology (IJSRET)
Volume 2 Issue 10 pp 642-646 January 2014 www.ijsret.org ISSN 2278 0882
IJSRET @ 2014
the tumor (a); employing this line, a VOI is chosen with
foreground-background seeds (b); tCA algorithm is run
on the VOI to get a label map and strengths at every
voxel (c); label maps and strengths are combined to get
the signed strength values, i.e. map M, such as contours
have value of zero (d). The map M is accustomed to
evolve a level-set snake. In (d), initial level set contour is
represented in white, and nal evolved contour is given
in black. Comparison to expert segmentation (blue) is
visualized in (e), overlayed with tCA result (red), and
tCA-Level set result (yellow).
Fig. 2. Steps of the proposed tumor segmentation
method: see text for explanations
5. EXPERIMENTAL RESULT
The Defined approach is Processed on various tumor
image and the outputs are shown with better accuracy
and detection.
Fig.4: Learning Model of the tumor type
Fig.5: neural network model training for classification
Fig.6: best training rate with the current system
6. CONCLUSION
It presented a segmentation algorithm for the
problem of tumor delineation that exhibit varying tissue
characteristics. As the change in necrotic and enhancing
part of the tumor after radiation therapy becomes
important, it additionally applied the Tumor-cut
segmentation to partition the tumor tissue more into its
necrotic and enhancing parts.
The projected segmentation algorithm for the
problem of tumor delineation, has solely two main
parameters: + , 1 tumor, { ; bg fg, 1e and mean
curvature term weight in the level set evolution. One
future work embraces optimizing both curvature term
and the tumor sensitivity parameter over a larger
tumor database, though the results over 18 tumors of
varying degrees showed that the algorithm executes with
high overlap ratios even with the xed heuristic values.
One more item is to investigate the issues related to the
VOI and seed selection procedure. The current work
includes assessment of the tumor response to therapy,
that is built on the given segmentation framework.
Strengths of the proposed technique embrace its simple
interaction over a single slice and less sensitivity to the
International Journal of Scientific Research Engineering & Technology (IJSRET)
Volume 2 Issue 10 pp 642-646 January 2014 www.ijsret.org ISSN 2278 0882
IJSRET @ 2014
initialization (demonstrated by lower coefficient of
variation values), its efficiency in terms of computation
time, and robustness with respect to different and
heterogeneous tumor types.
REFERENCES
[1] Zou, K.H., Wareld, S.K., Bharatha, A.,
Tempany, C.M.C., Kaus, M.R., Haker, S.J.,
Wells, W.M., Jolesz, F.A., Kikinis, R.:
Statistical validation of image segmentation
quality based on a spatial overlap index.
Academic Radiology 11(2), 178189 (2004)
[2] Chan, T.F., Vese, L.: Active contours without
edges. IEEE Transactions on Image Processing
10(2), 266277 (2001)
[3] Ho, S., Bullitt, E., Gerig, G.: Level-set evolution
with region competition: Automatic 3-d
segmentation of brain tumors. In: ICPR, vol. 1,
p. 10532 (2002)
[4] Liu, J., Udupa, J.K., Odhner, D., Hackney, D.,
Moonis, G.: A system for brain tumor volume
estimation via mr imaging and fuzzy
connectedness. Computerized Medical Imaging
and Graphics 29, 2134 (2005.
[5] Boykov, Y., Jolly, M.P.: Interactive graph cuts
for optimal boundary and region segmentation
of objects in n-d images. In: ICCV, pp. 105112
(2001)
[6] Grady, L.: Random walks for image
segmentation. PAMI 28(11), 17681783 (2006)
[7] Couprie, C., Grady, L., Najman, L., Talbot, H.:
Power watersheds: A new image segmentation
framework extending graph cuts, random walker
and optimal spanning forest. In: ICCV (2009)
[8] Sinop, A., Grady, L.: A seeded image
segmentation framework unifying graph cuts
and random walker which yields a new
algorithm. In: ICCV (2007)
[9] Szeliski, R., et al.: A comparative study of
energy minimization methods for markov
random elds with smoothness-based priors.
PAMI 30(6) (2008)
[10] Vezhnevets, V., Konouchine, V.: Growcut -
interactive multi-label n-d image segmentation
by cellular automata. In: Graphicon, Novosibirsk
Akademgorodok, Russia (2005) S. Ho, E.
Bullitt, and G. Gerig, Level-set evolution with
region com-petition: Automatic 3-D
segmentation of brain tumors, inProc. ICPR ,
2002, vol. 1, p. 10532.
[11] Y. Boykov and M.-P. Jolly, Interactive graph
cuts for optimal boundary and region
segmentation of objects in n-d images, in Proc.
ICCV, 2001, pp. 105112.
[12] L. Grady, Random walks for image
segmentation, in IEEE Trans. Pattern Anal.
Mach. Intell. , Nov. 2006, vol. 28, no. 11, pp.
17681783.
[13] C. Couprie, L. Grady, L. Najman , and H.
Talbot, Power watersheds:A new image
segmentation framework extending graph cuts,
random walker and optimal spanning forest, in
ICCV, 2009, pp. 731738.
[14] A. Sinop and L. Grady, A seeded image
segmentation framework uni-fying graph cuts
and ran dom walker which yields a new
algorithm, in ICCV, 2007, pp. 18.
[15] A. Criminisi, T. Sharp, and A. Blake, GeoS:
Geodesic image segmen-tation, in Comput.
Vis. ECCV 2008, 2008, vol. 5302, pp. 99112.