© All Rights Reserved

1 vues

© All Rights Reserved

- An Efficient Learning of Constraints for Semi-Supervised Clustering Using Neighbour Clustering Algorithm
- Analysis And Detection of Infected Fruit Part Using Improved k-means Clustering and Segmentation Techniques
- sdarticle4
- An Effective Technique for Clustering Incremental Gene Expression data
- The Clustering in Large Databases using Clustering Huge Data Sets (CLHDS) Algorithm
- Using Clustering and DEA for evaluation and ranking university majors
- Paper
- Digital Image Processing U1
- IMAGE ENHANCEMENT BASED ON FUZZY LOGIC AND THRESHOLDING TECHNIQUES
- Av 23274279
- MRI1
- A Comparison of Threshold Ing Methods
- EC708 new
- Cluster Analysis
- References
- Web Pepole Search
- Course Outline(3)
- Palmprint
- syllabus DWDM
- [IJCT-V2I1P23] Authors :Dinesh Babu G L , Hariharan G

Vous êtes sur la page 1sur 21

SEGMENTATION

In the hard clustering process, each data sample is assigned to only one

cluster and all clusters are regarded as disjoint gatherings of the data set. In real

life, however, there are many cases, in which the clusters are not completely

classification process cannot cater for such a situation. Therefore, the separation of

the clusters becomes a fuzzy notion, and the representations of real data structures

can then be more accurately handled by fuzzy clustering methods. In these cases, it

is necessary to describe the data structure in terms of fuzzy clusters. The fuzzy c-

means (FCM) algorithm is the best known and the most intelligently used

technique. The objective function of FCM algorithm is very suitable for image

image can be prudently handled FCM algorithm. The use of membership values

provides more flexibility and makes the clustering results more useful in practical

applications. To take the image geometric properties into account, we can make

can no longer be used. Now let us consider the FCM clustering method to segment

the image. At each pixel, we have two membership values, one representing the

the degree of certainty of a pixel belonging to foreground. Since the sum of two

membership values must be equal to one, they are not independent of each other.

In general, for any -class problem, only membership values for each input

There exist many literatures suggesting various methods Pap smear image

the requirement. The first attempt to detect and segment cells in cervical

methods. The boundaries of the structuring elements of the cells can be detected by

applying methods based on active contours [104], template fitting [172], genetic

algorithms [173], region growing with moving K-means [174], and edge detectors

[175]. The method proposed by Lezoray and Cardot [171] is based on pixel-

classification techniques for the detection of the nuclei markers, in order to avoid

the over segmentation that the watershed algorithm may produce. In pixel-

classification techniques, the choice of the number of the classes the pixels belong

to plays a crucial role for the final segmentation result. Pap smear images exhibit

great complexity and the number of pixel classes is not obvious. The rough

assumption that all the pixels of the image are distributed into two classes, such as

Plissiti et al. [176] proposed a method of automated cell nuclei detection in

Pap smear images using morphological reconstruction and two types of clustering

clustering are used in the study. The preprocessing of the images involved

process is refined with the application of a 3x3 flat structuring element. Gray scale

process creates some regional minima. FCM and SVM processed these regional

minima and found out the true nuclei and the points belonging to other regional

minima.

Supervised SVM requires a training data set or more precisely some apriori

knowledge of the cell nuclei. An incomplete and unrealistic training set will greatly

affect the efficiency of SVM. A fixed structuring element of size may cause

problem for images of higher dimension. FCM suffers from the local minima

problem.

Kim et al. [177] proposed a method of segmentation and classification of

algorithm. The extracted characteristics of the cell nuclei are morphemetric feature,

images are preprocessed with a three layer processing: conversion to gray scaled

and are the brightness values of the original image and z is . is the

sum of the lowest brightness value and 30% of the highest brightness value, and

is 80% of the highest brightness value. and are 0 and 255 respectively.

Next fuzzy morphological operation is applied which helps to extract the region of

refinement of the cell nuclei region. The fuzzy morphological operations are

defined as [177]

! " #$%

! &'() *+ , -

./ 0 12 !34 5

7 &( 7

0 12 6 >

89 :;<&=:

? ?! " #$%

?! =@ )A* + / !34 5

