Analysis and improvement of Marr's algorithm for image reconstruction

A reconstruction algorithm of a function on a circular domain which was given by Marr is analyzed deeply. The problem found by us with this approach is that the term r/sup n/Q/sub n,k/ (r/sup 2/)included in the Marr's expansion algorithm has local large oscillation if n and k are very large. From that, numerical difficulties may arise and image distortion tends to come in the neighbourhood of circle. Moreover, the computing time of the algorithm is also long. In this paper, a new improved algorithm that overcomes the above two flaws is described. The computer simulation experiments show that the new algorithm is effective.