文件名称:dynamic-region-merging
介绍说明－－下载内容均来自于网络，请自行研究使用
In the proposed algorithm, these two issues are solved by a novel predicate, which is defined by the sequential probability ratio test (SPRT) and the minimal cost criterion. Starting from an over-segmented image, neighboring regions are progressively merged if there is an evidence for merging according to this predicate. We show that the merging order follows the principle of dynamic programming. This formulates image segmentation as an inference problem, where the final segmentation is established based on the observed image. We also prove that the produced segmentation satisfies certain global properties. In addition, a faster algorithm is developed to accelerate the region merging process, which maintains a nearest neighbor graph (NNG) in each iteration.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
DRM\fleurshinagawa.jpg
...\Main.m
...\srm.m
...\srm_boundarygradient.c
...\srm_boundarygradient.mexw32
...\srm_boundarylen.c
...\srm_boundarylen.mexw32
...\srm_demo.m
...\srm_getborders.m
...\srm_imgGrad.m
...\srm_plot_segmentation.m
...\srm_randimseg.m
...\vl_tightsubplot.m
DRM