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 条
  • [31] Design of electronic circuits using a divide-and-conquer approach
    He, Guoliang
    Li, Yuanxiang
    Yu, Li
    Zhang, Wei
    Tu, Hang
    [J]. EVOLVABLE SYSTEMS: FROM BIOLOGY TO HARDWARE, PROCEEDINGS, 2007, 4684 : 13 - +
  • [32] AVERAGE COMPLEXITY OF DIVIDE-AND-CONQUER ALGORITHMS
    VEROY, BS
    [J]. INFORMATION PROCESSING LETTERS, 1988, 29 (06) : 319 - 326
  • [33] A divide-and-conquer approach to evolvable hardware
    Torresen, J
    [J]. EVOLVABLE SYSTEMS: FROM BIOLOGY TO HARDWARE, 1998, 1478 : 57 - 65
  • [34] Divide-and-Conquer With Sequential Monte Carlo
    Lindsten, F.
    Johansen, A. M.
    Naesseth, C. A.
    Kirkpatrick, B.
    Schon, T. B.
    Aston, J. A. D.
    Bouchard-Cote, A.
    [J]. JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS, 2017, 26 (02) : 445 - 458
  • [35] SOLUTION OF A DIVIDE-AND-CONQUER MAXIMIN RECURRENCE
    LI, Z
    REINGOLD, EM
    [J]. SIAM JOURNAL ON COMPUTING, 1989, 18 (06) : 1188 - 1200
  • [36] Synthesis of Implementations for Divide-and-Conquer Specifications
    Bortin, Maksym
    [J]. FORMAL METHODS: FOUNDATIONS AND APPLICATIONS, SBMF 2022, 2022, 13768 : 73 - 88
  • [37] A DIVIDE-AND-CONQUER METHOD FOR POLYNOMIAL ZEROS
    FREEMAN, TL
    BRANKIN, RW
    [J]. JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 1990, 30 (01) : 71 - 79
  • [38] A DIVIDE-AND-CONQUER ALGORITHM FOR GRID GENERATION
    DOUGHERTY, RL
    HYMAN, JM
    [J]. APPLIED NUMERICAL MATHEMATICS, 1994, 14 (1-3) : 125 - 134
  • [39] FINDING RECTANGLE INTERSECTIONS BY DIVIDE-AND-CONQUER
    GUTING, RH
    WOOD, D
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1984, 33 (07) : 671 - 675
  • [40] A frame for general divide-and-conquer recurrences
    Wang, XD
    Fu, QX
    [J]. INFORMATION PROCESSING LETTERS, 1996, 59 (01) : 45 - 51