![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_open_medium.gif)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_restricted_medium.gif)
Enhanced Graph Based Normalized Cut Methods for Image Segmentation
Subscribe/Renew Journal
Image segmentation is one of the important steps in digital image processing. Several algorithms are available for segmenting the images, posing many challenges such as precise criteria and efficient computations. Most of the graph based methods used for segmentation depend on local properties of graphs without considering global impressions of image, which ultimately limits segmentation quality. In this paper, we propose an enhanced graph based normalized cut method for extracting global impression and consistencies in the image. We propose a technique to add flexibility to original recursive normalized two way cut method which was further extended to other graph based methods. The results show that the proposed technique improves segmentation quality as well as requires lesser computational time than the regular normalized cut method.
Keywords
Image Segmentation, Normalized Cut, Pixel Affinity, Multiscale, Watershed Regions.
Subscription
Login to verify subscription
User
Font Size
Information
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 173
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 0