This paper presents a new description of the completion of a quasi-uniform frame. The completion is used to extend the notion of the Samuel compactification to quasi-uniform frames.

This paper considers totally bounded quasi-uniformities and quasi-proximities for frames and shows that for a given quasi-proximity ⊳ on a frame L there is a totally bounded quasi-uniformity on L that is the coarsest quasi-uniformity, and the only totally bounded quasi-uniformity, that determines ⊳. The constructions due to B. Banaschewski and A. Pultr of the Cauchy spectrum ψL and the compacti...

Using their unitary extension principle, Ron and Shen have constructed a normalized tight frame for L2(R) consisting of spline functions with uniform knots. This paper constructs a normalized tight frame for L2((0,∞)) comprising spline functions with knots on a hybrid of uniform and geometric mesh. The construction is motivated by applications in adaptive approximation using spline functions on...

We consider the problem of recovering fusion frame sparse signals from incomplete measurements. These signals are composed of a small number of nonzero blocks taken from a family of subspaces. First, we show that, by using a-priori knowledge of a coherence parameter associated with the angles between the subspaces, one can uniformly recover fusion frame sparse signals with a significantly reduc...

Two-uniform frames and their use for the coding of vectors are the main subject of this paper. These frames are known to be optimal for handling up to two erasures, in the sense that they minimize the largest possible error when up to two frame coefficients are set to zero. Here, we consider various numerical measures for the reconstruction error associated with a frame when an arbitrary number...

Two-uniform frames and their use for the coding of vectors are the main subject of this paper. These frames are known to be optimal for handling up to two erasures, in the sense that they minimize the largest possible error when up to two frame coefficients are set to zero. Here, we consider various numerical measures for the reconstruction error associated with a frame when an arbitrary number...

Two-uniform frames and their use for the coding of vectors are the main subject of this paper. These frames are known to be optimal for handling up to two erasures, in the sense that they minimize the largest possible error when up to two frame coefficients are set to zero. Here, we consider various numerical measures for the reconstruction error associated with a frame when an arbitrary number...

Two-uniform frames and their use for the coding of vectors are the main subject of this paper. These frames are known to be optimal for handling up to two erasures, in the sense that they minimize the largest possible error when up to two frame coefficients are set to zero. Here, we consider various numerical measures for the reconstruction error associated with a frame when an arbitrary number...