While the Fast Fourier Transform (FFT) is frequently used to efficiently implement a shift invariant convolution operator, it is of little use in implementing a variant operator which is to be evaluated at only selected locations in the image. The analysis of efficient implementation of a special class of circular-arc convolution operators found useful in the analysis of echocardiographic images leads to the observation that a much wider class of arc-like operators can also be approximated by the sum of a small number of invariant operators. While the immediate application is analyzed for the 3 X 3 computing environment, the techniques are general.

Date Published: 1 June 1992
PDF: 10 pages
Proc. SPIE 1769, Image Algebra and Morphological Image Processing III, (1 June 1992); doi: 10.1117/12.60662

Published in SPIE Proceedings Vol. 1769:
Image Algebra and Morphological Image Processing III
Paul D. Gader; Edward R. Dougherty; Jean C. Serra, Editor(s)