(22) * << * >> * Russian * English * Content * All Issues

Optimization of structural and computational characteristics of large-format image recovery algorithms

N.V. Radchenko2, V.V. Sergeev1,2, V.M. Chernov1,2, M.A. Chicheva1,2

1 IPSI RAS – Branch of the FSRC "Crystallography and Photonics" RAS,
443001, Samara, Russia, Molodogvardeyskaya 151,
2 Samara National Research University, 443086, Samara, Russia, Moskovskoye Shosse 34

 PDF, 345 kB

Pages: 84-88.

Full text of article: Russian language.

Abstract:
This work solves the problem of recovering large-format images by filtering. A partition-based convolution method is described. A method for choosing the optimal block size is presented. The basic DFT algorithm for the selected block size is presented, its computational complexity and implementation characteristics are indicated.

Keywords:
large-format image, filtering, optimal block size, DFT algorithm.

Citation:
Radchenko NV, Sergeev VV, Chernov VM, Chicheva MA.  Optimization of structural and computational characteristics of large-format image recovery algorithms. Computer Optics 2002; 23: 84-88.

References:
  1. Blahut RE. Fast algorithms for digital signal processing. Boston, MA: Addison-Wesley Publishing Company Inc; 1985.
  2. Nussbaumer HG. Fast Fourier transform and convolution algorithms. Berlin, Heidelberg: Springer-Verlag; 1981.
  3. Aramberpola B, Rayner PJW. Multidimensional fast Fourier transform algorithm. Electron Lett 1979; 15(13): 382-383.
  4. Chernov VM. Algorithms of two-dimensional discrete orthogonal transforms realized in Hamilton–Eisenstein codes. Probl Inf Transm 1995; 31(3): 228-235.

© 2009, IPSI RAS
151, Molodogvardeiskaya str., Samara, 443001, Russia; E-mail: journal@computeroptics.ru ; Tel: +7 (846) 242-41-24 (Executive secretary), +7 (846) 332-56-22 (Issuing editor), Fax: +7 (846) 332-56-20