SearcharxivSearch

arXiv subjects

Fengzhong Qu

Publications and source records attributed to Fengzhong Qu.

17 recordsLinked to original sources

An Enhanced MNOMP for Line Spectrum Estimation and Detection

Multisnapshot Newtonized orthogonal matching pursuit (MNOMP) incorporates Newton's method into OMP to avoid the off-grid issues, achieve high accuracy, high resolution and fast line spectrum estimation with multiple measurement vectors. It employs the generalized likelihood ratio test (GLRT) with a constant false alarm rate (CFAR) criterion to determine the number of sinusoids. In this paper, we develop an enhanced MNOMP (EMNOMP) by analyzing the statistical distribution of the exact GLRT statistic. In contrast to MNOMP, which approximates the GLRT by restricting the search to discrete Fourier transform (DFT) grid frequencies, EMNOMP instead solves the GLRT over the continuous frequency domain. The key technical novelty is the derivation of the false alarm probability for this continuous-domain GLRT using chi-squared random field theory and the resulting closed-form threshold via the Lambert W function. The signal-to-noise ratio (SNR) gain of EMNOMP relative to MNOMP is derived and analyzed in depth. Numerical simulations validate the theoretical analysis and the effectiveness of EMNOMP compared to MNOMP.

eess.SP

A Model and Data Dual-driven Approach for Multitargets Detection under Mainlobe Jamming

In modern radar systems, target detection and parameter estimation face significant challenges when confronted with mainlobe jamming. This paper presents a Diffusion-based Model and Data Dual-driven (DMDD) approach to estimate and detect multitargets and suppress structured jamming. In DMDD, the jamming prior is modeled through a score-based diffusion process with its score learned from the pure jamming data, enabling posterior sampling without requiring detailed knowledge of jamming. Meanwhile, the target signal is usually sparse in the range space, which can be modeled via a sparse Bayesian learning (SBL) framework, and hyperparameter is updated through the expectation-maximization (EM) algorithm. A single diffusion process is constructed for the jamming, while the state of targets are estimated through direct posterior inference, enhancing computational efficiency. The noise variance is also estimated through EM algorithm. Numerical experiments demonstrate the effectiveness of the proposed method in structured jamming scenarios. The proposed DMDD algorithm achieves superior target detection performance, compared with existing methods.

eess.SP

Fast and Efficient Implementation of the Maximum Likelihood Estimation for the Linear Regression with Gaussian Model Uncertainty

The linear regression model with a random variable (RV) measurement matrix, where the mean of the random measurement matrix has full column rank, has been extensively studied. In particular, the quasiconvexity of the maximum likelihood estimation (MLE) problem was established, and the corresponding Cramer-Rao bound (CRB) was derived, leading to the development of an efficient bisection-based algorithm known as RV-ML. In contrast, this work extends the analysis to both overdetermined and underdetermined cases, allowing the mean of the random measurement matrix to be rank-deficient. A remarkable contribution is the proof that the equivalent MLE problem is convex and satisfies strong duality, strengthening previous quasiconvexity results. Moreover, it is shown that in underdetermined scenarios, the randomness in the measurement matrix can be beneficial for estimation under certain conditions. In addition, a fast and unified implementation of the MLE solution, referred to as generalized RV-ML (GRV-ML), is proposed, which handles a more general case including both underdetermined and overdetermined systems. Extensive numerical simulations are provided to validate the theoretical findings.

eess.SP

A Convex and Global Solution for the P$n$P Problem in 2D Forward-Looking Sonar

