Simulated Annealing based Maximum Likelihood Clustering Algorithm for Image Segmentation
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Image segmentation can be regarded as the problem of two-class pattern classification. How to apply the maximum likelihood clustering algorithm to image segmentation is discussed in this paper. Simulated annealing technology is used to solve the problem of maximum likelihood clustering, which avoids the local optimal solution of iterative method. It shows better image segmentation effect than the famous Otsu algorithm and iterative method with less classification error than iterative method.

    Reference
    Related
    Cited by
Get Citation

张引,潘云鹤.基于模拟退火的最大似然聚类图像分割算法.软件学报,2001,12(2):212-218

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:July 29,1999
  • Revised:October 28,1999
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063