Changes between Version 6 and Version 7 of GSoC/2016/Additional_segmentation_algorithms/mean_shift


Ignore:
Timestamp:
09/08/16 13:05:17 (9 years ago)
Author:
hao2309
Comment:

--

Legend:

Unmodified
Added
Removed
Modified

  • TabularUnified GSoC/2016/Additional_segmentation_algorithms/mean_shift

    v6 v7  
    137137* K-means algorithm is easy to implement.
    138138* Its time complexity is O(n), where n is the number of patterns. It is faster than the hierarchical clustering.
    139 Disadvantages:
     139'''Cons:'''
    140140* The result is sensitive to the selection of the initial random centroids.
    141141* We cannot show the clustering details as hierarchical clustering does.
    142142
    143 '''Cons:'''
    144143
    145144[1] http://stackoverflow.com/questions/4831813/image-segmentation-using-mean-shift-explained [[BR]]