Text-independent speaker recognition using graph matching

@article{Hautamki2008TextindependentSR,
  title={Text-independent speaker recognition using graph matching},
  author={Ville Hautam{\"a}ki and Tomi Kinnunen and Pasi Fr{\"a}nti},
  journal={Pattern Recognition Letters},
  year={2008},
  volume={29},
  pages={1427-1432}
}
Technical mismatches between the training and matching conditions adversely affect the performance of a speaker recognition system. In this paper, we present a matching scheme which is invariant to feature rotation, translation and uniform scaling. The proposed approach uses a neighborhood graph to represent the global shape of the feature distribution. The reference and test graphs are aligned by graph matching and the match score is computed using conventional template matching. Experiments… CONTINUE READING
6 Citations
22 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Graph Theory, second ed

  • R. Diestel
  • 2000
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…