Hai Huyen Dam
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Hai Huyen Dam has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Sven Nordholm
School of Electrical Engineering, Computing and Mathematical Sciences (EECMS), Faculty of Science and Engineering, Curtin University, Bentley, WA 6102, Australia
7 shared publications - Antonio Cantoni
Department of Electrical, Electronic and Computer Engineering, University of Western Australia, Crawley, WA 6009 Australia
4 shared publications - Bin Li
School of Aeronautics and Astronautics, Sichuan University, Chengdu 610065, China
2 shared publications - Bingo Wing-Kuen Ling
Faculty of Information Engineering, Guangdong University of Technology, Guangzhou, China
2 shared publications - Kok Lay Teo
School of Mathematical Sciences, Sunway University, Bandar Sunway, Selangor Darul Ehsan, Malaysia
2 shared publications - Siow Yong Low
Connected Intelligence Research Group (CIRG), University of Southampton Malaysia, Iskandar Puteri, Malaysia
2 shared publications
Latest Publications
- Open Access
- 22 January 2024
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 43 (5) , 2891-2908
Optimized Sigmoid Functions for Speech Presence Probability and Gain Function in Speech Enhancement
Speech presence probability (SPP) and gain functions such as Wiener filter or MMSE estimators require an estimate of the a-priori signal-to-noise ratio (SNR). However, the estimation of the a-priori SNR is computationally involved and sensitive to noise variations. This paper proposes to approximate the SPP and the overall gain function of a speech enhancement system by using sigmoid functions to reduce the need of estimating the a-prior SNR. By applying an approximation via the sigmoid functions it is shown that only the a-posteriori estimate of SNR is needed, resulting in a low complexity system. The sigmoid function is designed with an optimization algorithm to optimize its parameters with respect to speech quality measures. The optimization algorithm is based on the idea that the solution obtained for a given problem should move towards the best solution and avoid the worst solution. The proposed algorithm requires minimal control parameters and does not require any algorithm specific parameters. Simulation results show that the proposed sigmoid functions achieve good results in terms of speech quality measures when compared with existing methods while providing significantly lower complexity for implementation.
- 22 January 2024
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 43 (5) , 2891-2908
Open AccessOptimized Sigmoid Functions for Speech Presence Probability and Gain Function in Speech Enhancement
Speech presence probability (SPP) and gain functions such as Wiener filter or MMSE estimators require an estimate of the a-priori signal-to-noise ratio (SNR). However, the estimation of the a-priori SNR is computationally involved and sensitive to noise variations. This paper proposes to approximate the SPP and the overall gain function of a speech enhancement system by using sigmoid functions to reduce the need of estimating the a-prior SNR. By applying an approximation via the sigmoid functions it is shown that only the a-posteriori estimate of SNR is needed, resulting in a low complexity system. The sigmoid function is designed with an optimization algorithm to optimize its parameters with respect to speech quality measures. The optimization algorithm is based on the idea that the solution obtained for a given problem should move towards the best solution and avoid the worst solution. The proposed algorithm requires minimal control parameters and does not require any algorithm specific parameters. Simulation results show that the proposed sigmoid functions achieve good results in terms of speech quality measures when compared with existing methods while providing significantly lower complexity for implementation.
- Open Access
Accelerated Conjugate Gradient for Second-Order Blind Signal Separation
This paper proposes a new adaptive algorithm for the second-order blind signal separation (BSS) problem with convolutive mixtures by utilising a combination of an accelerated gradient and a conjugate gradient method. For each iteration of the adaptive algorithm, the search point and the search direction are obtained based on the current and the previous iterations. The algorithm efficiently calculates the step size for the accelerated conjugate gradient algorithm in each iteration. Simulation results show that the proposed accelerated conjugate gradient algorithm with optimal step size converges faster than the accelerated descent algorithm and the steepest descent algorithm with optimal step size while having lower computational complexity. In particular, the number of iterations required for convergence of the accelerated conjugate gradient algorithm is significantly lower than the accelerated descent algorithm and the steepest descent algorithm. In addition, the proposed system achieves improvement in terms of the signal to interference ratio and signal to noise ratio for the dominant speech outputs.
Open AccessAccelerated Conjugate Gradient for Second-Order Blind Signal Separation
This paper proposes a new adaptive algorithm for the second-order blind signal separation (BSS) problem with convolutive mixtures by utilising a combination of an accelerated gradient and a conjugate gradient method. For each iteration of the adaptive algorithm, the search point and the search direction are obtained based on the current and the previous iterations. The algorithm efficiently calculates the step size for the accelerated conjugate gradient algorithm in each iteration. Simulation results show that the proposed accelerated conjugate gradient algorithm with optimal step size converges faster than the accelerated descent algorithm and the steepest descent algorithm with optimal step size while having lower computational complexity. In particular, the number of iterations required for convergence of the accelerated conjugate gradient algorithm is significantly lower than the accelerated descent algorithm and the steepest descent algorithm. In addition, the proposed system achieves improvement in terms of the signal to interference ratio and signal to noise ratio for the dominant speech outputs.
- 1 January 2022
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 18 (5) , 3701
Two-level optimization approach with accelerated proximal gradient for objective measures in sparse speech reconstruction
Compressive speech enhancement makes use of the sparseness of speech and the non-sparseness of noise in time-frequency representation to perform speech enhancement. However, reconstructing the sparsest output may not necessarily translate to a good enhanced speech signal as speech distortion may be at risk. This paper proposes a two level optimization approach to incorporate objective quality measures in compressive speech enhancement. The proposed method combines the accelerated proximal gradient approach and a global one dimensional optimization method to solve the sparse reconstruction. By incorporating objective quality measures in the optimization process, the reconstructed output is not only sparse but also maintains the highest objective quality score possible. In other words, the sparse speech reconstruction process is now quality sparse speech reconstruction. Experimental results in a compressive speech enhancement consistently show score improvement in objectives measures in different noisy environments compared to the non-optimized method. Additionally, the proposed optimization yields a higher convergence rate with a lower computational complexity compared to the existing methods.
- 1 January 2022
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 18 (5) , 3701
Two-level optimization approach with accelerated proximal gradient for objective measures in sparse speech reconstruction
Compressive speech enhancement makes use of the sparseness of speech and the non-sparseness of noise in time-frequency representation to perform speech enhancement. However, reconstructing the sparsest output may not necessarily translate to a good enhanced speech signal as speech distortion may be at risk. This paper proposes a two level optimization approach to incorporate objective quality measures in compressive speech enhancement. The proposed method combines the accelerated proximal gradient approach and a global one dimensional optimization method to solve the sparse reconstruction. By incorporating objective quality measures in the optimization process, the reconstructed output is not only sparse but also maintains the highest objective quality score possible. In other words, the sparse speech reconstruction process is now quality sparse speech reconstruction. Experimental results in a compressive speech enhancement consistently show score improvement in objectives measures in different noisy environments compared to the non-optimized method. Additionally, the proposed optimization yields a higher convergence rate with a lower computational complexity compared to the existing methods.
- Open Access
- 1 January 2021
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 17 (3) , 1119-1145
Optimal design of window functions for filter window bank
This paper considers the designs of the periodic window functions in the filter window banks. First, the filter window bank with the constant synthesis periodic window functions is considered. The total number of the nonzero coefficients in the impulse responses of the analysis periodic window functions is minimized subject to the near perfect reconstruction condition. This is an$ L_0 $ norm optimization problem. To find its solution, the$ L_0 $ norm optimization problem is approximated by the$ L_1 $ norm optimization problem. Then, the column of the constraint matrix corresponding to the element in the solution with the smallest magnitude is removed. Next, it is tested whether the feasible set corresponding to the new$ L_0 $ norm optimization problem is empty or not. By repeating the above procedures, a solution of the$ L_0 $ norm optimization problem is obtained. Second, the filter window bank with the time varying synthesis periodic window functions is considered. Likewise, the design of the periodic window functions in both the analysis periodic window functions and the synthesis periodic window functions is formulated as an$ L_0 $ optimization problem. However, this$ L_0 $ norm optimization problem is subject to a quadratic matrix inequality constraint. To find its solution, the set of the synthesis periodic window functions is initialized. Then, the set of the analysis periodic window functions is optimized based on the initialized set of the synthesis periodic window functions. Next, the set of the synthesis periodic window functions is optimized based on the found set of the analysis periodic window functions. Finally, these two procedures are iterated. It is shown that the iterative algorithm converges. A design example of a filter window bank with the constant synthesis periodic window functions and a design example of a filter window bank with the time varying synthesis periodic window functions are illustrated. It is shown that the near perfect reconstruction condition is satisfied, whereas this is not the cases for the nonuniform filter banks with the conventional samplers and the conventional block samplers.- 1 January 2021
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 17 (3) , 1119-1145
Open AccessOptimal design of window functions for filter window bank
This paper considers the designs of the periodic window functions in the filter window banks. First, the filter window bank with the constant synthesis periodic window functions is considered. The total number of the nonzero coefficients in the impulse responses of the analysis periodic window functions is minimized subject to the near perfect reconstruction condition. This is an$ L_0 $ norm optimization problem. To find its solution, the$ L_0 $ norm optimization problem is approximated by the$ L_1 $ norm optimization problem. Then, the column of the constraint matrix corresponding to the element in the solution with the smallest magnitude is removed. Next, it is tested whether the feasible set corresponding to the new$ L_0 $ norm optimization problem is empty or not. By repeating the above procedures, a solution of the$ L_0 $ norm optimization problem is obtained. Second, the filter window bank with the time varying synthesis periodic window functions is considered. Likewise, the design of the periodic window functions in both the analysis periodic window functions and the synthesis periodic window functions is formulated as an$ L_0 $ optimization problem. However, this$ L_0 $ norm optimization problem is subject to a quadratic matrix inequality constraint. To find its solution, the set of the synthesis periodic window functions is initialized. Then, the set of the analysis periodic window functions is optimized based on the initialized set of the synthesis periodic window functions. Next, the set of the synthesis periodic window functions is optimized based on the found set of the analysis periodic window functions. Finally, these two procedures are iterated. It is shown that the iterative algorithm converges. A design example of a filter window bank with the constant synthesis periodic window functions and a design example of a filter window bank with the time varying synthesis periodic window functions are illustrated. It is shown that the near perfect reconstruction condition is satisfied, whereas this is not the cases for the nonuniform filter banks with the conventional samplers and the conventional block samplers. - 7 May 2019
- Published by Springer Nature in Multidimensional Systems and Signal Processing
- Vol. 31 (1) , 135-155
Robust broadband beamformer design for noise reduction and dereverberation
- 7 May 2019
- Published by Springer Nature in Multidimensional Systems and Signal Processing
- Vol. 31 (1) , 135-155
Robust broadband beamformer design for noise reduction and dereverberation
- Open Access
- 1 January 2019
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 15 (1) , 97-112
Optimal design of finite precision and infinite precision non-uniform cosine modulated filter bank
This paper investigates the design of non-uniform cosine modulated filter bank (CMFB) with both finite precision coefficients and infinite precision coefficients. The finite precision filter bank has been designed to reduce the computational complexity related to the multiplication operations in the filter bank. Here, non-uniform filter bank (NUFB) is obtained by merging the appropriate filters of an uniform filter bank. An efficient optimization approach is developed for the design of non-uniform CMFB with infinite precision coefficients. A new procedure based on the discrete filled function is then developed to design the filter bank prototype filter with finite precision coefficients. Design examples demonstrate that the designed filter banks with both infinite precision coefficients and finite precision coefficients have low distortion and better performance when compared with other existing methods.
- 1 January 2019
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 15 (1) , 97-112
Open AccessOptimal design of finite precision and infinite precision non-uniform cosine modulated filter bank
This paper investigates the design of non-uniform cosine modulated filter bank (CMFB) with both finite precision coefficients and infinite precision coefficients. The finite precision filter bank has been designed to reduce the computational complexity related to the multiplication operations in the filter bank. Here, non-uniform filter bank (NUFB) is obtained by merging the appropriate filters of an uniform filter bank. An efficient optimization approach is developed for the design of non-uniform CMFB with infinite precision coefficients. A new procedure based on the discrete filled function is then developed to design the filter bank prototype filter with finite precision coefficients. Design examples demonstrate that the designed filter banks with both infinite precision coefficients and finite precision coefficients have low distortion and better performance when compared with other existing methods.
- 19 August 2017
- Published by Springer Nature in Optimization Letters
- Vol. 12 (6) , 1373-1386
A reduced complexity zero-forcing beamformer design for multiuser MIMO systems
- 19 August 2017
- Published by Springer Nature in Optimization Letters
- Vol. 12 (6) , 1373-1386
A reduced complexity zero-forcing beamformer design for multiuser MIMO systems
- 22 March 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 24 (5) , 673-677
Optimal Design of Oversampled Modulated Filter Bank
This letter proposes an optimal design of the filter bank with minimum inband aliasing, residual aliasing together with restrictions on the frequency response of the analysis filter and the distortion level for the filter bank. A new procedure that includes the combination of one parameter filled function and an iterative method is developed to solve the optimization problem. The advantage of using the iterative algorithm within the filled function is that a lower basin can be obtained with a low computational complexity. Design examples show that a significant improvement can be obtained using the proposed method over existing methods.
- 22 March 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 24 (5) , 673-677
Optimal Design of Oversampled Modulated Filter Bank
This letter proposes an optimal design of the filter bank with minimum inband aliasing, residual aliasing together with restrictions on the frequency response of the analysis filter and the distortion level for the filter bank. A new procedure that includes the combination of one parameter filled function and an iterative method is developed to solve the optimization problem. The advantage of using the iterative algorithm within the filled function is that a lower basin can be obtained with a low computational complexity. Design examples show that a significant improvement can be obtained using the proposed method over existing methods.
- 24 February 2017
- Published by Springer Nature in Multidimensional Systems and Signal Processing
- Vol. 29 (3) , 903-919
Accelerated gradient with optimal step size for second-order blind signal separation
- 24 February 2017
- Published by Springer Nature in Multidimensional Systems and Signal Processing
- Vol. 29 (3) , 903-919
Accelerated gradient with optimal step size for second-order blind signal separation
- Open Access
- 1 September 2016
- Published by American Institute of Mathematical Sciences (AIMS) in Numerical Algebra, Control & Optimization
- Vol. 6 (3) , 297-304
A low-complexity zero-forcing Beamformer design for multiuser MIMO systems via a dual gradient method
In this paper, we consider the zero-forcing beamforming (ZFBF) under the per-antenna power constraints (PAPC). Our objective is to maximize the minimum user information rate. Traditionally, ZFBF under PAPC with a max-min performance measure can be transformed into a second order cone problem and then solved by applying the interior point method. However, it is expensive to realize this design in practice due to high computational complexity per iteration. An alternative low complexity zero-forcing beamformer design is proposed for MU-MIMO systems by applying a dual gradient method. Different from the step size rule in the literature, a backtracking line search is adopted. A numerical example is provided to show the effectiveness of the proposed method.
- 1 September 2016
- Published by American Institute of Mathematical Sciences (AIMS) in Numerical Algebra, Control & Optimization
- Vol. 6 (3) , 297-304
Open AccessA low-complexity zero-forcing Beamformer design for multiuser MIMO systems via a dual gradient method
In this paper, we consider the zero-forcing beamforming (ZFBF) under the per-antenna power constraints (PAPC). Our objective is to maximize the minimum user information rate. Traditionally, ZFBF under PAPC with a max-min performance measure can be transformed into a second order cone problem and then solved by applying the interior point method. However, it is expensive to realize this design in practice due to high computational complexity per iteration. An alternative low complexity zero-forcing beamformer design is proposed for MU-MIMO systems by applying a dual gradient method. Different from the step size rule in the literature, a backtracking line search is adopted. A numerical example is provided to show the effectiveness of the proposed method.