Graph-Based Image Segmentation Using K-Means Clustering and Normalised Cuts

摘要

Image segmentation with low computational burden has been highly regarded as important goal for researchers. Various image segmentation methods are widely discussed and more noble segmentation methods are expected to be developed when there is rapid demand from the emerging machine vision field. One of the popular image segmentation methods is by using normalised cuts algorithm. It is unfavourable for a high resolution image to have its resolution reduced as high detail information is not fully made used when critical objects with weak edges is coarsened undesirably after its resolution reduced. Thus, a graph-based image segmentation method done in multistage manner is proposed here. In this paper, an experimental study based on the method is conducted. This study shows an alternative approach on the segmentation method using k-means clustering and normalised cuts in multistage manner.