2009 International Conference on Information Management, Innovation Management and Industrial Engineering

Classification for Trademark Image Based on Normal Cloud Model

Ya-Li Qi
The Computer Department
Beijing Institute of Graphic Communication
Beijing, China, 102600
e-mail: qyl@bigc.edu.cn

Abstract—Classification is an important research topic in
the field of image data mining. There have been many data
classification methods studied, including decision-tree
method, statistical methods, neural networks, rough sets,
etc. This paper proposed a method to classify the image with
normal cloud model which is an uncertainty transformation
model between quantities and qualities conception. We
develop the algorithm for classification based on normal
cloud model. Finally we perform experiments on an
artificial trademark image database. The results show the
advantages of the cloud model in the process of
classification.
Keywords-data mining; thecloud model; classification
algorithm; trademark image retrival
I. INTRODUCTION
Data classification is a well-recognized operation in
data mining and knowledge discovery research field and it
has been studied extensively in statistics and machine
learning literature [1]. There are some methods on data
classification. Quinlan [2] developed a decision-tree
classification method, which is a supervised learning
method that constructs decision trees from a set of
examples. Shan.et.al. [3,4] proposed an approach, which
uses rough sets to ensuring the completeness of the
classification and the reliability of the probability estimate
prior to rule induction. In [5] proposed statistical
approaches to classification. Jianhua Fan and Deyi Li
present a new mathematical representation of qualitative
concepts—Cloud Models. With the new models, mapping
between quantities and qualities becomes much easier and
interchangeable. Based on the cloud models, a novel
qualitative strategy for data classification in large
relational databases is proposed. Then, the algorithms for
classification are developed, such as cloud generation,
complexity reduction, identifying interacting attributes, etc.
In [9] application cloud model to puts forward the theory
of cloud detecting which uses multi-detectors to evaluate
the uncertain antigen, and will decrease the false positive
rate and false negative rate based on classification. By the
enlightenment of these research theses, this paper
proposed a method to classify the image with Cloud
model. We design an algorithm to develop normal cloud
generation based on an artificial database which includes
train samples and test samples. Then classify the test
sample to its class. The experiments results are showed in
section4. The rest of the paper is organized as follows.
Section2 briefly introduces cloud model. The algorithm to
structure cloud model classifier is showed in Section3.
Finally Section5 concludes the paper based on the
experiments results and the future research direction.
II. CLOUD MODEL
Deyi Li. define the cloud model following the
important characteristics of linguistic variables and
terms[1,6]. Normal Cloud is widely used in knowledge
representation. Let U be the set U={u},as the universe of
discourse, and T a term associated with U. The
membership degree of u in U to the term T, CT(u)∈[0,1],
is a random number with a stable tendency. The cloud of
T is a mapping from the universe of discourse U to the
unit interval [0,1]. That is:
CT(u):U→[0,1] (1)
u∈U u→CT(u) (2)
The normal cloud (NC) is based on normal
distributions. It can be characterized by three digital
parameters: A (Ex, En, He). The expected value Ex points
out the center of gravity of a cloud. The entropy En is a
measure of the fuzziness of the concept over the universe
of discourse, showing how many elements could be

978-0-7695-3876-1/09 $26.00
$25.00 © 2009 IEEE 74
DOI 10.1109/ICIII.2009.328

Authorized licensed use limited to: EASWARI COLLEGE OF ENGINEERING. Downloaded on July 12,2010 at 08:11:31 UTC from IEEE Xplore. Restrictions apply.
 accepted by the term A. The hyper entropy He is a
measure of the uncertainty of the entropy En. The larger
the value of He, the more random the set of membership
degrees is distributed. Given the digital characteristics Ex,
En and He represent a linguistic term. For a cloud first of
all, the mapping from all u in U to the interval [0, 1], is
one-point to multi-point transition, producing
membership cloud, rather than a membership curve.
Secondly, any particular drop of the cloud may be paid
little attention to, however, the total shape of the cloud,
which is visible, elastic, boundless and movable, is most
important. Thirdly, the mathematics expected curve
(MEC) of a membership cloud may be considered as its
membership function from the fuzzy set theory point of
view. Finally, the definition has effectively integrated the
fuzziness and randomness of a linguistic term in a unified
way.
III. CLOUD MODEL CLASSIFIER
Cloud model curve obey normal distribution which
reflect daily fuzzy concept. And in the cloud model for
random x, the degree of membership will change within
limits to any concept, which reflects different person has
different viewpoint for the same thing in the daily life. In
this paper we train the normal cloud model for
classification.
A Normal Cloud Generation
Given three digital characteristics Ex, En, and He, to
represent a linguistic term, a set of cloud drops may be
generated by the following algorithm:
Normal Cloud Generation Algorithm:
Input:
The expected value of cloud Ex, the entropy of cloud
En, the hyper entropy of cloud He, the number of drops N.
Output:
A normal cloud with digital characteristics Ex, En,
and He.
1) Produce a value x which satisfies with the normal
distribution probability of mean=Ex, and standard
error=En, select x aimed to the center of class;
2) Produce a random value En’ which satisfies with the
normal distribution probability of mean=En, and standard
error=He;
3)Calculate
− ( x − Ex ) 2
2 ( E ′N ) 2
y=e (3)
take y as the degree of membership;
4) Let(x, y) be a cloud drop in the universe of discourse;
5) Repeat 1-4 until the number of drops required all
generated.
a B Normal Cloud Recognition Algorithm
Lots of normal cloud models will be trained, and we
used these models to classification. It is important to say
again the entropy En is a measure of the fuzziness of the
concept over the universe of discourse, showing how
many elements could be accepted by the term A, so we
use the En to control the test result. The specific algorithm
showed as following:
Normal Cloud classification Algorithm:
Input:
the expected value of developed cloud Ex, the
entropy of developed cloud En, the hyper entropy of
developed cloud He, the awaiting data to classify x’ .
Output:
The degree of membership y’ corresponding the
awaiting data x’.
1) for a random object x’ to classify, we computer y’
according the formula,
− ( x ′ − Ex ) 2
2 ( E ′N ) 2
y′ = e (4)
2) for every model computer y’;
3) order all y’ form large to small;
4) the class of larger y’ corresponding is taken for the
class of x’ residing in.
IV. EXPERIMENTS
The artificial image database which selected from
http://image.google.cn and we draw some similar image.
The database includes 200 sheets of image. We use
Matlab7.0 to receive the Tamura texture feature [7, 8] ,
and for every class image use coarseness, contrast,
directionality train the cloud model respectively. For
example as Figure1, we develop cartoon calf cloud model
based on coarseness of the training
samples.

