Comparison of the efficiency of deterministic and stochasticalgorithms for visual reconstruction
Blake, A.
Dept. of Comput. Sci., Edinburgh Univ.;
This paper appears in: Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publication Date: Jan 1989
Volume: 11,
Issue: 1
On page(s): 2-12
ISSN: 0162-8828
References Cited: 30
CODEN: ITPIDJ
INSPEC Accession Number: 3366821
Digital Object Identifier: 10.1109/34.23109
Current Version Published: 2002-08-06
Abstract
Piecewise continuous reconstruction of real-valued data can be
formulated in terms of nonconvex optimization problems. Both stochastic
and deterministic algorithms have been devised to solve them. The
simplest such reconstruction process is the weak string. Exact solutions
can be obtained for it and are used to determine the success or failure
of the algorithms under precisely controlled conditions. It is concluded
that the deterministic algorithm (graduated nonconvexity) outstrips
stochastic (simulated annealing) algorithms both in computational
efficiency and in problem-solving power
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
