Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Shristi Rajbamshi

dblp:253/6261 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Information theory · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information theory › signal processing
compressed sensing
1.012026
Frame Multipliers and Compressive Sensing · IEEE Trans. Inf. Theory 2026
Information theory › signal processing › compressed sensing
measurement matrix design
1.012026
Frame Multipliers and Compressive Sensing · IEEE Trans. Inf. Theory 2026
Information theory › signal processing › signal representation
frame theory
0.312026
Frame Multipliers and Compressive Sensing · IEEE Trans. Inf. Theory 2026

Methods — techniques the papers use, named apart from their topics

probabilistic nullspace property · 1.0gabor frame · 1.0
YearPublicationVenuePosition
2026 Frame Multipliers and Compressive Sensing
abstract
We investigate the applicability of frame multipliers as compressive sensing measurements. We show that, under certain conditions, subsampled frame multipliers yield measurement matrices with desirable properties. To that end, we prove a general probabilistic nullspace property for arbitrary nonempty sets, that accounts for the special measurement structure induced by subsampled frame multipliers. Conditions for uniqueness of reconstruction of signals that are sparse with respect to dictionaries or, more generally, to non-linear locally Lipschitz mappings are obtained as special cases. Furthermore, we show that a frame multiplier matrix is full superregular, i.e., that all its minors are nonzero, for almost all frame symbol vectors, provided that the underlying frames are full spark and sufficiently redundant. Since Gabor frames are full spark for almost all windows, we study Gabor multipliers in more detail and are able to derive improved constants for some scenarios. Finally, our simulation results reveal that, in many instances, subsampled frame multiplier matrices exhibit the same ℓ1-reconstruction performance as i.i.d. Gaussian measurement matrices.
Georg Tauböck, Shristi Rajbamshi
IEEE Trans. Inf. Theory2