Superpixel Segmentation Using Linear Spectral Clustering

2015-06-01 · CVPR 2015 6 · Zhengqin Li, Jiansheng Chen

We present in this paper a superpixel segmentation algorithm called Linear Spectral Clustering (LSC), which produces compact and uniform superpixels with low computational costs. Basically, a normalized cuts formulation of the superpixel segmentation is adopted based on a similarity metric that measures the color similarity and space proximity between image pixels. However, instead of using the traditional eigen-based algorithm, we approximate the similarity metric using a kernel function leading to an explicitly mapping of pixel values and coordinates into a high dimensional feature space. We revisit the conclusion that by appropriately weighting each point in this feature space, the objective functions of weighted K-means and normalized cuts share the same optimum point. As such, it is possible to optimize the cost function of normalized cuts by iteratively applying simple K-means clustering in the proposed feature space. LSC is of linear computational complexity and high memory efficiency and is able to preserve global properties of images. Experimental results show that LSC performs equally well or better than state of the art superpixel segmentation algorithms in terms of several commonly used evaluation metrics in image segmentation.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

ClusteringImage Segmentation Segmentation Semantic SegmentationSuperpixels

Methods 이 논문이 사용한 방법론

Spectral Clustering Spectral clustering has attracted increasing attention due to the promising ability in dealing with nonlinearly separable datasets [15], [16]. In spectral clustering, the…

Joint Superpixel and Self-Representation Learning for Scalable Hyperspectral Image Clustering

2025-09-28 · Xianlu Li, Nicolas Nadisic, Shaoguang Huang, Aleksandra Pizurica arxiv

Subspace clustering is a powerful unsupervised approach for hyperspectral image (HSI) analysis, but its high computational and memory costs limit scalability. Superpixel segmentation can improve efficiency by reducing th…

Representation Learning Image Clustering

Hierarchical Homogeneity-Based Superpixel Segmentation: Application to Hyperspectral Image Analysis

2024-07-22 · Luciano Carvalho Ayres, Sérgio José Melo de Almeida, José Carlos Moreira Bermudez, Ricardo Augusto Borsoi

Hyperspectral image (HI) analysis approaches have recently become increasingly complex and sophisticated. Recently, the combination of spectral-spatial information and superpixel techniques have addressed some hyperspect…

Hyperspectral image analysis Superpixels

Affinity Fusion Graph-based Framework for Natural Image Segmentation

2020-06-24 · Yang Zhang, Moyun Liu, Jingwu He, Fei Pan 외

This paper proposes an affinity fusion graph framework to effectively connect different graphs with highly discriminating power and nonlinearity for natural image segmentation. The proposed framework combines adjacency-g…

Clustering Image Segmentation Segmentation Semantic Segmentation+1

Image Segmentation Based on Multiscale Fast Spectral Clustering

2018-12-12 · Chongyang Zhang, Guofeng Zhu, Minxin Chen, Hong Chen 외

In recent years, spectral clustering has become one of the most popular clustering algorithms for image segmentation. However, it has restricted applicability to large-scale images due to its high computational complexit…

Clustering Image Segmentation Semantic Segmentation Superpixels+1

Weakly-Supervised Dual Clustering for Image Semantic Segmentation

2013-06-01 · CVPR 2013 6 · Yang Liu, Jing Liu, Zechao Li, Jinhui Tang 외

In this paper, we propose a novel Weakly-Supervised Dual Clustering (WSDC) approach for image semantic segmentation with image-level labels, i.e., collaboratively performing image segmentation and tag alignment with thos…

Clustering Image Segmentation Segmentation Semantic Segmentation+2