Overview of spectral clustering algorithm with statistical sub-graph affinity.

<p>The image is lexicographically unwrap into a vector, spatially weighted kernels and are constructed, edge weights are calculated, and traditional spectral clustering techniques are applied before the labelled data is wrapped back into a labelled image. Although the kernels are illustrated as matrices above, the kernels can be constructed as an arbitrary graph.