Abstract

The graph theory-based graph cut algorithm is successfully applied in a wide range of problems in computer vision. The normalized graph cut algorithm is one of the efficient algorithms used for the detection of salient objects in one image. The efficiency of normalized graph cut algorithm has been improved by applying Lp1 norm-based Gaussian filter and median filter, with normalized cut algorithm, on individual color channels rather than the whole image. Different experiments are conducted to prove the efficiency of these applications by considering images from different standard image segmentation datasets like Berkley image segmentation dataset and COREL image segmentation dataset. The results of the proposed methods are compared with Otsu thresholding and C-means clustering algorithms. Three validity indices are used to quantify the results.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call