Considers the problem of restoring randomly distributed sets of missing pixels in band-limited discrete images, and give non-iterative and iterative algorithms capable of error-free restoration. The methods discussed have minimum dimension, that is, the size of the matrices and vectors which appear in the algorithm is determined by the number of unknown pixels. This is a characteristic which an alternative iterative formulation, based on the Papoulis-Gerchberg iteration, does not have. Convergence proofs for both the basic algorithms and a number of accelerated iterative methods are included as well. The performance of the methods is demonstrated with examples.
展开▼
