arXiv subjects

Hongqi Fan

Publications and source records attributed to Hongqi Fan.

11 recordsLinked to original sources

arXiv2025

From Target Tracking to Targeting Track -- Part I: A Metric for Spatio-Temporal Trajectory Evaluation

In the realm of target tracking, performance evaluation plays a pivotal role in the design, comparison, and analytics of trackers. Compared with the traditional trajectory composed of a set of point-estimates obtained by a tracker in the measurement time-series, the trajectory that our series of studies including this paper pursued is given by a curve function of time (FoT). The trajectory FoT provides complete information of the movement of the target over time and can be used to infer the state corresponding to arbitrary time, not only at the measurement time. However, there are no metrics available for comparing and evaluating the trajectory FoT. To address this lacuna, we propose a metric denominated as the spatiotemporal-aligned trajectory integral distance (Star-ID). The StarID associates and aligns the estimated and actual trajectories in the spatio-temporal domain and distinguishes between the time-aligned and unaligned segments in calculating the spatial divergence including false alarm, miss-detection and localization errors. The effectiveness of the proposed distance metric and the time-averaged version is validated through theoretical analysis and numerical examples of a single target or multiple targets.

eess.SY↗

arXiv2023

Arithmetic Average Density Fusion -- Part III: Heterogeneous Unlabeled and Labeled RFS Filter Fusion

This paper proposes a heterogenous density fusion approach to scalable multisensor multitarget tracking where the inter-connected sensors run different types of random finite set (RFS) filters according to their respective capacity and need. These diverse RFS filters result in heterogenous multitarget densities that are to be fused with each other in a proper means for more robust and accurate detection and localization of the targets. Our approach is based on Gaussian mixture implementations where the local Gaussian components (L-GCs) are revised for PHD consensus, i.e., the corresponding unlabeled probability hypothesis densities (PHDs) of each filter best fit their average regardless of the specific type of the local densities. To this end, a computationally efficient, coordinate descent approach is proposed which only revises the weights of the L-GCs, keeping the other parameters unchanged. In particular, the PHD filter, the unlabeled and labeled multi-Bernoulli (MB/LMB) filters are considered. Simulations have demonstrated the effectiveness of the proposed approach for both homogeneous and heterogenous fusion of the PHD-MB-LMB filters in different configurations.

eess.SY↗

arXiv2021

Arithmetic Average Density Fusion -- Part I: Some Statistic and Information-theoretic Results

Finite mixture such as the Gaussian mixture is a flexible and powerful probabilistic modeling tool for representing the multimodal distribution widely involved in many estimation and learning problems. The core of it is representing the target distribution by the arithmetic average (AA) of a finite number of sub-distributions which constitute a mixture. While the mixture has been widely used for single sensor filter design, it is only recent that the AA fusion demonstrates compelling performance for multi-sensor filter design. In this paper, some statistic and information-theoretic results are given on the covariance consistency, mean square error, mode-preservation capacity, and the information divergence of the AA fusion approach. In particular, based on the concept of conservative fusion, the relationship of the AA fusion with the existing conservative fusion approaches such as covariance union and covariance intersection is exposed. A suboptimal weighting approach has been proposed, which jointly with the best mixture-fit property of the AA fusion leads to a max-min optimization problem. Linear Gaussian models are considered for algorithm illustration and simulation comparison, resulting in the first-ever AA fusion-based multi-sensor Kalman filter.

math.ST↗

arXiv2021

From Target Tracking to Targeting Track: A Data-Driven Yet Analytical Approach to Joint Target Detection and Tracking

This paper addresses the problem of real-time detection and tracking of a non-cooperative target in the challenging scenario with almost no a-priori information about target birth, death, dynamics and detection probability. Furthermore, there are false and missing data at an unknown yet low rate in the measurements. The only information given in advance is about the target-measurement model and the constraint that there is no more than one target in the scenario. To solve these challenges, we model the movement of the target by using a polynomial trajectory function of time (T-FoT), which aims to estimate the continuous-time trajectory of the target rather than a series of discrete-time point estimates as is done in most existing filters/trackers. Data-driven T-FoT initiation and termination strategies are proposed for identifying the (re-)appearance and disappearance of the target. During the existence of the target, real target measurements are distinguished from clutter if the target indeed exists and is detected, in order to update the T-FoT at each scan for which we design a least-squares estimator. Overall, our approach is Markov-free, data-driven yet analytical. Simulations using either linear or nonlinear systems are conducted to demonstrate the effectiveness of our approach in comparison with the Bayes optimal Bernoulli filters. The results show that our approach is comparable to the perfectly modeled filters, even outperforms them in some cases while requiring much less a-priori information and computing much faster.

eess.SY↗

arXiv2019

Second Order Statistics Analysis and Comparison between Arithmetic and Geometric Average Fusion

Two fundamental approaches to information averaging are based on linear and logarithmic combination, yielding the arithmetic average (AA) and geometric average (GA) of the fusing initials, respectively. In the context of target tracking, the two most common formats of data to be fused are random variables and probability density functions, namely $v$-fusion and $f$-fusion, respectively. In this work, we analyze and compare the second order statistics (including variance and mean square error) of AA and GA in terms of both $v$-fusion and $f$-fusion. The case of weighted Gaussian mixtures representing multitarget densities in the presence of false alarms and misdetection (whose weight sums are not necessarily unit) is also considered, the result of which appears significantly different from that for a single target. In addition to exact derivation, exemplifying analysis and illustrations are provided.