The perspective-$n$-point (P$n$P) problem is important for robotic pose estimation. It is well studied for optical cameras, but research is lacking for 2D forward-looking sonar (FLS) in underwater scenarios due to the vastly different imaging principles. In this paper, we demonstrate that, despite the nonlinearity inherent in sonar image formation, the P$n$P problem for 2D FLS can still be effectively addressed within a point-to-line (PtL) 3D registration paradigm through orthographic approximation. The registration is then resolved by a duality-based optimal solver, ensuring the global optimality. For coplanar cases, a null space analysis is conducted to retrieve the solutions from the dual formulation, enabling the methods to be applied to more general cases. Extensive simulations have been conducted to systematically evaluate the performance under different settings. Compared to non-reprojection-optimized state-of-the-art (SOTA) methods, the proposed approach achieves significantly higher precision. When both methods are optimized, ours demonstrates comparable or slightly superior precision.

cs.RO

Rejecting Outliers in 2D-3D Point Correspondences from 2D Forward-Looking Sonar Observations

Rejecting outliers before applying classical robust methods is a common approach to increase the success rate of estimation, particularly when the outlier ratio is extremely high (e.g. 90%). However, this method often relies on sensor- or task-specific characteristics, which may not be easily transferable across different scenarios. In this paper, we focus on the problem of rejecting 2D-3D point correspondence outliers from 2D forward-looking sonar (2D FLS) observations, which is one of the most popular perception device in the underwater field but has a significantly different imaging mechanism compared to widely used perspective cameras and LiDAR. We fully leverage the narrow field of view in the elevation of 2D FLS and develop two compatibility tests for different 3D point configurations: (1) In general cases, we design a pairwise length in-range test to filter out overly long or short edges formed from point sets; (2) In coplanar cases, we design a coplanarity test to check if any four correspondences are compatible under a coplanar setting. Both tests are integrated into outlier rejection pipelines, where they are followed by maximum clique searching to identify the largest consistent measurement set as inliers. Extensive simulations demonstrate that the proposed methods for general and coplanar cases perform effectively under outlier ratios of 80% and 90%, respectively.

cs.RO

Joint Multitarget Detection and Tracking with mmWave Radar

Accurate targets detection and tracking with mmWave radar is a key sensing capability that will enable more intelligent systems, create smart, efficient, automated system. This paper proposes an end-to-end detection-estimation-track framework named MNOMP-SPA-KF consisting of the target detection and estimation module, the data association (DA) module and the target tracking module. In the target estimation and detection module, a low complexity, super-resolution and constant false alarm rate (CFAR) based two dimensional multisnapshot Newtonalized orthogonal matching pursuit (2D-MNOMP) is designed to extract the multitarget's radial distances and velocities, followed by the conventional (Bartlett) beamformer to extract the multitarget's azimuths. In the DA module, a sum product algorithm (SPA) is adopted to obtain the association probabilities of the existed targets and measurements by incorporating the radial velocity information. The Kalman filter (KF) is implemented to perform target tracking in the target tracking module by exploiting the asymptotic distribution of the estimators. To improve the detection probability of the weak targets, extrapolation is also coupled into the MNOMP-SPA-KF. Numerical and real data experiments demonstrate the effectiveness of the MNOMP-SPA-KF algorithm, compared to other benchmark algorithms.

eess.SP

DM-SBL: Channel Estimation under Structured Interference

Channel estimation is a fundamental task in communication systems and is critical for effective demodulation. While most works deal with a simple scenario where the measurements are corrupted by the additive white Gaussian noise (AWGN), this work addresses the more challenging scenario where both AWGN and structured interference coexist. Such conditions arise, for example, when a sonar/radar transmitter and a communication receiver operate simultaneously within the same bandwidth. To ensure accurate channel estimation in these scenarios, the sparsity of the channel in the delay domain and the complicate structure of the interference are jointly exploited. Firstly, the score of the structured interference is learned via a neural network based on the diffusion model (DM), while the channel prior is modeled as a Gaussian distribution, with its variance controlling channel sparsity, similar to the setup of the sparse Bayesian learning (SBL). Then, two efficient posterior sampling methods are proposed to jointly estimate the sparse channel and the interference. Nuisance parameters, such as the variance of the prior are estimated via the expectation maximization (EM) algorithm. The proposed method is termed as DM based SBL (DM-SBL). Numerical simulations demonstrate that DM-SBL significantly outperforms conventional approaches that deal with the AWGN scenario, particularly under low signal-to-interference ratio (SIR) conditions. Beyond channel estimation, DM-SBL also shows promise for addressing other linear inverse problems involving structured interference.

