@INPROCEEDINGS { Rsds2179,
author = {Peters, James F. and Borkowski, Maciej}, 
title = {K-means Indiscernibility Relation over Pixels}, 
booktitle = {Rough Sets and Current Trends in Computing}, 
conference = {Rough Sets and Current Trends in Computing}, 
series =  = {Lecture Notes in Artificial Intelligence}, 
volume = 3066, 
pages = {580-585}, 
publisher = {Springer-Verlag}, 
address = {Heidelberg - Berlin, Germany}, 
month = {June}, 
year = 2004, 
editor = {Tsumoto, Shusaku and Slowinski, Roman W. and Komorowski, Jan and Grzymala-Busse, Jerzy W.}, 
issn = {0302-9743}, 
isbn = {3-540-22117-4}, 
abstract = {This article presents a new form of indiscernibility relation based on K-means clustering of pixel values. The end result is a partitioning of a set of pixel values into bins that represent equivalence classes. The proposed approach makes it possible to introduce a form of upper and lower approximation specialized relative to sets of pixel values. This approach is particularly relevant to a special class of digital images for power line ceramic insulators. Until now the problem of determining when a ceramic insulator needs to be replaced has relied on visual inspection. With the K-means indiscernibility relation, it is now possible to automate the detection of faulty ceramic insulators. The contribution of this article is the introduction of an approach to classifying power line insulators based on a rough set methods and K-means clustering in analyzing digital images.}, 
keywords = {approximation, classification, digital image processing, k-means clustering, rough sets, }, 
}