Cae 1543
Cae 1543
9
Communications on Applied Electronics (CAE) – ISSN : 2394-4714
Foundation of Computer Science FCS, New York, USA
Volume 1 – No.5, April 2015 – www.caeaccess.org
et al. [11] applied naïve Bayes classifier for diagnosis of dynamics of the ESNN is uniquely controlled by the input,
diseases from retinal image. A system can provide a good and the effect of the initial states vanishes. The current design
decision support to ophthalmologist. of ESNN parameters relies on the selection of spectral radius.
There are many possible weight matrices with the same
3. ESNN WITH REGION GROWING spectral radius, and unfortunately they do not perform at the
Region growing (RG) [1] is an iterative technique employed same level of mean square error (MSE) for functional
to identify connected regions of interest (contiguous sets of approximation.
voxels) in images, obeying some inclusion rule (generally
based on threshold values), and according to the notion of The recurrent network is a reservoir of highly interconnected
discrete connectivity [2]. Initially, the region growing starts dynamical components, states of which are called echo states.
by choosing an initial pixel as a seed point which is present in The memory less linear readout is trained to produce the
the region to be grown and, after checking its inclusion of output. Consider the recurrent discrete-time neural network
neighbors in the growing region based on the threshold value. with M input units, N internal PEs, and L output units. The
Each included voxel becomes in turn a seed point for the value of the input unit at time n is u(n) = [u1(n), u2(n), . . . ,
following iteration. The above process continues until all the uM(n)]T ,
pixels are added in the grown region based on the set of rules The internal units are x(n) = [x1(n), x2(n), . . . , xN(n)]T
and threshold. , and
In our approach, a region growing approach along with the Output units are y(n) = [y1(n), y2(n), . . . , yL (n)]T.
clustering is used to fix the threshold inorder to segment the
region of interest present in the CT retinal images. The initial
seed point is a voxel (3x3 or 5x5 pixels) belonging to the The connection weights are given
retinal nerve region, and the fuzzy rule fixes a value by
selecting the voxels with intensity values lower than the given
threshold. In this way the entire nerve is connected which
in an (N x M) weight matrix W back Wijback for
present in the image is starting from the bronchi, carena, and connections between the input and the internal PEs,
the trachea. The initial seed point is automatically chosen by
selecting the 3x3 pixel which is present in the central slice of in an N × N matrix W in Wijin for connections
the CT image and grows towards the entire region present in
the image. between the internal PEs
Recently, there has been considerable interest among in an L × N matrix W out Wijout for connections
researchers in statistical clustering techniques [3] in image
segmentation. In a clustering technique along with the region from PEs to the output units and
growing, each pixel is associated with one of the finite
number of threshold is grown to form disjoint regions. The In an N × L matrix W back Wijback for the
contextual clustering method proposed by [4, 9] is a connections that project back from the output to the
supervised algorithm. It uses a 3 X 3 overlapping windows of internal PEs.
pixels to form a segmented image. The quality of segmented
image depends upon 1) A defined threshold value (T=140) by The activation of the internal PEs (echo state) is updated
the user which is used to choose the nearest regions for according to
segmentation, 2) a controlling parameter β which is in the x(n + 1) = f(Win u(n + 1) + Wx(n) +Wbacky(n)),
range of 0< β <1, 3) the median value of the 9 pixels in the
window, 4) the total number of intensity values (u) >1 inside Where f = (f1, f2, . . . , fN) are the internal PEs‟ activation
the window, excluding the already identified median value. functions.
The outputs of this internal PEs (echo states) are fed to a nonlinear functions. Generally, the readout is linear so fout is
memory less but adaptive readout network that produces the identity [14].
network output. The interesting property of ESNN is that only
the memory less readout is trained, whereas the recurrent ESNN algorithm consists of two phases namely Training
topology has fixed connection weights. This reduces the and Testing (segmentation)
complexity of RNN training to simple linear regression while Phase 1: Training ESNN
preserving a recurrent topology, but obviously places
important constraints in the overall architecture that have not Step 1: Read 31st slice in DICOM format and separate the
yet been fully studied. image into 3 x 3 overlapping blocks of pixels.
The echo state condition is defined in terms of the spectral Step 2: Decide the number of reservoirs.
radius (the largest among the absolute values of the
Step 3: Decide the number of nodes in the input layer = 3.
eigenvalues of a matrix, denoted by (|| ||) of the reservoir‟s
weight matrix (|| W || < 1). This condition states that the
10
Communications on Applied Electronics (CAE) – ISSN : 2394-4714
Foundation of Computer Science FCS, New York, USA
Volume 1 – No.5, April 2015 – www.caeaccess.org
Step 4: Decide the number of nodes in the output layer = Step 1: Adopt step 1 and step 2 mentioned in Training.
number of target values=1.
Step 2: Calculate state_vector= tanh ((ILhL)weights*Inputpattern
Step 5: Initialize state vector (number of reservoirs)=0. +(hL)weights* state vectorpresent+(hLoL)weights * Targetpattern).
Step 6:Initialize random weights between input layer (I L) and Step 3: Estimated output= state_vector * Wout
hidden layer(hL). Initialize weights between output
layer(oL) and hidden layer (hL). Initialize weights in Step 4: Assign 0 (black) or 255(white) in the new matrix
the reservoirs. which will be the segmented image.
11
Communications on Applied Electronics (CAE) – ISSN : 2394-4714
Foundation of Computer Science FCS, New York, USA
Volume 1 – No.5, April 2015 – www.caeaccess.org
Table 1 shows the segmented images obtained from the original algorithm are block size of the moving window is 3x3.
retina image. The parameters given for the variables of ESNN
500
Block size=3x3
NUMBER OF OBJECTS
400
300
200
100
0
80 100 120 140
THRESHOLD IN RG
Block size=3x3
120000
NUMBER OF PIXELS
100000
80000
60000
40000
20000
0
80 100 120 140
THRESHOLD IN RG
12
Communications on Applied Electronics (CAE) – ISSN : 2394-4714
Foundation of Computer Science FCS, New York, USA
Volume 1 – No.5, April 2015 – www.caeaccess.org
[4] Sinthanayothin C, Boyce JF, Williamson TH, Cook HL, [8] Zheng Liu, Opas C, Krishnan SM. Automatic image
Mensah E, Lal S. Automated detection of diabetic analysis of fundus photograph. In: Proceedings of the
retinopathy on digital fundus image. J Diabet Med International Conference on Engineering in Medicine
2002;19:105–12. and Biology, vol. 2. 1997. p. 524–5.
[5] Niemeijer M, van Ginneken B, Staal J, Suttorp-Schulten [9] Osareh A, Mirmehdi M, Thomas B, Markham R.
MS, Abramoff MD.Automatic detection of red lesions in Automated identification of diabetic retinal exudates in
digital color fundus photographs. IEEE Trans Med Imag digital colour images. Br J Ophthalmol 2003;87:1220–3.
2005;24:584–92.
[10] Mitra SK, Te-Won Lee, Goldbaum M. Bayesian network
[6] Usher D, Dumskyj M, Himaga M, Williamson TH, based sequential inference for diagnosis of diseases from
Nussey S, Boyce J. Automated detection of diabetic retinal images. Pattern Recogn Lett 2005;26:459–70.
retinopathy in digital retinal images: a tool for diabetic
retinopathy screening. Diabet Med 2004;21:84–90. [11] Purushothaman S and Suganthi D, 2008, fMRI
segmentation using echo state neural network,
[7] Gardner GG, Keating D, Williamson TH, Elliott AT. International Journal of Image Processing, Vol. 2, Issue
Automatic detection of diabetic retinopathy using an 1, pp.1-9.
artificial neural network: a screening tool. Br J
Ophthalmol 1996;80:940–4.
13