scispace - formally typeset
Journal ArticleDOI

On Computation of the Hadamard Transform and the R Transform in Ordered Form

Murat Kunt
- 01 Nov 1975 - 
- Vol. 24, Iss: 11, pp 1120-1121
Reads0
Chats0
TLDR
An improved computational algorithm for the Hadamard transform and the R transform is described, by performing the computation "in place", the number of storage locations is minimized and the speed is increased.
Abstract
This correspondence describes an improved computational algorithm for the Hadamard transform and the R transform. By performing the computation "in place", the number of storage locations is minimized and the speed is increased. The transformed coefficients are in the order of increasing sequency.

read more

Citations
More filters
Journal ArticleDOI

The receptive field of the primate P retinal ganglion cell, I: Linear dynamics

TL;DR: The investigation of P-cell responses measured as S-potentials in the lateral geniculate nucleus (LGN) is continued, and significant nonlinear, second-order responses from the center and the surround are described.
Journal ArticleDOI

Speckle photography fringe analysis by the Walsh transform.

TL;DR: Two-dimensional Walsh spectral analysis is presented as a new method of numerically processing the Young's fringes diffraction pattern from a double-exposure speckle photograph, giving results of almost identical accuracy but with substantially reduced computational effort.
Journal ArticleDOI

Picture processing: 1975

TL;DR: Topics covered include transforms and filtering; compression; enhancement, restoration, and reconstruction; hardware and software implementations; pictorial pattern recognition; matching and local feature detection; segmentation; shape and texture; scene analysis; and formal models.
References
More filters
Journal ArticleDOI

Hadamard transform image coding

TL;DR: A high-speed computational algorithm, similar to the fast Fourier transform algorithm, which performs the Hadamard transformation has been developed, which provides a potential toleration to channel errors and the possibility of reduced bandwidth transmission.
Journal ArticleDOI

Computation of the Fast Walsh-Fourier Transform

TL;DR: An efficient Walsh transform computation algorithm is derived which is analogous to the Cooley-Tukey algorithm for the complex-exponential Fourier transform.
Journal ArticleDOI

A transformation with invariance under cyclic permutation for applications in pattern recognition

TL;DR: A transformation that can be used to characterize patterns independent of their position is described, which is 10–100 times faster than the fast Fourier transform (depending on the number of sampling points).
Journal ArticleDOI

A generalized concept of frequency and some applications

TL;DR: For the complete system of the orthogonal Walsh functions, the implementation of circuits by modem semiconductor techniques appears to be competitive in a number of applications with the implementationof circuits for the system of sine and cosine functions.
Journal ArticleDOI

Computation of the Hadamard Transform and the R- Transform in Ordered Form

TL;DR: This correspondence describes a method of computing the Hadamard transform and the R-transform that produces the transform components in the order of the increasing sequency of the Walsh functions represented by the rows of a symmetric hadamard matrix.
Related Papers (5)