Abstract
An unusual form of the maximum entropy problem is considered, that includes simple bound constraints on the Fourier coefficients of the required image, as well as nonnegativity conditions on the image intensities. The algorithm avoids mixing these constraints by introducing a parameter into the objective function that is adjusted by an outer iteration. For each parameter value an inner iteration solves a large optimization calculation, whose constraints are just the simple bounds, by a combination of the conjugate gradient procedure and an active set method. An important feature is the ability to make many changes to the active set at once. The outer iteration includes a test for inconsistency of all the given constraints. The algorithm is described, a proof of convergence is given, and there are some second-hand remarks on numerical results.
Similar content being viewed by others
References
I. Barrodale, C.A. Zala and R.F. MacKinnon (1987), “Image processing by a maximum entropy procedure incorporating frequency domain bounds and prior knowledge,” in:IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, June 4–5, 1987, Preprints, pp. 163–169.
A.S.J. Batchelor and E.M.L. Beale (1980), “A revised method of conjugate gradient approximation programming,” in: A. Prekopa, ed.,Survey of Mathematical Programming (Akademie Kiadó, Budapest) pp. 329–346.
R. Fletcher (1987),Practical Methods of Optimization (John Wiley & Sons, Chichester).
S.F. Gull and J. Skilling (1984), “Maximum entropy method in image processing,”IEE Proceedings 131F, 646–659.
E.T. Jaynes (1982), “On therationale of maximum entropy methods,”Proc. IEEE 70, 939–952.
E. Polak (1971),Computational Methods in Optimization: A Unified Approach (Academic Press, New York).
M.J.D. Powell (1969), “A method for nonlinear constraints in minimization problems,” in: R. Fletcher, ed.,Optimization (Academic Press, London) pp. 283–298.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Powell, M.J.D. An algorithm for maximizing entropy subject to simple bounds. Mathematical Programming 42, 171–180 (1988). https://doi.org/10.1007/BF01589401
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01589401