2004 | OriginalPaper | Buchkapitel
K-means Indiscernibility Relation over Pixels
verfasst von : James F. Peters, Maciej Borkowski
Erschienen in: Rough Sets and Current Trends in Computing
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.