README 782 B

12345678910111213141516171819202122232425
  1. Implementation of the segmentation algorithm described in:
  2. Efficient Graph-Based Image Segmentation
  3. Pedro F. Felzenszwalb and Daniel P. Huttenlocher
  4. International Journal of Computer Vision, 59(2) September 2004.
  5. The program takes a color image (PPM format) and produces a segmentation
  6. with a random color assigned to each region.
  7. 1) Type "make" to compile "segment".
  8. 2) Run "segment sigma k min input output".
  9. The parameters are: (see the paper for details)
  10. sigma: Used to smooth the input image before segmenting it.
  11. k: Value for the threshold function.
  12. min: Minimum component size enforced by post-processing.
  13. input: Input image.
  14. output: Output image.
  15. Typical parameters are sigma = 0.5, k = 500, min = 20.
  16. Larger values for k result in larger components in the result.