The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
A Sinusoidal Family of Unitary Transforms
Abstract
A new family of unitary transforms is introduced. It is shown that the well-known discrete Fourier, cosine, sine, and the Karhunen-Loeve (KL) (for first-order stationary Markov processes) transforms are members of this family. All the member transforms of this family are sinusoidal sequences that are asymptotically equivalent. For finite-length data, these transforms provide different approximations to the KL transform of the said data. From the theory of these transforms some well-known facts about orthogonal transforms are easily explained and some widely misunderstood concepts are brought to light. For example, the near-optimal behavior of the even discrete cosine transform to the KL transform of first-order Markov processes is explained and, at the same time, it is shown that this transform is not always such a good (or near-optimal) approximation to the above-mentioned KL transform. It is also shown that each member of the sinusoidal family is the KL transform of a unique, first-order, non-stationary (in general), Markov process. Asymptotic equivalence and other interesting properties of these transforms can be studied by analyzing the underlying Markov processes.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Ahmed, N., Natarajan, T., & Rao, K. R. (1974) · IEEE Transactions on Computers · doi:10.1109/t-c.1974.223784 · Cited by 5,156
Orthogonal Transforms for Digital Signal Processing
Ahmed, N., & Rao, K. R. (1975) · Springer eBooks · doi:10.1007/978-3-642-45450-9 · Cited by 948
Toeplitz and Circulant Matrices: A Review
Gray, R. M. (2005) · now publishers, Inc. eBooks · doi:10.1561/9781933019680 · Cited by 759
The chirp z-transform algorithm
Rabiner, L., Schafer, R., & Rader, C. (1969) · IEEE Transactions on Audio and Electroacoustics · doi:10.1109/tau.1969.1162034 · Cited by 642
Introduction to Matrix Analysis
Gillies, A. W. (1960) · Physics Bulletin · doi:10.1088/0031-9112/11/7/011 · Cited by 597
On the asymptotic eigenvalue distribution of Toeplitz matrices
Gray, R. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054924 · Cited by 526
A Fast Karhunen-Loeve Transform for a Class of Random Processes
Jain, A. (1976) · IEEE Transactions on Communications · doi:10.1109/tcom.1976.1093409 · Cited by 241
Self-citationComparison of the cosine and Fourier transforms of Markov-1 signals
Hamidi, M., & Pearl, J. (1976) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1976.1162839 · Cited by 102
Asymptotic Properties of Discrete Unitary Transforms
Yemini, Y., & Pearl, J. (1979) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1979.4766945 · Cited by 41
Cited by
Fast fourier transforms: A tutorial review and a state of the art
Duhamel, P., & Vetterli, M. (1990) · Signal Processing · doi:10.1016/0165-1684(90)90158-u · Cited by 1,143
Image data compression: A review
Jain, A. K. (1981) · Proceedings of the IEEE · doi:10.1109/proc.1981.11971 · Cited by 709
Self-citationFast algorithms for the discrete W transform and for the discrete Fourier transform
Wang, Z. (1984) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1984.1164399 · Cited by 597
A fast recursive algorithm for computing the discrete cosine transform
Hou, H. (1987) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1987.1165060 · Cited by 405
Advances in mathematical models for image processing
Jain, A. K. (1981) · Proceedings of the IEEE · doi:10.1109/proc.1981.12021 · Cited by 402
Self-citation
Metadata
- Authors
- Jain, A. K.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1979-10
- Volume
- PAMI-1
- Issue
- 4
- Pages
- 356-365
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2144640755
- Cited by
- 287
- References
- 10
- FWCI
- 3.04
- 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.