CART-based feature selection of hyperspectral images for crop cover classification

Image Processing, 2003. ICIP 2003. Proceedings. 2003 International Conference(2003)

引用 30|浏览12
暂无评分
摘要
In this paper, we propose a procedure to reduce data dimensionality while preserving relevant information for posterior crop cover classification. The huge amount of data involved in hyperspectral image processing is one of the main problems in order to apply pattern recognition techniques. We propose a dimensionality reduction strategy that eliminates redundant information and a subsequent selection of the most discriminative features based on classification and regression trees (CART). CART allow feature selection based on the classification success, it is a non-linear method and specially allows knowledge discovery. The main advantage of our proposal relies on model interpretability, since we can get qualitative information by analyzing the surrogate and main splits of the tree. This method is tested with a crop cover recognition application of six hyperspectral images from the same area acquired with the 128-bands HyMap spectrometer. Even though CART do not provide the best results in classification it is useful for a previous pre-processing step of feature selection. Finally, we analyze the selected bands of the input space in order to gain knowledge on the problem and to give a physical interpretation of results.
更多
查看译文
关键词
feature extraction,image classification,vegetation mapping,classification and regression trees,crop cover classification,data dimensionality,dimensionality reduction strategy,feature selection,hyperspectral images,knowledge discovery,pattern recognition techniques
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要