Construction of isothetic covers of a digital object: A combinatorial approach
Journal of Visual Communication and Image Representation
Isothetic polygonal approximations of a 2d object on generalized grid
PReMI'05 Proceedings of the First international conference on Pattern Recognition and Machine Intelligence
TIPS: on finding a tight isothetic polygonal shape covering a 2d object
SCIA'05 Proceedings of the 14th Scandinavian conference on Image Analysis
| Hi-index | 0.00 |
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.