HAHemant Kumar Aggarwal

Hemant Kumar Aggarwal

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Hemant Kumar Aggarwal has a total of 3 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Impulse Denoising From Hyper-Spectral Images: A Blind Compressed Sensing Approach

    by Angshul Majumdar, Naushad Ansari, Hemant Aggarwal, Pravesh Biyani

    In this work we propose a technique to remove sparse impulse noise from hyperspectral images. Our algorithm accounts for the spatial redundancy and spectral correlation of such images. The proposed method is based on the recently introduced Blind Compressed Sensing (BCS) framework, i.e. it empirically learns the spatial and spectral sparsifying dictionaries while denoising the images. The BCS framework differs from existing CS techniques - which assume the sparsifying dictionaries to be data independent, and from prior dictionary learning studies which learn the dictionary in an offline training phase. Our proposed formulation have shown over 5 dB improvement in PSNR over other techniques.

  • Open Access

    Extension of Sparse Randomized Kaczmarz Algorithm for Multiple Measurement Vectors

    by Hemant Kumar Aggarwal, Angshul Majumdar

    The Kaczmarz algorithm is popular for iteratively solving an overdetermined system of linear equations. The traditional Kaczmarz algorithm can approximate the solution in few sweeps through the equations but a randomized version of the Kaczmarz algorithm was shown to converge exponentially and independent of number of equations. Recently an algorithm for finding sparse solution to a linear system of equations has been proposed based on weighted randomized Kaczmarz algorithm. These algorithms solves single measurement vector problem; however there are applications were multiple-measurements are available. In this work, the objective is to solve a multiple measurement vector problem with common sparse support by modifying the randomized Kaczmarz algorithm. We have also modeled the problem of face recognition from video as the multiple measurement vector problem and solved using our proposed technique. We have compared the proposed algorithm with state-of-art spectral projected gradient algorithm for multiple measurement vectors on both real and synthetic datasets. The Monte Carlo simulations confirms that our proposed algorithm have better recovery and convergence rate than the MMV version of spectral projected gradient algorithm under fairness constraints.