paper-with-me

Papers

Self-supervised Representation Learning With Path Integral Clustering For Speaker Diarization

2021-04-19 · Prachi Singh, Sriram Ganapathy

Automatic speaker diarization techniques typically involve a two-stage processing approach where audio segments of fixed duration are converted to vector representations in the first stage. This is followed by an unsupervised clustering of the representations in the second stage. In most of the prior approaches, these two stages are performed in an isolated manner with independent optimization steps. In this paper, we propose a representation learning and clustering algorithm that can be iteratively performed for improved speaker diarization. The representation learning is based on principles of self-supervised learning while the clustering algorithm is a graph structural method based on path integral clustering (PIC). The representation learning step uses the cluster targets from PIC and the clustering step is performed on embeddings learned from the self-supervised deep model. This iterative approach is referred to as self-supervised clustering (SSC). The diarization experiments are performed on CALLHOME and AMI meeting datasets. In these experiments, we show that the SSC algorithm improves significantly over the baseline system (relative improvements of 13% and 59% on CALLHOME and AMI datasets respectively in terms of diarization error rate (DER)). In addition, the DER results reported in this work improve over several other recent approaches for speaker diarization.

📄 PDF Abstract BibTeX arXiv:2104.09456

Code (1)

iiscleap/SSC 공식 구현 pytorch

Tasks

ClusteringRepresentation LearningSelf-Supervised Learningspeaker-diarizationSpeaker Diarization

Similar Papers 제목 키워드 기반

Agglomerative clustering and collectiveness measure via exponent generating function

2015-07-30 · Wei-Ya Ren, Shuo-Hao Li, Qiang Guo, Guo-Hui Li 외

The key in agglomerative clustering is to define the affinity measure between two sets. A novel agglomerative clustering method is proposed by utilizing the path integral to define the affinity measure. Firstly, the path…

Clustering

HeMI: Multi-view Embedding in Heterogeneous Graphs

2021-09-14 · Costas Mavromatis, George Karypis

Many real-world graphs involve different types of nodes and relations between nodes, being heterogeneous by nature. The representation learning of heterogeneous graphs (HGs) embeds the rich structure and semantics of suc…

ClusteringLink PredictionNode ClassificationNode Clustering+1

Improving Representation Learning for Histopathologic Images with Cluster Constraints

2023-10-18 · ICCV 2023 1 · Weiyi Wu, Chongyang Gao, Joseph DiPalma, Soroush Vosoughi 외

Recent advances in whole-slide image (WSI) scanners and computational capabilities have significantly propelled the application of artificial intelligence in histopathology slide analysis. While these strides are promisi…

ClusteringRepresentation LearningSelf-Supervised Learning

Learning Integral Representations of Gaussian Processes

2018-02-21 · Zilong Tan, Sayan Mukherjee

We propose a representation of Gaussian processes (GPs) based on powers of the integral operator defined by a kernel function, we call these stochastic processes integral Gaussian processes (IGPs). Sample paths from IGPs…

Dimensionality ReductionGaussian Processesregression

Divide-and-Rule: Self-Supervised Learning for Survival Analysis in Colorectal Cancer

2020-07-07 · Christian Abbet, Inti Zlobec, Behzad Bozorgtabar, Jean-Philippe Thiran

With the long-term rapid increase in incidences of colorectal cancer (CRC), there is an urgent clinical need to improve risk stratification. The conventional pathology report is usually limited to only a few histopatholo…

ClusteringDeep ClusteringSelf-Supervised LearningSurvival Analysis