In this paper, we present a multi-dimensional extension of an image feature extractor, the scale saliency algorithm by Kadir and Brady. In order to avoid the curse of dimensionality, our algorithm is based on a recent Shannon's entropy estimator and on a new divergence metric in the spirit of Friedman's and Rafsky estimation of Henze-Penrose divergence. The experiments show that, compared to our previous existing method based on entropic graphs, this approach remarkably decreases computation time, while not significantly deterioring the quality of the results. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Suau, P., & Escolano, F. (2009). A new feasible approach to multi-dimensional scale saliency. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5807 LNCS, pp. 77–88). https://doi.org/10.1007/978-3-642-04697-1_8
Mendeley helps you to discover research relevant for your work.