On affinity matrix normalization for graph cuts and spectral clustering.
Mario BeaucheminPublished in: Pattern Recognit. Lett. (2015)
Keyphrases
- graph cuts
- affinity matrix
- spectral clustering
- image segmentation
- markov random field
- pairwise
- data clustering
- clustering method
- normalized cut
- multi label
- low rank representation
- similarity matrix
- eigendecomposition
- mean shift
- k means
- graph laplacian
- clustering algorithm
- higher order
- computer vision
- graph matching
- subspace clustering
- graph partitioning