An algorithm to find all solutions of blind deconvolution

  • 발행 : 2004.06.01

초록

This paper shows that blind deconvolution has only finite solutions when an original image and a point spread function are nonzero over a restricted domain, in other words, an observed image has a compact support. The key of the proof is to use z-transformations and factorizations of polynomials. Then, we propose an algorithm to find all finite solutions under the boundary condition. Finally, we confirm that we can extract all sets of an original image and a point spread function from a degraded image by using our algorithm in numerical examples.

키워드

참고문헌

  1. T. G. Stockham, T. M. Cannon and R. B. Ingebresten, 'Blind deconvolution through digital signal processing', Proc. IEEE, Vol. 63, No. 4, pp. 678-692, 1975
  2. G. R. Ayers and J. C. Dainty, 'Iterative blind deconvolution method and its applications', Opt. Lett., Vol. 13, No. 7, pp. 547-549, 1988
  3. R. G. Lane and R. H. T. Bates, 'Automatic multidimensional deconvolution', J. Opt. Soc. Am. A, Vol. 4, No. 1, pp. 180-188, 1987
  4. Satoshi Kawata, Introduction to Data Processing for Science-Measure, CQ Publishing, pp. 108-119, 2002. (In Japanese)
  5. Teiji Takagi, Lecture of Algebra, Kyoritsu Publishing, pp. 40-137, 1965. (In Japanese)
  6. Teturo Yamamoto, Introduction to Numerical Analysis, Science-sya Co., pp. 14-16, 1976. (In Japanese)
  7. M. Sakauchi, M. Onoe and Y. Inamoto, SIDBA: standard image data base, Multidimensional Image Processing Center Report, 79-1, Institute of Industrial Science, University of Tokyo, Mar. 1979