Spherical nearest neighbor classification: Application to hyperspectral data

2Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The problem of feature transformation arises in many fields of information processing including machine learning, data compression, computer vision and geoscientific applications. In this paper, we investigate the transformation of hyperspectral data to a coordinate system that preserves geodesic distances on a constant curvature space. The transformation is performed using the recently proposed spherical embedding method. Based on the properties of hyperspherical surfaces and their relationship with local tangent spaces we propose three spherical nearest neighbor metrics for classification. As part of experimental validation, results on modeling multi-class multispectral data using the proposed spherical geodesic nearest neighbor, the spherical mahalanobis nearest neighbor and the spherical discriminant adaptive nearest neighbor rules are presented. The results indicate that the proposed metrics yields better classification accuracies especially for difficult tasks in spaces with complex irregular class boundaries. This promising outcome serves as a motivation for further development of new models to analyze hyperspectral images in spherical manifolds. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Lunga, D., & Ersoy, O. (2011). Spherical nearest neighbor classification: Application to hyperspectral data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6871 LNAI, pp. 170–184). https://doi.org/10.1007/978-3-642-23199-5_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free