Penerapan Pohon Rentang Minimum pada Graph dalam Segmentasi Citra

Silvia Alvini - Jurusan Matematika Universitas Negeri Padang
Armiati Armiati - Jurusan Matematika Universitas Negeri Padang
Meira Dewi - Jurusan Matematika Universitas Negeri Padang

Abstract


Abstract – Image segmentation is the process of separating the object from the background or of other objects that are not a concern, so the object can be processed for the other purposes. Along with the development of technology in digital image processing application, the segmentation process becomes increasingly necessary. The results of the segmentation must be accurate so that any error does not happen in the interpretation of information from an image. This article discussed the application of the minimum spanning tree on a graph in a segment of an image. This method is able to separate an object from the background so that it produces binary image, which is in this case, the object that being the focus is set in white, while the background is black or otherwise. The whole processes were done by using the Matlab R2013a.

 

Keywords – graph, minimum spanning tree, image segmentation, digital image


Full Text:

PDF

References


Munir, Rinaldi. 2004. Pengolahan Citra Digital dengan Pendekatan Algoritmik. Bandung: Informatika Bandung.

McAndrew, Alasdair. 2004. “An Introduction ti Digital Image Processing with Matlab.” School of Computer Science and Mathematics Victoria University of Technology.

Gonzalez, Rafael C. dan Richard E. Woods. 2002. Digital Image Processing. New Jersey: Prentice Hall, Inc., Upper Saddle river.

Janakiraman,T.N.danChandra Mouli. 2010. “Image Segmentation Using Graph Euler.” Int. J. of Computers, Communications & Control.

Alvini, Silvia. 2016. Penerapan Pohon Rentang Minimum pada Graph dalam Segmentasi Citra. Padang: Universitas Negeri Padang.




DOI: http://dx.doi.org/10.24036/unpjomath.v6i2.11568