The DOI matches its Crossref record; 71 of the 71 references it cites were found in a registry or an index.
Designing structured tight frames via an alternating projection method
Abstract
Tight frames, also known as general Welch-bound- equality sequences, generalize orthonormal systems. Numerous applications - including communications, coding, and sparse approximation- require finite-dimensional tight frames that possess additional structural properties. This paper proposes an alternating projection method that is versatile enough to solve a huge class of inverse eigenvalue problems (IEPs), which includes the frame design problem. To apply this method, one needs only to solve a matrix nearness problem that arises naturally from the design specifications. Therefore, it is the fast and easy to develop versions of the algorithm that target new design problems. Alternating projection will often succeed even if algebraic constructions are unavailable. To demonstrate that alternating projection is an effective tool for frame design, the paper studies some important structural properties in detail. First, it addresses the most basic design problem: constructing tight frames with prescribed vector norms. Then, it discusses equiangular tight frames, which are natural dictionaries for sparse approximation. Finally, it examines tight frames whose individual vectors have low peak-to-average-power ratio (PAR), which is a valuable property for code-division multiple-access (CDMA) applications. Numerical experiments show that the proposed algorithm succeeds in each of these three cases. The appendices investigate the convergence properties of the algorithm.
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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Least squares quantization in PCM
Lloyd, S. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056489 · Cited by 15,836
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
Horn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
Vector Quantization and Signal Compression
Gersho, A., & Gray, R. M. (1992) · Springer eBooks · doi:10.1007/978-1-4615-3626-0 · Cited by 7,003
Golub, G. H., & Loan, C. F. V. (1996) · Johns Hopkins University Press eBooks · Cited by 6,027
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint.
Daubechies, I., Defrise, M., & De Mol, C. (2004) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20042 · Cited by 4,958
Inequalities: Theory of Majorization and its Applications.
Arnold, B. C., Marshall, A. W., & Olkin, I. (1981) · Journal of the American Statistical Association · doi:10.2307/2287859 · Cited by 4,870
Greed is Good: Algorithmic Results for Sparse Approximation
Tropp, J. A. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.834793 · Cited by 3,635
Self-citationOptimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
Donoho, D. L., & Elad, M. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0437847100 · Cited by 2,898
Bregman, L. M. (1967) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(67)90040-7 · Cited by 2,618
Weak convergence of the sequence of successive approximations for nonexpansive mappings
Opial, Z. (1967) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1967-11761-0 · Cited by 2,340
A Generalized Solution of the Orthogonal Procrustes Problem
Schönemann, P. H. (1966) · Psychometrika · doi:10.1007/bf02289451 · Cited by 2,040
Franklin, J. (1968) · Cited by 1,807
An Introduction to Differentiable Manifolds and Riemannian Geometry
(1975) · Pure and Applied Mathematics · doi:10.1016/s0079-8169(08)x6065-9 · Cited by 1,778
An Introduction to Frames and Riesz Bases
Weber, E., & Christensen, O. (2005) · American Mathematical Monthly · doi:10.2307/30037432 · Cited by 1,715
On Projection Algorithms for Solving Convex Feasibility Problems
Bauschke, H. H., & Borwein, J. M. (1996) · SIAM Review · doi:10.1137/s0036144593251710 · Cited by 1,654
An Introduction to Frames and Riesz Bases
Christensen, O. (2003) · Applied and Numerical Harmonic Analysis · doi:10.1007/978-0-8176-8224-8 · Cited by 1,461
Computation of channel capacity and rate-distortion functions
Blahut, R. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054855 · Cited by 1,381
Concept Decompositions for Large Sparse Text Data Using Clustering
Dhillon, I. S., & Modha, D. S. (2001) · Machine Learning · doi:10.1023/a:1007612920971 · Cited by 1,293
Self-citationLower bounds on the maximum cross correlation of signals (Corresp.)
Welch, L. (1974) · IEEE Transactions on Information Theory · doi:10.1109/tit.1974.1055219 · Cited by 1,291
Nonlinear Programming: A Unified Approach.
Beale, E. M. L., & Zangwill, W. (1970) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2343701 · Cited by 1,057
Uncertainty Principles and Signal Recovery
Donoho, D. L., & Stark, P. B. (1989) · SIAM Journal on Applied Mathematics · doi:10.1137/0149053 · Cited by 1,054
Image Restoration by the Method of Convex Projections: Part 1ߞTheory
Youla, D. C., & Webb, H. (1982) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.1982.4307555 · Cited by 1,021
Nonlinear Programming: A Unified Approach
Peterson, D. W., & Zangwill, W. I. (1972) · Econometrica · doi:10.2307/1909424 · Cited by 1,005
Super-resolution through Error Energy Reduction
Gerchberg, R. W. (1974) · Optica Acta: International Journal of Optics · doi:10.1080/713818946 · Cited by 987
Zheng, L., & Tse, D. N. C. (2002) · IEEE Transactions on Information Theory · doi:10.1109/18.978730 · Cited by 986
Sparse representations in unions of bases
Gribonval, R., & Nielsen, M. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.820031 · Cited by 960
Grassmannian frames with applications to coding and communication
Strohmer, T., & Heath, R. W. (2003) · Applied and Computational Harmonic Analysis · doi:10.1016/s1063-5203(03)00023-x · Cited by 955
Self-citationSolution of Equations and Systems of Equations
I., E., & Ostrowski, A. M. (1967) · Mathematics of Computation · doi:10.2307/2005025 · Cited by 937
Computing the nearest correlation matrix--a problem from finance
Higham, N. J. (2002) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/22.3.329 · Cited by 886
An algorithm for computing the capacity of arbitrary discrete memoryless channels
Arimoto, S. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054753 · Cited by 838
Parallel optimization: Theory, algorithms, and applications
(1998) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(98)90713-1 · Cited by 813
Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
Conway, J. H., Hardin, R. H., & Sloane, N. J. A. (1996) · Experimental Mathematics · doi:10.1080/10586458.1996.10504585 · Cited by 755
Nonuniform Sampling and Reconstruction in Shift-Invariant Spaces
Aldroubi, A., & Gröchenig, K. (2001) · SIAM Review · doi:10.1137/s0036144501386986 · Cited by 728
Systematic design of unitary space-time constellations
Hochwald, B. M., Marzetta, T. L., Richardson, T. J., et al. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.868472 · Cited by 707
Signal enhancement-a composite property mapping algorithm
CADZOW, J. A. (1988) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/29.1488 · Cited by 701
Computing a nearest symmetric positive semidefinite matrix
Higham, N. J. (1988) · Linear Algebra and its Applications · doi:10.1016/0024-3795(88)90223-6 · Cited by 698
Information geometry and alternating minimization procedures
Csiszár, I. (1984) · Statistics & Risk Modeling · Cited by 579
An Algorithm for Restricted Least Squares Regression
Dykstra, R. L. (1983) · Journal of the American Statistical Association · doi:10.1080/01621459.1983.10477029 · Cited by 551
Computing the Polar Decomposition—with Applications
Higham, N. J. (1986) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0907079 · Cited by 427
Finite Normalized Tight Frames
Benedetto, J. J., & Fickus, M. (2003) · Advances in Computational Mathematics · doi:10.1023/a:1021323312367 · Cited by 421
Quantized overcomplete expansions in IR/sup N/: analysis, synthesis, and algorithms
Goyal, V. K., Vetterli, M., & Thao, N. T. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.650985 · Cited by 417
A Method for Finding Projections onto the Intersection of Convex Sets in Hilbert Spaces
Boyle, J. P., & Dykstra, R. L. (1986) · Lecture Notes in Statistics · doi:10.1007/978-1-4613-9940-7_3 · Cited by 415
A quadratic programming procedure
Hildreth, C. (1957) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800040113 · Cited by 378
Cvetkovic, Z., & Vetterli, M. (1998) · IEEE Transactions on Signal Processing · doi:10.1109/78.668788 · Cited by 332
Equal-Norm Tight Frames with Erasures
Casazza, P. G., & Kovačević, J. (2003) · Advances in Computational Mathematics · doi:10.1023/a:1021349819855 · Cited by 329
Optimal sequences and sum capacity of synchronous CDMA systems
Viswanath, P., & Anantharam, V. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.782121 · Cited by 321
Z4 -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets
Calderbank, A., Cameron, P., Kantor, W., & Seidel, J. (1997) · Proceedings of the London Mathematical Society · doi:10.1112/s0024611597000403 · Cited by 313
Proximity maps for convex sets
Cheney, W., & Goldstein, A. A. (1959) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1959-0105008-8 · Cited by 302
On the existence of equiangular tight frames
Sustik, M. A., Tropp, J. A., Dhillon, I. S., & Heath, R. W. (2007) · Linear Algebra and its Applications · doi:10.1016/j.laa.2007.05.043 · Cited by 253
Self-citationOn the continuity of the minimum set of a continuous function
Dantzig, G. B., Folkman, J., & Shapiro, N. (1967) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(67)90139-4 · Cited by 244
The Orthogonal Approximation of an Oblique Structure in Factor Analysis
Green, B. F. (1952) · Psychometrika · doi:10.1007/bf02288918 · Cited by 234
Block-relaxation Algorithms in Statistics
de Leeuw, J. (1994) · Studies in Classification, Data Analysis, and Knowledge Organization · doi:10.1007/978-3-642-46808-7_28 · Cited by 216
THE ORTHOGONAL APPROXIMATION OF AN OBLIQUE STRUCTURE IN FACTOR ANALYSIS
Green, B. F. (1951) · ETS Research Bulletin Series · doi:10.1002/j.2333-8504.1951.tb00218.x · Cited by 205
The Formulation and Analysis of Numerical Methods for Inverse Eigenvalue Problems
Friedland, S., Nocedal, J., & Overton, M. L. (1987) · SIAM Journal on Numerical Analysis · doi:10.1137/0724043 · Cited by 163
The Projected Gradient Method for Least Squares Matrix Approximations with Spectral Constraints
Chu, M. T., & Driessel, K. R. (1990) · SIAM Journal on Numerical Analysis · doi:10.1137/0727062 · Cited by 145
The formulation and analysis of numerical methods for inverse eigenvalue problems
Friedland, S., & Overton, M. L. (1987) · Deep Sea Research Part B Oceanographic Literature Review · doi:10.1016/0198-0254(87)96151-6 · Cited by 144
Method of successive projections for finding a common point of sets in metric spaces
Combettes, P. L., & Trussell, H. J. (1990) · Journal of Optimization Theory and Applications · doi:10.1007/bf00939646 · Cited by 132
Sufficient conditions for the convergence of monotonic mathematicalprogramming algorithms
Meyer, R. R. (1976) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(76)80021-9 · Cited by 113
Diametrical clustering for identifying anti-correlated gene clusters
Dhillon, I. S., Marcotte, E. M., & Roshan, U. (2003) · Bioinformatics · doi:10.1093/bioinformatics/btg209 · Cited by 111
Self-citationEquiripple FIR filter design by the FFT algorithm
Çetin, A. E., Gerek, Ö. N., & Yardımcı, Y. (1997) · IEEE Signal Processing Magazine · doi:10.1109/79.581378 · Cited by 109
Optimal sequences for CDMA under colored noise: a Schur-saddle function property
Viswanath, P., & Anantharam, V. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.1003823 · Cited by 100
Approximation of Dual Gabor Frames, Window Decay, and Wireless Communications
Strohmer, T. (2001) · Applied and Computational Harmonic Analysis · doi:10.1006/acha.2001.0357 · Cited by 99
Self-citationInformation Systems and Data Analysis
Bock, H., Lenski, W., & Richter, M. M. (1994) · Studies in classification, data analysis, and knowledge organization · doi:10.1007/978-3-642-46808-7 · Cited by 91
The recovery of distorted band-limited signals
Landau, H. J., & Miranker, W. L. (1961) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(61)90047-6 · Cited by 78
Composition and union of general algorithms of optimization
Fiorot, J.-C., & Huard, P. (1979) · Mathematical programming studies · doi:10.1007/bfb0120844 · Cited by 24
Packing Planes in Four Dimensions and Other MysteriesPreprint
Sloane, N. J. A. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.math/0208017 · Cited by 15
Optimal CDMA signature sequences, inverse eigenvalue problems and alternating minimization
Tropp, J. A., Heath, R. W., & Strohmer, T. (2003) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2003.1228424 · Cited by 6
Self-citation
Cited by
Spatially Sparse Precoding in Millimeter Wave MIMO Systems
Ayach, O. E., Rajagopal, S., Abu-Surra, S., Pi, Z., & Heath, R. W. (2014) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2014.011714.130846 · Cited by 3,557
Self-citationOptimized Projections for Compressed Sensing
Elad, M. (2007) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.900760 · Cited by 835
Frequency Selective Hybrid Precoding for Limited Feedback Millimeter Wave Systems
Alkhateeb, A., & Heath, R. W. (2016) · IEEE Transactions on Communications · doi:10.1109/tcomm.2016.2549517 · Cited by 543
Self-citationThe Undecimated Wavelet Decomposition and its Reconstruction
Starck, J.-L., Fadili, J., & Murtagh, F. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2006.887733 · Cited by 530
New Algorithms for Designing Unimodular Sequences With Good Correlation Properties
Stoica, P., He, H., & Li, J. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2012562 · Cited by 475
Metadata
- Authors
- Tropp, J. A., Dhillon, I. S., Heath, R. W., & Strohmer, T.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2005-01
- Volume
- 51
- Issue
- 1
- Pages
- 188-209
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2132702454
- Cited by
- 494
- References
- 71
- FWCI
- 27.00
- 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.