Is Hamming distance only way for matching binary image feature descriptors?

Creative Commons License

Bostanci E.

ELECTRONICS LETTERS, cilt.50, sa.11, ss.806-807, 2014 (SCI-Expanded) identifier identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 50 Sayı: 11
  • Basım Tarihi: 2014
  • Doi Numarası: 10.1049/el.2014.0773
  • Dergi Adı: ELECTRONICS LETTERS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.806-807
  • Ankara Üniversitesi Adresli: Evet

Özet

Brute force matching of binary image feature descriptors is conventionally performed using the Hamming distance. The use of alternative metrics is assessed in order to see whether they can produce feature correspondences that yield more accurate homography matrices. Two statistical tests, namely analysis of variance (ANOVA) and McNemar's test were employed for the evaluation. Results show that Jackard-Needham and Dice metrics can display better performance for some descriptors. Yet, these performance differences were not found to be statistically significant.