Speaker Diarization Using Divide-and-Conquer

被引:0
|
作者
Cheng, Shih-Sian [1 ]
Tseng, Chun-Han [2 ]
Chen, Chia-Ping [2 ]
Wang, Hsin-Min [1 ]
机构
[1] Acad Sinica, Inst Informat Sci, Taipei, Taiwan
[2] Natl Sun Yat Sen Univ, Dept Comp Sci & Engn, Kaohsiung, Taiwan
关键词
speaker diarization; speaker segmentation; speaker clustering; divide-and-conquer; SEGMENTATION;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Speaker diarization systems usually consist of two core components: speaker segmentation and speaker clustering. The current state-of-the-art speaker diarization systems usually apply hierarchical agglomerative clustering (HAC) for speaker clustering after segmentation. However, HAC's quadratic computational complexity with respect to the number of data samples inevitably limits its application in large-scale data sets. In this paper, we propose a divide-and-conquer (DAC) framework for speaker diarization. It recursively partitions the input speech stream into two sub-streams, performs diarization on them separately, and then combines the diarization results obtained from them using HAC. The results of experiments conducted on RT-02 and RT-03 broadcast news data show that the proposed framework is faster than the conventional segmentation and clustering-based approach while achieving comparable diarization accuracy. Moreover, the proposed framework obtains a higher speedup over the conventional approach on a larger test data set.
引用
收藏
页码:1059 / +
页数:2
相关论文
共 50 条
  • [41] Divide-and-conquer Tournament on Social Networks
    Jiasheng Wang
    Yichao Zhang
    Jihong Guan
    Shuigeng Zhou
    [J]. Scientific Reports, 7
  • [42] Divide-and-Conquer for Voronoi Diagrams Revisited
    Aichholzer, Oswin
    Aigner, Wolfgang
    Aurenhammer, Franz
    Hackl, Thomas
    Juettler, Bert
    Pilgerstorfer, Elisabeth
    Rabl, Margot
    [J]. PROCEEDINGS OF THE TWENTY-FIFTH ANNUAL SYMPOSIUM ON COMPUTATIONAL GEOMETRY (SCG'09), 2009, : 189 - 197
  • [43] Recommendation for Newborn Services by Divide-and-Conquer
    Zhang, Junqi
    Fan, Yushun
    Tan, Wei
    Zhang, Jia
    [J]. 2017 IEEE 24TH INTERNATIONAL CONFERENCE ON WEB SERVICES (ICWS 2017), 2017, : 57 - 64
  • [44] DIVIDE-AND-CONQUER, AUGUSTINE IN THE 'DIVINE COMEDY'
    HAWKINS, PS
    [J]. PMLA-PUBLICATIONS OF THE MODERN LANGUAGE ASSOCIATION OF AMERICA, 1991, 106 (03): : 471 - 482
  • [45] Divide-and-conquer Tournament on Social Networks
    Wang, Jiasheng
    Zhang, Yichao
    Guan, Jihong
    Zhou, Shuigeng
    [J]. SCIENTIFIC REPORTS, 2017, 7
  • [46] A DIVIDE-AND-CONQUER ALGORITHM FOR THE BIDIAGONAL SVD
    GU, M
    EISENSTAT, SC
    [J]. SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1995, 16 (01) : 79 - 92
  • [47] A divide-and-conquer algorithm for curve fitting
    Buchinger, Diego
    Rosso Jr, Roberto Silvio Ubertino
    [J]. COMPUTER-AIDED DESIGN, 2022, 151
  • [48] Divide-and-Conquer Strategies for Process Mining
    Carmona, Josep
    Cortadella, Jordi
    Kishinevsky, Michael
    [J]. BUSINESS PROCESS MANAGEMENT, PROCEEDINGS, 2009, 5701 : 327 - +
  • [49] Divide-and-conquer Jigsaw Puzzle Solving
    Shih, Huang-Chia
    Lu, Chien-Liang
    [J]. 2018 IEEE INTERNATIONAL CONFERENCE ON VISUAL COMMUNICATIONS AND IMAGE PROCESSING (IEEE VCIP), 2018,
  • [50] APPROXIMATIONS AND OPTIMAL GEOMETRIC DIVIDE-AND-CONQUER
    MATOUSEK, J
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1995, 50 (02) : 203 - 208