Image Processing by Transforms Over a Finite Field

@article{Reed1977ImagePB,
  title={Image Processing by Transforms Over a Finite Field},
  author={Irving S. Reed and Trieu-Kien Truong and Yik S. Kwoh and Ernest L. Hall},
  journal={IEEE Transactions on Computers},
  year={1977},
  volume={C-26},
  pages={874-881}
}
A transform analogous to the discrete Fourier transform is defined on the Galois field GF(p), where p is a prime of the form k X 2n + 1, where k and n are integers. Such transforms offer a substantial variety of possible transform lengths and dynamic ranges. The fast Fourier transform (FFT) algorithm of this transform is faster than the conventional radix-2 FFT. A transform of this type is used to filter a two-dimensional picture (e.g., 256 X 256 samples), and the results are presented with a… CONTINUE READING

Similar Papers

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 16 CITATIONS

Texture Representation Using Galois Field for Rotation Invariant Classification

  • 2017 13th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS)
  • 2017
VIEW 1 EXCERPT
CITES METHODS

Using Fermat number transform to accelerate convolutional neural network

  • 2017 IEEE 12th International Conference on ASIC (ASICON)
  • 2017
VIEW 1 EXCERPT
CITES BACKGROUND

Number Theoretic Transforms for Secure Signal Processing

  • IEEE Transactions on Information Forensics and Security
  • 2016
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 13 REFERENCES

The use of finite fields to compute convolutions

  • IEEE Trans. Information Theory
  • 1975
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Integer convolutions over the finite field GF ( 3 X 2 n + 1 ) , " SIAMJ

I. S. Reed, T. K. Truong
  • Appl . Math .
  • 1977

Effects of finite register length in digital filtering and the fast Fourier transform

A. V. Oppenheim, C. Weimsten
  • Proc. IEEE, vol. 60, pp. 957-976, Aug. 1972.
  • 1972
VIEW 1 EXCERPT