IMPLEMENTATION OF DERMOSCOPIC IMAGE BASED MELANOMA

CLASSIFICATION
Sai Kumar Dora1*, D.L Samyuktha, Nalini Bodasingi1,
1
Department of ECE, JNTUK UCEV, Vizianagaram, PIN – 535001, India
Abstract:
Since a lot of years, the frequency of melanoma is rising blisteringly. In human beings, it is one of the
dangerous cancers. Treatment will be easy in early detection and becomes untreatable at later stages.
So for the classification of melanoma from benign lesions, CAD based diagnosis on images is
essential. In this method the daubechies (db3) and the reverse Biorthogonal (rbio 3.3, rbio 3.5, rbio
3.7) wavelet filters are used. The energy and mean texture features are considered for the classification
of Melanoma. PSO is used as the feature selection technique which has reduced the filter size without
the sacrifice of the accuracy. The SVM with RBF kernel with sigma 2 differentiates benign from the
melanoma with 95% accuracy. In the proposed method, complexity of the computation is highly
reduced by reduction of filter size by PSO while retaining the same accuracy. This approach is further
extended with FPGA platform to implement to reach the hardware implementation.

1. Introduction malignant cases is very high subjects[3]. During

The two major types of the skin
cancerous lesions are benign and malignant
lesions. Nearly twenty sq.ft of human body is
covered by skin area [1].According to the British
Skin around twenty five thousand people die due
to skin cancer[2]. Melanin deposits are found in
epidermis layers in benign lesions. Growth rate
of melanin is abnormal for malignant lesions.
Malignant lesions become dangerous when
melanin enters to the dermis layers. If
malignant melanoma is not treated at early
stages, it becomes fatal at last stages. Frequent
types of skin cancer are Squamous cell
carcinoma, Basal cell carcinoma and melanoma.
BCC and SCC are non melanoma skin cancers.
Sometimes for experienced dermatologists also
the classification can be difficult. So great
interest is being shown for computer- aided
diagnosis. The major steps for computer aided
diagnosis constitutes input acquisition, feature
extraction and classification. Feature carries
information related to colour, shape and texture.
Texture-based features outperform border and
the features based on colour [3]. The energy
variation of the wavelets for benign and
feature extraction large quantities of features are
produced which consists of relevant, irrelevant
and redundant features. There are two
drawbacks due to the presence of the redundant
and irrelevant features. First one is that their
presence is not useful for classification. Second
drawback is that they sometimes reduce the
performance of the classifier due to larger
search space known as “the curse of
dimensionality” [4] . This problem can be solved
by feature selection which can reduces the
number of features, lowers the training time of
the classifier and sometimes it can even improve
the classification performance[5][6].Feature
selection is an difficult task due to the
interaction among the features and larger
dimensionality. As the number of features
increases, the size of the search space increases
in an exponential manner[7]. So a thorough
search is almost not possible in this case.
Particle swarm optimization (PSO)[8][9] is a
new feature selection technique. The advantage
of PSO over the other feature selection
algorithms such as genetic algorithm and genetic
programming is that it is computationally less
expensive and the quicker convergence. Due to
this reason PSO is widely used as the feature
selection technique[10][11][12] .The idea of the
proposed method is to reduce the size of the
filter based on features which are being selected
by the PSO technique, with the reduction in the
complexity of computation and with likely or
even more performance of the classifier.
Organization of proposed work is as follows.
Section 2 includes previous works. section 3
includes information about dataset. Section 4
includes the overall methodology of the paper.
Section 5 includes comparision table of the
previous works. Section 6 includes performance
metrics and results and section 7 ,8includes
conclusion and references.
2. Related works:
ABCD technique has been used by
Shivangiet.al[13] and Karim Mokraniet.al[14]
by extracting the skin lesion features. Both for
segmentation and pre-processing, shape, texture
and size features are calculated and used for
classification. Narasimhan K and Elamaran[3]
used four wavelet filters for the classification of
dermoscopic images with 97.5 sensitivity and
96% accuracy. Karim Mokraniet.al[14], total
dermoscopic score is calculated and
classification is being done. It achieved
95%accuracy. Manousaki et al. [15] considered
colour, texture parameters giving result of
69%sensitivity. ABCD (Asymmetry, Border
irregularity, colour, different structures)is the
frequently used technique for the classification
of benign from malignant melanoma. Increase in
ABCD value tells that the lesion is highly
expected to be melanoma. Skin lesions are being
differentiated in[16] Blue-white veil and its
structures are detected by learning approach
Celebi et. al[17]. Shape descriptor and decision
tree classifier which considers pixel
classification are used. Experiments are done on
545 images which resulted in
89.97%specificity.Benign and malignant images
are being classified by svm and wavelets [18]
with 86.64% accuracy.For the analysis of skin
cancer, texture information was being analysed
by using ABCD rule and classification was
performed by SVM[19] .Classification based on
the adaptive wavelets was being used in[20].
Texture bases analysis calculates the
texturalfeatures like skewness, kurtosis, entropy,
homogeneity at various points of wavelets and
classifies based on machine earning techniques
[21, 22, 23, 24]. Support vector machine is
being used for skin cancer detection by
UzmaBanoAnsariezal[25]. This method used
support vector machines and image processing
techniques. Quality of image is increased by
preprocessing. After preprocessing, image is
subjected to thresholding. SVM classifies the
images into cancerous or noncancerous.
Classification is being done by both supervised
and unsupervised methods by Mhaskeet.al[26] .
\Highest accuracy is attained by support vector
machine compared to neural networks and k-
means clustering.SVM and neural network
achieves better accuracy compared to k-means
clustering algorithm. Yuan et all[27], used the
same methodand the aim is to enhance the total
DSS(decision support system)[27]. The
performance of this work is being experienced
on twenty two pairs of dermoscopic images.
Outcomes prove that the fourth order
polynomial kernel can achieve accuracy 70%.
Sequential Minimal optimization is being used
as the optimization technique by
Diwakaret.al[28] , who has done pre-
processing , segmentation, ABCD feature
extraction and used SVM classifier which
attained 87%sensitivity. Feature selection by
using new fitness function in PSO was proposed
by “B.Xu, Zang and Browne”[29] Which outer
performed SFS [30] and SBS[31].
3. Materials:
The datasets whichare used in this
method are downloaded from EDRA interactive
atlas of dermoscopy which includes both benign
and malignant skin lesions. Overall hundred
skinlesions including fifty benign and fifty
malignant skin lesions are taken into account.
These images are stored in JPEG format because
it is a lossless format and the resolution of the
images is 512x512. The images are taken from
the website: http://isdis.net/isic-project/
Samples of benign and malignant skin lesion
biomedical images are first pre-processed which
includes hair removal and standard histogram
equalisation. After pre-processing, DWT is
applied. High frequency components which are
present in the detail coefficients are obtained
and feature selection is being done by PSO
andSVM classifier has been used for disease
diagnosis. The proposed method is explained by
the block diagram and the following steps.

