Gayatri Parthasarathy
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Gayatri Parthasarathy has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
G. Abhilash
Electronics and Communication Engineering National Institute of Technology Calicut Calicut Kerala 673601 India
1 shared publication- G. Abhilash
Department of Electronics and Communication Engineering, National Institute of Technology Calicut, Kozhikode, India
1 shared publication - G. Abhilash
Electronics and Communication Engineering Department National Institute of Technology Calicut Calicut Kerala 673 601 India
1 shared publication
Latest Publications
- Open Access
- 1 September 2019
- Published by Institution of Engineering and Technology (IET) in IET Signal Processing
- Vol. 13 (7) , 650-660
Entropy‐based learning of sensing matrices
Compressive sensing deals with non‐uniform sampling of a signal, at an average rate much less than the Nyquist rate, and recovery of the signal uniquely from these reduced set of measurements. Construction of an efficient measurement (sensing) matrix to enable unique recovery is a topic of interest since compressive sensing came to existence. The sensing operator should be efficient to capture the vital information content of the signal into a reduced set of discrete measurements. This study proposes a learning method to construct an efficient sensing matrix, having orthogonal rows, for compressed sensing of a class of signals. The learning scheme identifies the sensing matrix by maximising the entropy of measurement vectors. The bounds on the entropy of the measurement vector necessary for the unique recovery of a signal are proposed. A comparison of the performance of the designed sensing matrix and the sensing matrices constructed using other existing methods is also presented. The simulation results on the recovery of synthetic, speech, and image signals, compressively sensed using the sensing matrix identified, show an improvement in the accuracy of recovery. The reconstruction quality is better, using less number of measurements than those measured using sensing matrices identified by other methods.
- 1 September 2019
- Published by Institution of Engineering and Technology (IET) in IET Signal Processing
- Vol. 13 (7) , 650-660
Open AccessEntropy‐based learning of sensing matrices
Compressive sensing deals with non‐uniform sampling of a signal, at an average rate much less than the Nyquist rate, and recovery of the signal uniquely from these reduced set of measurements. Construction of an efficient measurement (sensing) matrix to enable unique recovery is a topic of interest since compressive sensing came to existence. The sensing operator should be efficient to capture the vital information content of the signal into a reduced set of discrete measurements. This study proposes a learning method to construct an efficient sensing matrix, having orthogonal rows, for compressed sensing of a class of signals. The learning scheme identifies the sensing matrix by maximising the entropy of measurement vectors. The bounds on the entropy of the measurement vector necessary for the unique recovery of a signal are proposed. A comparison of the performance of the designed sensing matrix and the sensing matrices constructed using other existing methods is also presented. The simulation results on the recovery of synthetic, speech, and image signals, compressively sensed using the sensing matrix identified, show an improvement in the accuracy of recovery. The reconstruction quality is better, using less number of measurements than those measured using sensing matrices identified by other methods.
- Open Access
Entropy-Based Learning of Sensing Matrices
This paper proposes a learning method to construct an efficient sensing (measurement) matrix, having orthogonal rows, for compressed sensing of a class of signals. The learning scheme identifies the sensing matrix by maximizing the entropy of measurement vectors. The bounds on the entropy of the measurement vector necessary for the unique recovery of a signal are also proposed. A comparison of the performance of the designed sensing matrix and the sensing matrices constructed using other existing methods is also presented. The simulation results on the recovery of synthetic, speech, and image signals, compressively sensed using the sensing matrix identified, shows an improvement in the accuracy of recovery. The reconstruction quality is better, using less number of measurements, than those measured using sensing matrices identified by other methods.
Open AccessEntropy-Based Learning of Sensing Matrices
This paper proposes a learning method to construct an efficient sensing (measurement) matrix, having orthogonal rows, for compressed sensing of a class of signals. The learning scheme identifies the sensing matrix by maximizing the entropy of measurement vectors. The bounds on the entropy of the measurement vector necessary for the unique recovery of a signal are also proposed. A comparison of the performance of the designed sensing matrix and the sensing matrices constructed using other existing methods is also presented. The simulation results on the recovery of synthetic, speech, and image signals, compressively sensed using the sensing matrix identified, shows an improvement in the accuracy of recovery. The reconstruction quality is better, using less number of measurements, than those measured using sensing matrices identified by other methods.
- Open Access
- 1 June 2018
- Published by Institution of Engineering and Technology (IET) in IET Signal Processing
- Vol. 12 (4) , 439-446
Entropy‐based transform learning algorithms
This study proposes transform learning (TL) methods to construct a sparsifying basis for a class of signals by minimising the entropy of representation of the signal class. Simulation studies using synthetic, speech, and image signals confirm that the basis constructed using the proposed methods result in an improved sparsity of the signals compared to most of the existing TL algorithms.
- 1 June 2018
- Published by Institution of Engineering and Technology (IET) in IET Signal Processing
- Vol. 12 (4) , 439-446
Open AccessEntropy‐based transform learning algorithms
This study proposes transform learning (TL) methods to construct a sparsifying basis for a class of signals by minimising the entropy of representation of the signal class. Simulation studies using synthetic, speech, and image signals confirm that the basis constructed using the proposed methods result in an improved sparsity of the signals compared to most of the existing TL algorithms.