Enhances Color Image Segmentation
Rajesh Kumar, Malkit Singh
Grabcut Algorithm, Ford-Fulkerson algorithm, Tree Algorithm, Graph Algorithm, Maximum Flow of Graph.
The key concern in Color Image Segmentation is more accurately and fast to do image segmentation by using algorithm. By using Algorithm we highlight the color images in two parts that is background and Foreground. This paper focus on segmentation with flow of algorithm using n link nodes, T link nodes. This reduces the time and increase the perfection of segmentation. In which we use the grabcut Algorithm with some type of models.
Article Details
Unique Paper ID: 150711

Publication Volume & Issue: Volume 7, Issue 9

Page(s): 121 - 129
Article Preview & Download

Share This Article

Conference Alert


International conference on Management, Science, Technology, Engineering, Pharmact and Humanities.

Go To Issue

Call For Paper

Volume 8 Issue 4

Last Date 25 September 2021

About Us

IJIRT.org enables door in research by providing high quality research articles in open access market.

Send us any query related to your research on editor@ijirt.org

Social Media

Google Verified Reviews

Contact Details

Email: editor@ijirt.org
Website: ijirt.org