I created an interactive, online version of the Felzenszwalb & Huttenlocher segmentation algorithm.

Here are the details of the engineering behind it:

Efficient Graph-Based Image Segmentation
Pedro F. Felzenszwalb and Daniel P. Huttenlocher
International Journal of Computer Vision, 59(2) September 2004.

The program takes a color image (PPM format) and produces a segmentation with a random color assigned to each region.

The parameters are: (see the paper for details)

sigma: Used to smooth the input image before segmenting it.
k: Value for the threshold function.
min: Minimum component size enforced by post-processing.

Typical parameters are sigma = 0.5, k = 500, min = 20.
Larger values for k result in larger components in the result.

Also, I reimplemented the average color algorithm

This entry was posted on Monday, March 26th, 2007 at 9:26 am and is filed under software development, web technology. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.