Linear Programming Approach to Maximum Entropy Signal Restoration.

摘要

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. (ERA citation 13:050318)