Skip to main navigation Skip to search Skip to main content

Novel adaptive multi threshold image segmentation algorithm

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

Abstract

A novel adaptive multi threshold image segmentation algorithm is proposed in this paper. This proposed segmentation algorithm has two unique characteristics: it fits the 1-D graylevel histogram of the image by potential base function and thereby adaptively determines the classification number by potential function clustering; based on the graylevel co-occurrence matrix, it acquires the multi segmentation thresholds which makes the shape connectivity maximum according to the shape connectivity criterion. Both theoretical analysis and simulation results indicate that the performance of this new adaptive multi threshold segmentation algorithm is superior to those of the conventional threshold segmentation algorithms. And it has not only a low computing cost, but also shows quite good segmentation effect. Besides, it is insensitive to noises and interferences.

Original languageEnglish
Title of host publicationMIPPR 2007
Subtitle of host publicationAutomatic Target Recognition and Image Analysis; and Multispectral Image Acquisition
DOIs
StatePublished - 2007
EventMIPPR 2007: Automatic Target Recognition and Image Analysis; and Multispectral Image Acquisition - Wuhan, China
Duration: 15 Nov 200717 Nov 2007

Publication series

NameProceedings of SPIE - The International Society for Optical Engineering
Volume6786
ISSN (Print)0277-786X

Conference

ConferenceMIPPR 2007: Automatic Target Recognition and Image Analysis; and Multispectral Image Acquisition
Country/TerritoryChina
CityWuhan
Period15/11/0717/11/07

Keywords

  • Graylevel co-occurrence matrix
  • Image segmentation
  • Multi thresholds
  • Potential function clustering
  • Shape connectivity

Fingerprint

Dive into the research topics of 'Novel adaptive multi threshold image segmentation algorithm'. Together they form a unique fingerprint.

Cite this