On the existence of equiangular tight frames
By Mátyás A. Sustik, Joel A. Tropp, Inderjit S. Dhillon, Robert W. Heath. 2007
268 citations recorded by the source corpus.
Subfields: Applied Mathematics, Computational Mechanics, Computer Vision and Pattern Recognition
View Paper: https://www.semanticscholar.org/paper/1ece463acf8cd11fc9e9371258c038a421961384
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Applied Mathematics
- Shayne Waldron
- Thomas Strohmer
- Dustin G. Mixon
- Matthew C. Fickus
- Janet C. Tremain
- Joel A. Tropp
- Alexey A. Glazyrin
- Wei-Hsuan Yu
In Computational Mechanics
- Shayne Waldron
- Robert W. Heath
- Thomas Strohmer
- Kasso Okoudjou
- Inderjit S. Dhillon
- Joel A. Tropp
- Dustin G. Mixon
- Matthew C. Fickus
In Computer Vision and Pattern Recognition
- Shayne Waldron
- Kasso Okoudjou
- Joel A. Tropp
- Robert W. Heath
- Thomas Strohmer
- Inderjit S. Dhillon
- Martin Ehler
- Matthew C. Fickus
Citations in the corpus
- Upper bounds for $s$-distance sets and equiangular lines (2016, background): “For instance, there is an extensive literature in frame theory devoted to equiangular tight frames [56, 38, 57].”
- Minimization of the probabilistic p-frame potential (2010, background): “Thus, by (10) they form an equiangular FUNTF [5, 31].”
- Steiner equiangular tight frames (2010, background): “Many approaches to constructing ETFs have focused on the special case in which every entry of F is a root of unity [17, 20, 26, 28, 31].”
- A note on equiangular tight frames (2008, background): “2 A necessary condition for the Gram matrix of an (n, d)-ETF to satisfy 〈fk, fl〉 = ±i √ n− d d(n− 1) , for all k 6= l, (11)”
- Designing structured tight frames via an alternating projection method (2005, background): “The paper [55] also contains detailed necessary conditions on real equiangular tight frames and on equiangular tight frames over finite alphabets.”
- On the construction of equiangular frames from graphs (2009, methodology): “When such frames do not exist (cf [ STDH07 ]) closely related classes of frames have been suggested as substitutes, most notably Grassmannian frames and mutually unbiased bases (see [SH03], [BK06], [KR04]).”