1 citations · 2 across the 4 of their papers we have counts for
5 papers
Sparse recovery guarantees for block orthogonal binary matrices constructed via Generalized Euler Squares
Pradip Sasmal, Phanindra Jampana, C. S. Sastry
In recent times, the construction of deterministic matrices has gained popularity as an alternative of random matrices as they provide guarantees for recovery of sparse signals. In…
Construction of Structured Incoherent Unit Norm Tight Frames
Pradip Sasmal, Phanindra Jampana, C. S. Sastry
The exact recovery property of Basis pursuit (BP) and Orthogonal Matching Pursuit (OMP) has a relation with the coherence of the underlying frame. A frame with low coherence provid…
Analysis of the Self Projected Matching Pursuit Algorithm
Laura Rebollo-Neira, Miroslav Rozloznik, Pradip Sasmal
The convergence and numerical analysis of a low memory implementation of the Orthogonal Matching Pursuit greedy strategy, which is termed Self Projected Matching Pursuit, is presen…
Nullspace Property for Optimality of Minimum Frame Angle Under Invertible Linear Operators
Pradip Sasmal, Prasad Theeda, Phanindra Jampana +1
Orthogonal Matching Pursuit and Basis Pursuit are popular reconstruction algorithms for recovery of sparse signals. The exact recovery property of both the methods has a relation w…
Deterministic construction of sparse binary and ternary matrices from existing binary sensing matrices
Pradip Sasmal, R. Ramu Naidu, C. S. Sastry +1
In the present work, we discuss a procedure for constructing sparse binary and ternary matrices from existing two binary sensing matrices. The matrices that we construct have sever…