A linear programming approach to maximum entropy signal restoration
Conference
·
OSTI ID:6948598
In future computing environments where computer resources are abundant, a linear programming (LP) approach to maximum entropy signal/image restoration could have advantages over traditional techniques. A revised simplex LP algorithm with inequality constraints is presented. Dantzig's bounded-variable method is used to express the maximum entropy restoration problem as a LP problem. This is done by approximating the nonlinear objective function with piecewise linear segments, then bounding the variables as a function of the number of segments used. Linear inequality constraints may be used to assure a basic feasible solution. Experimental results with 512-point signals are presented. These include restorations of noisy signals. Problems with as many as 513 equations and 6144 unknowns are demonstrated. The complexity of the LP restoration approach is briefly addressed. 14 refs., 4 figs.
- Research Organization:
- Sandia National Labs., Albuquerque, NM (USA)
- DOE Contract Number:
- AC04-76DP00789
- OSTI ID:
- 6948598
- Report Number(s):
- SAND-88-0371C; CONF-880887-3; ON: DE88013021
- Country of Publication:
- United States
- Language:
- English
Similar Records
Maximum entropy signal restoration with linear programming
Issues of piecewise linearity in dual and primal-dual methods for bounded-variable linear programs
Two-dimensional maximum entropy image restoration
Technical Report
·
Sun May 01 00:00:00 EDT 1988
·
OSTI ID:7043116
Issues of piecewise linearity in dual and primal-dual methods for bounded-variable linear programs
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36022
Two-dimensional maximum entropy image restoration
Technical Report
·
Fri Jul 01 00:00:00 EDT 1977
·
OSTI ID:7218359