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
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
Handbook of frequency stability analysis
Riley, W. J., & Riley, W. J. (2008) · doi:10.6028/nist.sp.1065 · Cited by 586
The fast Fourier transform in a finite field
Pollard, J. M. (1971) · Mathematics of Computation · doi:10.1090/s0025-5718-1971-0301966-0 · Cited by 467
Image and Video Compression With Neural Networks: A Review
Ma, S., Zhang, X., Jia, C., Zhao, Z., Wang, S., & Wang, S. (2020) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2019.2910119 · Cited by 459
Netravali, A. N., & Limb, J. O. (1980) · Proceedings of the IEEE · doi:10.1109/proc.1980.11647 · Cited by 451
Single-pixel infrared and visible microscope
Radwell, N., Mitchell, K. J., Gibson, G. M., Edgar, M. P., Bowman, R., & Padgett, M. J. (2014) · Optica · doi:10.1364/optica.1.000285 · Cited by 447
Chen, W.-H., & Pratt, W. (1984) · IEEE Transactions on Communications · doi:10.1109/tcom.1984.1096066 · Cited by 347
Self-citationLearning Sparsifying Transforms
Ravishankar, S., & Bresler, Y. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2226449 · Cited by 344
Simultaneous real-time visible and infrared video with single-pixel detectors
Edgar, M. P., Gibson, G. M., Bowman, R. W., Sun, B., Radwell, N., Mitchell, K. J., Welsh, S. S., & Padgett, M. J. (2015) · Scientific Reports · doi:10.1038/srep10669 · Cited by 332
Deep learning for real-time single-pixel video
Higham, C. F., Murray-Smith, R., Padgett, M. J., & Edgar, M. P. (2018) · Scientific Reports · doi:10.1038/s41598-018-20521-y · Cited by 318
Wintz, P. A. (1972) · Proceedings of the IEEE · doi:10.1109/proc.1972.8780 · Cited by 288
Image compression techniques: A survey in lossless and lossy algorithms
Hussain, A. J., Al-Fayadh, A., & Radi, N. (2018) · Neurocomputing · doi:10.1016/j.neucom.2018.02.094 · Cited by 275
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.