arXiv subjects

Fanqin Meng

Publications and source records attributed to Fanqin Meng.

8 recordsLinked to original sources

arXiv2026

A Similarity Network for Correlating Musical Structure to Military Strategy

Music perception, a multi-sensory process based on the synesthesia effect, is an essential component of music aesthetic education. Understanding music structure helps both perception and aesthetic education. Music structure incorporates a range of information, the coordination of which forms the melody, just as different military actions cooperate to produce a military strategy. However, there are a few ways for assessing music perception from the perspectives of system operation and information management. In this paper, we explore the similarities between music structure and military strategy while creating the Music Clips Correlation Network (MCCN) based on Mel-frequency Cepstral Coefficients (MFCCs). The inspiration comes from the comparison between a concert conductor's musical score and a military war commander's sand table exercise. Specifically, we create MCCNs for various kinds of war movie soundtracks, then relate military tactics (Sun Tzu's Art of War, etc.) and political institutions to military operations networks. Our primary findings suggest a few similarities, implying that music perception and aesthetic education can be approached from a military strategy and management perspective through this interdisciplinary research. Similarly, we can discover similarities between the art of military scheming and the art of musical structure based on network analysis in order to facilitate the understanding of the relationship between technology and art.

cs.SD↗

arXiv2025

Enhancing Speech Emotion Recognition with Multi-Task Learning and Dynamic Feature Fusion

This study investigates fine-tuning self-supervised learn ing (SSL) models using multi-task learning (MTL) to enhance speech emotion recognition (SER). The framework simultane ously handles four related tasks: emotion recognition, gender recognition, speaker verification, and automatic speech recog nition. An innovative co-attention module is introduced to dy namically capture the interactions between features from the primary emotion classification task and auxiliary tasks, en abling context-aware fusion. Moreover, We introduce the Sam ple Weighted Focal Contrastive (SWFC) loss function to ad dress class imbalance and semantic confusion by adjusting sam ple weights for difficult and minority samples. The method is validated on the Categorical Emotion Recognition task of the Speech Emotion Recognition in Naturalistic Conditions Chal lenge, showing significant performance improvements.

cs.SD↗

arXiv2024

Destination-Constrained Linear Dynamical System Modeling in Set-Valued Frameworks

Directional motion towards a specified destination is a common occurrence in physical processes and human societal activities. Utilizing this prior information can significantly improve the control and predictive performance of system models. This paper primarily focuses on reconstructing linear dynamic system models based on destination constraints in the set-valued framework. We treat destination constraints as inherent information in the state evolution process and employ convex optimization techniques to construct a coherent and robust state model. This refined model effectively captures the impact of destination constraints on the state evolution at each time step. Furthermore, we design an optimal weight matrix for the reconstructed model to ensure smoother and more natural trajectories of state evolution. We also analyze the theoretical guarantee of optimality for this weight matrix and the properties of the reconstructed model. Finally, simulation experiments verify that the reconstructed model has significant advantages over the unconstrained and unoptimized weighted models and constrains the evolution of state trajectories with different starting and ending points.

eess.SY↗

arXiv2023

On Communication-Efficient Multisensor Track Association via Measurement Transformation (Extended Version)

Multisensor track-to-track fusion for target tracking involves two primary operations: track association and estimation fusion. For estimation fusion, lossless measurement transformation of sensor measurements has been proposed for single target tracking. In this paper, we investigate track association which is a fundamental and important problem for multitarget tracking. First, since the optimal track association problem is a multi-dimensional assignment (MDA) problem, we demonstrate that MDA-based data association (with and without prior track information) using linear transformations of track measurements is lossless, and is equivalent to that using raw track measurements. Second, recent superior scalability and performance of belief propagation (BP) algorithms enable new real-time applications of multitarget tracking with resource-limited devices. Thus, we present a BP-based multisensor track association method with transformed measurements and show that it is equivalent to that with raw measurements. Third, considering communication constraints, it is more beneficial for local sensors to send in compressed data. Two analytical lossless transformations for track association are provided, and it is shown that their communication requirements from each sensor to the fusion center are less than those of fusion with raw track measurements. Numerical examples for tracking an unknown number of targets verify that track association with transformed track measurements has the same performance as that with raw measurements and requires fewer communication bandwidths.

cs.IT↗

arXiv2022

Seamless Tracking of Group Targets and Ungrouped Targets Using Belief Propagation

This paper considers the problem of tracking a large-scale number of group targets. Usually, multi-target in most tracking scenarios are assumed to have independent motion and are well-separated. However, for group target tracking (GTT), the targets within groups are closely spaced and move in a coordinated manner, the groups can split or merge, and the numbers of targets in groups may be large, which lead to more challenging data association, filtering and computation problems. Within the belief propagation (BP) framework, we propose a scalable group target belief propagation (GTBP) method by jointly inferring target existence variables, group structure, data association and target states. The method can efficiently calculate the approximations of the marginal posterior distributions of these variables by performing belief propagation on the devised factor graph. As a consequence, GTBP is capable of capturing the changes in group structure, e.g., group splitting and merging. Furthermore, we model the evolution of targets as the co-action of the group or single-target motions specified by the possible group structures and corresponding probabilities. This flexible modeling enables seamless and simultaneous tracking of multiple group targets and ungrouped targets. Particularly, GTBP has excellent scalability and low computational complexity. It not only maintains the same scalability as BP, i.e., scaling linearly in the number of sensor measurements and quadratically in the number of targets, but also only scales linearly in the number of preserved group partitions. Finally, numerical experiments are presented to demonstrate the effectiveness and scalability of the proposed GTBP method.

cs.LG↗

arXiv2021

Randomized Multiple Model Multiple Hypothesis Tracking

This paper considers the data association problem for multi-target tracking. Multiple hypothesis tracking is a popular algorithm for solving this problem but it is NP-hard and is is quite complicated for a large number of targets or for tracking maneuvering targets. To improve tracking performance and enhance robustness, we propose a randomized multiple model multiple hypothesis tracking method, which has three distinctive advantages. First, it yields a randomized data association solution which maximizes the expectation of the logarithm of the posterior probability and can be solved efficiently by linear programming. Next, the state estimation performance is improved by the random coefficient matrices Kalman filter, which mitigates the difficulty introduced by randomized data association, i.e., where the coefficient matrices of the dynamic system are random. Third, the probability that the target follows a specific dynamic model is derived by jointly optimizing the multiple possible models and data association hypotheses, and it does not require prior mode transition probabilities. Thus, it is more robust for tracking multiple maneuvering targets. Simulations demonstrate the efficiency and superior results of the proposed algorithm over interacting multiple model multiple hypothesis tracking.

cs.IT↗

arXiv2019

Multiple-Source Ellipsoidal Localization Using Acoustic Energy Measurements

In this paper, the multiple-source ellipsoidal localization problem based on acoustic energy measurements is investigated via set-membership estimation theory. When the probability density function of measurement noise is unknown-but-bounded, multiple-source localization is a difficult problem since not only the acoustic energy measurements are complicated nonlinear functions of multiple sources, but also the multiple sources bring about a high-dimensional state estimation problem. First, when the energy parameter and the position of the source are bounded in an interval and a ball respectively, the nonlinear remainder bound of the Taylor series expansion is obtained analytically on-line. Next, based on the separability of the nonlinear measurement function, an efficient estimation procedure is developed. It solves the multiple-source localization problem by using an alternating optimization iterative algorithm, in which the remainder bound needs to be known on-line. For this reason, we first derive the remainder bound analytically. When the energy decay factor is unknown but bounded, an efficient estimation procedure is developed based on interval mathematics. Finally, numerical examples demonstrate the effectiveness of the ellipsoidal localization algorithms for multiple-source localization. In particular, our results show that when the noise is non-Gaussian, the set-membership localization algorithm performs better than the EM localization algorithm.

cs.IT↗

arXiv2019

Dual Set Membership Filter with Minimizing Nonlinear Transformation of Ellipsoid

In this paper, we propose a dual set membership filter for nonlinear dynamic systems with unknown but bounded noises, and it has three distinctive properties. Firstly, the nonlinear system is translated into the linear system by leveraging a semi-infinite programming, rather than linearizing the nonlinear function. In fact, the semi-infinite programming is to find an ellipsoid bounding the nonlinear transformation of an ellipsoid, which aims to compute a tight ellipsoid to cover the state. Secondly, the duality result of the semi-infinite programming is derived by a rigorous analysis, then a first order Frank-Wolfe method is developed to efficiently solve it with a lower computation complexity. Thirdly, the proposed filter can take advantage of the linear set membership filter framework and can work on-line without solving the semidefinite programming problem. Furthermore, we apply the dual set membership filter to a typical scenario of mobile robot localization. Finally, two illustrative examples in the simulations show the advantages and effectiveness of the dual set membership filter.

math.DS↗