Massively parallel implementation of simulated annealing algorithms for image processing

Kurosh Madani; Nabil Mesbah

doi:10.1117/12.230393

19 January 1996 Massively parallel implementation of simulated annealing algorithms for image processing

Kurosh Madani, Nabil Mesbah

Proceedings Volume 2599, Three-Dimensional and Unconventional Imaging for Industrial Inspection and Metrology; (1996) https://doi.org/10.1117/12.230393
Event: Photonics East '95, 1995, Philadelphia, PA, United States

Abstract

It is now well known and well accepted that stochastic algorithms are very powerful in the case of degraded image reconstruction. One of the classes of such an approach is simulated annealing based algorithms. However, the reconstruction of a degraded image using iterative stochastic process requires a large number of operations. We are investigating massively parallel implementation of image processing dedicated simulated annealing based algorithms. In this paper, we discuss a massively parallel implementation of Carnevali's algorithm. We debate the elementary processor's structure of such implementation.

Citation Download Citation

Kurosh Madani and Nabil Mesbah "Massively parallel implementation of simulated annealing algorithms for image processing", Proc. SPIE 2599, Three-Dimensional and Unconventional Imaging for Industrial Inspection and Metrology, (19 January 1996); https://doi.org/10.1117/12.230393

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available