graphyimaseg
所属分类：图形图象
开发工具：C/C++
文件大小：8KB
下载次数：46
上传日期：2007-04-19 19:14:24
上 传 者：
管理员
说明： 基于图匹配理论的图像分割，是IJCV上那片经典文献的作者写的程序，简练实用。可以给做这方面的人的参考
(based on the theory of graph matching image segmentation, Shangri-La is IJCV on classic literature written by the author of procedures, concise practical. This can be done to the people of reference)
文件列表:
segment\convolve.h (1219, 2005-02-24)
segment\disjoint-set.h (1118, 2005-02-24)
segment\filter.h (2252, 2005-02-24)
segment\image.h (1573, 2005-02-24)
segment\imconv.h (4205, 2005-02-24)
segment\imutil.h (927, 2005-02-24)
segment\Makefile (338, 2005-02-24)
segment\misc.h (1010, 2005-02-24)
segment\pnmfile.h (4532, 2005-02-24)
segment\segment-graph.h (1452, 2005-02-24)
segment\segment-image.h (3569, 2005-02-24)
segment\segment.cpp (721, 2005-02-24)
segment (0, 2005-08-13)
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.
近期下载者：
相关文件：
收藏者：