- 1 HOLMES, W. S. Automatic photointerpretation and target location. Proc. IEEE 54, 12 (Dec. 1966), 1679-1686.Google Scholar
- 2 GRAHAM, D.N. Image transmission by two-dimensional contour coding. Proc. IEEE 55, 3 (Mar. 1967), 336-346.Google Scholar
- 3 NARASlMHAN, R. Labeling schemata and syntactic descriptions of pictures. Inform. Contr. 7, 2 (June 1964), 151-179.Google Scholar
- 4 SKLANSKY, J. An image storage tube computer. US Navy Contract Nonr 2913(00), A1) 658521, Defense Documentation Center, Cameron, Va., July 1967.Google Scholar
- 5 HAWKINS, J. K., AND MUNSEY, C.J. Image processing by electron-optical techniques. J. Optical Soc. Amer. 57, 7 (July 1967), 914-918.Google Scholar
- 6 RUSSELL, JOHN K. A visual image processor. IEEE Trans. C-17, 7 (July 1968), 635-639.Google Scholar
- 7 JuEY, E .I . Theory and Application of the Z-Transform Method. Wiley, New York, 1964, pp. 73-76.Google Scholar
- 8 PAPOULIS, A. Systems and Transforms with Applications in Optics. McGraw-Hill, New York, 1968.Google Scholar
Index Terms
- Thresholded Convolutions Operations
Recommendations
Discrete Convolutions via Mersenne Transrorms
A transform analogous to the discrete Fourier transform is defined in the ring of integers with a multiplication and addition modulo a Mersenne number. The arithmetic necessary to perform the transform requires only additions and circular shifts of the ...
Efficient Dealiased Convolutions without Padding
Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place convolutions, the memory requirements are identical with the zero-padding ...
Computation of convolutions and discrete Fourier transforms by polynomial transforms
Discrete transforms are introduced and are defined in a ring of polynomials. These polynomial transforms are shown to have the convolution property and can be computed in ordinary arithmetic, without multiplications. Polynomial transforms are ...
Comments