• DocumentCode
    88241
  • Title

    Measures of Scalability

  • Author

    Xuemei Chen ; Kutyniok, Gitta ; Okoudjou, Kasso A. ; Philipp, Friedrich ; Rongrong Wang

  • Author_Institution
    Dept. of Math., Univ. of Missouri, Columbia, MO, USA
  • Volume
    61
  • Issue
    8
  • fYear
    2015
  • fDate
    Aug. 2015
  • Firstpage
    4410
  • Lastpage
    4423
  • Abstract
    Scalable frames are frames with the property that the frame vectors can be rescaled resulting in tight frames. However, if a frame is not scalable, one has to aim for an approximate procedure. For this, in this paper we introduce three novel quantitative measures of the closeness to scalability for frames in finite dimensional real Euclidean spaces. Besides the natural measure of scalability given by the distance of a frame to the set of scalable frames, another measure is obtained by optimizing a quadratic functional, while the third is given by the volume of the ellipsoid of minimal volume containing the symmetrized frame. After proving that these measures are equivalent in a certain sense, we establish bounds on the probability of a randomly selected frame to be scalable. In the process, we also derive new necessary and sufficient conditions for a frame to be scalable.
  • Keywords
    computational geometry; convex programming; vectors; convex geometry; finite dimensional real Euclidean spaces; frame vectors; minimal volume ellipsoid; quadratic functional optimization; quantitative closeness measures; scalability measure; scalable frames; symmetrized frame; Compressed sensing; Electronic mail; Ellipsoids; Scalability; Volume measurement; Convex Geometry; Convex geometry; Parseval frame; Quality Measures; Scalable frame; parseval frame; quality measures; scalable frame;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2015.2441071
  • Filename
    7117415