Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2108.09058

Estimation of Playable Piano Fingering by Pitch-difference Fingering Matching Model

Haoyue Zhao·Xin Guan·Qiang Li
View original source ↗Read source document ↗Export metadata ↓

Abstract

The existing piano fingering labeling statistical models usually consider the constraints among the fingers and the correlation between fingering and notes, and rarely include the relationship among the notes directly. The limited learned finger-transfer rules often cause that some parts of the fingering cannot be playable in fact. And traditional models often adopt the original notes, which cannot help to explore the mapping nature between the pitches and fingering. Inspired from manual-ly annotation which acquire the fingering knowledge directly from pitch-difference, we proposed a pitch-difference sequence and fingering (PdF) matching model. And to get playable fingering, be-sides learned finger-transfer rules, prior finger-transfer knowledge is especially combined into the model. In order to characterize the playable performance of the model, we also presented a new evaluation index named incapable-performing fingering rate (IFR). Comprehensive experimental re-sults show that compared with the existing state-of-the-art third-order hidden Markov labeling model, the general and the highest matching rate of our model increases by 3% and 1.6% respective-ly, and the fingering for all scores can be playable.

Explore related subjects

cs.SD

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Haoyue Zhao, Xin Guan, Qiang Li. 2021-08-20. Estimation of Playable Piano Fingering by Pitch-difference Fingering Matching Model. https://arxiv.org/abs/2108.09058

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Xiaomi-CocktailASR-1 Technical Report

Recently, large language model (LLM) based ASR models have achieved significant progress, yet they generally lack support for multi-speaker scenarios, where the cocktail party problem remains a critical bottleneck for further advancing ASR. Existing TS-ASR methods, including end-to-end architectures with speaker embeddings and latest LLM-based explorations suffer from degraded single-speaker performance and the inability to reject when the target speaker is absent. In this paper, we propose Xiaomi-CocktailASR-1, an LLM-based end-to-end TS-ASR architecture. By utilizing reference speech as voiceprint prompts, it directly transcribes the target speaker's speech without requiring speech separation. Xiaomi-CocktailASR-1 maintains competitive performance in single-speaker scenarios, comparable to mainstream ASR models. It also features a negative sample rejection capability, outputting empty text when the target speaker is absent from the mixed speech. Additionally, Xiaomi-CocktailASR-1 supports a Chain-of-Thought (CoT) reasoning mode to provide explicit reasoning steps. Extensive experiments on various synthetic and real-world multispeaker benchmarks demonstrate that Xiaomi-CocktailASR-1 achieves state-of-the-art performance, effectively addressing the cocktail party problem through a unified architecture that balances multispeaker and single-speaker recognition accuracy, along with rejection capability.

cs.SD↗
arXiv2026

EConv-TasNet: Efficient Conv-TasNet for Effective Speech Separation

Conv-TasNet has served as a strong baseline for time-domain speech separation, and many studies have extended it with advanced architectures such as dual-path networks, U-Nets, and attention mechanisms. However, these methods often introduce high computational cost and complexity, limiting their deployment in resource-constrained scenarios. To address this issue, we propose eConv-TasNet, an efficient variant of Conv-TasNet that improves both effectiveness and efficiency without relying on resource-intensive modules. The proposed model consists of a group-wise early-splitting (GES) module and a multi-group feature aggregation (MGFA) module. GES generates discriminative speaker embeddings at intermediate stages, while MGFA progressively aggregates these group-level representations for refined mask estimation. Experimental results show that eConv-TasNet reduces model size by 22.4%, accelerates inference by 18.9%, and improves SI-SNRi by 14.0%-28.0% across three public benchmarks. Moreover, it achieves competitive performance compared with state-of-the-art methods while requiring significantly fewer parameters and lower inference cost. These results demonstrate a favorable efficiency-effectiveness trade-off for edge deployment.

cs.SD↗