eess.SY↗

arXiv2015

Bayesian De-quantization and Data Compression for Low-Energy Physiological Signal Telemonitoring

We address the issue of applying quantized compressed sensing (CS) on low-energy telemonitoring. So far, few works studied this problem in applications where signals were only approximately sparse. We propose a two-stage data compressor based on quantized CS, where signals are compressed by compressed sensing and then the compressed measurements are quantized with only 2 bits per measurement. This compressor can greatly reduce the transmission bit-budget. To recover signals from underdetermined, quantized measurements, we develop a Bayesian De-quantization algorithm. It can exploit both the model of quantization errors and the correlated structure of physiological signals to improve the quality of recovery. The proposed data compressor and the recovery algorithm are validated on a dataset recorded on 12 subjects during fast running. Experiment results showed that an averaged 2.596 beat per minute (BPM) estimation error was achieved by jointly using compressed sensing with 50% compression ratio and a 2-bit quantizer. The results imply that we can effectively transmit n bits instead of n samples, which is a substantial improvement for low-energy wireless telemonitoring.

cs.IT↗

arXiv2014

Energy Efficient Telemonitoring of Physiological Signals via Compressed Sensing: A Fast Algorithm and Power Consumption Evaluation

Wireless telemonitoring of physiological signals is an important topic in eHealth. In order to reduce on-chip energy consumption and extend sensor life, recorded signals are usually compressed before transmission. In this paper, we adopt compressed sensing (CS) as a low-power compression framework, and propose a fast block sparse Bayesian learning (BSBL) algorithm to reconstruct original signals. Experiments on real-world fetal ECG signals and epilepsy EEG signals showed that the proposed algorithm has good balance between speed and data reconstruction fidelity when compared to state-of-the-art CS algorithms. Further, we implemented the CS-based compression procedure and a low-power compression procedure based on a wavelet transform in Filed Programmable Gate Array (FPGA), showing that the CS-based compression can largely save energy and other on-chip computing resources.

cs.IT↗

arXiv2013

Compression via Compressive Sensing : A Low-Power Framework for the Telemonitoring of Multi-Channel Physiological Signals

Telehealth and wearable equipment can deliver personal healthcare and necessary treatment remotely. One major challenge is transmitting large amount of biosignals through wireless networks. The limited battery life calls for low-power data compressors. Compressive Sensing (CS) has proved to be a low-power compressor. In this study, we apply CS on the compression of multichannel biosignals. We firstly develop an efficient CS algorithm from the Block Sparse Bayesian Learning (BSBL) framework. It is based on a combination of the block sparse model and multiple measurement vector model. Experiments on real-life Fetal ECGs showed that the proposed algorithm has high fidelity and efficiency. Implemented in hardware, the proposed algorithm was compared to a Discrete Wavelet Transform (DWT) based algorithm, verifying the proposed one has low power consumption and occupies less computational resources.

cs.IT↗

arXiv2013

Fast Marginalized Block Sparse Bayesian Learning Algorithm

The performance of sparse signal recovery from noise corrupted, underdetermined measurements can be improved if both sparsity and correlation structure of signals are exploited. One typical correlation structure is the intra-block correlation in block sparse signals. To exploit this structure, a framework, called block sparse Bayesian learning (BSBL), has been proposed recently. Algorithms derived from this framework showed superior performance but they are not very fast, which limits their applications. This work derives an efficient algorithm from this framework, using a marginalized likelihood maximization method. Compared to existing BSBL algorithms, it has close recovery performance but is much faster. Therefore, it is more suitable for large scale datasets and applications requiring real-time implementation.

cs.IT↗

arXiv2013

Scan-based Compressed Terahertz Imaging and Real-Time Reconstruction via the Complex-valued Fast Block Sparse Bayesian Learning Algorithm

Compressed Sensing based Terahertz imaging (CS-THz) is a computational imaging technique. It uses only one THz receiver to accumulate the random modulated image measurements where the original THz image is reconstruct from these measurements using compressed sensing solvers. The advantage of the CS-THz is its reduced acquisition time compared with the raster scan mode. However, when it applied to large-scale two-dimensional (2D) imaging, the increased dimension resulted in both high computational complexity and excessive memory usage. In this paper, we introduced a novel CS-based THz imaging system that progressively compressed the THz image column by column. Therefore, the CS-THz system could be simplified with a much smaller sized modulator and reduced dimension. In order to utilize the block structure and the correlation of adjacent columns of the THz image, a complex-valued block sparse Bayesian learning algorithm was proposed. We conducted systematic evaluation of state-of-the-art CS algorithms under the scan based CS-THz architecture. The compression ratios and the choices of the sensing matrices were analyzed in detail using both synthetic and real-life THz images. Simulation results showed that both the scan based architecture and the proposed recovery algorithm were superior and efficient for large scale CS-THz applications.

cs.CV↗

arXiv2013

The Annealing Sparse Bayesian Learning Algorithm

In this paper we propose a two-level hierarchical Bayesian model and an annealing schedule to re-enable the noise variance learning capability of the fast marginalized Sparse Bayesian Learning Algorithms. The performance such as NMSE and F-measure can be greatly improved due to the annealing technique. This algorithm tends to produce the most sparse solution under moderate SNR scenarios and can outperform most concurrent SBL algorithms while pertains small computational load.

cs.IT↗