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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Keywords
AlgorithmPiecewiseComputer scienceSimulated annealingStochastic processMathematical optimizationStochastic optimizationMathematics
Affiliated Institutions
Related Publications
Applying the genetic approach to simulated annealing in solving some NP-hard problems
A stochastic approach called the annealing-genetic algorithm is presented for solving some well-known combinatorial optimization problems. This approach incorporates genetic alg...
Performance evaluation of genetic algorithms for flowshop scheduling problems
The aim of this paper is to evaluate the performance of genetic algorithms for the flowshop scheduling problem with an objective of minimizing the makespan. First we examine var...
On the use of backpropagation in associative reinforcement learning
A description is given of several ways that backpropagation can be useful in training networks to perform associative reinforcement learning tasks. One way is to train a second ...
An improved elastic net method for the traveling salesman problem
An elastic net method is presented for finding traveling-salesman tours; the method improves on the convergence properties of a recent model proposed by R. Durbin and D. Willsha...
A framework for the robust estimation of optical flow
The authors consider the problem of robustly estimating optical flow from a pair of images using a new framework based on robust estimation which addresses violations of the bri...
Publication Info
- Year
- 1989
- Type
- article
- Volume
- 11
- Issue
- 1
- Pages
- 2-12
- Citations
- 175
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
175
OpenAlex
Cite This
Andrew Blake
(1989).
Comparison of the efficiency of deterministic and stochastic algorithms for visual reconstruction.
IEEE Transactions on Pattern Analysis and Machine Intelligence
, 11
(1)
, 2-12.
https://doi.org/10.1109/34.23109
Identifiers
- DOI
- 10.1109/34.23109