arXiv subjects

Baifeng Li

Publications and source records attributed to Baifeng Li.

3 recordsLinked to original sources

arXiv2024

EMALG: An Enhanced Mandarin Lombard Grid Corpus with Meaningful Sentences

This study investigates the Lombard effect, where individuals adapt their speech in noisy environments. We introduce an enhanced Mandarin Lombard grid (EMALG) corpus with meaningful sentences , enhancing the Mandarin Lombard grid (MALG) corpus. EMALG features 34 speakers and improves recording setups, addressing challenges faced by MALG with nonsense sentences. Our findings reveal that in Mandarin, meaningful sentences are more effective in enhancing the Lombard effect. Additionally, we uncover that female exhibit a more pronounced Lombard effect than male when uttering meaningful sentences. Moreover, our results reaffirm the consistency in the Lombard effect comparison between English and Mandarin found in previous research.

cs.SD↗

arXiv2023

Mandarin Lombard Flavor Classification

The Lombard effect refers to individuals' unconscious modulation of vocal effort in response to variations in the ambient noise levels, intending to enhance speech intelligibility. The impact of different decibel levels and types of background noise on Lombard effects remains unclear. Building upon the characteristic of Lombard speech that individuals adjust their speech to improve intelligibility dynamically based on the self-feedback speech, we propose a flavor classification approach for the Lombard effect. We first collected Mandarin Lombard speech under different noise conditions, then simulated self-feedback speech, and ultimately conducted the statistical test on the word correct rate. We found that both SSN and babble noise types result in four distinct categories of Mandarin Lombard speech in the range of 30 to 80 dBA with different transition points.

cs.SD↗

arXiv2015

Research on Solution Space of Bipartite Graph Vertex-Cover by Maximum Matchings

Some rigorous results and statistics of the solution space of Vertex-Covers on bipartite graphs are given in this paper. Based on the $K\ddot{o}nig$'s theorem, an exact solution space expression algorithm is proposed and statistical analysis of the nodes' states is provided. The statistical results fit well with the algorithmic results until the emergence of the unfrozen core, which makes the fluctuation of statistical quantities and causes the replica symmetric breaking in the solutions. Besides, the entropy of bipartite Vertex-Cover solutions is calculated with the clustering entropy using a cycle simplification technique for the unfrozen core. Furthermore, as generalization of bipartite graphs, bipartite core graph is proposed, the solution space of which can also be easily determined; and based on these results, how to generate a $K\ddot{o}nig-Egerv\acute{a}ry$ subgraph is studied by a growth process of adding edges. The investigation of solution space of bipartite graph Vertex-Cover provides intensive understanding and some insights on the solution space complexity, and will produce benefit for finding maximal $K\ddot{o}nig-Egerv\acute{a}ry$ subgraphs, solving general graph Vertex-Cover and recognizing the intrinsic hardness of NP-complete problems.

cs.DS↗