An evidential k-nearest neighbors combination rule for tree species recognition - Archive ouverte HAL Access content directly
Conference Papers Year :

An evidential k-nearest neighbors combination rule for tree species recognition

(1, 2) , (2) , (2)
1
2

Abstract

The task of tree species recognition is to recognize the tree species using photos of their leaves and barks. In this paper, we propose an evidential k-nearest neighbors (k-NN) combination rule. The proposed rule is adapted to classication problems where we have a large number of classes with an intra-class variability and an inter-class similarity like the problem of tree species recognition. Finally, we compare the performance of the proposed solution to the evidential k-NN.
Fichier principal
Vignette du fichier
kNN-LNS1.pdf (355.28 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01953169 , version 1 (12-12-2018)

Identifiers

  • HAL Id : hal-01953169 , version 1

Cite

Siwar Jendoubi, Didier Coquin, Reda Boukezzoula. An evidential k-nearest neighbors combination rule for tree species recognition. 5th International Conference, Belief 2018, Sep 2018, Compiègne, France. ⟨hal-01953169⟩
32 View
82 Download

Share

Gmail Facebook Twitter LinkedIn More