The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Hadamard transform image coding
Abstract
The introduction of the fast Fourier transform algorithm has led to the development of the Fourier transform image coding technique whereby the two-dimensional Fourier transform of an image is transmitted over a channel rather than the image itself. This devlopement has further led to a related image coding technique in which an image is transformed by a Hadamard matrix operator. The Hadamard matrix is a square array of plus and minus ones whose rows and columns are orthogonal to one another. A high-speed computational algorithm, similar to the fast Fourier transform algorithm, which performs the Hadamard transformation has been developed. Since only real number additions and subtractions are required with the Hadamard transform, an order of magnitude speed advantage is possible compared to the complex number Fourier transform. Transmitting the Hadamard transform of an image rather than the spatial representation of the image provides a potential toleration to channel errors and the possibility of reduced bandwidth transmission.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An algorithm for the machine calculation of complex Fourier series
Cooley, J. W., & Tukey, J. W. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0178586-1 · Cited by 13,154
The Fourier integral and its applications
Papoulis, A. (1962) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,650
Ryser, H. (1963) · Carus Mathematical Monographs · doi:10.5948/upo9781614440147 · Cited by 969
A Closed Set of Normal Orthogonal Functions
Walsh, J. L. (1923) · American Journal of Mathematics · doi:10.2307/2387224 · Cited by 967
Brigham, E. O., & Morrow, R. E. (1967) · IEEE Spectrum · doi:10.1109/mspec.1967.5217220 · Cited by 588
Paley, R. E. A. C. (1933) · Journal of Mathematics and Physics · doi:10.1002/sapm1933121311 · Cited by 587
The Interaction Algorithm and Practical Fourier Analysis
Good, I. J. (1958) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1958.tb00300.x · Cited by 509
What is the fast Fourier transform?
Cochran, W. T., Cooley, J. W., Favin, D. L., Helms, H. D., Kaenel, R. A., Lang, W. W., Maling, G. C., Nelson, D. E., Rader, C. M., & Welch, P. D. (1967) · Proceedings of the IEEE · doi:10.1109/proc.1967.5957 · Cited by 493
Design and Analysis of Factorial Experiments
Yates, F. (1958) · Rothamsted Repository (Rothamsted Repository) · Cited by 467
The Design and Analysis of Factorial Experiments
FISHER, R. A. (1938) · Nature · doi:10.1038/142090a0 · Cited by 295
Einige S�tze �ber Reihen von allgemeinen Orthogonalfunktionen
Rademacher, H. (1922) · Mathematische Annalen · doi:10.1007/bf01458040 · Cited by 291
Hadamard’s determinant theorem and the sum of four squares
Williamson, J. (1944) · Duke Mathematical Journal · doi:10.1215/s0012-7094-44-01108-7 · Cited by 204
Historical notes on the fast Fourier transform
Cooley, J., Lewis, P., & Welch, P. (1967) · IEEE Transactions on Audio and Electroacoustics · doi:10.1109/tau.1967.1161903 · Cited by 201
What is Fast Fourier Transform?
Gasmi, A. (2022) · HAL (Le Centre pour la Communication Scientifique Directe) · doi:10.13140/rg.2.2.28731.49444 · Cited by 172
Historical notes on the fast Fourier transform
Cooley, J. W., Lewis, P. A. W., & Welch, P. D. (1967) · Proceedings of the IEEE · doi:10.1109/proc.1967.5959 · Cited by 167
Discovery of an Hadamard matrix of order 92
Baumert, L. D., Golomb, S. W., & Hall, M. (1962) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1962-10761-7 · Cited by 79
Cited by
Principles and prospects for single-pixel imaging
Edgar, M. P., Gibson, G. M., & Padgett, M. J. (2019) · Nature Photonics · doi:10.1038/s41566-018-0300-7 · Cited by 1,029
Image coding using vector quantization: a review
Nasrabadi, N. M., & King, R. A. (1988) · IEEE Transactions on Communications · doi:10.1109/26.3776 · Cited by 958
Image data compression: A review
Jain, A. K. (1981) · Proceedings of the IEEE · doi:10.1109/proc.1981.11971 · Cited by 709
Single-pixel imaging 12 years on: a review
Gibson, G. M., Johnson, S. D., & Padgett, M. J. (2020) · Optics Express · doi:10.1364/oe.403195 · Cited by 645
Liquid Crystal Tunable Metamaterial Absorber
Shrekenhamer, D., Chen, W.-C., & Padilla, W. J. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.177403 · Cited by 615
Metadata
- Authors
- Pratt, W. K., Kane, J., & Andrews, H. C.
- Venue
- Proceedings of the IEEE
- Published
- 1969
- Volume
- 57
- Issue
- 1
- Pages
- 58-68
- ISSN
- 0018-9219 (ISSN-L)
- OpenAlex
- W2134809980
- Cited by
- 657
- References
- 16
- FWCI
- 47.50
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.