arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1506.02585cs.LG
收藏

最优稀疏核学习在高光谱异常检测中的应用

Optimal Sparse Kernel Learning for Hyperspectral Anomaly Detection

U.S. Army Research Laboratory(美国陆军研究实验室);Rice University(莱斯大学)

Zhimin Peng, Prudhvi Gurram, Heesung Kwon, Wotao Yin

摘要:

提出了一种基于稀疏核学习的支持向量数据描述(SVDD)异常检测框架。在这项工作中,最佳的稀疏特征选择异常检测建模为一个混合规划(MIP)问题。由于MIP的高计算复杂性,它被放松成一个二次约束线性规划(QCLP)问题。QCLP问题可以通过使用迭代优化方法来实际解决,在该方法中,与单个子集相反,迭代地找到多个特征子集。基于QCLP的迭代优化问题在称为\emph{Empirical Kernel Feature Space}(EKFS)的有限空间中而不是在输入空间或\emph{Reproducing Kernel Hilbert Space}(RKHS)中求解。这是可能的,因为EKFS和相应的RKHS的几何特性保持相同。现在,可以在有限的EKFS中对数据进行显式的非线性利用,从而获得最佳的特征排名。基于高光谱图像的实验结果表明,所提出的方法可以提供更好的性能比当前国家的最先进的技术。

英文摘要:

In this paper, a novel framework of sparse kernel learning for Support Vector Data Description (SVDD) based anomaly detection is presented. In this work, optimal sparse feature selection for anomaly detection is first modeled as a Mixed Integer Programming (MIP) problem. Due to the prohibitively high computational complexity of the MIP, it is relaxed into a Quadratically Constrained Linear Programming (QCLP) problem. The QCLP problem can then be practically solved by using an iterative optimization method, in which multiple subsets of features are iteratively found as opposed to a single subset. The QCLP-based iterative optimization problem is solved in a finite space called the \emph{Empirical Kernel Feature Space} (EKFS) instead of in the input space or \emph{Reproducing Kernel Hilbert Space} (RKHS). This is possible because of the fact that the geometrical properties of the EKFS and the corresponding RKHS remain the same. Now, an explicit nonlinear exploitation of the data in a finite EKFS is achievable, which results in optimal feature ranking. Experimental results based on a hyperspectral image show that the proposed method can provide improved performance over the current state-of-the-art techniques.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