Skip to Main content Skip to Navigation
Conference papers

An Introduction to Gamma-Convergence for Spectral Clustering

Abstract : The problem of clustering is to partition the dataset into groups such that elements belonging to the same group are similar and elements belonging to the different groups are dissimilar. The unsupervised nature of the problem makes it widely applicable and also tough to solve objectively. Clustering in the context of image data is referred to as image segmentation. Distance based methods such as K-means fail to detect the non-globular clusters and hence spectral clustering was proposed to overcome this problem. This method detects the non glob-ular structures by projecting the data set into a subspace, in which the usual clustering methods work well. Gamma convergence is the study of asymptotic behavior of minimizers of a family of minimization problems. Such a limit of minimizers is referred to as the gamma limit. Calculating the gamma limit for various variational problems have been proved useful giving a different algorithm and insights into why existing methods work. In this article, we calculate the gamma limit of the spectral clustering methods, analyze its properties, and compare them with minimum spanning tree based clustering methods and spectral clustering methods.
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download
Contributor : Aditya Challa <>
Submitted on : Tuesday, June 27, 2017 - 11:08:30 AM
Last modification on : Wednesday, February 26, 2020 - 7:06:07 PM
Document(s) archivé(s) le : Wednesday, January 17, 2018 - 7:24:37 PM


Files produced by the author(s)


  • HAL Id : hal-01427957, version 2


Aditya Challa, Sravan Danda, B Daya Sagar, Laurent Najman. An Introduction to Gamma-Convergence for Spectral Clustering. Discrete Geometry for Computer Imagery, Kropatsch, Walter G.; Artner, Nicole M.; Janusch, Ines, Sep 2017, Vienna, Austria. pp.185--196. ⟨hal-01427957v2⟩



Record views


Files downloads