Abstract:Compressed Sensing (CS) is a new signal acquisition technique that allows sampling of sparse signal using significantly fewer measurements than previously thought possible. On the other hand, a fusion frame is a new signal representation method that uses collections of subspaces instead of vectors to represent signals. This work combines these exciting new fields to introduce a new sparsity model for fusion frames. Signals that are sparse under the new model can be compressively sampled and uniquely reconstruc… Show more
“…The rich structure of the fusion frame framework allows us to characterize more complicated signal models than the standard sparse or compressible signals used in compressed sensing techniques. This paper complements and extends our work in [4].…”
supporting
confidence: 77%
“…, N . Definition 3.3: Let A ∈ R n×N and (W j ) N j=1 be a fusion frame for R M and A P as defined in (4). The fusion restricted isometry constant δ k is the smallest constant such that…”
Sparse representations have emerged as a powerful tool in signal and information processing, culminated by the success of new acquisition and processing techniques such as Compressed Sensing (CS). Fusion frames are very rich new signal representation methods that use collections of subspaces instead of vectors to represent signals. This work combines these exciting fields to introduce a new sparsity model for fusion frames. Signals that are sparse under the new model can be compressively sampled and uniquely reconstructed in ways similar to sparse signals using standard CS. The combination provides a promising new set of mathematical tools and signal models useful in a variety of applications. With the new model, a sparse signal has energy in very few of the subspaces of the fusion frame, although it does not need to be sparse within each of the subspaces it occupies. This sparsity model is captured using a mixed 1/ 2 norm for fusion frames.A signal sparse in a fusion frame can be sampled using very few random projections and exactly reconstructed using a convex optimization that minimizes this mixed 1/ 2 norm. The provided sampling conditions generalize coherence and RIP conditions used in standard CS theory. It is demonstrated that they are sufficient to guarantee sparse recovery of any signal sparse in our model. Moreover, a probabilistic analysis is provided using a stochastic model on the sparse signal that shows that under very mild conditions the probability of recovery failure decays exponentially with increasing dimension of the subspaces.
“…The rich structure of the fusion frame framework allows us to characterize more complicated signal models than the standard sparse or compressible signals used in compressed sensing techniques. This paper complements and extends our work in [4].…”
supporting
confidence: 77%
“…, N . Definition 3.3: Let A ∈ R n×N and (W j ) N j=1 be a fusion frame for R M and A P as defined in (4). The fusion restricted isometry constant δ k is the smallest constant such that…”
Sparse representations have emerged as a powerful tool in signal and information processing, culminated by the success of new acquisition and processing techniques such as Compressed Sensing (CS). Fusion frames are very rich new signal representation methods that use collections of subspaces instead of vectors to represent signals. This work combines these exciting fields to introduce a new sparsity model for fusion frames. Signals that are sparse under the new model can be compressively sampled and uniquely reconstructed in ways similar to sparse signals using standard CS. The combination provides a promising new set of mathematical tools and signal models useful in a variety of applications. With the new model, a sparse signal has energy in very few of the subspaces of the fusion frame, although it does not need to be sparse within each of the subspaces it occupies. This sparsity model is captured using a mixed 1/ 2 norm for fusion frames.A signal sparse in a fusion frame can be sampled using very few random projections and exactly reconstructed using a convex optimization that minimizes this mixed 1/ 2 norm. The provided sampling conditions generalize coherence and RIP conditions used in standard CS theory. It is demonstrated that they are sufficient to guarantee sparse recovery of any signal sparse in our model. Moreover, a probabilistic analysis is provided using a stochastic model on the sparse signal that shows that under very mild conditions the probability of recovery failure decays exponentially with increasing dimension of the subspaces.
“…Fusion frames were introduced in [9] (under the name frames of subspaces) and [10], and have quickly turned into an industry (see www.fusionframes.org). Recent developments include applications to sensor networks [12], filter bank fusion frames [13], applications to coding theory [1], compressed sensing [2], construction methods [3,4,7,6,5], sparsity for fusion frames [8], and frame potentials and fusion frames [18]. Until now, most of the work on fusion frames has centered on developing their basic properties and on constructing fusion frames with specific properties.…”
Fusion frames have become a major tool in the implementation of distributed systems. The effectiveness of fusion frame applications in distributed systems is reflected in the efficiency of the end fusion process. This in turn is reflected in the efficiency of the inversion of the fusion frame operator S W , which in turn is heavily dependent on the sparsity of S W . We will show that sparsity of the fusion frame operator naturally exists by introducing a notion of non-orthogonal fusion frames. We show that for a fusion frame {W i , v i } i∈I , if dim(W i ) = k i , then the matrix of the non-orthogonal fusion frame operator S W has in its corresponding location at most a k i × k i block matrix. We provide necessary and sufficient conditions for which the new fusion frame operator S W is diagonal and/or a multiple of an identity. A set of other critical questions are also addressed. A scheme of multiple fusion frames whose corresponding fusion frame operator becomes an diagonal operator is also examined.
“…This concept provides a useful framework in modeling sensor networks [19]. Different aspects and applications of fusion frame can be seen in [5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20].…”
In this paper we characterize √ 2-1-uniform J-Parseval fusion frames in a Krein space K. We provide a few results regarding construction of new J-tight fusion frame from given J-tight fusion frames. We also characterize any uniformly J-definite subspace of a Krein space K in terms of a J-fusion frame inequality. Finally we generalize the fundamental identity of frames in Krein space J-fusion frame setting.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.