Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2002.04990

Periodicity Pitch Detection in Complex Harmonies on EEG Timeline Data

Maria Heinze·Lars Hausfeld·Rainer Goebel·Frieder Stolzenburg
View original source ↗Read source document ↗Export metadata ↓

Abstract

An acoustic stimulus, e.g., a musical harmony, is transformed in a highly non-linear way during the hearing process in ear and brain. We study this by comparing the frequency spectrum of an input stimulus and its response spectrum in the auditory processing stream using the frequency following response (FFR). Using electroencephalography (EEG), we investigate whether the periodicity pitches of complex harmonies (which are related to their missing fundamentals) are added in the auditory brainstem by analyzing the FFR. While other experiments focus on common musical harmonies like the major and the minor triad and dyads, we also consider the suspended chord. The suspended chord causes tension foreign to the common triads and therefore holds a special role among the triads. While watching a muted nature documentary, the participants hear synthesized classic piano triads and single tones with a duration of 300ms for the stimulus and 100ms interstimulus interval. We acquired EEG data of 64 electrodes with a sampling rate of 5kHz to get a detailed enough resolution of the perception process in the human brain. Applying a fast Fourier transformation (FFT) on the EEG response, starting 50ms after stimulus onset, the evaluation of the frequency spectra shows that the periodicity pitch frequencies calculated beforehand +/-3Hz occur with some accuracy. However, jitter turned out as a problem here. Note that the sought-for periodicity pitch frequencies do not physically exist in the frequency spectra of the stimuli.

Explore related subjects

cs.SDeess.AS

Keep this discovery

BibTeXRIS

Maria Heinze, Lars Hausfeld, Rainer Goebel, Frieder Stolzenburg. 2020-02-11. Periodicity Pitch Detection in Complex Harmonies on EEG Timeline Data. https://arxiv.org/abs/2002.04990

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↗