eess.SP

A Modulo Sampling Hardware Prototype and Reconstruction Algorithm Evaluation

Analog-to-digital converters (ADCs) play a vital important role in any devices via manipulating analog signals in a digital manner. Given that the amplitude of the signal exceeds the dynamic range of the ADCs, clipping occurs and the quality of the digitized signal degrades significantly. In this paper, we design a joint modulo sampling hardware and processing prototype which improves the ADCs' dynamic range by folding the signal before sampling. Both the detailed design of the hardware and the recovery results of various state-of-the-art processing algorithms including our proposed unlimited sampling line spectral estimation (USLSE) algorithm are presented. Additionally, key issues that arise during implementation are also addressed. It is demonstrated that the USLSE algorithm successfully recovers the original signal with a frequency of 2.5 kHz and an amplitude 10 times the ADC's dynamic range, and the linear prediction (LP) algorithm successfully recovers the original signal with a frequency of 3.5 kHz and an amplitude 10 times the ADC's dynamic range.

eess.SP

On the Identifiability from Modulo Measurements under DFT Sensing Matrix

Modulo sampling (MS) has been recently introduced to enhance the dynamic range of conventional ADCs by applying a modulo operator before sampling. This paper examines the identifiability of a measurement model where measurements are taken using a discrete Fourier transform (DFT) sensing matrix, followed by a modulo operator (modulo-DFT). Firstly, we derive a necessary and sufficient condition for the unique identification of the modulo-DFT sensing model based on the number of measurements and the indices of zero elements in the original signal. Then, we conduct a deeper analysis of three specific cases: when the number of measurements is a power of $2$, a prime number, and twice a prime number. Additionally, we investigate the identifiability of periodic bandlimited (PBL) signals under MS, which can be considered as the modulo-DFT sensing model with additional symmetric and conjugate constraints on the original signal. We also provide a necessary and sufficient condition based solely on the number of samples in one period for the unique identification of the PBL signal under MS, though with an ambiguity in the direct current (DC) component. Furthermore, we show that when the oversampling factor exceeds $3(1+1/P)$, the PBL signal can be uniquely identified with an ambiguity in the DC component, where $P$ is the number of harmonics, including the fundamental component, in the positive frequency part. Finally, we also present a recovery algorithm that estimates the original signal by solving integer linear equations, and we conduct simulations to validate our conclusions.

cs.IT

Line Spectrum Estimation and Detection with Few-bit ADCs: Theoretical Analysis and Generalized NOMP Algorithm

As radar systems will be equipped with thousands of antenna elements and wide bandwidth, the associated costs and power consumption become exceedingly high, and a potential solution is to adopt low-resolution quantization technology, which not only reduces data storage needs but also lowers power and hardware costs. This paper focuses on line spectral estimation and detection (LSE\&D) with few-bit ADCs (typically 1-4 bits) by investigating the signal-to-noise ratio (SNR) loss, establishing a framework to understand the impact of intersinusoidal interference, the bit-depth of the quantizer, and the noise variance on weak signal detection in scenarios involving multiple sinusoids under low-resolution quantization. Additionally, a low-complexity, super-resolution, and constant false alarm rate (CFAR) algorithm, named generalized Newtonized orthogonal matching pursuit (GNOMP), is proposed. Extensive numerical simulations are conducted to validate the theoretical findings, particularly in terms of the detection probability bound. The effectiveness of GNOMP is demonstrated through comparisons with state-of-the-art algorithms, the Cramér Rao bound, and the detection probability bound. Real data acquired by mmWave radar further substantiates the effectiveness of GNOMP in practical applications.

eess.SP