thresholding. Feature extraction from the segmented images is performed and the

information mostly based on histogram. According to Kim et al. [177], one of the

most important features is textural feature. The extracted features are processed

Only 20 samples of Pap smear images are analyzed with the method which

is very low for analytical procedure as there exists a vast variation of images. Use

Pap smear images using a combined framework of distance metric and FCM

images are created from each of the Pap smear images using Otsu’s method [47].

Logical OR operation is used to obtain a binary mask from the binary image. The

connected components with less than 500 pixels are removed. For detection of

are removed using an edge detection method. The Euclidean distance metric is

used to refine the markers. The centroids of the nuclei are refined by applying the

&

Repeat

B C DE &

Select ; F G , -.H IJ

& KK

E is the area that has label equal &, 'E is labeled area, and is the gray level

image of the original image. Finally, FCM clustering algorithm is used to segment

(iii) Positive class is defined when average intensity of the clusters is lower than

the other.

evaluate the intensity values and again FCM is used to refine the markers of the

candidate nuclei. The use of FCM algorithm with fixed number of clusters reduces

the efficiency and the flexibility of FCM. One of the obvious drawbacks of the

method is the use of only one criterion as an input to the FCM algorithm, which is

trivial. The complexity of the Pap smear image is not considered up to the level of

segments the Pap smear images into cell nuclei, cytoplasm and background. In the

stretching process, the distribution of gray level of the Pap smear images are

stretched. This is a simple process of enhancing the contrast of the images. Images

are segmented using two clustering techniques, FCM and non-adaptive k-means

algorithm. Ghafar et al. [171] compared the results of the two segmentation

algorithms. Non-adaptive k-means and FCM algorithms, both can detect only

method suffers from the typical limitations of the two clustering algorithms.

Pap smear test through FCM clustering algorithm and learning vector quantization.

growing method suggested by Jones et al. [181] does segmentation of the images.

Fourteen texture features are extracted based on the work of Haralick et al. [182],

representing statistics of the co-occurrence matrix of the gray level image. Four co-

general statistics about the relative positions of the gray levels within the image.

Cebron et al. [180] modified the FCM algorithm to cancel the affect of

noise. They define the feature vector and the objective function as follows: let

L N & O O O "L " be a set of feature vectors for the data items that are to be

4M

QR

4M

distance function, X, the FCM algorithm with noise detection iteratively minimizes

"b" _ "b" _

YZ [ [ WMZR X ST N ^ c [

^

[ WM R ^

Q\ 4]

M`a R`a M`a R`a

d is the fuzzification parameter and indicates how much the clusters are

allowed to overlap each other. The first term on the right hand side of the above

whereas the second term arises from the noise cluster. c is the distance from every

datapoint to the noise cluster . This distance can either be fixed or can be updated

in each iteration according to the average inter-point distances. Objects that are not

close to any of the cluster centers ST are therefore detected as having a high

QR

An adaptive active classification based FCM clustering algorithm followed

the unsupervised FCM clustering. A user can adjust the parameters of the FCM

clustering as well as can label the samples and add them to a labeled prototype

clusters.

The method is efficient because FCM is prone to noise and the noise

cluster center generation. The interactive user dependent FCM clustering can give

very good result provided the user is sufficiently expert and has good knowledge of

the cell assay image. The unsupervised FCM clustering produces a noise cluster.

This has both advantage and disadvantage. It enables efficient noise removal; and

on the other hand, the noise points could have been discarded without assembling

some limitations as seen in the previously discussed methods. The user defined

FCM parameter and labeling can completely fail due to lack of experience and

7.3 Proposed method of Analysis of Pap smear images using FCM algorithm

Colour Pap smear images in RGB colour channel are considered for

particular value for the three colour channels red (R), green (G) and blue (B).

Hence to find the different areas inside the image, let us consider the image as a set

of data having pixel values R, G and B. This dataset (x1, x2,....xn) is classified using

inside image namely nucleus and cytoplasm. To initiate the clustering process

Two types of random number generator are used; general random number

generator and random number based on Chaos theory. These random numbers

constitute the membership value (µ) of the pixels. The µ value of the pixels are

compared with that of the cluster center and classified accordingly. The clustering

process segments the images namely into three classes: cytoplasm, nucleus and the

background.

various factors, such as the process of initialization, the choice of the number of

clusters’ c etc. The method of initialization requires a good estimate of the clusters

been developed in the past. In this section, three of these measures are described:

c n

1

F (U , c ) = ( µ ik )

2

n i =1 k =1

Suppose that _ represents the clustering result, then the optimal choice of

c is given by

c {

max max F (U , c ) )

Ωc } c = 2,..., n −1

The partition coefficient measures the closeness of all input samples to their

corresponding cluster centers. If each sample is closely associated with only one

cluster, that is, if for each U, MR is large for only one value, then the uncertainty of

1 c n

H (U, c) = − µik log ( µik )

n i=1 k =1

c {

m i n m in H (U , c ) )

Ωc } c = 2,..., n − 1

When all MR ’s have values close to 0.5, which represents a high degree of

and indicates a good clustering result. The compactness and separation (SC)

c n

1 2

µ i2k x k − v i

n

S (U , c ) = i =1 k =1

2

m in vi − v j

i, j

c {

m i n m i n S (U , c ) )

Ω c

} c = 2,..., n − 1

