Skip to content

GPGPU Project : implementing Graph Cuts algorithm with CUDA

Notifications You must be signed in to change notification settings

Azanthy/graph_cuts

Repository files navigation

Graph Cut with CUDA

Implementation of the max-flow/min-cut algorithm known as Push-Relabel in order to segment images.

It's implemented in CXX17 and CUDA.

The program take two images in order to work:

  • The main image to segment
  • The seed image with background (red) and foreground (blue) labels

Result images

Installation

mkdir build
cd build
cmake ..

Usage

The images should be at .jpg format.

./graph_cut [-cg] <img> <seeds_img>

-c for CPU -g for GPU

Benchmark

The benchmarcking is made with Google Benchmark

./bench

Testsuite

The testsuite compare the results obtained with the the ground truth given by my teacher. It used the mean dice score over the 15 given images in segmentation_dataset.

Actually the mean dice score over the 15 images is 0.91 using the GPU implementation

make test

About

GPGPU Project : implementing Graph Cuts algorithm with CUDA

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published