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.