Results 1 
4 of
4
Prime tight frames
 Adv. Comput. Math
"... Abstract: We introduce a class of finite tight frames called prime tight frames and prove some of their elementary properties. We show that any finite tight frame can be written as a union of prime tight frames. We then characterize all prime harmonic tight frames as well as all prime frames constr ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
Abstract: We introduce a class of finite tight frames called prime tight frames and prove some of their elementary properties. We show that any finite tight frame can be written as a union of prime tight frames. We then characterize all prime harmonic tight frames as well as all prime frames constructed from the spectral tetris method. As a byproduct of this last result, we obtain a characterization of when the spectral tetris construction works for redundancies below two.
CONSTRUCTIVE PROOF OF THE CARPENTER’S THEOREM
"... Abstract. We give a constructive proof of Carpenter’s Theorem due to Kadison [14, 15]. Unlike the original proof our approach also yields the real case of this theorem. 1. Kadison’s theorem In [14] and [15] Kadison gave a complete characterization of the diagonals of orthogonal projections on a Hilb ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
Abstract. We give a constructive proof of Carpenter’s Theorem due to Kadison [14, 15]. Unlike the original proof our approach also yields the real case of this theorem. 1. Kadison’s theorem In [14] and [15] Kadison gave a complete characterization of the diagonals of orthogonal projections on a Hilbert space H. Theorem 1.1 (Kadison). Let {di}i∈I be a sequence in [0, 1]. Define a = di<1/2 di and b = di≥1/2 (1 − di). There exists a projection P with diagonal {di} if and only if one of the following holds (i) a, b < ∞ and a − b ∈ Z, (ii) a = ∞ or b =∞. The goal of this paper is to give a constructive proof of the sufficiency direction of Kadison’s
Matrices·Tight
"... Abstract Frame theory is closely intertwined with signal processing by providing a canon of methodologies for the analysis of signals using (redundant) linear measurements. The dual frame associated with a frame then provides a means for reconstruction by a least squares approach. The novel paradigm ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract Frame theory is closely intertwined with signal processing by providing a canon of methodologies for the analysis of signals using (redundant) linear measurements. The dual frame associated with a frame then provides a means for reconstruction by a least squares approach. The novel paradigm of sparsity entered this area lately in various ways. Of those, in this survey paper, we will focus on the frames and dual frames which can be written as sparse matrices. The objective for this approach is to ensure not only lowcomplexity computations, but also high compressibility. We will discuss both existence results as well as explicit constructions.
Frame Theory: A Complete Introduction to Overcompleteness. Contents
"... Abstract. In this chapter we survey two topics that have recently been investigated in frame theory. First, we give an overview of the class of scalable frames. These are (finite) frames with the property that each frame vector can be rescaled in such a way that the resulting frames are tight. This ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. In this chapter we survey two topics that have recently been investigated in frame theory. First, we give an overview of the class of scalable frames. These are (finite) frames with the property that each frame vector can be rescaled in such a way that the resulting frames are tight. This process can be thought of as a preconditioning method for finite frames. In particular, we: (1) describe the class of scalable frames; (2) formulate various equivalent characterizations of scalable frames, and relate the scalability problem to the Fritz John ellipsoid theorem. Next, we discuss some results on a probabilistic interpretation of frames. In this setting, we: (4) define probabilistic frames as a generalization of frames and as a subclass of continuous frames; (5) review the properties of certain potential functions whose minimizers are frames with certain optimality properties. The chapter