Fast Simulated Annealing Algorithm 


Vol. 27,  No. 3, pp. 284-289, Mar.  2002


PDF
  Abstract

In this paper, we propose the fast simulated annealing algorithm to decrease convergence rate in image segmentation using MRF. Simulated annealing algorithm has a good performance in noisy image or texture image. But there is a problem to have a long convergence rate. To find a solution to this problem, we have labeled each pixel adaptively according to its intensity before simulated annealing. Then, we show the superiority of proposed method through experimental results.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

C. Jung and J. Kim, "Fast Simulated Annealing Algorithm," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 3, pp. 284-289, 2002. DOI: .

[ACM Style]

Cheolkon Jung and Joongkyu Kim. 2002. Fast Simulated Annealing Algorithm. The Journal of Korean Institute of Communications and Information Sciences, 27, 3, (2002), 284-289. DOI: .

[KICS Style]

Cheolkon Jung and Joongkyu Kim, "Fast Simulated Annealing Algorithm," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 3, pp. 284-289, 3. 2002.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880