LE-CAM++: A Lighter and More Efficient CAM++ for Speaker Verification

Due to its superior performance and fewer parameters, CAM++ has become the state-of-the-art model for speaker verification tasks. This model uses 2D convolutional blocks to extract front-end features, which are then fed into a densely connected time-delay neural network backbone to extract deep features. However, the simple stacking of 2D convolutions may lead to the generation of a significant amount of redundant features, which is detrimental to efficient feature extraction. Furthermore, although CAM++ already has a relatively small number of parameters, there is still room for further optimization. To address these issues, this paper first employs depthwise separable convolutions to replace the dilated convolutions in the back-end network of CAM++, making the model more lightweight. Next, we introduce spatial and channel reconstruction convolution (SCConv) in the ResBlock module of CAM++ to reduce redundant features and optimize the feature extraction process. Finally, after SCConv, we apply squeeze and excitation attention mechanism to model the interdependencies between channels and recalibrate each channel, further enhancing the model's representational capacity. We name the resulting model LE-CAM++. Our proposed model achieves an EER of 0.686 and a minDCF of 0.084 on the VoxCeleb1–O dataset. Compared to the baseline model CAM ++, the EER is reduced by 11%, and the minDCF is reduced by 28%. Additionally, the model parameters are reduced by 8%.

Authors

Institutions

Publication Details

Published
2024-11-07
DOI
https://doi.org/10.1109/iscslp63861.2024.10800177
Citations
1
Primary Topic
Speech Recognition and Synthesis
Type
article
Field-Weighted Citation Impact
0.35
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

LE-CAM++: A Lighter and More Efficient CAM++ for Speaker Verification

Zhihua Fang, Zhida Song, Liang He, Shuanghong Liu
1 citations
Speech Recognition and Synthesis
0.35
article

LE-CAM++: A Lighter and More Efficient CAM++ for Speaker Verification

Zhihua Fang, Zhida Song, Liang He, Shuanghong Liu
article en
1 citations

Abstract

Due to its superior performance and fewer parameters, CAM++ has become the state-of-the-art model for speaker verification tasks. This model uses 2D convolutional blocks to extract front-end features, which are then fed into a densely connected time-delay neural network backbone to extract deep features. However, the simple stacking of 2D convolutions may lead to the generation of a significant amount of redundant features, which is detrimental to efficient feature extraction. Furthermore, although CAM++ already has a relatively small number of parameters, there is still room for further optimization. To address these issues, this paper first employs depthwise separable convolutions to replace the dilated convolutions in the back-end network of CAM++, making the model more lightweight. Next, we introduce spatial and channel reconstruction convolution (SCConv) in the ResBlock module of CAM++ to reduce redundant features and optimize the feature extraction process. Finally, after SCConv, we apply squeeze and excitation attention mechanism to model the interdependencies between channels and recalibrate each channel, further enhancing the model's representational capacity. We name the resulting model LE-CAM++. Our proposed model achieves an EER of 0.686 and a minDCF of 0.084 on the VoxCeleb1–O dataset. Compared to the baseline model CAM ++, the EER is reduced by 11%, and the minDCF is reduced by 28%. Additionally, the model parameters are reduced by 8%.

Xinjiang University (CN)
Openalex Percentile: Top 30%
Speech Recognition and Synthesis
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.