Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Does anyone know where to find a C++ example of Image Segmentation using Min-Cut via BGL? I know how to run Min-Cut via BGL using Edmunds-Karp Maximum Flow. What I am mostly interested in is the setup around building the graph from the image and transforming the Min-Cut result into the output of Image Segmentation.
A very good c++ implementation of image segmentation using graph0cuts can be found:
at VGG iseg homepage. I’m not sure if they use BGL, but you can find where they run the graph-cut and replace this part with BGL.
Another more simple example can be found here look for the example there. It is a Matlab code – but it shows one way of building the energy function for the graph cut.