Нема описа

Alexander Freytag 1de245ec3d added compilation program пре 11 година
COPYING 9a56179e76 added felzenszwalb code пре 12 година
Makefile 9a56179e76 added felzenszwalb code пре 12 година
README 9a56179e76 added felzenszwalb code пре 12 година
compileFelzenszwalbSegmentation.m 1de245ec3d added compilation program пре 11 година
convolve.h 9a56179e76 added felzenszwalb code пре 12 година
disjoint-set.h 9a56179e76 added felzenszwalb code пре 12 година
filter.h 9a56179e76 added felzenszwalb code пре 12 година
image.h 9a56179e76 added felzenszwalb code пре 12 година
imconv.h 9a56179e76 added felzenszwalb code пре 12 година
imutil.h 9a56179e76 added felzenszwalb code пре 12 година
misc.h 9a56179e76 added felzenszwalb code пре 12 година
pnmfile.h 9a56179e76 added felzenszwalb code пре 12 година
segment-graph.h 0b6653a4a4 stable version - todo: check if given img has only 1 dimension (gray scale) пре 12 година
segment-image-labelOutput.h 0b6653a4a4 stable version - todo: check if given img has only 1 dimension (gray scale) пре 12 година
segment-image.h 9a56179e76 added felzenszwalb code пре 12 година
segment.cpp 9a56179e76 added felzenszwalb code пре 12 година
segmentFelzenszwalb.cpp cb165c089b fixed memory leak, proper code layout пре 11 година
segmentFelzenszwalb.m 810368e721 minor change on default value пре 12 година

README


Implementation of the segmentation algorithm described in:

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.

1) Type "make" to compile "segment".

2) Run "segment sigma k min input output".

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.
input: Input image.
output: Output image.

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