No abstract

In order to simultaneously improve system performance and resource utilization of distributed multiple-input multiple-output (MIMO) radar systems, a joint resource allocation method is proposed to address the velocity estimation problem for multiple targets tracking in this paper. The paper focuses to improve the tracking performance for key targets using the remaining resources when the general targets have obtained resources to reach to tracking requirements. Firstly, a criterion minimizing the velocity estimation mean square error (MSE) for a key target is considered. Restricted by limited and relatively sufficient system resources and given velocity estimation requirements for general targets, a joint resource allocation optimization model with transmitters, receivers, transmitted power, and signal time is established. We propose a suboptimal method to approximately solve this problem. The method separates the optimization into three steps, where each step transforms the corresponding mixed-Boolean optimization problem into a second-order cone programming (SOCP) problem by convex relaxation. Finally, the approximately optimal solution can be obtained by cyclic minimization method. Extensive simulations indicate that compared with other methods, the proposed joint method can achieve the lowest velocity estimation MSE with the fewest transmitters. Meanwhile, limited by the given velocity estimation MSE, the proposed method can focus on the key target and achieve the whole velocity estimation error minimization while a greater flexibility for target tracking number can be obtained. Moreover, random experiments can further validate and evaluate the proposed method's effectiveness and traceability with the given scenario.

Considering the demands of different location accuracy for multiple targets tracking, performance-driven resource allocation schemes in distributed MIMO radar system are proposed. Restricted by the tracking antenna number, location estimation meansquare error (MSE), and target priorities, an optimization problem of the minimal antenna subsets selection is modeled as a knapsack problem. Then, two operational schemes, modified fair multistart local search (MFMLS) algorithm and modified fair multistart local search with one antenna to all targets (MFMLS_OAT) algorithm, are presented and evaluated. Simulation results indicate that the proposed MFMLS and MFMLS_OAT algorithm outperform the existing algorithms. Moreover, the MFMLS algorithm can distinguish targets with different priorities, while the MFMLS_OAT algorithm can perform the tracking tasks with higher accuracy.

Single-trial electroencephalogram detection has been widely applied in brain-computer interface (BCI) systems. Moreover, an individual generalized model is significant for applying the dynamic visual target detection BCI system in real life because of the time jitter of the detection latency, the dynamics and complexity of visual background. Hence, we developed an unsupervised multi-source domain adaptation network (P3-MSDA) for dynamic visual target detection. In this network, a P3 map-clustering method was proposed for source domain selection. The adversarial domain adaptation was conducted for domain alignment to eliminate individual differences, and prediction probabilities were ranked and returned to guide the input of target samples for imbalanced data classification. The results showed that individuals with a strong P3 map selected by the proposed P3 map-clustering method perform best on the source domain. Compared with existing schemes, the proposed P3-MSDA network achieved the highest classification accuracy and F1 score using five labeled individuals with a strong P3 map as the source domain. These findings can have a significant meaning in building an individual generalized model for dynamic visual target detection.