Challa, Aditya ; Danda, Sravan ; Sagar, B. S. Daya ; Najman, Laurent (2020) Power Spectral Clustering Journal of Mathematical Imaging and Vision, 62 (9). pp. 1195-1213. ISSN 0924-9907
![]() |
PDF
6MB |
Official URL: http://doi.org/10.1007/s10851-020-00980-7
Related URL: http://dx.doi.org/10.1007/s10851-020-00980-7
Abstract
Spectral clustering is one of the most important image processing tools, especially for image segmentation. This specializes at taking local information such as edge weights and globalizing them. Due to its unsupervised nature, it is widely applicable. However, traditional spectral clustering is O(n3/2). This poses a challenge, especially given the recent trend of large datasets. In this article, we propose an algorithm by using ideas from Γ-convergence, which is an amalgamation of maximum spanning tree clustering and spectral clustering. This algorithm scales as O(nlog(n)) under certain conditions, while producing solutions which are similar to that of spectral clustering. Several toy examples are used to illustrate the similarities and differences. To validate the proposed algorithm, a recent state-of-the-art technique for segmentation—multiscale combinatorial grouping is used, where the normalized cut is replaced with the proposed algorithm and results are analyzed.
Item Type: | Article |
---|---|
Source: | Copyright of this article belongs to Springer Nature |
Keywords: | Spectral clustering, Γ-convergence, MST-based clustering, Multiscale combinatorial grouping, Image segmentation |
ID Code: | 127131 |
Deposited On: | 13 Oct 2022 09:03 |
Last Modified: | 13 Oct 2022 09:03 |
Repository Staff Only: item control page