corresponding cluster centers and the minimum distance between cluster centers. A

good cluster procedure should make all input samples as close to their cluster

centers as possible and all cluster centers separated as far as possible. The

compactness and separation validity function seems to work better for image

segmentation problems.

Shape analysis gives the idea about the shape of an object. Simple direction

code or chain code can be used to trace the contour of an object. The chain code is

chosen among 8 selected points on the boundary of the object as shown in Figure

7.1. The angle between any consecutive lines connecting two consecutive pair of

points is 45°. Any two opposite points can be taken as starting points of boundary.

Suppose point 1 and point 5 are taken as the starting point of the boundary and let

Figure 7.1: Direction code with 8 points

7.4 Results

The segmented images of the Pap smear images FCM clustering algorithm

Chain coded direction is used to trace the boundary of the cell nucleus. The

tracing is helpful in distingushing the cell nucleus, that is to visualize the region of

inaterest for the health personnel. Cell nuclei are traced with white dotted line as

The seven classes of Pap smear cell images segmented with the histogram

and morphology based segmentation are again segmented with FCM clustering

algorithm. In Table 7.1, the seven classes of Pap smear cell images are with their

(a) (b)

(c) (d)

Figure 7.2: FCM segmentation: (a) and (c) Original Pap smear image; (b) and (d)

Segmented image.

(a) (b)

(c) (d)

Figure 7.3: Chain coded tracing: (a) and (c) Original image, (b) and (d) traced cell

Table 7.1: Seven class of Cervical cell segmentation and cell nuclei tracing.

Cell Original Image Segmented Image Traced cell nucleus

Class boundary

1

7

The clustering process is validated by three cluster validity measures. The

processing tasks. The FCM segmentation is carried out on both the images with

cluster of cells and the images with single cell. The cluster validity measure values

The cluster validity measures for the segmented images in Figure 7.2 (b)

and (d) are given in the Table 7.2. The value of the fuzzifier, d is 1.2.

Clusters coefficient Entropy Separation index

(c) (PC) (PE) (SC)

Figure 7.2

(b)

2 0.59 0.62 1.28

Figure 7.2

(d)

2 0.63 0.56 1.16

The cluster validity measure values are also calculated for the seven classes

of cervical cell images. The number of the clusters for these images are

generated for FCM initialization as described in Section 7.3.1. The value of the

fuzzifier, d is kept same as above that is 1.2. Table 7.3 shows the values of three

Table 7.3: Cluster validity measure values for seven classes of cervical cell image

Class of Coefficient Entropy and

Clusters (PC) (PE) Separation

index (SC)

1

5 0.29 0.68 0.96

2

4 0.33 0.69 0.88

3

3 0.43 0.71 0.83

4

4 0.48 0.72 0.79

5

4 0.31 0.75 1.05

6

3 0.49 0.83 1.12

7

4 0.51 0.89 1.44

7.5 Discussion and Conclusion

The FCM clustering algorithm has several advantages over hard clustering

