Refined implementation of Efficient Graph-Based Image Segmentation, P. Felzenszwalb, D. Huttenlocher. The aim is to produce a segmentation of a color image with a random color assigned to each region.
License: GNU General Public License v2.0
Makefile 1.11%C++ 69.20%C 29.69%
efficient-graph-segment's Introduction
This repository is a new home for the segmentation algorithm, originally described in 'Efficient Graph-Based Image Segmentation, Pedro F. Felzenszwalb and Daniel P. Huttenlocher, International Journal of Computer Vision, 59(2) September 2004.'
You may find additional details here http://cs.brown.edu/~pff/segment/
The program accepts a color image (PPM format) and outputs a segmentation with a random color assigned to each region.
Instructions:
1) Run 'make' to compile 'segment'.
2) Execute 'segment sigma k min input output'.
The parameters are:
sigma: Used to smooth the input image before segmenting it.
k: Value for the threshold function.
min: Minimum component size enforced by post-processing.
input: Input image.
output: Output image.
Typically, parameters are sigma = 0.5, k = 500, min = 20. Larger values for k will result in larger components in the output.