Image-Conditional Diffusion Transformer for Underwater Image Enhancement

Underwater image enhancement (UIE) has attracted much attention owing to its importance for underwater operation and marine engineering. Motivated by the recent advance in generative models, we propose a novel UIE method based on image-conditional diffusion transformer (ICDT). Our method takes the degraded underwater image as the conditional input and converts it into latent space where ICDT is applied. ICDT replaces the conventional U-Net backbone in a denoising diffusion probabilistic model (DDPM) with a transformer, and thus inherits favorable properties such as scalability from transformers. Furthermore, we train ICDT with a hybrid loss function involving variances to achieve better log-likelihoods, which meanwhile significantly accelerates the sampling process. We experimentally assess the scalability of ICDTs and compare with prior works in UIE on the Underwater ImageNet dataset. Besides good scaling properties, our largest model, ICDT-XL/2, outperforms all comparison methods, achieving state-of-the-art (SOTA) quality of image enhancement.

cs.CV

One-Bit-Aided Modulo Sampling for DOA Estimation

Modulo sampling has recently drawn a great deal of attention for cutting-edge applications, due to overcoming the barrier of information loss through sensor saturation and clipping. This is a significant problem, especially when the range of signal amplitudes is unknown or in the near-far case. To overcome this fundamental bottleneck, we propose a one-bit-aided (1bit-aided) modulo sampling scheme for direction-of-arrival (DOA) estimation. On the one hand, one-bit quantization involving a simple comparator offers the advantages of low-cost and low-complexity implementation. On the other hand, one-bit quantization provides an estimate of the normalized covariance matrix of the unquantized measurements via the arcsin law. The estimate of the normalized covariance matrix is used to implement blind integer-forcing (BIF) decoder to unwrap the modulo samples to construct the covariance matrix, and subspace methods can be used to perform the DOA estimation. Our approach named as 1bit-aided-BIF addresses the near-far problem well and overcomes the intrinsic low dynamic range of one-bit quantization. Numerical experiments validate the excellent performance of the proposed algorithm.

eess.SP

Line Spectral Estimation via Unlimited Sampling

Frequency Modulated Continuous Wave (FMCW) radar has been widely applied in automotive anti-collision systems, automatic cruise control, and indoor monitoring. However, conventional analog-to-digital converters (ADCs) can suffer from significant information loss when strong and weak targets coexist in ranging applications. To address this issue, the Unlimited Sampling (US) strategy was proposed, which applies a modulo operator prior to sampling. In this paper, we investigate the range estimation problem using FMCW radar in the context of US, which can be formulated as a one-dimensional line spectral estimation (LSE) via US. By exploiting the oversampling property and proving that the leakage onto a certain frequency band can be controlled, we establish an integer optimization problem in the Fourier and first-order difference domain. We then propose a dynamic programming (DP) based algorithm followed by the orthogonal matching pursuit (OMP) method to solve it. In addition, a two-stage US LSE (USLSE) is proposed, where the line spectral signal is first recovered by iteratively executing DP and OMP, and then the parameters are estimated by applying a state-of-the-art LSE algorithm. Substantial numerical simulations and real experiments demonstrate that the proposed algorithm, USLSE, outperforms existing algorithms.

eess.SP

Joint Channel Estimation and Turbo Equalization of Single-Carrier Systems over Time-Varying Channels

Block transmission systems have been proven successful over frequency-selective channels. For time-varying channel such as in high-speed mobile communication and underwater communication, existing equalizers assume that channels over different data frames are independent. However, the real-world channels over different data frames are correlated, thereby indicating potentials for performance improvement. In this paper, we propose a joint channel estimation and equalization/decoding algorithm for a single-carrier system that exploits temporal correlations of channel between transmitted data frames. Leveraging the concept of dynamic compressive sensing, our method can utilize the information of several data frames to achieve better performance. The information not only passes between the channel and symbol, but also the channels over different data frames. Numerical simulations using an extensively validated underwater acoustic model with a time-varying channel establish that the proposed algorithm outperforms the former bilinear generalized approximate message passing equalizer and classic minimum mean square error turbo equalizer in bit error rate and channel estimation normalized mean square error. The algorithm idea we present can also find applications in other bilinear multiple measurements vector compressive sensing problems.

