Changes between Version 19 and Version 20 of GSoC/2016/Additional_segmentation_algorithms/mean_shift

Timestamp:

09/13/16 18:13:26 (9 years ago)

Author:

hao2309

Comment:

--

GSoC/2016/Additional_segmentation_algorithms/mean_shift

@@ -110 +110 @@
 
 === Fast scanning algorithm ===
- The concept of fast scanning algorithm is to scan from the upper-left corner to lower-right corner of the whole image and determine if we can merge the pixel into an existed clustering. The merged criterion is based on our assigned threshold. If the difference between the pixel value and the average pixel value of the adjacent cluster is smaller than the threshold, then this pixel can be merged into the cluster.[[BR]]
+The concept of fast scanning algorithm is to scan from the upper-left corner to lower-right corner of the whole image and determine if we can merge the pixel into an existed clustering. The merged criterion is based on our assigned threshold. If the difference between the pixel value and the average pixel value of the adjacent cluster is smaller than the threshold, then this pixel can be merged into the cluster.[[BR]]
 '''Pros:'''
 * The pixels of each cluster are connected and have similar pixel value, i.e. it has good shape connectivity.
@@ -152 +152 @@
 This example uses the panchromatic image inluded in the NC sample dataset.
 Set up an imagery gourp:
+
 {{{i.group group=singleband input=lsat7_2002_80}}}
 
 Set the segmentation region, the first testing case will be the full image.
+
 {{{g.region raster=lsat7_2002_80 -p}}}
 
 Firstly test the region with least input arguments.
+
 {{{i.segment --o group=singleband  output=lsat7_2002_80_MM_min1 method=mean_shift thresh=0.01}}}