Unsupervised Discovery of Sign Terms by K-Nearest Neighbours Approach
Abstract
In order to utilize the large amount of unlabeled sign language resources, unsupervised learning methods are needed. Motivated by the successful results of unsupervised term discovery (UTD) in spoken languages, here we explore how to apply similar methods for sign terms discovery. Our goal is to find the repeating terms from continuous sign videos without any supervision. Using visual features extracted from RGB videos, we show that a k-nearest neighbours based discovery algorithm designed for speech can also discover sign terms. We also run experiments using a baseline UTD algorithm and comment on their differences.
Cite
Text
Polat and Saraçlar. "Unsupervised Discovery of Sign Terms by K-Nearest Neighbours Approach." European Conference on Computer Vision Workshops, 2020. doi:10.1007/978-3-030-66096-3_22Markdown
[Polat and Saraçlar. "Unsupervised Discovery of Sign Terms by K-Nearest Neighbours Approach." European Conference on Computer Vision Workshops, 2020.](https://mlanthology.org/eccvw/2020/polat2020eccvw-unsupervised/) doi:10.1007/978-3-030-66096-3_22BibTeX
@inproceedings{polat2020eccvw-unsupervised,
title = {{Unsupervised Discovery of Sign Terms by K-Nearest Neighbours Approach}},
author = {Polat, Korhan and Saraçlar, Murat},
booktitle = {European Conference on Computer Vision Workshops},
year = {2020},
pages = {310-321},
doi = {10.1007/978-3-030-66096-3_22},
url = {https://mlanthology.org/eccvw/2020/polat2020eccvw-unsupervised/}
}