eess.SP

Information-Preserved Blending Method for Forward-Looking Sonar Mosaicing in Non-Ideal System Configuration

Forward-Looking Sonar (FLS) has started to gain attention in the field of near-bottom close-range underwater inspection because of its high resolution and high framerate features. Although Automatic Target Recognition (ATR) algorithms have been applied tentatively for object-searching tasks, human supervision is still indispensable, especially when involving critical areas. A clear FLS mosaic containing all suspicious information is in demand to help experts deal with tremendous perception data. However, previous work only considered that FLS is working in an ideal system configuration, which assumes an appropriate sonar imaging setup and the availability of accurate positioning data. Without those promises, the intra-frame and inter-frame artifacts will appear and degrade the quality of the final mosaic by making the information of interest invisible. In this paper, we propose a novel blending method for FLS mosaicing which can preserve interested information. A Long-Short Time Sliding Window (LST-SW) is designed to rectify the local statistics of raw sonar images. The statistics are then utilized to construct a Global Variance Map (GVM). The GVM helps to emphasize the useful information contained in images in the blending phase by classifying the informative and featureless pixels, thereby enhancing the quality of final mosaic. The method is verified using data collected in the real environment. The results show that our method can preserve more details in FLS mosaics for human inspection purposes in practice.

cs.CV

Expectation Propagation based Line Spectral Estimation

The fundamental problem of line spectral estimation (LSE) using the expectation propagation (EP) method is studied. Previous approaches estimate the model order sequentially, limiting their practical utility in scenarios with large dimensions of measurements and signals. To overcome this limitation, a bilinear generalized LSE (BiG-LSE) method that concurrently estimates the model order is developed. The key concept involves iteratively approximating the original nonlinear model as a bilinear model through Taylor series expansion, with EP employed for inference. To mitigate computational complexity, the posterior log-pdfs are approximated to reduce the number of messages. BiG-LSE automatically determines the model order, noise variance, provides uncertainty levels for the estimates, and adeptly handles nonlinear measurements. Based on the BiG-LSE, a variant employing the von Mises distribution for the frequency is developed, which is suitable for sequential estimation. Numerical experiments and real data are used to demonstrate that BiG-LSE achieves estimation accuracy comparable to current methods.

cs.IT

Multi-antenna Wireless Legitimate Surveillance Systems: Design and Performance Analysis

To improve national security, government agencies have long been committed to enforcing powerful surveillance measures on suspicious individuals or communications. In this paper, we consider a wireless legitimate surveillance system, where a full-duplex multi-antenna legitimate monitor aims to eavesdrop on a dubious communication link between a suspicious pair via proactive jamming. Assuming that the legitimate monitor can successfully overhear the suspicious information only when its achievable data rate is no smaller than that of the suspicious receiver, the key objective is to maximize the eavesdropping non-outage probability by joint design of the jamming power, receive and transmit beamformers at the legitimate monitor. Depending on the number of receive/transmit antennas implemented, i.e., single-input single-output, single-input multiple-output, multiple-input single-output and multiple-input multiple-output (MIMO), four different scenarios are investigated. For each scenario, the optimal jamming power is derived in closed-form and efficient algorithms are obtained for the optimal transmit/receive beamforming vectors. Moreover, low-complexity suboptimal beamforming schemes are proposed for the MIMO case. Our analytical findings demonstrate that by exploiting multiple antennas at the legitimate monitor, the eavesdropping non-outage probability can be significantly improved compared to the single antenna case. In addition, the proposed suboptimal transmit zero-forcing scheme yields similar performance as the optimal scheme.

cs.IT