Žiadny popis

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

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.