Unsupervised Discovery of Sign Terms by K-Nearest Neighbours Approach


Polat K., SARAÇLAR M.

Workshops held at the 16th European Conference on Computer Vision, ECCV 2020, Glasgow, İngiltere, 23 - 28 Ağustos 2020, cilt.12536 LNCS, ss.310-321, (Tam Metin Bildiri)

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası: 12536 LNCS
  • Doi Numarası: 10.1007/978-3-030-66096-3_22
  • Basıldığı Şehir: Glasgow
  • Basıldığı Ülke: İngiltere
  • Sayfa Sayıları: ss.310-321
  • Anahtar Kelimeler: Unsupervised learning, Sign language, Term discovery
  • Boğaziçi Üniversitesi Adresli: Evet

Özet

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.