Sreejith Kallummil
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Sreejith Kallummil has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Sheetal Kalyani
Department of Electrical Engineering, Indian Institute of Technology Madras, Chennai, India
9 shared publications - Sheetal Kalyani1 shared publication
Latest Publications
- 5 March 2022
- Published by Elsevier in Signal Processing
- Vol. 197, 108531
Generalized residual ratio thresholding
- 5 March 2022
- Published by Elsevier in Signal Processing
- Vol. 197, 108531
Generalized residual ratio thresholding
- Open Access
Generalized Residual Ratio Thresholding
Simultaneous orthogonal matching pursuit (SOMP) and block OMP (BOMP) are two widely used techniques for sparse support recovery in multiple measurement vector (MMV) and block sparse (BS) models respectively. For optimal performance, both SOMP and BOMP require \textit{a priori} knowledge of signal sparsity or noise variance. However, sparsity and noise variance are unavailable in most practical applications. This letter presents a novel technique called generalized residual ratio thresholding (GRRT) for operating SOMP and BOMP without the \textit{a priori} knowledge of signal sparsity and noise variance and derive finite sample and finite signal to noise ratio (SNR) guarantees for exact support recovery. Numerical simulations indicate that GRRT performs similar to BOMP and SOMP with \textit{a priori} knowledge of signal and noise statistics.
Open AccessGeneralized Residual Ratio Thresholding
Simultaneous orthogonal matching pursuit (SOMP) and block OMP (BOMP) are two widely used techniques for sparse support recovery in multiple measurement vector (MMV) and block sparse (BS) models respectively. For optimal performance, both SOMP and BOMP require \textit{a priori} knowledge of signal sparsity or noise variance. However, sparsity and noise variance are unavailable in most practical applications. This letter presents a novel technique called generalized residual ratio thresholding (GRRT) for operating SOMP and BOMP without the \textit{a priori} knowledge of signal sparsity and noise variance and derive finite sample and finite signal to noise ratio (SNR) guarantees for exact support recovery. Numerical simulations indicate that GRRT performs similar to BOMP and SOMP with \textit{a priori} knowledge of signal and noise statistics.
- Open Access
- 12 October 2019
- Published by Elsevier in Signal Processing
- Vol. 168, 107335
High SNR consistent compressive sensing without signal and noise statistics
- 12 October 2019
- Published by Elsevier in Signal Processing
- Vol. 168, 107335
Open AccessHigh SNR consistent compressive sensing without signal and noise statistics
- 12 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 67 (4) , 838-853
Residual Ratio Thresholding for Linear Model Order Selection
- 12 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 67 (4) , 838-853
Residual Ratio Thresholding for Linear Model Order Selection
- 23 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 67 (2) , 383-398
Noise Statistics Oblivious GARD For Robust Regression With Sparse Outliers
Linear regression models contaminated by Gaussian noise (inlier) and possibly unbounded sparse outliers are common in many signal processing applications. Sparse recovery inspired robust regression (SRIRR) techniques are shown to deliver high-quality estimation performance in such regression models. Unfortunately, most SRIRR techniques assume a priori knowledge of noise statistics like inlier noise variance or outlier statistics like number of outliers. Both inlier and outlier noise statistics are rarely known a priori, and this limits the efficient operation of many SRIRR algorithms. This paper proposes a novel noise statistics oblivious algorithm called residual ratio thresholding GARD (RRT-GARD) for robust regression in the presence of sparse outliers. RRT-GARD is developed by modifying the recently proposed noise statistics dependent greedy algorithm for robust denoising (GARD). Both finite sample and asymptotic analytical results indicate that RRT-GARD performs nearly similar to GARD with a priori knowledge of noise statistics. Numerical simulations in real and synthetic data sets also point to the highly competitive performance of RRT-GARD.
- 23 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 67 (2) , 383-398
Noise Statistics Oblivious GARD For Robust Regression With Sparse Outliers
Linear regression models contaminated by Gaussian noise (inlier) and possibly unbounded sparse outliers are common in many signal processing applications. Sparse recovery inspired robust regression (SRIRR) techniques are shown to deliver high-quality estimation performance in such regression models. Unfortunately, most SRIRR techniques assume a priori knowledge of noise statistics like inlier noise variance or outlier statistics like number of outliers. Both inlier and outlier noise statistics are rarely known a priori, and this limits the efficient operation of many SRIRR algorithms. This paper proposes a novel noise statistics oblivious algorithm called residual ratio thresholding GARD (RRT-GARD) for robust regression in the presence of sparse outliers. RRT-GARD is developed by modifying the recently proposed noise statistics dependent greedy algorithm for robust denoising (GARD). Both finite sample and asymptotic analytical results indicate that RRT-GARD performs nearly similar to GARD with a priori knowledge of noise statistics. Numerical simulations in real and synthetic data sets also point to the highly competitive performance of RRT-GARD.
- Open Access
High SNR Consistent Compressive Sensing Without Signal and Noise Statistics
Recovering the support of sparse vectors in underdetermined linear regression models, \textit{aka}, compressive sensing is important in many signal processing applications. High SNR consistency (HSC), i.e., the ability of a support recovery technique to correctly identify the support with increasing signal to noise ratio (SNR) is an increasingly popular criterion to qualify the high SNR optimality of support recovery techniques. The HSC results available in literature for support recovery techniques applicable to underdetermined linear regression models like least absolute shrinkage and selection operator (LASSO), orthogonal matching pursuit (OMP) etc. assume \textit{a priori} knowledge of noise variance or signal sparsity. However, both these parameters are unavailable in most practical applications. Further, it is extremely difficult to estimate noise variance or signal sparsity in underdetermined regression models. This limits the utility of existing HSC results. In this article, we propose two techniques, \textit{viz.}, residual ratio minimization (RRM) and residual ratio thresholding with adaptation (RRTA) to operate OMP algorithm without the \textit{a priroi} knowledge of noise variance and signal sparsity and establish their HSC analytically and numerically. To the best of our knowledge, these are the first and only noise statistics oblivious algorithms to report HSC in underdetermined regression models.
Open AccessHigh SNR Consistent Compressive Sensing Without Signal and Noise Statistics
Recovering the support of sparse vectors in underdetermined linear regression models, \textit{aka}, compressive sensing is important in many signal processing applications. High SNR consistency (HSC), i.e., the ability of a support recovery technique to correctly identify the support with increasing signal to noise ratio (SNR) is an increasingly popular criterion to qualify the high SNR optimality of support recovery techniques. The HSC results available in literature for support recovery techniques applicable to underdetermined linear regression models like least absolute shrinkage and selection operator (LASSO), orthogonal matching pursuit (OMP) etc. assume \textit{a priori} knowledge of noise variance or signal sparsity. However, both these parameters are unavailable in most practical applications. Further, it is extremely difficult to estimate noise variance or signal sparsity in underdetermined regression models. This limits the utility of existing HSC results. In this article, we propose two techniques, \textit{viz.}, residual ratio minimization (RRM) and residual ratio thresholding with adaptation (RRTA) to operate OMP algorithm without the \textit{a priroi} knowledge of noise variance and signal sparsity and establish their HSC analytically and numerically. To the best of our knowledge, these are the first and only noise statistics oblivious algorithms to report HSC in underdetermined regression models.
- Open Access
Signal and Noise Statistics Oblivious Orthogonal Matching Pursuit
Orthogonal matching pursuit (OMP) is a widely used algorithm for recovering sparse high dimensional vectors in linear regression models. The optimal performance of OMP requires \textit{a priori} knowledge of either the sparsity of regression vector or noise statistics. Both these statistics are rarely known \textit{a priori} and are very difficult to estimate. In this paper, we present a novel technique called residual ratio thresholding (RRT) to operate OMP without any \textit{a priori} knowledge of sparsity and noise statistics and establish finite sample and large sample support recovery guarantees for the same. Both analytical results and numerical simulations in real and synthetic data sets indicate that RRT has a performance comparable to OMP with \textit{a priori} knowledge of sparsity and noise statistics.
Open AccessSignal and Noise Statistics Oblivious Orthogonal Matching Pursuit
Orthogonal matching pursuit (OMP) is a widely used algorithm for recovering sparse high dimensional vectors in linear regression models. The optimal performance of OMP requires \textit{a priori} knowledge of either the sparsity of regression vector or noise statistics. Both these statistics are rarely known \textit{a priori} and are very difficult to estimate. In this paper, we present a novel technique called residual ratio thresholding (RRT) to operate OMP without any \textit{a priori} knowledge of sparsity and noise statistics and establish finite sample and large sample support recovery guarantees for the same. Both analytical results and numerical simulations in real and synthetic data sets indicate that RRT has a performance comparable to OMP with \textit{a priori} knowledge of sparsity and noise statistics.
- 1 May 2018
- Published by Elsevier in Signal Processing
- Vol. 146, 1-14
High SNR consistent compressive sensing
- 1 May 2018
- Published by Elsevier in Signal Processing
- Vol. 146, 1-14
High SNR consistent compressive sensing
- 5 November 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 5 (1) , 72-75
Combining ML and Compressive Sensing: Detection Schemes for Generalized Space Shift Keying
Generalized space shift keying (GSSK) proposed for large scale MIMO systems promises significant advantages in terms of hardware costs. However, the maximum likelihood (ML) detection for GSSK is computationally intractable. Detection schemes using compressive sensing (CS) offer a favorable performance-complexity tradeoff. In this letter, we propose a novel GSSK detection framework, where CS algorithms are used to reduce the complexity of ML detection. The proposed framework significantly reduces the performance gap between existing CS-based detection schemes and ML detection while retaining the complexity advantage of CS algorithms. Simulation results demonstrate the superiority of proposed scheme over popular CS-based detection schemes.
- 5 November 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 5 (1) , 72-75
Combining ML and Compressive Sensing: Detection Schemes for Generalized Space Shift Keying
Generalized space shift keying (GSSK) proposed for large scale MIMO systems promises significant advantages in terms of hardware costs. However, the maximum likelihood (ML) detection for GSSK is computationally intractable. Detection schemes using compressive sensing (CS) offer a favorable performance-complexity tradeoff. In this letter, we propose a novel GSSK detection framework, where CS algorithms are used to reduce the complexity of ML detection. The proposed framework significantly reduces the performance gap between existing CS-based detection schemes and ML detection while retaining the complexity advantage of CS algorithms. Simulation results demonstrate the superiority of proposed scheme over popular CS-based detection schemes.
- 23 June 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 22 (11) , 1940-1944
High SNR Consistent Thresholding for Variable Selection
This work states and proves necessary and sufficient condition for a threshold based estimate of set of active regression coefficients to be high SNR consistent. It is further shown that popular thresholding schemes like universal threshold, Bonferroni correction etc fails to meet the necessary condition and hence are inconsistent at high SNR. The sufficient conditions provides a very rich class of threshold based estimators with varying rate of convergence to consistency. Simulation results demonstrates the superior performance of the proposed threshold based estimator over Lasso, Dantzig selector and Orthogonal Matching Pursuit.
- 23 June 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 22 (11) , 1940-1944
High SNR Consistent Thresholding for Variable Selection
This work states and proves necessary and sufficient condition for a threshold based estimate of set of active regression coefficients to be high SNR consistent. It is further shown that popular thresholding schemes like universal threshold, Bonferroni correction etc fails to meet the necessary condition and hence are inconsistent at high SNR. The sufficient conditions provides a very rich class of threshold based estimators with varying rate of convergence to consistency. Simulation results demonstrates the superior performance of the proposed threshold based estimator over Lasso, Dantzig selector and Orthogonal Matching Pursuit.