Abstract
An iterative restoration algorithm for the solution of x in y = Hx has been described. For the purpose of comparison, a general overview of the existing iterative techniques is given. For the proposed technique, the constraints for convergence and its rate, which is quadratic in comparison with the linear rate of other techniques, have been derived. Also derived is the deviation in the solution when instead of H a perturbed operator H ∗ is used in the algorithm. The effect of additive noise on the estimates has also been described. Finally, the technique has been applied to the deconvolution of a blurred signal, the results of which validate the theory. For the sake of comparison, the algorithm has been applied to the sample of Fig. 7 of Schafer, Mersereau and Richards (1981). It is seen that only four iterations compared with twenty in the cited reference are sufficient to produce similar results.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