and conventional non-fuzzy image segmentation methods. This can be seen from

the results in Figure 7.2 and Figure 7.3, Table 7.1, Table 7.2 and Table 7.3. The

proposed in Chapter 6, works on converted gray level image. The conversion may

lead to some data loss. But the FCM based method works on colour image and

RGB colour space has three components, R, G, and B. Thus, a pixel has

three values associated with it. Two types of random number generators are used to

form the membership matrix for each pixel. The use of right random number

idea of the goodness of the clusters terms of the dataset and the problem domain.

In this study, three validity measures are used; partition coefficient (PC), partition

entropy (PE), and compactness and separation function (SC). The PC and PE are

image.

The shape analysis gives the contour of cell nuclei, which is a critical

criterion for cervical cancer diagnosis. The application of chain code is easy and

simple, though it is capable of producing very reliable result. It exploits the pixel

image data. The obvious drawback of FCM algorithm is that it cannot detect

clusters of arbitrary shape except spherical shaped clusters. In case of colour image

segmentation, where very subtle and uncertain change in pixel properties occurs

within a large data space, FCM fails to detect all the valid clusters. A closer

inspection of the segmentation results presented in Figure 7.2 and Table 7.1,

invites some retrospection. In Figure 7.2 (b) and (d), it can be seen that not all the

cell nuclei are segmented properly. In Table 7.2, some images are over segmented

and some are under segmented. The high dimension of image data is responsible

The tracing of the cell nuclei works well in case of images with less

complexity, such as minimal colour variation, but fails to trace the region of

interest (ROI) where the boundary is vague. Some parts of the cytoplasm are traced

Pap smear images, and to generalize the shape analysis with some concrete and

invariant shape measures. In the next chapter a method, which attempts to address

- An Efficient Learning of Constraints for Semi-Supervised Clustering Using Neighbour Clustering AlgorithmTransféré parEditor IJRITCC
- Analysis And Detection of Infected Fruit Part Using Improved k-means Clustering and Segmentation TechniquesTransféré parInternational Journal for Scientific Research and Development - IJSRD
- sdarticle4Transféré parapi-3706534
- An Effective Technique for Clustering Incremental Gene Expression dataTransféré parIJCSI Editor
- The Clustering in Large Databases using Clustering Huge Data Sets (CLHDS) AlgorithmTransféré parIJSRP ORG
- Using Clustering and DEA for evaluation and ranking university majorsTransféré parJournal of Computing
- PaperTransféré pardiyaraj
- Digital Image Processing U1Transféré parsid1990
- IMAGE ENHANCEMENT BASED ON FUZZY LOGIC AND THRESHOLDING TECHNIQUESTransféré pareditor3854
- Av 23274279Transféré parAnonymous 7VPPkWS8O
- MRI1Transféré par9750313106
- A Comparison of Threshold Ing MethodsTransféré parMariam Rotinwa-Akinbile
- EC708 newTransféré parprathiie1
- Cluster AnalysisTransféré parVinayak Modi
- ReferencesTransféré paraisyah786
- Web Pepole SearchTransféré parJoy Machado
- Course Outline(3)Transféré parKim June
- PalmprintTransféré parjssudheer
- syllabus DWDMTransféré parsaravanakumar15
- [IJCT-V2I1P23] Authors :Dinesh Babu G L , Hariharan GTransféré parIjctJournals
- 00061706.pdfTransféré parSaqib Zafar
- A SURVEY OF LINK MINING AND ANOMALIES DETECTIONTransféré parLewis Torres
- 24Transféré parAyreine Nisya
- rana2011Transféré parhamadaxx2000
- Reading Py Spark Ml LibTransféré parAnupam Baruah
- Devnagri Script Recognition Using Artificial Neural Network ClassifierTransféré paresatjournals
- Analysis of Image Segmentation Techniques for Medical ImagesTransféré parAmany Morsey
- A New Classification Method for High Spatial Resolution Remote Sensing Image Based on Mapping MechanismTransféré parpushpakarthi
- Crisanto Da Cunha - Toolkit Support for the Analysis of Finger Movement in a Video StreamTransféré parCrisanto Da Cunha
- An Improved Method for Image Segmentation Using K-Means Clustering with Neutrosophic LogicTransféré parMia Amalia

