A Fast N-FINDR Algorithm Based on Cofactor of a Determinant
-
摘要: 基于高光谱图像特征空间几何分布的端元提取方法通常可分为投影类算法和单形体体积最大类算法,通常前者精度不好,后者计算复杂度较高。该文提出一种基于代数余子式的快速N-FINDR端元提取算法(FCA),该算法融合了投影类算法速度快和单形体体积最大类算法精度高的优势,利用像元投影到端元矩阵元素的代数余子式构成的向量上的方法,寻找最大体积的单形体。此外,该算法在端元搜索方面较为灵活,每次迭代都可用纯度更高的像元代替已有端元,因此能保证用该端元确定的单形体,可以将特征空间中全部像元包含在内。仿真和实际高光谱数据实验结果表明,该文算法在精准提取出端元的同时,收敛速度非常快。Abstract: Endmember extraction methods based on geometric?distribution of hyperspectral images usually divide into projection algorithm and the maximum volume formula for simplex, which the former has lower computational complexity and the latter has better precision. A Fast endmember extraction method based on Cofactor of a determinant Algorithm (FCA) is proposed. The algorithm combines the two kinds of algorithms, and which means it has a high speed and accuracy performance for endmember extraction. FCA finds the max volume of simplex by making pixels project to vectors, which are composed of the cofactors of elements in endmember determinant. Besides, FCA is flexible in endmember search, for it can use higher purity pixels to replace the endmembers extracted in the last iteration, which ensures that all the endmembers extracted by FCA are the vertices of simplex. The theoretical analysis and experiments on both simulated and real hyperspectral data demonstrate that the proposed algorithm is a fast and accurate algorithm for endmember extraction.
-
Key words:
- Image processing /
- Hyperspectral /
- Endmember extraction /
- Simplex /
- Maximum volume /
- Cofactor /
- Projection
计量
- 文章访问数: 1802
- HTML全文浏览量: 138
- PDF下载量: 676
- 被引次数: 0