Share Email Print

Proceedings Paper

Global cost optimization in image registration using simulated annealing
Author(s): Babak Farsaii; Andras Sablauer
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

A new optimization method for image registration has been proposed. Registration using Simulated Annealing converges to global minima/maxima as opposed to the previously wildly used algorithms that get trapped in local minima. The performance of this algorithm is tested against two other well-known optimization algorithms, Powell and Down Hill Simplex using two different methods. First, the algorithms are tested against famous De jong Test Suites and second, they are tested against Two-Cube Phantom. Our data shows that simulated annealing is the only algorithm that will always converges to the global minima with the cost of more function evaluation.

Paper Details

Date Published: 24 September 1998
PDF: 9 pages
Proc. SPIE 3457, Mathematical Modeling and Estimation Techniques in Computer Vision, (24 September 1998); doi: 10.1117/12.323436
Show Author Affiliations
Babak Farsaii, SUNY/Buffalo (United States)
Andras Sablauer, SUNY/Buffalo (United States)

Published in SPIE Proceedings Vol. 3457:
Mathematical Modeling and Estimation Techniques in Computer Vision
Francoise J. Preteux; Jennifer L. Davidson; Edward R. Dougherty, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?