Normalized Gaussian Distance Graph Cuts for Image Segmentation

  • Chengcai Leng
  • , Wei Xu
  • , Irene Cheng
  • , Zhihui Xiong
  • , Anup Basu

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

This paper presents a novel, fast image segmentation method based on normalized Gaussian distance on nodes in conjunction with normalized graph cuts. We review the equivalence between kernel k-means and normalized cuts. Then we extend the framework of efficient spectral clustering and avoid choosing weights in the weighted graph cuts approach. Experiments on synthetic data sets and real-world images demonstrate that the proposed method is effective and accurate.

Original languageEnglish
Title of host publicationProceedings - 2015 IEEE International Symposium on Multimedia, ISM 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages523-528
Number of pages6
ISBN (Electronic)9781509003792
DOIs
StatePublished - 25 Mar 2016
Event17th IEEE International Symposium on Multimedia, ISM 2015 - Miami, United States
Duration: 14 Dec 201516 Dec 2015

Publication series

NameProceedings - 2015 IEEE International Symposium on Multimedia, ISM 2015

Conference

Conference17th IEEE International Symposium on Multimedia, ISM 2015
Country/TerritoryUnited States
CityMiami
Period14/12/1516/12/15

Keywords

  • image segmentation
  • kernel k-means
  • normalized cuts
  • normalized Gaussian distance
  • spectral clustering

Fingerprint

Dive into the research topics of 'Normalized Gaussian Distance Graph Cuts for Image Segmentation'. Together they form a unique fingerprint.

Cite this