- Baglamukhi MantraTransféré parDus Mahavidya
- b.tech Spot Valuation RegistrationTransféré parmaruthi631
- unit3 IOTTransféré parmaruthi631
- unit-2 IoTTransféré parmaruthi631
- 21-09-17Transféré parmaruthi631
- 2017-18_1.pdfTransféré parmaruthi631
- 311WTTransféré parmaruthi631
- 312CNTransféré parmaruthi631
- 311MPITransféré parmaruthi631
- 2.6.3 (1)Transféré parmaruthi631
- Book2Transféré parmaruthi631
- Distributed System-II.pptxTransféré parmaruthi631
- Chapter 4 slides.pptTransféré parMuhammad Farooq
- 09b21fc2ae27949abebbfeb8c074fb8bd262.pdfTransféré parmaruthi631
- 05_contents.pdfTransféré parmaruthi631
- 09_chapter4.pdfTransféré parmaruthi631
- Giz2016 Bmz Digital IKT StudieTransféré parmaruthi631
- PythonTransféré parjanmejoydas
- ieee conference paperTransféré parmaruthi631
- 203cd4e4b1c58088fe2947c4ccad5a074cecTransféré parmaruthi631
- Harish 2009Transféré parmaruthi631
- unit-1 IoTTransféré parmaruthi631
- Candlestick Flash Cards- TradeSmartTransféré parcalibertrader
- ac letterTransféré parmaruthi631
- 1305.0982Transféré parmaruthi631
- An Efficient Visualization and Segmentation of Lung CT Scan Images for Early Diagnosis of CancerTransféré parmaruthi631
- PREDICTION OF LUNG CANCER USING IMAGE PROCESSING TECHNIQUES: A REVIEWTransféré paracii journal
- SurveyTransféré parchaithra580
- 2013-2014Transféré parmaruthi631

- Series vs Parallel WiringTransféré parMAHIPAL
- omnetTransféré parMohamed Darqaoui
- TrigoTransféré parHakim Latiffi
- Constitutive Model of the Alloy 2117-T4 at Low Strain[1]Transféré parJavier Barrera
- Tamaya Astro NavigationTransféré parsiroos_afs
- neplan0Transféré parbajrica
- Combined Autoclave and Water Purification System using Solar EnergyTransféré parIJIRST
- Water Cooled Chillers PrimerTransféré parMuhammad Faizan Jantan
- ICS_2415_ADBS_Sess05_10_AdvTopicsTransféré parWellWisher
- app2Transféré parakhyar98
- faTransféré parBadic Victor
- MO_lecture_course-2.pdfTransféré paraneeshssa
- Applications of DSCTransféré parprinceamit
- The Swift Programming Language - Apple Inc_.pdfTransféré parzulo666
- 10 Rook endings.pdfTransféré parAlin Titiriga
- Textile Chemistry Ivth Sem PapersTransféré parTanmay Jagetia
- hydrogen peroxide and yeast prac prac infoTransféré parAditya Pujara
- Business MathematicsTransféré parVishal Bhadra
- Project Delta RobotTransféré parRobert Kodra
- Calculation of Mappings Between One and N-dimensional Values Using the Hilbert Space-Filling CurveTransféré parBahareh Sarrafzadeh
- Mylar Physical & Thermal PropertiesTransféré parthermalguru
- Flare NetTransféré parPetrol Solly
- Evaluation of Lower Errakalava Watershed, West Godavari District, A. P. - An Integrated Approach Using Remote Sensing And GIS TechniquesTransféré parAnonymous vQrJlEN
- 3051Transféré parTamy Alex
- lec9.pdfTransféré parTesh Si
- Frånvaro Hilbert Space: Mark Hilbert's Space Shuttle 1969 Mark Richard RossettiTransféré parMark Richard Hilbert(Mark Richard Rossetti)
- Group Number 15Transféré parRaman
- EXOS Command Reference 15 6Transféré parMario Matiz
- Risk Analysis in Investment AppraisalTransféré parchioque
- Shear force and Bending momentTransféré parsiddhantkankrej