Review article · Apr 2013
Case reportPublished 2016
Image Segmentation by Using Linear Spectral Clustering
Abstract
Select any words in the title or abstract, or press this and choose a sentence.
In this paper a super pixel segmentation algorithm called Linear Spectral Clustering (LSC), which produces compact and uniform super pixels with low computational costs. Basically, a normalized cuts formulation of the super pixel segmentation is adopted based on a similarity metric that measures the colour 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 super pixel segmentation algorithms in terms of several commonly used evaluation metrics in image segmentation.
Subjects
Computer Science & ITAsk about this article
Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.
Similar by topic
Research article · Dec 2011
A COMBINED METHOD USING FUZZY CLUSTERING AND MGGVF SNAKE MODEL FOR BRAIN TUMOR SEGMENTATION ON MRI IMAGES
Research article · Nov 2011
SEMI SUPERVISED IMAGE SEGMENTATION USING OPTIMAL HIERARCHICAL CLUSTERING BY SELECTING INTERESTED REGION AS PRIOR INFORMATION
Commentary · 2 Aug 2022
Spectral Bands Detection by Using Band Clustering and Dynamic Multi-Graph Constraints
Review article · Jun 2012
NOVEL INITIALIZATION TECHNIQUE FOR K-MEANS CLUSTERING USING SPECTRAL CONSTRAINT PROTOTYPE
More from this journal
The newest in Telecommunications System & Management.
Brief report · 29 Nov 2025
Optimizing Wireless Spectrum: Advanced Techniques for Future Networks
Brief report · 29 Nov 2025
Telecom OSS/BSS: Modernization, AI and Digital Transformation
Opinion · 29 Nov 2025
Telecommunication Network Scalability: Future-Proofing for Demands
Conferences in this field
Upcoming conferences in this field.
Follow
New articles from what you follow go into your email digest, once you agree to alert emails.
- JournalTelecommunications System & Management
- SubjectComputer Science & IT
- BylineArticles whose byline prints “Reddy NS”

