Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Joonhyeon Bae

dblp:409/3379 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
0009-0004-5417-7968ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Artificial intelligence
1 paper
Representation and self-supervised learning · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › multimedia analysis and retrieval
audio-text retrieval
0.912025
Understanding Audio-Text Retrieval Through Singular Value Decomposition · SIGIR 2025
Information retrieval
multimedia analysis and retrieval
0.912025
Understanding Audio-Text Retrieval Through Singular Value Decomposition · SIGIR 2025
Machine learning › Representation and self-supervised learning
contrastive learning
0.312025
Understanding Audio-Text Retrieval Through Singular Value Decomposition · SIGIR 2025

Methods — techniques the papers use, named apart from their topics

singular value decomposition · 1.7contrastive learning · 1.7
YearPublicationVenuePosition
2025 Synthetic Dataset Generation for String Ensemble Separation
abstract
Most studies on music source separation have traditionally concentrated on separating popular music into vocals, bass, drums, and others, with fewer studies focusing on chamber ensemble audio. The task of separating sources from chamber ensemble audio presents greater challenges due to factors like timbral similarity, high synchronization, and spectral overlap. These complexities necessitate more refined and realistic datasets for effective chamber ensemble separation. Yet, the creation of such datasets faces numerous challenges, depending on the methods of dataset formation. Taking these challenges into account, our work seeks to enhance the performance of chamber ensemble separation tasks, with a particular focus on string quartets. Based on dataset generation using a neural synthesis model, we propose an approach that incorporates musical expressions into the dataset generation process using MusicXML files. Furthermore, our framework adapt reverberation to the audio to better match the target mixtures. Our objective evaluation shows an increase in performance of chamber ensemble separation, supported by a subjective listening test to demonstrate improvement in our dataset. We also release our dataset and source code for further usage.
Joonhyeon Bae, Eunsik Shin, Kyogu Lee
ICASSP2
2025 Understanding Audio-Text Retrieval Through Singular Value Decomposition
abstract
Audio-language retrieval faces a fundamental challenge due to many-to-one mappings, where multiple audio instances correspond to the same or similar textual descriptions. This ambiguity leads to overlapping representations, making it difficult for models to learn discriminative features between samples. Queue-based contrastive learning helps mitigate this ambiguity by maintaining a large pool of negatives, improving retrieval performance. However, selecting appropriate hyperparameters, such as the queue size for optimal performance and the number of epochs to prevent overfitting, remains a challenge. In this study, we propose a LAtent Space Embedding Rank (LASER) analysis. Specifically, we analyze that a low-rank property of a queue indicates the presence of informative negative samples, and demonstrate that the best performance is achieved when the queue has the lowest rank. Furthermore, the convergence of rank variation can be interpreted as the model parameters reaching an optimal state during training. Thanks to the proposed rank-based analysis, the model hyperparameters can be selected analytically rather than through trial and error. Experimental results confirm that retrieval performance depends on queue rank, with lower ranks yielding better performance. These findings suggest that our LASER analysis can provide insight into how rank-based analysis can improve retrieval performance in audio-language tasks.
Yoori Oh, Yoseob Han, Joonhyeon Bae, Jaeheon Sim, Kyogu Lee
SIGIR3