This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fourth International Conference on Computer and Information Technology (CIT'04)
Dimension Reduction Based on Rough Set in Image Mining
Wuhan, China
September 14-September 16
ISBN: 0-7695-2216-5
Maofu Liu, Wuhan University
Yanxiang He, Wuhan University
Huijun Hu, Wuhan University
Dandan Yu, Wuhan University
Image mining is a nontrivial process to discover valid, novel, potentially useful, and ultimately understandable knowledge from large image sets or image databases. With the rapid development of rough set theory in recent years, more and more people have applied this theory to different research fields. In order to solve the curse of dimensionality in image mining, in this paper, we give our own solution to this problem based on rough set. After introducing the basic concepts of rough set theory and the attribute reduction of information system, we put forward the related algorithms mainly including the partition algorithm and the dimension reduction algorithm. The experimental result has justified the feasibility of the solution based on rough set.
Index Terms:
Image Mining, Rough Set Theory, Image Understanding, Dimension Reduction, Information System
Citation:
Maofu Liu, Yanxiang He, Huijun Hu, Dandan Yu, "Dimension Reduction Based on Rough Set in Image Mining," cit, pp.39-44, Fourth International Conference on Computer and Information Technology (CIT'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.