Utilizing Graph Structure when using Mean Shift Clustering

Question

Imagine we are clustering pixels in an image. If we use Mean Shift Clustering, at least in my understanding, we will embed each pixel into some dimensional space (intensity, rgb, texture, etc) and cluster them. This embedding process, however, inherently destroys the graph structure of the image, which could be quite useful: e.g. neighboring pixels tend to form same semantic cluster.

Is there a way I can preserve this graph structure when using Mean Shift Clustering? You can assume grid like graph structure like a 2D image.

Simplest solution for this is to use quick-shift algorithm – foothill Dec 18 '16 at 20:33 — foothill, Dec 18 '16 at 20:33

score 1 · Answer 1 · answered Nov 15 '16 at 07:21

1

The simplest thing to do is to add the position information as another channel as well, such that points spatially close to each other are likely to be in the same cluster.

You can try different kernels and weights for the position channel to get different results.

answered Nov 15 '16 at 07:21

dontloo

13,692
7
51
80

Position information such as pixel coordinates are weaker than connectivity information in graphs. – foothill Nov 15 '16 at 23:22

Utilizing Graph Structure when using Mean Shift Clustering

1 Answers1