4.1 Image enhancement:

Fig1: Benign lesionFig2: Malignant lesion

4. Methodology:

Training data Testing data

Fig4: input skin lesion

Image enhancement

Feature extraction

PSO based feature selection

Z-score normalization

classification Fig5: gabor filtered result

SVM classifier
training

output

Fig3: block diagram of proposed work

The proposed work can be explained in the

following way. Totally fifty benignand fifty
malignant images are considered. 60-40 slip test
is perfomed on the biomedical images which
Fig 6: Preprocessed image
includes the following steps. Primarly, the
Hair removal: Artefacts such as Bubbles and Energy _ Dv 1=1/( p2∗q2 )∑├ x ={ p }▒ ∑ ├ y={q }▒ (Dv 1( x
thin hair are removed by using Median filter . (1)

Steps for thickerhair removal: 1

1.Identification and replacement of hair pixels
with closest non hair pixels and Smoothening
output.
2.For the location of darker hairs , gabor filters
are applied to the image as they smoothen
out low intensity values along structural
direction
3.The maximum response of the gabor filters is
found out.
4. The difference between the colour band and
gabor filtered result is thresholded
5.The hair masks seperates the hair and non hair
places to disjoint sets. The hair masks are to be
created for all the three planes i.er,g,b planes.
The final mask is the logical or of the three
masks.
6. The hair regions are replaced by the non hair
regions during the interpolation.
Histogram equalization:
In the proposed method, the images considered
from different subjects have different shape ,
size and orientation. These images have non-
uniform intensities.When the images are
preprocessed the non-uniform intensities are
changed to uniform intensities.This is called
histogram equalization or histogram
linearization. For the given non uniform
intensities of the input, uniform intensities of the
output are produced
Mean _ D 1= ∑ ∑ ¿¿ ¿ (2)
p∗q x={ p } y={q }
Discrete wavelet transform:
Given figure can be explained as
follows, For an input image I of size MxN,
g[n]islpf and h[n] is hpf. The image is
analysedby low pass filters and high pass filters
in sub band coding which leads to the
production of approximation and detailed
coefficients. When DWT is applied on an
image,four subbands are produced. They are
LL,LH,HL,HH with respective coefficients A1,
Dh1, Dv1, Dd1. A andD are approximation and
detail coefficients respectively. Usually the
detailed coefficients are considered as they
contain required textural information.Same
equation for average and energy calculations are
employed for horizontal and vertical
components. The proposed method used
daubechies and reverse biorthogonal wavelet
filters. Daubechies filters are considered due to
its property of noise removal. Reverse
biorthogonal filters are considered due to their
property of reconstruction, symmetry and
enhancement of textural features present in high
frequency components.Daubechies,reverse
biorthogonal wavelet filters are considered for
the feature extraction of proposed work
along rows
h(n) 2 LL A1

h(n) 2
4.2 Feature extraction: column
Dh1
g(n) 2 LH
Given two formulas calculates the average and row input
energy values. Usually, the general
h(n) 2 HL Dv1
characterstics of skin lesions are conveyed by
g(n) 2
the low frequency components and the textural
g(n) 2 HH Dd1
details are conveyed in high frequency
componentsThe formulas for the average and along columns

energy features are: fig 7: Block diagram of subband coding


4.3 PSO based feature selection:
In the machine learning, the main cause
for the classification problems is due to the
guessing of the class labels depending on the
information about the various features. During
feature extraction large number of features are
produced which consists of relevant, irrelevant
and redundant features. There are two
drawbacks due to the presence of the redundant
and irrelevant features. First one is that their
presence is not useful for classification. The
second drawback is that they sometimes reduce
the performance of the classifier. So feature
selection is very helpful in this case [32].
Feature selection aims in selecting only relevant
features from all the original features. By doing
this, not only will there be an improvisation in
the performance of the classifier, but also
reduces the complexity of the classifier[33].
Prominent method for selection of
features includes filter and wrapper. In the filter
based method, there is no dependence on an
algorithm and are generally computationally less
expensive than the other[33]. Wrapper based
method is comparatively different than the filter
based method.They use a learning algorithm,
fitness function and select best features out of
the original features. It has been proved that the
wrapper can give better classification
performance than the filter based methods[34].
Selection of features is not easy due to the
interaction among features and larger
dimensionality. As the feature size increases,
search space increases in an exponential
manner[34]. So a thorough search is almost not
possible in this case. To address this problems,
(SFS)[30] (SBS) [31] have been used but some
problems occurred due to these algorithms. The
problem is that they get struck in the local
optima and the computation cost is more. So
there raised a need for the development of good
feature selection algorithm.
start
Initialize the particles velocity and position
Define the fitness function
accuracy = (TP+TN)/(TP+TN+FP+FN)
Calculate the fitness of Calculate the fitness
each particle of all particles
p best current fitness
Yes
Current fitness >pbest
No
Assign current fitness as new
pbest
Keep previous pbest
Assign best particles pbest to get gbest
Calculate the velocities of each particle
Use each particle velocity to update its position
if maximum
Update iteration No Yes
count
accuracy
reached
Stop
Fig 8: Block diagram of PSO
In recent times various feature selection
techniques such as PSO[35,36,37],genetic
algorithm[38] and genetic programming have
been used[39] .It has been known that PSO can
be implemented easily, has lesser number of
parameters, expense is less in computation and
quicker convergence [40] when compared with
genetic algorithm and genetic programming. The
idea of the proposed method is to achieve this
goal by developing novel fitness in PSO for
selection of features. In PSO, each problem
solution is assumed to be a element in search
space[35]. Position of the whole swarm is
obtained by the best solutions which occur
depending on the experience of the individual
element and the whole swarm[41]. In PSO, the
position is shown by vector xi, where selected set of the features the Z-score
xi=(xi1,xi2,....xid), the dimensionality of the normalization is applied. Here, the original value
search space is represented by d and the velocity is yold, new value is ynew, m is mean and sd is
is represented by vi, where vi=(vi1,vi2,....vid). standard deviation.
pbest and gbest are best previous positions of
the element and the swarm respectively. 4.5 classifier training:
According to the given formulae the The classification by SVM is done by
velocity and the positions are updated and the the construction of a hyperplane which
optimal solutions are being found out in the differentiates data to 2 classes. Kernels for
following equations support vector machines includes “linear,
¿+¿ (3) Gaussian or radial basis function, polynomial
and sigmoidal kernel’’.In the proposed work rbf
t+1 t t
v id =
W× v id +
c ×r 1 1i (
p id _
x id )
kernel is proved to be best kernel due to the
similarity among the features.The benefit of svm
t

+
c ×r
2 2 i׿ ¿ ( p ¿ )
over the other classifiers is higher classification
rate . It produces the best result with proper
(4) kernel choice. The classifier performance is
t=tth iteration calculated by using performance metrics which
c1 ,c2 represents acceleration constants are sensitivity[3], specificity[3], accuracy[3] and
r1i, r2i denotes random variables in the range of positive predictive value[3].
[0,1]
5. Previous year works:
pid, pgd represents elements of pbest and gbest
Table 1: comparision of previous year works
respectively
w represents weight vector
Year Title Performance
vid represents velocity, range[-vmax, vmax]
metrics
2016 Classification by 96% accuracy
Basic fitness function: Accuracy
using wavelet
The fitness function given below is the features[3]
accuracy which is defined to increase 2015 ’usageofsvm for 86% accuracy
performance of classifier and decrease the error classification of
rate that is obtained during the selection of the melanoma[28]
feature subsets in the training procedure. 2010 ’svm and wavelet 86.64% accuracy
Fitness1=accuracy, where transform[18]
2010 ’Selection of feature 63% accuracy
accuracy=(TP+TN)/(TP+TN+FP+FN)[3](5)
subset in larger
where
dimensionality[4]
TP: true positives[3] 2008 blue white veil 69.35%
TN: true negatives[3] structures sensitivity
FP: false positives[3] detection[17] 89.97%
FN: false negatives[3] specificity
2006 classification of 70% accuracy
4.4 Z-score normalization: early melanoma by
using svm based
Energy and average features are rescaled texture
to same units by Z-score normalization. On the classification[27]
2006 Digital image 69% sensitivity
 processing system tabular form .As the filter size is reduced, the
in aiding melanoma computational complexity is also reduced.
diagnosis[15] M=L1 + L2 (7)
2004 utilization of 95% accuracy A=L1 + L2 – 2(8)
support vector
Equations 7&8 gives a single valued
machines on digital
information which are used for comparing
images[14]
2003 ’detection of skin 95% accuracy different classifier performance as represented
cancer[25] in below equations.
1995 PSO[8] 89% accuracy 1. Sensitivity:it is named as TPR ( True positive
rate), which estimates the count of positives that
6. Analysis of the Performance are related to accuracy, which is represented in
metrics equation 9
TPR = TP/(TP + FN)[3] (9)
We used four wavelet filters. They are 2. Specificity: It is named as TNR (True
daubechies(db3)[3] and reversebiorthogonal[3] negative rate), which estimate the count of
wavelet filters(rbio 3.3, rbio 3.5, rbio 3.7) Six negatives that are related to accuracy, which is
features consisting of three energy and three represented in equation 10
average features. So totally 24 features are used to
TNR = TN/(TN + FP)[3] (10)
train the classifier. Similar process is repeated in
3. Precision: it is named as PVV( Positive
testing phase and features are compared for
prediction value), that estimates the count of
classification. In the proposed method, trail for the
positive samples stated as a positive class by the
reduction of filter size is made with the retainment
classifier which as represented in equation11
of the same accuracy of 95%.PSO is used to
achieve this. It is used as the feature selection
PPV = TP/(TP + FP)[3] ( 11)
method for the reduction of the filter size and 4. Accuracy: it is the estimation of correct
features. PSO has selected 16 features out of 24 classification done by the classifier. Hence, it
features even with the increase in the accuracy shows the capability of whole performance.
from 92.5% to 95%accuacy. PSO has even ACC=TN+TP/(TN+TP+FP+FN)[3] (12)
selected two filters(rbio 3.5 and rbio 3.7) from the
given four filterswith the retainment of the same Table 2: comparisonof Computation complexity
accuracy 95%. Further two filters have been
Filters Multiplicatio Additio No of
reduced to one filter with the retainment of the
same accuracy 95%. The two sets of filters namely ns ns computatio
rbio 3.5and rbio 3.7produces the equal precision ns
as both have same coefficients of filter and lengths 4 60 44 104
of the filters, hence, any one combination can be filters
used. Lengths of filters denoted as L1 & L2 with PSO 48 36 84
high pass and low pass which are biorthogonal selecte
filters and for accomplishing the operation of
d
filters[42], the required number of additions(A)
and multiplications(M) are calculated by using feature
2Filter 36 28 64
equations 7 & 8. These equations are used to
calculate the complexity of computation of 1D s
signals that is , formulas are multiplied by two in 1 filter 20 16 36
case of an image associated to vertical & Table 3: Performance Metrics Analysis
horizontal separable filtering. These complexity of
computation comparison of filters is represented in
 Fig 10: comparison of sensitivity with corresponding
kernel values

T F T F TPR SPC PP ACC

filters P P N N V
96

94

s p e c ific ity
Four 18 2 19 1 94.7 90.4 90 92.5 92

Filters 3 7 0 90 All filters

PSO selected features
88
Two filters
PSO 19 1 19 1 95 95 95 95 86 One filter

featur 84
e 82
σ=0.25 σ=0.50 σ= 1 σ= 2

Rbf kernel values

2- 19 1 19 1 95 95 95 95
filters Fig 11: comparison of specificity with corresponding
kernel values
1-filter 19 1 19 1 95 95 95 95

P o sitiv e P re d ic tiv e Va lu e
96
94
92

90
All filters
88 PSO selected features
100 86 Two filters
One filter
84
95
82
90 80
Accuracy

All filters σ=0.25 σ=0.50 σ= 1 σ= 2

85 PSO selected features
Rbf kernel values
Two filters
80
One filter

75
Fig 12: comparison of positive predictive value with
corresponding kernel values
70
σ=0.25 σ=0.50 σ= 1 σ= 2

Rbf kernel values 7. VLSI implementation of

Fig 9: comparison of accuracies with corresponding melanoma detection
kernel values
In the RBF SVM hardware architecture
implementation, to implement a parallelism and
pipelined (improving the performance) RBF
kernel based linear support vector machine
T r u e P o s itiv e R a te (S e n sitiv ity )

100 (SVM) classifier with adders and multipliers in

90
80 order to reduce delay and area with high
70
60 All filters
performance.
50 PSO selected features
40
The input of hardware is coming from Matlab.
two filters
30 one filter
20
10
The outputs of the Matlab are Support vectors
0 (SV), Text features (X), Sigma (σ), Alpha (α)
σ=0.25 σ=0.50 σ= 1 σ= 2

Rbf kernel values

and Bias (b). These outputs are obtained in
offline mode in training phase. The output of
training phase in computer is a set of support
vectors and the set of weights (α) that shows the
boundary hyperplane of two classes either
melanoma or benign classes. By using these
parameters of training phase to implement the
hardware architecture of testing phase.
The RBF kernel based SVM module shown in
Fig 13. This RBF architecture consists of one
accumulator, one subtractor, one CORDIC
module to compute the exponential function,
one BRAM module for storage of support
vectors, text features, bias and alpha values, and
architecture also consist of one square multiplier
and two multipliers.
Fig 13: Overall architecture of RBF SVM
All the outputs of training phase vectors are
stored in the format of 8Q32 bit. That means the
length of the vector 32 bit, in this 32 bit first 8
bit can be used for integer part and remaining 24
bits are fraction part. In this pipelined hardware
architecture requires 36 CORDIC blocks, 36
subtractors, 36 accumulators and 72 multipliers
for the hardware implementation of 36 support
vectors.
The Xilinx IP Core module CORDIC block is to
provide the sinh and cosh of the input. The input
range for CORDIC block is from -pi/4 to pi/4.
But we require the range of the exponential
function from 0 to -68. We need to extend the
exponential range by using CORDIC IP CORE.
In the BRAM (Block RAM) we use FIFO buffer
lines to store the support vectors and text vectors
and alpha values. The input and output width of
BRAM is 8bit. For 36 support vectors with five
features require 222 vectors for single image,
For 40 Testing images require 417 vectors. Each
vector consist of 32 bits length and each vector
requires 4 memory locations. For 36 support
vectors requires 888 memory locations.
The MSB bit of final value of the hardware
board is 1, means this image belongs to
melanoma image shown in Fig 14, The MSB bit
of the final value is 0, means this image belongs
to benign image shown in Fig 15.
Fig 14: Normal image Simulation result of RBF
kernel SVM architecture for single image
 utilization results of 36 support vectors are
shown in Table 4.

Table 4: Hardware utilization of 36 support

vectors

S.no Type Used Available Util(%)

1 LUTs 594131 594131 83.45
2 Register 36084 1424000 2.53
3 DSPs 1596 3360 47.50
4 IOB 173 480 36.04
Fig 15: abnormal image Simulation result of 9. Conclusion
RBF kernel SVM architecture for single image
In the proposed work, number of the
For 36 support vectors our architecture takes features required for the classification is reduced
83.45% of LUTs and 2.53% of slice registers in by PSO method. These reduced features are fed
7vx1140tflg1928-1 FPGA Board. Simulation as input to the support vector machines and svm
results of 40 testing images by using 36 support is trained. The texture features present fully in
wavelet filter coefficients which are used to
vectors shown in Fig 16.The proposed hardware
discriminate the benign from malignant
architecture hardware accuracy and software melanoma. Four filters are reduced to one filter
accuracy are equal. with the retainment of same accuracy of 95% in
both software and hardware results. As the
filters size is reduced the computational
complexity is also reduced.

Fig 16: Simulation results of 36 support vectors
in SVM architecture for 40 images
8. Hardware utilization:
The Hardware utilization results are taken from
the synthesis reports generated by Xilinx
VIVADO V.2017.2 (win64) environment with
7vx1140tflg1928-1 FPGA (Field programmable
gate array) Device. The summarized hardware
10. References
[1] Human analysis regarding skin for better health
http://www.webmd.com/skin-problems-
andtreatments/ picture of the skin reacquire on
August 15,2016
[2]Information regarding “Skin cancer” available in
below link
http://www.britishskinfoundation.org.uk/SkinInforma
tion/SkinCancer.aspx(2016),march 20 2016
[3] “Energy characters for diagnosis fore melanoma
based on Wavelets from dermoscopicimages ”,
J.biomedical technology and engineering by
Narasimhanan and Elamarann vol. 20, pp242-252
[4] “Selection of feature subset in larger
dimensionality” by smith &Agheyasvol 43, no.1,pp
5-13,Jan 2010
[5] “fordevision or to classify feature” by M.Dash
and H.Liu, vol1 pp 131-156 1997 no 1-4
[6] “Fetureselection based on PSO to solve
problems”byA.Unler and A.Murat no 3,
Pp 528-539, nov 2010,vol 206
[7] “variable and feature selection introduction” by
A. Elisseeff and I. Guyon, pp1157-1182, volume 3,
march 2003
[8]’PSO’ IEEE IntConf neural networks by
J.Kennedy and R. Eberhart, pp1942-1948 ,1995, vol4
[9] “modifiedPSO”by Y. Shi and R. Eberhart , pp 69-
73,1998
[10]”A Discrete PSO by A. Unler And A.Murat”pp
528-539, no3,nov2010,vol 206
[11] “PSO improvisation by H. Chen, G. Wang,
H.Dongand” Y. Liu pp191-200, vol8, no2,june 2011
[12] “PSO based detection by adaboost algorithm”
by M. Johnston, A. Mohemmed, and M.
Zhang,pp2494-2501,2009
[13] “skin cancer detection”, by Vandanajagtap,
ShivangJain and NitinPise, pp735-740, Elsevier,
ICCC-2015
[14] “utilization of support vector machines on digital
images” by Zafiropoulos, Maglogiannis ,pp 1-8,2004
[15] “Digital image processing system in aiding
melanoma diagnosis” Manios, Tsompanaki and
Manousaki pp 402-410,2006
[16] “Classification based on the ABCD rule’by
Karim Mokranii and Reda Kasmi” volume 10,pp
448-455 2016
[17] “blue white veil structures detection”by
Giuseppe Argenziano, Randy H. Moss, William M.
EmreCelebi , V. Stoecker, H. Peter Soyer, Hitoshi
Iyatomi and Harold S. 2008 pp 670-677
[18] “svm and wavelet transform’”byTirtajaya and
Santika pp 164-166, December 2010
[19] “Performance evaluation and detection of
melanoma”by D. Gautam, D. Singh, and M. Ahmed,
pp 567-572, july 2014
[20] “tree structured wavelet transforms for
classification” by A. P. Dhawan, S. V. Patwardhan
and P. A. Relue pp 223-239,nov 2003, vol 72
[21] “Incidence of dyplastic nevi and high incidence
melanoma’byGoppnerD , Kruger S pp517-520, 2014
[22] “skin lesions characterization overview” by
Doukas , Maglogiannis I pp 721-733, 2019
[23] “Incidence of dyplastic nevi and high incidence
melanoma” by muler, krger, goppner, H. Gollnickk
pp517-520 ,sep 2014, vol.94
[24] “skin lesions characterization overview” by
C.N.Doukasvol and I.Maglogiannis, pp.721–733, Sep
2009, no5
[25] “detection of skin cancer” by TanujaSarode and
UzmaBanoAnsari, Apr-2017,volume4
[26] detection of melanoma skin cancer by using
machine learning” by Mrs. D.A.Phalke, Ms.
H.R.Mhaske, dec 2013.
[27] “classification of early melanoma by using svm
based texture classification’’ by ZhenyuYang,
NizarMullani, GeorgeZouridakis, XiaojingYuan,
2006, pp 4775-4778
[28] “usage of svm for classification of melanoma”
by DiwakarGautam ,Mushtaq Ahmed, 2015,pp. 1 – 6,
[29] “new fitness function proposed in PSO” by M.
Zhang, B. Xue and W. N. Browne, pp. 1–8,2012
[30] “non parametric selection by using direct
method” by A. Whitney, pp. 1100–1103,sep 1971, no
9
[31] “recognition systems and effectiveness of
receptors ”, D. Green, T. Marill, pp. 11–17, Jan. 1963
and no. 1
[32] “varible feature selection” by A. Elisseeff, I.
Guyon, 2003 pp. 1157–1182
[33] “classification by using feature selection”, H.
Liu, M. Dash, 1997, pp. 131–156
[34] “Feature selection by using wrapper” by G. H.
John and R. Kohavi, pp. 273–324,1997
[35] “BPSO for feature selection with chaotic maps”
by Y.chang, yang and li pp107–112,2008
[36]’discrete PSO in binary classification’by A.
Murat, A. Unler ,2010,pp. 528–539
[37] “Boolean BPSO” by chunang and yang pp2093–
2098, 2008
[38] “Filter and wrapper for two phase feature
selection” by W. Gangshan, H. Yuan and S. S. Tseng,
pp. 132–136, 1999
[39]’genetic programming in face detection’by M.
Zhang and K. Neshatian pp. 391–396,2009
[40] “multimodal problem generator in PSO and
genetic algorithms” by W.Spears, J.Kennedy, pp78–
83,1998
[41]’ “computation and swarm intelligence” by Y.
Shi, R. C. Eberhart, J. Kennedy,2001
[42] “ Anew Flexible biorthogonal filter desing for
multi resolution filter bans with application to image
compression”, NilolayPolya and WillamPearlman, to
appear in the IEEE transactions on signal processing.