Xiaoqing Hu
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
Xiaoqing Hu has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
Bugong Xu
College of Automation Science and Engineering South China University of Technology Guangzhou 510640 People's Republic of China
3 shared publicationsMing Bao
Institute of Acoustics, Chinese Academy of Sciences, Beijing, China
3 shared publicationsYu-Hen Hu
University of Wisconsin-Madison, Madison, WI
3 shared publications- Feiran Yang
State Key Laboratory of Acoustics and Marine Information, Institute of Acoustics, Chinese Academy of Sciences, Beijing, China
2 shared publications - Jun Yang
Laboratory of Noise and Audio Research, Institute of Acoustics, Chinese Academy of Sciences, Beijing, China
2 shared publications - Ming Bao
School of Materials Science and Intelligent Engineering, Nanjing University, Suzhou, China
2 shared publications
Latest Publications
- 1 September 2025
- Published by Acoustical Society of America (ASA) in The Journal of the Acoustical Society of America
- Vol. 158 (3) , 1767-1782
A dual-encoder U-net architecture with prior knowledge embedding for acoustic source mapping
The deconvolution approach has become a standard method for high-resolution acoustic source mapping, but it suffers from a heavy computational burden. Deep learning-based methods have shown promising progress but often rely on single-type input features and ignore the position- and frequency-dependent variabilities of the point spread function (PSF), which leads to a decline in localization accuracy. This paper proposes a supervised learning framework based on dual-encoder U-net architecture to convert beamforming maps into a high-resolution map of true source strength distribution. Specifically, the model employs two individual encoders to extract complementary features from delay-and-sum and functional beamforming maps. Because the two maps provide distinct information on the same source strength distribution, a contrastive loss function is introduced to help encoders learn consistent latent features of sources. To characterize the PSF variations, a frequency encoder and position encoder are designed to embed prior knowledge, i.e., source frequency and grid positions, into the backbone network. The proposed model outperforms competing methods, on average, across four metrics for the simulation data and MIRACLE dataset and generalizes well across different numbers of sound sources and frequencies.
- 1 September 2025
- Published by Acoustical Society of America (ASA) in The Journal of the Acoustical Society of America
- Vol. 158 (3) , 1767-1782
A dual-encoder U-net architecture with prior knowledge embedding for acoustic source mapping
The deconvolution approach has become a standard method for high-resolution acoustic source mapping, but it suffers from a heavy computational burden. Deep learning-based methods have shown promising progress but often rely on single-type input features and ignore the position- and frequency-dependent variabilities of the point spread function (PSF), which leads to a decline in localization accuracy. This paper proposes a supervised learning framework based on dual-encoder U-net architecture to convert beamforming maps into a high-resolution map of true source strength distribution. Specifically, the model employs two individual encoders to extract complementary features from delay-and-sum and functional beamforming maps. Because the two maps provide distinct information on the same source strength distribution, a contrastive loss function is introduced to help encoders learn consistent latent features of sources. To characterize the PSF variations, a frequency encoder and position encoder are designed to embed prior knowledge, i.e., source frequency and grid positions, into the backbone network. The proposed model outperforms competing methods, on average, across four metrics for the simulation data and MIRACLE dataset and generalizes well across different numbers of sound sources and frequencies.
- 2 September 2024
- Published by Elsevier in Applied Acoustics
- Vol. 227
Microphone array post-filter based on accurate estimation of noise power spectral density
- 2 September 2024
- Published by Elsevier in Applied Acoustics
- Vol. 227
Microphone array post-filter based on accurate estimation of noise power spectral density
- 7 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Audio, Speech, and Language Processing
- Vol. 32 (23299290) , 3811-3825
Theoretical Analysis of Maclaurin Expansion Based Linear Differential Microphone Arrays and Improved Solutions
Linear differential microphone arrays (LDMAs) are becoming popular due to their potentially high directional gain and frequency-invariant beampattern. By increasing the number of microphones, the Maclaurin expansion-based LDMAs address the inherently poor robustness problem of the conventional LDMA at low frequencies. However, this method encounters severe beampattern distortion and the deep nulls problem in the white noise gain (WNG) and the directivity factor (DF) at high frequencies as the number of microphones increases. In this paper, we reveal that the severe beampattern distortion is attributed to the deviation term of the synthesized beampattern while the deep nulls problem in the WNG and the DF is attributed to the violation of the distortionless constraint in the desired direction. We then propose two new design methods to avoid the degraded performance of LDMAs. Compared to the Maclaurin series expansion-based method, the first method additionally imposes the distortionless constraint in the desired direction, and the deep nulls problem in the WNG and the DF can be avoided. The second method explicitly requires the response of the higher order spatial directivity pattern in the deviation term to be zero, and thus the beampattern distortion can be avoided. By choosing the frequency-wise parameter that determines the number of the considered higher order spatial directivity patterns, the second method enables a good trade-off between the WNG and the beampattern distortion. Simulations exemplify the superiority of the proposed method against existing methods in terms of the robustness and the beampattern distortion.
- 7 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Audio, Speech, and Language Processing
- Vol. 32 (23299290) , 3811-3825
Theoretical Analysis of Maclaurin Expansion Based Linear Differential Microphone Arrays and Improved Solutions
Linear differential microphone arrays (LDMAs) are becoming popular due to their potentially high directional gain and frequency-invariant beampattern. By increasing the number of microphones, the Maclaurin expansion-based LDMAs address the inherently poor robustness problem of the conventional LDMA at low frequencies. However, this method encounters severe beampattern distortion and the deep nulls problem in the white noise gain (WNG) and the directivity factor (DF) at high frequencies as the number of microphones increases. In this paper, we reveal that the severe beampattern distortion is attributed to the deviation term of the synthesized beampattern while the deep nulls problem in the WNG and the DF is attributed to the violation of the distortionless constraint in the desired direction. We then propose two new design methods to avoid the degraded performance of LDMAs. Compared to the Maclaurin series expansion-based method, the first method additionally imposes the distortionless constraint in the desired direction, and the deep nulls problem in the WNG and the DF can be avoided. The second method explicitly requires the response of the higher order spatial directivity pattern in the deviation term to be zero, and thus the beampattern distortion can be avoided. By choosing the frequency-wise parameter that determines the number of the considered higher order spatial directivity patterns, the second method enables a good trade-off between the WNG and the beampattern distortion. Simulations exemplify the superiority of the proposed method against existing methods in terms of the robustness and the beampattern distortion.
- Open Access
- 1 September 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 2024 (1) , 012006
Trip-GhostNet for Hyperspectral Image Classification
The classification of hyperspectral remote sensing images (HSI) is an important task in the processing and application of hyperspectral images. Convolutional neural network (CNN) has significant advantages in the extraction and fusion of hyperspectral image spectrum and spatial features, so it has become a common method in the field of HSI classification. However, the spectral domain feature redundancy of hyperspectral images is very high, and the spatial domain feature structure is complex, which makes CNN more time-consuming and higher memory requirements in the feature extraction process. Based on this problem, lightweight networks with fewer parameters have gradually become the main application method in the field of HSI classification. In order to reduce the computational complexity of deep feature extraction and take into account the shallow features, a high-order nonlinear Ghost module is proposed on the basis of the original Ghost linear transformation module. Furthermore, in view of the independent characteristics of each dimension of HSI, a Trip-GhostNet is proposed, which simultaneously extracts and fuses features from three dimensions in a lightweight manner. According to the distribution characteristics of HSI, the influence of attention embedding methods in the high-order Ghost module of each branch on the feature extraction is compared and analyzed. The results show that the proposed model can reduce model calculations and improve classification accuracy, and is suitable for HSI classification problems.
- 1 September 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 2024 (1) , 012006
Open AccessTrip-GhostNet for Hyperspectral Image Classification
The classification of hyperspectral remote sensing images (HSI) is an important task in the processing and application of hyperspectral images. Convolutional neural network (CNN) has significant advantages in the extraction and fusion of hyperspectral image spectrum and spatial features, so it has become a common method in the field of HSI classification. However, the spectral domain feature redundancy of hyperspectral images is very high, and the spatial domain feature structure is complex, which makes CNN more time-consuming and higher memory requirements in the feature extraction process. Based on this problem, lightweight networks with fewer parameters have gradually become the main application method in the field of HSI classification. In order to reduce the computational complexity of deep feature extraction and take into account the shallow features, a high-order nonlinear Ghost module is proposed on the basis of the original Ghost linear transformation module. Furthermore, in view of the independent characteristics of each dimension of HSI, a Trip-GhostNet is proposed, which simultaneously extracts and fuses features from three dimensions in a lightweight manner. According to the distribution characteristics of HSI, the influence of attention embedding methods in the high-order Ghost module of each branch on the feature extraction is compared and analyzed. The results show that the proposed model can reduce model calculations and improve classification accuracy, and is suitable for HSI classification problems.
- Open Access
A Robust Steered Response Power Localization Method for Wireless Acoustic Sensor Networks in an Outdoor Environment
The localization of outdoor acoustic sources has attracted attention in wireless sensor networks. In this paper, the steered response power (SRP) localization of band-pass signal associated with steering time delay uncertainty and coarser spatial grids is considered. We propose a modified SRP-based source localization method for enhancing the localization robustness in outdoor scenarios. In particular, we derive a sufficient condition dependent on the generalized cross-correlation (GCC) waveform function for robust on-grid source localization and show that the SRP function with GCCs satisfying this condition can suppress the disturbances induced by the grid distance and the uncertain steering time delays. Then a GCC refinement procedure for band-pass GCCs is designed, which uses complex wavelet functions in multiple sub-bands to filter the GCCs and averages the envelopes of the filtered GCCs as the equivalent GCC to match the sufficient condition. Simulation results and field experiments demonstrate the excellent performance of the proposed method against the existing SRP-based methods.
Open AccessA Robust Steered Response Power Localization Method for Wireless Acoustic Sensor Networks in an Outdoor Environment
The localization of outdoor acoustic sources has attracted attention in wireless sensor networks. In this paper, the steered response power (SRP) localization of band-pass signal associated with steering time delay uncertainty and coarser spatial grids is considered. We propose a modified SRP-based source localization method for enhancing the localization robustness in outdoor scenarios. In particular, we derive a sufficient condition dependent on the generalized cross-correlation (GCC) waveform function for robust on-grid source localization and show that the SRP function with GCCs satisfying this condition can suppress the disturbances induced by the grid distance and the uncertain steering time delays. Then a GCC refinement procedure for band-pass GCCs is designed, which uses complex wavelet functions in multiple sub-bands to filter the GCCs and averages the envelopes of the filtered GCCs as the equivalent GCC to match the sufficient condition. Simulation results and field experiments demonstrate the excellent performance of the proposed method against the existing SRP-based methods.
- 22 August 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 17 (4) , 871-883
Quantized Kalman Filter Tracking in Directional Sensor Networks
Moving target tracking in directional sensor networks has recently attracted attention by right of special directional sensing features. Unlike omnidirectional sensors, the directional sensor senses the target only in the direction of its orientation. It can provide quantized direction that indicates the presence or absence of the target in the sensing field, rather than just the analog measurement of sensing signal with respect to the detected target. A quantized Kalman filter (QKF) based on both quantized directions and analog ranging measurements is derived in the minimum mean-square error (MMSE) sense. Its performances of mean square estimation error (MSE) and complexity are also analyzed. Then, a reduced-complexity QKF of high-accuracy is pursued to facilitate its implementation. It is proved that the QKF yields a smaller MSE than the traditional extended Kalman filter (EKF) merely based on analog measurements. The posterior Cramér-Rao lower bound (PCRLB) is introduced as the performance measure. The performance advantages of the proposed QKF are demonstrated using Monte Carlo simulations in a target tracking application using ultrasonic ranging sensors.
- 22 August 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 17 (4) , 871-883
Quantized Kalman Filter Tracking in Directional Sensor Networks
Moving target tracking in directional sensor networks has recently attracted attention by right of special directional sensing features. Unlike omnidirectional sensors, the directional sensor senses the target only in the direction of its orientation. It can provide quantized direction that indicates the presence or absence of the target in the sensing field, rather than just the analog measurement of sensing signal with respect to the detected target. A quantized Kalman filter (QKF) based on both quantized directions and analog ranging measurements is derived in the minimum mean-square error (MMSE) sense. Its performances of mean square estimation error (MSE) and complexity are also analyzed. Then, a reduced-complexity QKF of high-accuracy is pursued to facilitate its implementation. It is proved that the QKF yields a smaller MSE than the traditional extended Kalman filter (EKF) merely based on analog measurements. The posterior Cramér-Rao lower bound (PCRLB) is introduced as the performance measure. The performance advantages of the proposed QKF are demonstrated using Monte Carlo simulations in a target tracking application using ultrasonic ranging sensors.
- Open Access
- 4 April 2017
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 13 (4)
Measurement-converted Kalman filter tracking with Gaussian intensity attenuation signal in wireless sensor networks
In this article, the target tracking problem in a wireless sensor network with nonlinear Gaussian signal intensity attenuation model is considered. A Bayesian filter tracking algorithm is presented to estimate the locations of moving source that has unknown central signal intensity. This approach adopts a measurement conversion method to remove the measurement nonlinearity by the maximum likelihood estimator, and a linear estimate of the target position and its associated noise statistics obtained by the Newton–Raphson iterative optimization steps are applied into the standard Kalman filter. The Monte Carlo simulations have been conducted in comparison with the commonly used extended Kalman filter with an augmented state that consists of both the original target state and the augmentative central signal intensity. It is observed that the proposed measurement-converted Kalman filter can yield higher accurate estimate and nicer convergence performance over existing methods.
- 4 April 2017
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 13 (4)
Open AccessMeasurement-converted Kalman filter tracking with Gaussian intensity attenuation signal in wireless sensor networks
In this article, the target tracking problem in a wireless sensor network with nonlinear Gaussian signal intensity attenuation model is considered. A Bayesian filter tracking algorithm is presented to estimate the locations of moving source that has unknown central signal intensity. This approach adopts a measurement conversion method to remove the measurement nonlinearity by the maximum likelihood estimator, and a linear estimate of the target position and its associated noise statistics obtained by the Newton–Raphson iterative optimization steps are applied into the standard Kalman filter. The Monte Carlo simulations have been conducted in comparison with the commonly used extended Kalman filter with an augmented state that consists of both the original target state and the augmentative central signal intensity. It is observed that the proposed measurement-converted Kalman filter can yield higher accurate estimate and nicer convergence performance over existing methods.
- 16 May 2015
- Published by Springer Nature
- p. 263-272
A PLLS-PKF Method for Target Tracking of DOA Measurement Sensor Networks
- 16 May 2015
- Published by Springer Nature
- p. 263-272
A PLLS-PKF Method for Target Tracking of DOA Measurement Sensor Networks
- Open Access
- 1 May 2015
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 11 (5)
Constrained Extended Kalman Filter for Target Tracking in Directional Sensor Networks
The target tracking problem in directional sensor networks (DSNs) is attracting increasing attention. Unlike the traditional omnidirectional sensor, a directional sensor has a special angle of view. It can offer direction information rather than just the sensing signal measurement with respect to the detected target. The existing tracking approaches in DSNs always separately consider the direction and measurement information; they hardly promise the tracking performance of minimum variance. In this paper, the field of view of directional sensor is approximated to a rectangle; as such the constrained area in which the target is bound to be is constructed. Then, the target tracking problem is formulated as a constrained estimation problem, and a constrained extended Kalman filter (CEKF) tracking algorithm integrating the direction and measurement information is presented; its structural and statistical properties are rigorously derived. It is proved that CEKF is the linear unbiased minimum variance estimator, and CEKF can yield a smaller error covariance than the unconstrained traditional extended Kalman filter using only sensor measurements. Simulation results show that the CEKF has superior tracking performance for directional wireless networks.
- 1 May 2015
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 11 (5)
Open AccessConstrained Extended Kalman Filter for Target Tracking in Directional Sensor Networks
The target tracking problem in directional sensor networks (DSNs) is attracting increasing attention. Unlike the traditional omnidirectional sensor, a directional sensor has a special angle of view. It can offer direction information rather than just the sensing signal measurement with respect to the detected target. The existing tracking approaches in DSNs always separately consider the direction and measurement information; they hardly promise the tracking performance of minimum variance. In this paper, the field of view of directional sensor is approximated to a rectangle; as such the constrained area in which the target is bound to be is constructed. Then, the target tracking problem is formulated as a constrained estimation problem, and a constrained extended Kalman filter (CEKF) tracking algorithm integrating the direction and measurement information is presented; its structural and statistical properties are rigorously derived. It is proved that CEKF is the linear unbiased minimum variance estimator, and CEKF can yield a smaller error covariance than the unconstrained traditional extended Kalman filter using only sensor measurements. Simulation results show that the CEKF has superior tracking performance for directional wireless networks.
- 15 April 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 63 (12) , 3204-3217
Generalized Iterated Kalman Filter and its Performance Evaluation
In this paper, we present a generalized iterated Kalman filter (GIKF) algorithm for state estimation of a nonlinear stochastic discrete-time system with state-dependent multiplicative observation noise. The GIKF algorithm adopts the Newton-Raphson iterative optimization steps to yield an approximate maximum a posteriori estimate of the states. The mean-square estimation error (MSE) and the Cramér-Rao lower bound (CRLB) of the state estimates are also derived. In particular, the local convergence of MSE of GIKF is rigorously established. It is also proved that the GIKF yields a smaller MSE than those of the generalized extended Kalman filter and the traditional extended Kalman filter. The performance advantages and convergence of GIKF are demonstrated using Monte Carlo simulations on a target tracking application in a range measuring sensor network.
- 15 April 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 63 (12) , 3204-3217
Generalized Iterated Kalman Filter and its Performance Evaluation
In this paper, we present a generalized iterated Kalman filter (GIKF) algorithm for state estimation of a nonlinear stochastic discrete-time system with state-dependent multiplicative observation noise. The GIKF algorithm adopts the Newton-Raphson iterative optimization steps to yield an approximate maximum a posteriori estimate of the states. The mean-square estimation error (MSE) and the Cramér-Rao lower bound (CRLB) of the state estimates are also derived. In particular, the local convergence of MSE of GIKF is rigorously established. It is also proved that the GIKF yields a smaller MSE than those of the generalized extended Kalman filter and the traditional extended Kalman filter. The performance advantages and convergence of GIKF are demonstrated using Monte Carlo simulations on a target tracking application in a range measuring sensor network.