Edge detection is analyzed as a problem in cost minimization. A cost function is formulated that evaluates the quality of edge configurations. A mathematical description of edges is given, and the cost function is analyzed in terms of the characteristics of the edges in minimum-cost configurations. The cost function is minimized by the simulated annealing method. A novel set of strategies for generating candidate states and a suitable temperature schedule are presented. Sequential and parallel versions of the annealing algorithm are implemented and compared. Experimental results are presented.<>
A cost minimization approach to edge detection using simulated annealing
1989-01-01
491214 byte
Conference paper
Electronic Resource
English
Parallel Simulated Annealing for Shape Detection
British Library Online Contents | 1995
|Global cost optimization in image registration using simulated annealing [3457-12]
British Library Conference Proceedings | 1998
|Nonsmooth Trajectory Optimization: An Approach Using Continuous Simulated Annealing
Online Contents | 1994
|