Python+OpenCV：K-Means聚类

ゞ浴缸里的玫瑰 2022-12-25 10:54 72阅读 0赞

# Python+OpenCV：K-Means聚类 #

## 目标 ##

*  Learn to use **cv.kmeans()** function in OpenCV for data clustering.

### 理解参数 ###

**输入参数：**

1.  **samples** : It should be of **np.float32** data type, and each feature should be put in a single column.
2.  **nclusters(K)** : Number of clusters required at end.
3.  **criteria** : It is the iteration termination criteria. When this criteria is satisfied, algorithm iteration stops. Actually, it should be a tuple of 3 parameters. They are \`( type, max\_iter, epsilon )\`:
    
    1.  type of termination criteria. It has 3 flags as below:
        
         *  **cv.TERM\_CRITERIA\_EPS** - stop the algorithm iteration if specified accuracy, *epsilon*, is reached.
         *  **cv.TERM\_CRITERIA\_MAX\_ITER** - stop the algorithm after the specified number of iterations, *max\_iter*.
         *  **cv.TERM\_CRITERIA\_EPS + cv.TERM\_CRITERIA\_MAX\_ITER** - stop the iteration when any of the above condition is met.
    2.  max\_iter - An integer specifying maximum number of iterations.
    3.  epsilon - Required accuracy.
4.  **attempts** : Flag to specify the number of times the algorithm is executed using different initial labellings. The algorithm returns the labels that yield the best compactness. This compactness is returned as output.
5.  **flags** : This flag is used to specify how initial centers are taken. Normally two flags are used for this :   
    **cv.KMEANS\_PP\_CENTERS (**Use kmeans++ center initialization by Arthur and Vassilvitskii \[Arthur2007\].**)** and **cv.KMEANS\_RANDOM\_CENTERS**** (Select random initial centers in each attempt.)**.

**输出参数：**

1.  **compactness** : It is the sum of squared distance from each point to their corresponding centers.
2.  **labels** : This is the label array (same as 'code' in previous article) where each element marked '0', '1'.....
3.  **centers** : This is array of centers of clusters.

Now we will see how to apply K-Means algorithm with three examples.

### **Data with Only One Feature** ###

Consider, you have a set of data with only one feature, ie one-dimensional.

For eg, we can take our t-shirt problem where you use only height of people to decide the size of t-shirt.

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2xpdWJpbmc4NjA5_size_16_color_FFFFFF_t_70][]

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2xpdWJpbmc4NjA5_size_16_color_FFFFFF_t_70 1][]

### Data with Multiple Features ###

In previous example, we took only height for t-shirt problem. Here, we will take both height and weight, ie two features.

Remember, in previous case, we made our data to a single column vector. Each feature is arranged in a column, while each row corresponds to an input test sample.

For example, in this case, we set a test data of size 50x2, which are heights and weights of 50 people.

First column corresponds to height of all the 50 people and second column corresponds to their weights.

First row contains two elements where first one is the height of first person and second one his weight.

Similarly remaining rows corresponds to heights and weights of other people.

Check image below:

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2xpdWJpbmc4NjA5_size_16_color_FFFFFF_t_70 2][]

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2xpdWJpbmc4NjA5_size_16_color_FFFFFF_t_70 3][]

### Color Quantization ###

Color Quantization is the process of reducing number of colors in an image.

One reason to do so is to reduce the memory. Sometimes, some devices may have limitation such that it can produce only limited number of colors.

In those cases also, color quantization is performed. Here we use k-means clustering for color quantization.

There is nothing new to be explained here. There are 3 features, say, R,G,B. So we need to reshape the image to an array of Mx3 size (M is number of pixels in image).

And after the clustering, we apply centroid values (it is also R,G,B) to all pixels, such that resulting image will have specified number of colors.

And again we need to reshape it back to the shape of original image.

Below is the code:

####################################################################################################
    # K-Means聚类(K-Means Clustering)
    def lmc_cv_k_means_demo(method):
        """
            函数功能: method:
            2: Color Quantization with K-Means Clustering in OpenCV.
        """
    
    
        # 2: Color Quantization with K-Means Clustering in OpenCV.
        if 2 == method:
            stacking_images = []
            image_file_name = ['D:/99-Research/TestData/image/Castle01.jpg',
                               'D:/99-Research/TestData/image/Castle02.jpg',
                               'D:/99-Research/TestData/image/Castle03.jpg',
                               'D:/99-Research/TestData/image/Castle04.jpg']
            for i in range(len(image_file_name)):
                image = lmc_cv.imread(image_file_name[i])
                image = lmc_cv.cvtColor(image, lmc_cv.COLOR_BGR2RGB)
                stacking_image = image.copy()
                result_image = image.copy()
                z = image.reshape((-1, 3))
                # convert to np.float32
                z = np.float32(z)
                # define criteria, number of clusters and apply kmeans()
                criteria = (lmc_cv.TERM_CRITERIA_EPS + lmc_cv.TERM_CRITERIA_MAX_ITER, 10, 1.0)
                for clusters_number in range(1, 4):
                    ret, label, center = lmc_cv.kmeans(z, 2 ** clusters_number, None, criteria, 10,
                                                       lmc_cv.KMEANS_RANDOM_CENTERS)
                    # Now convert back into uint8, and make original image
                    center = np.uint8(center)
                    res = center[label.flatten()]
                    result_image = res.reshape(image.shape)
                    # stacking images side-by-side
                    stacking_image = np.hstack((stacking_image, result_image))
    
                # stacking images side-by-side
                stacking_images.append(stacking_image)
    
            # 显示图像
            for i in range(len(stacking_images)):
                pyplot.figure('Color Quantization with K-Means Clustering %d' % (i + 1))
                pyplot.subplot(1, 1, 1)
                pyplot.imshow(stacking_images[i], 'gray')
                pyplot.title('Color Quantization with K-Means Clustering: k=2 k=4 k=8')
                pyplot.xticks([])
                pyplot.yticks([])
                pyplot.savefig('%02d.png' % (i + 1))
            pyplot.show()
    
            # 根据用户输入保存图像
            if ord("q") == (lmc_cv.waitKey(0) & 0xFF):
                # 销毁窗口
                pyplot.close('all')
            return

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2xpdWJpbmc4NjA5_size_16_color_FFFFFF_t_70 4][]

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2xpdWJpbmc4NjA5_size_16_color_FFFFFF_t_70 5][]

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2xpdWJpbmc4NjA5_size_16_color_FFFFFF_t_70 6][]

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2xpdWJpbmc4NjA5_size_16_color_FFFFFF_t_70 7][]

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2xpdWJpbmc4NjA5_size_16_color_FFFFFF_t_70]: /images/20221120/9c7c8d84949444c9846bc98f94b698e2.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2xpdWJpbmc4NjA5_size_16_color_FFFFFF_t_70 1]: /images/20221120/8c7f774d45bf4a8c9f1912f9c17f926f.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2xpdWJpbmc4NjA5_size_16_color_FFFFFF_t_70 2]: /images/20221120/fac5ebc4f04947268833c9ffc5daeea0.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2xpdWJpbmc4NjA5_size_16_color_FFFFFF_t_70 3]: /images/20221120/f0b6f712a7b24c1d83b43cf9df7bf497.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2xpdWJpbmc4NjA5_size_16_color_FFFFFF_t_70 4]: /images/20221120/4059f29e1168480880a1a09e86147ad0.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2xpdWJpbmc4NjA5_size_16_color_FFFFFF_t_70 5]: /images/20221120/9ca912d27d4443b8b4c78f7e461ed3f1.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2xpdWJpbmc4NjA5_size_16_color_FFFFFF_t_70 6]: /images/20221120/7d8724f185034d658c56655e958e4eb8.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2xpdWJpbmc4NjA5_size_16_color_FFFFFF_t_70 7]: /images/20221120/49676df2a61c4948957a32ccc910104a.png