NANaushad Ansari

Naushad Ansari

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Naushad Ansari has a total of 7 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

    M-RWTL: Learning Signal-Matched Rational Wavelet Transform in Lifting Framework

    by Naushad Ansari, Anubha Gupta

    Transform learning is being extensively applied in several applications because of its ability to adapt to a class of signals of interest. Often, a transform is learned using a large amount of training data, while only limited data may be available in many applications. Motivated with this, we propose wavelet transform learning in the lifting framework for a given signal. significant contributions of this work are: 1) the existing theory of lifting framework for the dyadic wavelet is extended to more generic rational wavelet design, where dyadic is a special case and 2) the proposed work allows to learn rational wavelet transform from a given signal and does not require large training data. Since it is a signal-matched design, the proposed methodology is called Signal-Matched Rational Wavelet Transform Learning in the Lifting Framework (M-RWTL). The proposed M-RWTL method inherits all the advantages of lifting, i.e., the learned rational wavelet transform is always invertible, method is modular, and the corresponding M-RWTL system can also incorporate non-linear filters, if required. This may enhance the use of RWT in applications which is so far restricted. M-RWTL is observed to perform better compared to standard wavelet transforms in the applications of compressed sensing based signal reconstruction.


  • Open Access

    M-RWTL: Learning Signal-Matched Rational Wavelet Transform in Lifting Framework

    by Naushad Ansari, Anubha Gupta

    Transform learning is being extensively applied in several applications because of its ability to adapt to a class of signals of interest. Often, a transform is learned using a large amount of training data, while only limited data may be available in many applications. Motivated with this, we propose wavelet transform learning in the lifting framework for a given signal. Significant contributions of this work are: 1) the existing theory of lifting framework of the dyadic wavelet is extended to more generic rational wavelet design, where dyadic is a special case and 2) the proposed work allows to learn rational wavelet transform from a given signal and does not require large training data. Since it is a signal-matched design, the proposed methodology is called Signal-Matched Rational Wavelet Transform Learning in the Lifting Framework (M-RWTL). The proposed M-RWTL method inherits all the advantages of lifting, i.e., the learned rational wavelet transform is always invertible, method is modular, and the corresponding M-RWTL system can also incorporate nonlinear filters, if required. This may enhance the use of RWT in applications which is so far restricted. M-RWTL is observed to perform better compared to standard wavelet transforms in the applications of compressed sensing based signal reconstruction.

  • Image Reconstruction Using Matched Wavelet Estimated From Data Sensed Compressively Using Partial Canonical Identity Matrix

    by Naushad Ansari, Anubha Gupta

    This paper proposes a joint framework wherein lifting-based, separable, image-matched wavelets are estimated from compressively sensed images and are used for the reconstruction of the same. Matched wavelet can be easily designed if full image is available. Also compared with the standard wavelets as sparsifying bases, matched wavelet may provide better reconstruction results in compressive sensing (CS) application. Since in CS application, we have compressively sensed images instead of full images, existing methods of designing matched wavelets cannot be used. Thus, we propose a joint framework that estimates matched wavelets from compressively sensed images and also reconstructs full images. This paper has three significant contributions. First, a lifting-based, image-matched separable wavelet is designed from compressively sensed images and is also used to reconstruct the same. Second, a simple sensing matrix is employed to sample data at sub-Nyquist rate such that sensing and reconstruction time is reduced considerably. Third, a new multi-level L-Pyramid wavelet decomposition strategy is provided for separable wavelet implementation on images that leads to improved reconstruction performance. Compared with the CS-based reconstruction using standard wavelets with Gaussian sensing matrix and with existing wavelet decomposition strategy, the proposed methodology provides faster and better image reconstruction in CS application.


  • Open Access

    Image Reconstruction using Matched Wavelet Estimated from Data Sensed Compressively using Partial Canonical Identity Matrix

    by Naushad Ansari, Anubha Gupta

    This paper proposes a joint framework wherein lifting-based, separable, image-matched wavelets are estimated from compressively sensed (CS) images and used for the reconstruction of the same. Matched wavelet can be easily designed if full image is available. Also matched wavelet may provide better reconstruction results in CS application compared to standard wavelet sparsifying basis. Since in CS application, we have compressively sensed image instead of full image, existing methods of designing matched wavelet cannot be used. Thus, we propose a joint framework that estimates matched wavelet from the compressively sensed images and also reconstructs full images. This paper has three significant contributions. First, lifting-based, image-matched separable wavelet is designed from compressively sensed images and is also used to reconstruct the same. Second, a simple sensing matrix is employed to sample data at sub-Nyquist rate such that sensing and reconstruction time is reduced considerably without any noticeable degradation in the reconstruction performance. Third, a new multi-level L-Pyramid wavelet decomposition strategy is provided for separable wavelet implementation on images that leads to improved reconstruction performance. Compared to CS-based reconstruction using standard wavelets with Gaussian sensing matrix and with existing wavelet decomposition strategy, the proposed methodology provides faster and better image reconstruction in compressive sensing application.

  • Shallow water acoustic channel estimation using two-dimensional frequency characterization

    by Naushad Ansari, Anubha Gupta, Ananya Sen Gupta

    Shallow water acoustic channel estimation techniques are presented at the intersection of time, frequency, and sparsity. Specifically, a mathematical framework is introduced that translates the problem of channel estimation to non-uniform sparse channel recovery in two-dimensional frequency domain. This representation facilitates disambiguation of slowly varying channel components against high-energy transients, which occupy different frequency ranges and also exhibit significantly different sparsity along their local distribution. This useful feature is exploited to perform non-uniform sampling across different frequency ranges, with compressive sampling across higher Doppler frequencies and close to full-rate sampling at lower Doppler frequencies, to recover both slowly varying and rapidly fluctuating channel components at high precision. Extensive numerical experiments are performed to measure relative performance of the proposed channel estimation technique using non-uniform compressive sampling against traditional compressive sampling techniques as well as sparsity-constrained least squares across a range of observation window lengths, ambient noise levels, and sampling ratios. Numerical experiments are based on channel estimates from the SPACE08 experiment as well as on a recently developed channel simulator tested against several field trials.


  • Tracking the underwater acoustic channel using two-dimensional frequency sampling

    by Ananya Sen Gupta, Naushad Ansari, Anubha Gupta

    Rapidly fluctuating multipath arrivals along with unpredictable surface wave focusing events render the shallow water acoustic channel difficult to track using sparse or least-squared error (LSE) optimization techniques. This fundamental bottleneck is primarily due to the time-varying nature of the underlying distribution. In this work, we propose a complementary channel tracking technique that exploits the dual representation of the acoustic channel in the Fourier domain and employs two-dimensional frequency sampling using an application-inspired input dictionary. Specifically, we reformulate the time-varying channel tracking problem on a MIMO framework and design training symbols that sample the channel in its dual Fourier domain. Ground truths based on experimental field data are presented.