Skip to main content

Parallel Simulated Annealing for Shape Detection

  • Chapter
Visual Form
  • 114 Accesses

Abstract

Simulated annealing is a powerful stochastic technique for solving combinatorial optimization problems. It differs from other techniques based on iterative improvements of the cost function in that it allows occasional increases in the cost function thus avoiding to get stuck into local minima. Metropolis first proposed the simulated annealing method to study complex physical systems which are first melted at high temperatures and then slowly cooled to attain low energy equilibrium configurations. The analogy between this problem and a combinatorial optimization problem was observed in [2] and [13]. In this analogy, the energy of the system is identified with the cost function of the optimization problem and the temperature with a control parameter.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P.J.M. van Laarhoven, E.H. Aarts, Simulated annealing: theory and applications, D. reidel Publishing Company.

    Google Scholar 

  2. V. Cerny (1985), “Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm, J. Opt. Theory Appl., 41-51.

    Google Scholar 

  3. E.H.L. Aarts, F.M.J. de Bont, E.H.A. Hbers, P.J.M. van Laarhoven (1986) “Parallel implementations of the statistical cooling algorithm”, Integration: the VLSI Journal, 4, 209–2238.

    Article  Google Scholar 

  4. S. T. Barnard (1989), “Stochastic stereo matching over scale”, International Journal of Computer Vision, 3, 17–32, 1989.

    Article  Google Scholar 

  5. P. Banerjee, M.H. Jones, J. S. Sargent (1990), “Parallel simulated annealing algorithms for cell placement on hypercube multiprocessors”, IEEE Trans, on Parallel and Distributed Systems, 1, 1, 91–106.

    Article  Google Scholar 

  6. P. Carnevali, L. Coletti, S. Patternello (1985), “Image processing by simulated annealing”, IBM J. Res. Develop., 1985.

    Google Scholar 

  7. A. Casotto, R. Romeo, A. Sangiovanni-Vincentelli (1987), “A parallel simulated annealing for the placement of macro-cells”, IEEE Trans. Computer-Aided Design, CAD-6, 838–847.

    Article  Google Scholar 

  8. X. Yao, C.L. Liu (1990), “PLA logic minimization by simulated annealing”, Integration, the VLSI Journal, 9, 243–257.

    Article  Google Scholar 

  9. A. Casotto, A. Sangiovanni-Vincentelli (1987), “Placement of standard cells using simulated annealing on the connection machine”, Proc. IEEE Int. Conf. Computer Design, 350-353.

    Google Scholar 

  10. F. Darema, S. Kirkpatrick, V.A. Norton (1987), “Parallel algorithms for chip placement by simulated annealing”, IBM J. Res. Develop., 31, 391–402.

    Article  Google Scholar 

  11. S. Devadas, A.R. Newton (1986), “Topological optimization of multiple level array logic: on uni and multi-processor”, Proc. IEEE Int. Conf. on Computer-Aided Design, 38-41, 1986.

    Google Scholar 

  12. S. Geman, D. Geman (1984), “Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images”, IEEE Trans, on Pattern Analysis and Machine Intelligence, PAMI-6, 6, 721–741.

    Article  Google Scholar 

  13. S. Kirkpatrick, C.D. Gelatt, M.P. Vecchi (1983), “Optimization by simulated annealing”, Science, 220, 671–680.

    Article  MathSciNet  MATH  Google Scholar 

  14. S. A. Kravitz, R.A. Rutenbar (1987), “Placement by simulated annealing on a multiprocessor”, IEEE Trans, on Computer-Aided Design, CAD-6, 534–549.

    Article  Google Scholar 

  15. D.W. Murray, A. Kashko, H. Buxton (1986), “A parallel approach to the picture restoration algorithm of Geman and Geman on an SIMD machine”, Image and Vision Computing, 4, 3, 133–142.

    Article  Google Scholar 

  16. C. Sechen, A. Sangiovanni-Vincentelli (1986), “Timberwolf 3.2: a new standard cell placement and global routing package”, 23rd Design Automation Conference, 432-439.

    Google Scholar 

  17. H.L. Tan, S. B. Gelfand, E.J. Delp (1989) “A cost minimization approach to edge detection using simulated annealing”, Proc. of the 1989 Conf. on Computer Vision and Pattern Recognition, 89-91.

    Google Scholar 

  18. P. Poussel-Ragot, G. Dreyfus (1990) “A problem independent parallel implementation of simulated annealing: models and experiments”, IEEE Trans, on Computer-Aided Desing, 9, 8, 827–835.

    Article  Google Scholar 

  19. C. Dyer, A. Rosenfeld (1981), “Parallel image processing by memory-augmented cellular automata”, IEEE Trans, on Pattern Analysis and Machine Intelligence, PAMI-3, 1, 29–41.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer Science+Business Media New York

About this chapter

Cite this chapter

Berna, A., Bongiovanni, G., Crescenzi, P., Guerra, C. (1992). Parallel Simulated Annealing for Shape Detection. In: Arcelli, C., Cordella, L.P., di Baja, G.S. (eds) Visual Form. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-0715-8_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-4899-0715-8_6

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4899-0717-2

  • Online ISBN: 978-1-4899-0715-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics