Skip to main content

2018 | OriginalPaper | Buchkapitel

An Evidential k-nearest Neighbors Combination Rule for Tree Species Recognition

verfasst von : Siwar Jendoubi, Didier Coquin, Reda Boukezzoula

Erschienen in: Belief Functions: Theory and Applications

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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 classification 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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
This work has been supported by the French National Agency for Research with the reference ANR-15-CES38-0004 (ReVeRIES project).
 
Literatur
1.
Zurück zum Zitat Ben Ameur, R., Coquin, D., Valet, L.: Influence of the basic belief assignments construction on the behavior of a fusion system for tree species recognition. In: Proceedings of 20th International Conference on Information Fusion, Xi’an, China, IEEE FUSION, July 2017 Ben Ameur, R., Coquin, D., Valet, L.: Influence of the basic belief assignments construction on the behavior of a fusion system for tree species recognition. In: Proceedings of 20th International Conference on Information Fusion, Xi’an, China, IEEE FUSION, July 2017
2.
Zurück zum Zitat Bertrand, S., Ameur, R.B., Cerutti, G., Coquin, D., Valet, L., Tougne, L.: Bark and leaf fusion systems to improve automatic tree species recognition. Ecol. Inf. 46, 57–73 (2018)CrossRef Bertrand, S., Ameur, R.B., Cerutti, G., Coquin, D., Valet, L., Tougne, L.: Bark and leaf fusion systems to improve automatic tree species recognition. Ecol. Inf. 46, 57–73 (2018)CrossRef
3.
Zurück zum Zitat Cerutti, G., Tougne, L., Mille, J., Vacavant, A., Coquin, D.: Understanding leaves in natural images-a model-based approach for tree species identification. Comput. Vis. Image Underst. 117(10), 1482–1501 (2013)CrossRef Cerutti, G., Tougne, L., Mille, J., Vacavant, A., Coquin, D.: Understanding leaves in natural images-a model-based approach for tree species identification. Comput. Vis. Image Underst. 117(10), 1482–1501 (2013)CrossRef
4.
Zurück zum Zitat Cetin, M.C., Erar, A.: Variable selection with akaike information criteria: a comparative study. Hacettepe J. Math. Stat. 31, 89–97 (2002)MathSciNetMATH Cetin, M.C., Erar, A.: Variable selection with akaike information criteria: a comparative study. Hacettepe J. Math. Stat. 31, 89–97 (2002)MathSciNetMATH
5.
Zurück zum Zitat Dempster, A.P.: Upper and lower probabilities induced by a multivalued mapping. Ann. Math. Stat. 38, 325–339 (1967)MathSciNetCrossRef Dempster, A.P.: Upper and lower probabilities induced by a multivalued mapping. Ann. Math. Stat. 38, 325–339 (1967)MathSciNetCrossRef
6.
Zurück zum Zitat Denœux, T.: A \(k\)-nearest neighbor classification rule based on Dempster-Shafer theory. IEEE Trans. Syst. Man Cybern. Part A Syst. Hum. 25(5), 804–813 (1995)CrossRef Denœux, T.: A \(k\)-nearest neighbor classification rule based on Dempster-Shafer theory. IEEE Trans. Syst. Man Cybern. Part A Syst. Hum. 25(5), 804–813 (1995)CrossRef
7.
Zurück zum Zitat Goëau, H., et al.: Pl@ntnet mobile app. In: Proceedings of the 21st ACM International Conference on Multimedia, pp. 423–424 (2013) Goëau, H., et al.: Pl@ntnet mobile app. In: Proceedings of the 21st ACM International Conference on Multimedia, pp. 423–424 (2013)
8.
Zurück zum Zitat Lian, C., Ruan, S., Denœux, T.: An evidential classifier based on feature selection and two-step classification strategy. Pattern Recognit. 48(7), 2318–2327 (2015)CrossRef Lian, C., Ruan, S., Denœux, T.: An evidential classifier based on feature selection and two-step classification strategy. Pattern Recognit. 48(7), 2318–2327 (2015)CrossRef
9.
Zurück zum Zitat Shafer, G.: A Mathematical Theory of Evidence. Princeton University Press, Belmont (1976)MATH Shafer, G.: A Mathematical Theory of Evidence. Princeton University Press, Belmont (1976)MATH
10.
Zurück zum Zitat Smets, P.: Belief functions: the disjunctive rule of combination and the generalized Bayesian theorem. Int. J. Approximate Reasoning 9, 1–35 (1993)MathSciNetCrossRef Smets, P.: Belief functions: the disjunctive rule of combination and the generalized Bayesian theorem. Int. J. Approximate Reasoning 9, 1–35 (1993)MathSciNetCrossRef
11.
Zurück zum Zitat Su, Z.G., Denoeux, T., Hao, Y.S., Zhao, M.: Evidential k-NN classification with enhanced performance via optimizing a class of parametric conjunctive t-rules. Knowl. Based Syst. 142, 7–16 (2018)CrossRef Su, Z.G., Denoeux, T., Hao, Y.S., Zhao, M.: Evidential k-NN classification with enhanced performance via optimizing a class of parametric conjunctive t-rules. Knowl. Based Syst. 142, 7–16 (2018)CrossRef
12.
Zurück zum Zitat Sudano, J.J.: Inverse pignistic probability transforms. In: Proceedings of FUSION, pp. 763–768 (2002) Sudano, J.J.: Inverse pignistic probability transforms. In: Proceedings of FUSION, pp. 763–768 (2002)
13.
Zurück zum Zitat Zhou, K., Martin, A., Pan, Q.: Evidence combination for a large number of sources. In: Proceedings of 20th International Conference on Information Fusion, Xi’an, China, IEEE FUSION, July 2017 Zhou, K., Martin, A., Pan, Q.: Evidence combination for a large number of sources. In: Proceedings of 20th International Conference on Information Fusion, Xi’an, China, IEEE FUSION, July 2017
14.
Zurück zum Zitat Zouhal, L.M., Denœux, T.: An evidence-theoric \(k\)-NN rule with parameter optimization. IEEE Trans. Syst. Man Cybern. Part C Appl. Rev. 28(2), 263–271 (1998)CrossRef Zouhal, L.M., Denœux, T.: An evidence-theoric \(k\)-NN rule with parameter optimization. IEEE Trans. Syst. Man Cybern. Part C Appl. Rev. 28(2), 263–271 (1998)CrossRef
Metadaten
Titel
An Evidential k-nearest Neighbors Combination Rule for Tree Species Recognition
verfasst von
Siwar Jendoubi
Didier Coquin
Reda Boukezzoula
Copyright-Jahr
2018
DOI
https://doi.org/10.1007/978-3-319-99383-6_17

Premium Partner