In this paper, we consider the recovery of low-rank matrices from noisy observations using spectral denoisers, where the singular values are denoised through an identical scalar smoothing function. We explore the asymptotic mean squared error (AMSE) of these denoisers within a framework where the rank of the matrix to be recovered grows linearly with the matrix size. We demonstrate that, under arbitrary i.i.d. noise and some mild regularity assumptions, the AMSE converges in probability to a deterministic function of the noise power. Our results are applicable to commonly used denoisers, including the best-rank-r denoiser, the singular-value soft-threshold denoiser, and the singular-value hard-threshold denoiser.