Main Article Content
Abstract
Computer vision relies entirely on image processing and the base of image processing is image segmentation, for an image to be processed productively it is very important that its segmentation has to be accurate. Moreover, it has to be so precise that not a single pixel is left or duplicated after segmentation. At the same time, resource consumption (like memory consumption, time complexity) has to be taken care of. The objective of this work is to check how graph traversal algorithms (Especially Single Source Shortest Path and Depth First Search Algorithms) are better than other in the field of image Segmentation.