Rakib Hyder
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
Rakib Hyder has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Muhammad Salman Asif
UC Riverside
8 shared publications Sayeed Shafayet Chowdhury
4 shared publications- Zikui Cai
University of California Riverside
3 shared publications - Ashley Prater-Bennette
Air Force Research Laboratory, Rome, USA
2 shared publications - Jubayer Mahmod
Virginia Tech, Blacksburg, VA, USA
2 shared publications Shaikh Anowarul Fattah
Department of Electrical and Electronic Engineering, Bangladesh University of Engineering and Technology
2 shared publications
Latest Publications
- Open Access
- 22 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Signal Processing
- Vol. 6, 1077-1085
Parameter-Efficient Multi-Task and Multi-Domain Learning Using Factorized Tensor Networks
Multi-task and multi-domain learning methods seek to learn multiple tasks/domains, jointly or one after another, using a single unified network. The primary challenge and opportunity lie in leveraging shared information across these tasks and domains to enhance the efficiency of the unified network. The efficiency can be in terms of accuracy, storage cost, computation, or sample complexity. In this paper, we introduce a factorized tensor network (FTN) designed to achieve accuracy comparable to that of independent single-task or single-domain networks, while introducing a minimal number of additional parameters. The FTN approach entails incorporating task- or domain-specific low-rank tensor factors into a shared frozen network derived from a source model. This strategy allows for adaptation to numerous target domains and tasks without encountering catastrophic forgetting. Furthermore, FTN requires a significantly smaller number of task-specific parameters compared to existing methods. We performed experiments on widely used multi-domain and multi-task datasets. We show the experiments on convolutional-based architecture with different backbones and on transformer-based architecture. Our findings indicate that FTN attains similar accuracy as single-task or single-domain methods while using only a fraction of additional parameters per task.
- 22 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Signal Processing
- Vol. 6, 1077-1085
Open AccessParameter-Efficient Multi-Task and Multi-Domain Learning Using Factorized Tensor Networks
Multi-task and multi-domain learning methods seek to learn multiple tasks/domains, jointly or one after another, using a single unified network. The primary challenge and opportunity lie in leveraging shared information across these tasks and domains to enhance the efficiency of the unified network. The efficiency can be in terms of accuracy, storage cost, computation, or sample complexity. In this paper, we introduce a factorized tensor network (FTN) designed to achieve accuracy comparable to that of independent single-task or single-domain networks, while introducing a minimal number of additional parameters. The FTN approach entails incorporating task- or domain-specific low-rank tensor factors into a shared frozen network derived from a source model. This strategy allows for adaptation to numerous target domains and tasks without encountering catastrophic forgetting. Furthermore, FTN requires a significantly smaller number of task-specific parameters compared to existing methods. We performed experiments on widely used multi-domain and multi-task datasets. We show the experiments on convolutional-based architecture with different backbones and on transformer-based architecture. Our findings indicate that FTN attains similar accuracy as single-task or single-domain methods while using only a fraction of additional parameters per task.
- Open Access
Learning to Sense for Coded Diffraction Imaging
In this paper, we present a framework to learn illumination patterns to improve the quality of signal recovery for coded diffraction imaging. We use an alternating minimization-based phase retrieval method with a fixed number of iterations as the iterative method. We represent the iterative phase retrieval method as an unrolled network with a fixed number of layers where each layer of the network corresponds to a single step of iteration, and we minimize the recovery error by optimizing over the illumination patterns. Since the number of iterations/layers is fixed, the recovery has a fixed computational cost. Extensive experimental results on a variety of datasets demonstrate that our proposed method significantly improves the quality of image reconstruction at a fixed computational cost with illumination patterns learned only using a small number of training images.
Open AccessLearning to Sense for Coded Diffraction Imaging
In this paper, we present a framework to learn illumination patterns to improve the quality of signal recovery for coded diffraction imaging. We use an alternating minimization-based phase retrieval method with a fixed number of iterations as the iterative method. We represent the iterative phase retrieval method as an unrolled network with a fixed number of layers where each layer of the network corresponds to a single step of iteration, and we minimize the recovery error by optimizing over the illumination patterns. Since the number of iterations/layers is fixed, the recovery has a fixed computational cost. Extensive experimental results on a variety of datasets demonstrate that our proposed method significantly improves the quality of image reconstruction at a fixed computational cost with illumination patterns learned only using a small number of training images.
- 28 October 2022
- Published by Springer Nature
- p. 566-582
Incremental Task Learning with Incremental Rank Updates
- 28 October 2022
- Published by Springer Nature
- p. 566-582
Incremental Task Learning with Incremental Rank Updates
- 24 September 2020
- Published by Springer Nature
- p. 425-441
Solving Phase Retrieval with a Learned Reference
- 24 September 2020
- Published by Springer Nature
- p. 425-441
Solving Phase Retrieval with a Learned Reference
- Open Access
Learning Illumination Patterns for Coded Diffraction Phase Retrieval
Signal recovery from nonlinear measurements involves solving an iterative optimization problem. In this paper, we present a framework to optimize the sensing parameters to improve the quality of the signal recovered by the given iterative method. In particular, we learn illumination patterns to recover signals from coded diffraction patterns using a fixed-cost alternating minimization-based phase retrieval method. Coded diffraction phase retrieval is a physically realistic system in which the signal is first modulated by a sequence of codes before the sensor records its Fourier amplitude. We represent the phase retrieval method as an unrolled network with a fixed number of layers and minimize the recovery error by optimizing over the measurement parameters. Since the number of iterations/layers are fixed, the recovery incurs a fixed cost. We present extensive simulation results on a variety of datasets under different conditions and a comparison with existing methods. Our results demonstrate that the proposed method provides near-perfect reconstruction using patterns learned with a small number of training images. Our proposed method provides significant improvements over existing methods both in terms of accuracy and speed.
Open AccessLearning Illumination Patterns for Coded Diffraction Phase Retrieval
Signal recovery from nonlinear measurements involves solving an iterative optimization problem. In this paper, we present a framework to optimize the sensing parameters to improve the quality of the signal recovered by the given iterative method. In particular, we learn illumination patterns to recover signals from coded diffraction patterns using a fixed-cost alternating minimization-based phase retrieval method. Coded diffraction phase retrieval is a physically realistic system in which the signal is first modulated by a sequence of codes before the sensor records its Fourier amplitude. We represent the phase retrieval method as an unrolled network with a fixed number of layers and minimize the recovery error by optimizing over the measurement parameters. Since the number of iterations/layers are fixed, the recovery incurs a fixed cost. We present extensive simulation results on a variety of datasets under different conditions and a comparison with existing methods. Our results demonstrate that the proposed method provides near-perfect reconstruction using patterns learned with a small number of training images. Our proposed method provides significant improvements over existing methods both in terms of accuracy and speed.
- 28 February 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 68 (1053587X) , 1688-1701
Generative Models for Low-Dimensional Video Representation and Reconstruction
Generative models have received considerable attention in signal processing and compressive sensing for their ability to generate high-dimensional natural image using low-dimensional codes. In the context of compressive sensing, if the unknown image belongs to the range of a pretrained generative network, then we can recover the image by estimating the underlying compact latent code from the available measurements. In practice, however, a given pretrained generator can only reliably generate images that are similar to the training data. To overcome this challenge, a number of methods have been proposed recently to use untrained generator structure as prior while solving the signal recovery problem. In this paper, we propose a similar method for jointly updating the weights of the generator and latent codes while recovering a video sequence from compressive measurements. We use a single generator to generate the entire video. To exploit the temporal redundancy in a video sequence, we use a low-rank constraint on the latent codes that imposes a low-dimensional manifold model on the generated video sequence. We evaluated the performance of our proposed methods on different video compressive sensing problems under different settings and compared them against some state-of-the-art methods. Our results demonstrate that our proposed methods provide better or comparable accuracy and low computational and memory complexity compared to the existing methods.
- 28 February 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 68 (1053587X) , 1688-1701
Generative Models for Low-Dimensional Video Representation and Reconstruction
Generative models have received considerable attention in signal processing and compressive sensing for their ability to generate high-dimensional natural image using low-dimensional codes. In the context of compressive sensing, if the unknown image belongs to the range of a pretrained generative network, then we can recover the image by estimating the underlying compact latent code from the available measurements. In practice, however, a given pretrained generator can only reliably generate images that are similar to the training data. To overcome this challenge, a number of methods have been proposed recently to use untrained generator structure as prior while solving the signal recovery problem. In this paper, we propose a similar method for jointly updating the weights of the generator and latent codes while recovering a video sequence from compressive measurements. We use a single generator to generate the entire video. To exploit the temporal redundancy in a video sequence, we use a low-rank constraint on the latent codes that imposes a low-dimensional manifold model on the generated video sequence. We evaluated the performance of our proposed methods on different video compressive sensing problems under different settings and compared them against some state-of-the-art methods. Our results demonstrate that our proposed methods provide better or comparable accuracy and low computational and memory complexity compared to the existing methods.
- 1 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 7705-7709
Alternating Phase Projected Gradient Descent with Generative Priors for Solving Compressive Phase Retrieval
The classical problem of phase retrieval arises in various signal acquisition systems. Due to the ill-posed nature of the problem, the solution requires assumptions on the structure of the signal. In the last several years, sparsity and support-based priors have been leveraged successfully to solve this problem. In this work, we propose replacing the sparsity/support priors with generative priors and propose two algorithms to solve the phase retrieval problem. Our proposed algorithms combine the ideas from AltMin approach for non-convex sparse phase retrieval and projected gradient descent approach for solving linear inverse problems using generative priors. We empirically show that the performance of our method with projected gradient descent is superior to the existing approach for solving phase retrieval under generative priors. We support our method with an analysis of sample complexity with Gaussian measurements.
- 1 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 7705-7709
Alternating Phase Projected Gradient Descent with Generative Priors for Solving Compressive Phase Retrieval
The classical problem of phase retrieval arises in various signal acquisition systems. Due to the ill-posed nature of the problem, the solution requires assumptions on the structure of the signal. In the last several years, sparsity and support-based priors have been leveraged successfully to solve this problem. In this work, we propose replacing the sparsity/support priors with generative priors and propose two algorithms to solve the phase retrieval problem. Our proposed algorithms combine the ideas from AltMin approach for non-convex sparse phase retrieval and projected gradient descent approach for solving linear inverse problems using generative priors. We empirically show that the performance of our method with projected gradient descent is superior to the existing approach for solving phase retrieval under generative priors. We support our method with an analysis of sample complexity with Gaussian measurements.
- 22 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Journal
- Vol. 18 (16) , 6563-6568
A Highly Sensitive Metal–Insulator–Metal Ring Resonator-Based Nanophotonic Structure for Biosensing Applications
We propose and theoretically analyze an integrated biosensor scheme based on a Metal-Insulator-Metal waveguide-coupled ring resonator structure that can be used for bio-molecular sensing applications. We incorporate silicon as substrate aiming that the whole structure can be fabricated monolithically in the same CMOS-compatible device. The full-field FDTD analysis is carried out to find the spectral response and performance characteristics of the proposed nanosensor in the NIR region of the spectrum. As the coupling of surface plasmon polaritons between two metal-dielectric interfaces of the ring increases the strength of the confined field, the sensitivity of the structure increases and reaches as high as 1383 nm/RIU. The analyses also indicate that the resonant modes can be tuned according to the design requirement keeping sensitivity almost constant. The proposed nanostructure is also investigated for some biomolecular sensing applications and expected results are obtained.
- 22 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Journal
- Vol. 18 (16) , 6563-6568
A Highly Sensitive Metal–Insulator–Metal Ring Resonator-Based Nanophotonic Structure for Biosensing Applications
We propose and theoretically analyze an integrated biosensor scheme based on a Metal-Insulator-Metal waveguide-coupled ring resonator structure that can be used for bio-molecular sensing applications. We incorporate silicon as substrate aiming that the whole structure can be fabricated monolithically in the same CMOS-compatible device. The full-field FDTD analysis is carried out to find the spectral response and performance characteristics of the proposed nanosensor in the NIR region of the spectrum. As the coupling of surface plasmon polaritons between two metal-dielectric interfaces of the ring increases the strength of the confined field, the sensitivity of the structure increases and reaches as high as 1383 nm/RIU. The analyses also indicate that the resonant modes can be tuned according to the design requirement keeping sensitivity almost constant. The proposed nanostructure is also investigated for some biomolecular sensing applications and expected results are obtained.
- 1 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 297-300
Predictive Real-Time Beat Tracking from Music for Embedded Application
Beat tracking from music signals has significant importance in multimedia information retrieval systems, especially in cover song detection. A predictive real-time beat tracking system can also be used to assist musicians performing live. In this paper we present a real-time beat tracking algorithm, fast enough to be implemented on an embedded system. The onset of a note is detected using a maximum filter approach that suppresses the effect of vibrato. Beats are predicted a second in advance using a causal variant of Dynamic Programming. We have employed an onset memoization algorithm, to reduce the computational resources required. Raspberry Pi was chosen as our preferred development board. We have demonstrated through experimental results that the proposed approach can satisfactorily estimate beat positions from a music signal in real-time with an average continuity score (AMLt) of 0.67.
- 1 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 297-300
Predictive Real-Time Beat Tracking from Music for Embedded Application
Beat tracking from music signals has significant importance in multimedia information retrieval systems, especially in cover song detection. A predictive real-time beat tracking system can also be used to assist musicians performing live. In this paper we present a real-time beat tracking algorithm, fast enough to be implemented on an embedded system. The onset of a note is detected using a maximum filter approach that suppresses the effect of vibrato. Beats are predicted a second in advance using a causal variant of Dynamic Programming. We have employed an onset memoization algorithm, to reduce the computational resources required. Raspberry Pi was chosen as our preferred development board. We have demonstrated through experimental results that the proposed approach can satisfactorily estimate beat positions from a music signal in real-time with an average continuity score (AMLt) of 0.67.