Subscribe

Mar. 25, 2009 to Mar. 27, 2009

ISBN: 978-0-7695-3593-7

pp: 65-70

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/UKSIM.2009.77

ABSTRACT

In this paper we propose a multistage computational procedure for partitioning of large data sets and for segmentation of images. In the first step the original “raw” data set (or the set of pixels from a given image) is compressed by use of the Neural-Gas unsupervised learning algorithm into Compressed Information Model (CIM) that contains small predefined number of neurons. In the second step a graph structure is generated by using all the neurons as nodes of the graph and a number of consistent arcs. Two kinds of consistent arcs are defined here, namely crisp and fuzzy arcs that lead to the respective crisp and fuzzy graph structures. The crisp graphs use the Euclidean distance between the nodes as “arc lengths”. The fuzzy graphs use weighted arcs with different “arc strengths”, computed by using the weights of the respective adjacent neurons. The third step identifies the number of the strongly connected elements (called also “connected areas”) in the generated graph structure from the previous step. This is done by using the well known depth-first graph algorithm. Then each connected area corresponds to a respective segment of the given data or image. The proposed computational scheme and its application are demonstrated and explained by two test examples consisting of process data and an image.

INDEX TERMS

Data partitioning, Image segmentation, Graph structures, Unsupervised learning, Connected areas

CITATION

Gancho Vachkov,
Hidenori Ishihara,
"Data Partitioning and Image Segmentation by Use of Information Compression and Graph Structures",

*UKSIM*, 2009, Computer Modeling and Simulation, International Conference on, Computer Modeling and Simulation, International Conference on 2009, pp. 65-70, doi:10.1109/UKSIM.2009.77