Alexander Freytag
9a56179e76
added felzenszwalb code
|
12 lat temu | |
|---|---|---|
| COPYING | 12 lat temu | |
| Makefile | 12 lat temu | |
| README | 12 lat temu | |
| convolve.h | 12 lat temu | |
| disjoint-set.h | 12 lat temu | |
| filter.h | 12 lat temu | |
| image.h | 12 lat temu | |
| imconv.h | 12 lat temu | |
| imutil.h | 12 lat temu | |
| misc.h | 12 lat temu | |
| pnmfile.h | 12 lat temu | |
| segment-graph.h | 12 lat temu | |
| segment-image.h | 12 lat temu | |
| segment.cpp | 12 lat temu | |
| segmentFelzenszwalb.cpp | 12 lat temu | |
| segmentFelzenszwalb.m | 12 lat temu |
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.