Rajiv Verma
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Rajiv Verma has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Rajoo Pandey
Electronics and Communication Engineering, National Institute of Technology, Kurukshetra, India
4 shared publications Rajoo Pandey
Department of Electronics and Communication Engineering, National Institute of Technology Kurukshetra, Haryana 136119, India
3 shared publications- Niraj Pratap Singh
National Institute of Technology Kurukshetra
1 shared publication
Latest Publications
- 9 January 2020
- Published by World Scientific Pub Co Pte Ltd in International Journal of Wavelets, Multiresolution and Information Processing
- Vol. 18 (03)
Characterization of local regions for wavelet-based image denoising using a statistical approach
The shape of local window plays a vital role in the estimation of original signal variance, which is used to shrink the noisy wavelet coefficients in wavelet-based image denoising algorithms. This paper presents an anisotropic-shaped region-based Wiener filtering (ASRWF) and BayesShrink (ASRBS) algorithms, which exploit the region characteristics to estimate the original signal variance using a statistical approach. The proposed approach divides the region centered on a noisy wavelet coefficient into various non-overlapping subregions. The Euclidean distance-based measure is considered to obtain the similarities between reference subregion and adjacent subregions. An appropriate threshold value is estimated by applying a statistical approach on these distances and the sets of similar and dissimilar subregions are obtained from a defined region. Thus, an anisotropic-shaped region is obtained by neglecting the dissimilar subregions in a defined region. The variance of every similar subregion is calculated and then averaged to estimate the original signal variance to shrink noisy wavelet coefficients effectively. Finally, the estimated signal variance is utilized in Wiener filtering and BayesShrink algorithms to improve the denoising performance. The performance of the proposed algorithms is analyzed qualitatively and quantitatively on standard images for different noise levels.
- 9 January 2020
- Published by World Scientific Pub Co Pte Ltd in International Journal of Wavelets, Multiresolution and Information Processing
- Vol. 18 (03)
Characterization of local regions for wavelet-based image denoising using a statistical approach
The shape of local window plays a vital role in the estimation of original signal variance, which is used to shrink the noisy wavelet coefficients in wavelet-based image denoising algorithms. This paper presents an anisotropic-shaped region-based Wiener filtering (ASRWF) and BayesShrink (ASRBS) algorithms, which exploit the region characteristics to estimate the original signal variance using a statistical approach. The proposed approach divides the region centered on a noisy wavelet coefficient into various non-overlapping subregions. The Euclidean distance-based measure is considered to obtain the similarities between reference subregion and adjacent subregions. An appropriate threshold value is estimated by applying a statistical approach on these distances and the sets of similar and dissimilar subregions are obtained from a defined region. Thus, an anisotropic-shaped region is obtained by neglecting the dissimilar subregions in a defined region. The variance of every similar subregion is calculated and then averaged to estimate the original signal variance to shrink noisy wavelet coefficients effectively. Finally, the estimated signal variance is utilized in Wiener filtering and BayesShrink algorithms to improve the denoising performance. The performance of the proposed algorithms is analyzed qualitatively and quantitatively on standard images for different noise levels.
- Open Access
- 28 September 2018
- Published by The Scientific and Technological Research Council of Turkey (TUBITAK-ULAKBIM) - DIGITAL COMMONS JOURNALS in Turkish Journal of Electrical Engineering and Computer Sciences
- Vol. 26 (5) , 2178-2193
Region characteristics-based fusion of spatial and transform domain image denoising methods
- 28 September 2018
- Published by The Scientific and Technological Research Council of Turkey (TUBITAK-ULAKBIM) - DIGITAL COMMONS JOURNALS in Turkish Journal of Electrical Engineering and Computer Sciences
- Vol. 26 (5) , 2178-2193
Open AccessRegion characteristics-based fusion of spatial and transform domain image denoising methods
- 2 March 2018
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 77 (19) , 25919-25940
Grey relational analysis based adaptive smoothing parameter for non-local means image denoising
- 2 March 2018
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 77 (19) , 25919-25940
Grey relational analysis based adaptive smoothing parameter for non-local means image denoising
- 29 December 2016
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 77 (1) , 549-566
A statistical approach to adaptive search region selection for NLM-based image denoising algorithm
- 29 December 2016
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 77 (1) , 549-566
A statistical approach to adaptive search region selection for NLM-based image denoising algorithm
- 1 December 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Non local means algorithm with adaptive isotropic search window size for image denoising
The selection of search window size is a critical issue in Non-local means (NLM) algorithm. The selection of small search window size for a pixel lying in smooth or homogeneous region limits the denoising effect due to contribution of only a small number of related pixels, whereas the selection of large search window size for a pixel lying in non-smooth or transition region degrades the denoising quality due to contribution of more and more unrelated pixels. The proposed algorithm selects the optimal search window size for each pixel, based on the gray level difference which indicates the characteristics of the region. Experimental results on standard images show that the proposed algorithm outperforms the conventional NLM algorithm in terms of PSNR and visual quality. It also preserves the image details such as edges and texture in an image at higher noise level.
- 1 December 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Non local means algorithm with adaptive isotropic search window size for image denoising
The selection of search window size is a critical issue in Non-local means (NLM) algorithm. The selection of small search window size for a pixel lying in smooth or homogeneous region limits the denoising effect due to contribution of only a small number of related pixels, whereas the selection of large search window size for a pixel lying in non-smooth or transition region degrades the denoising quality due to contribution of more and more unrelated pixels. The proposed algorithm selects the optimal search window size for each pixel, based on the gray level difference which indicates the characteristics of the region. Experimental results on standard images show that the proposed algorithm outperforms the conventional NLM algorithm in terms of PSNR and visual quality. It also preserves the image details such as edges and texture in an image at higher noise level.
- 1 October 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 312-315
An adaptive isotropic search window based NLM algorithm for image denoising
The non-local means (NLM) algorithm uses the self-similarity or repeated patterns present in images for denoising. NLM algorithm has been extensively researched due to its effectiveness and simplicity. In conventional NLM algorithm, the size of the search window is kept fixed for each pixel. Ideally, the search window size must optimally vary from region to region based on the characteristics of the search region. In this paper, we propose an adaptive NLM algorithm based on classification of homogeneous and heterogeneous regions using local entropy. The proposed algorithm selects an optimal search window size for each pixel based on region characteristics. The experimental results have shown that the proposed algorithm performs consistently better than the conventional NLM in terms of PSNR and visual quality for denoising the images at various noise levels.
- 1 October 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 312-315
An adaptive isotropic search window based NLM algorithm for image denoising
The non-local means (NLM) algorithm uses the self-similarity or repeated patterns present in images for denoising. NLM algorithm has been extensively researched due to its effectiveness and simplicity. In conventional NLM algorithm, the size of the search window is kept fixed for each pixel. Ideally, the search window size must optimally vary from region to region based on the characteristics of the search region. In this paper, we propose an adaptive NLM algorithm based on classification of homogeneous and heterogeneous regions using local entropy. The proposed algorithm selects an optimal search window size for each pixel based on region characteristics. The experimental results have shown that the proposed algorithm performs consistently better than the conventional NLM in terms of PSNR and visual quality for denoising the images at various noise levels.
- 7 March 2013
- Published by Springer Nature in Wireless Personal Communications
- Vol. 72 (2) , 1437-1452
GRA Based Network Selection in Heterogeneous Wireless Networks
- 7 March 2013
- Published by Springer Nature in Wireless Personal Communications
- Vol. 72 (2) , 1437-1452
GRA Based Network Selection in Heterogeneous Wireless Networks