75

Authorized licensed use limited to: EASWARI COLLEGE OF ENGINEERING. Downloaded on July 12,2010 at 08:11:31 UTC from IEEE Xplore. Restrictions apply.
 which maps between quantities and qualities become
much easier and interchangeable. The aim of our method
is recognize sample belong to which class. For promoting
the classification precision, on the one hand, we train more
class cloud sets for one hand, the other for one class image
use various feature to train various normal cloud model.
The precision is conditioned by the rule or the threshold
value to determine the sample whether belongs to some
class or not. At the same time it is the weakness in defect
of objectivity. In the future we will improve the decision
rule with objectivity.
(a) Cloud model parameter

(b) Normal cloud model

Figure 1. Cloud model based on coarseness (a) A calf image to test with calf cloud model
We can use the train sample gradually modulate the
En. Then test according the front algorithm. For example
we select a calf and a tree image to classification, the
result showed as Figure 2 (a) and (b) respectively. The red
line shows location of the test data in the cloud model.
From the results we can define a rule or a threshold
value which prescripts the sample whether belongs to this
class or not. Because a feature of image shows a aspect of
characteristic, so for one class image we train various
cloud model based on various feature. For a image to
classify can be performed with weighing the result from
various cloud model.

V. CONCLUSION
Data classification is a well-recognized operation in
data mining and knowledge discovery research field and it (b) A tree image to test with calf cloud model
has been studied extensively in statistics and machine Figure 2. Classification results
learning literature. We described a novel approach for
image classification. We have presented Cloud Models

76

Authorized licensed use limited to: EASWARI COLLEGE OF ENGINEERING. Downloaded on July 12,2010 at 08:11:31 UTC from IEEE Xplore. Restrictions apply.
 ACKNOWLEDGEMENTS
The research is supported by The Science and
Technology Project of Beijing Education Committee
(18000109008).

REFERENCES
[1] Jianhua Fan and Deyi Li, Mining Classification Knowledge Based
on Cloud Models, Proceedings of PAKDD99, Beijing, China,
April.26-28,1999,pp 317-326.
[2] Shan,N.,Ziarko,W.,Hamilton,H.J.,and Cercone, “Discovery
Classification Knowledge in Databases Using Rough Sets”, In
Proceedings of KDD-96:Second International Conference on
Knowledge Discovery&Data Mining,Menlo Park,CA:AAAI
Press,1996.
[3] Shan,N.,Ziarko,W.,Hamilton,H.J.,and Cercone,“Using Rough Sets
as Tools for Knowledge Discovery”.In Proceedings of the First
International Conference on Knowledge Discovery and Data
Mining(KDD-95),Montreal,Canada,1995.
[4] G.Piatetsky-Shapiro,“Discovery,analysis,and presentation of
strong rules”, In G. Piatetsky-Shapiro and
W.J.Frawley,editors,Knowledge Discovery in Databases,
AAAI/MIT Press,1991,p.229-238.
[5] Li Deyi,Shi Xuemei,Meng Haijun.“Membership clouds and clouds
generators ” ,The Research and Development of
Computers,1995,42(8):32-41.
[6] T Deselaers, D Keysers, H Ney. Features for image retrieval: A
quantitative comparison. Lecture Notes in Computer Science,
Springer,2004,Volume 3175/2004, pp.228-236.
[7] H.Tamura, S.Mori, T.Yamawaki. Textural Features Corresponding
to Visual Perception.IEEE Transaction on Systems,Man,and
Cybernetcs,1978,Vol.SMC-8, No.6, pp.460–472.
[8] WANG Si-peng, Detecting Technology Based on Cloud Mode,
Computer Technology and Development, Jun.2006,
Vol.16,pp:187-190.

77

Authorized licensed use limited to: EASWARI COLLEGE OF ENGINEERING. Downloaded on July 12,2010 at 08:11:31 UTC from IEEE Xplore. Restrictions apply.