首页> 外文会议>High-performance computing in remote sensing VI >OpenCL-library-based Implementation of SCLSU Algorithm for Remotely Sensed Hyperspectral Data Exploitation: clMAGMA versus viennaCL
【24h】

OpenCL-library-based Implementation of SCLSU Algorithm for Remotely Sensed Hyperspectral Data Exploitation: clMAGMA versus viennaCL

机译:基于OpenCL库的SCLSU算法用于遥感高光谱数据开发的实现:clMAGMA与viennaCL

获取原文
获取原文并翻译 | 示例

摘要

In the last decade, hyperspectral spectral unmixing (HSU) analysis have been applied in many remote sensing applications. For this process, the linear mixture model (LMM) has been the most popular tool used to find pure spectral constituents or endmembers and their fractional abundance in each pixel of the data set. The unmixing process consists of three stages: (ⅰ) estimation of the number of pure spectral signatures or endmembers, (ⅱ) automatic identification of the estimated endmembers, and (ⅲ) estimation of the fractional abundance of each endmember in each pixel of the scene. However, unmixing algorithms can be very expensive computationally, a fact that compromises their use in applications under real-time constraints. This is, mainly, due to the last two stages in the unmixing process, which are the most consuming ones. In this work, we propose parallel opencl-library-based implementations of the sum-to-one constrained least squares unmixing (P-SCLSU) algorithm to estimate the per-pixel fractional abundances by using mathematical libraries such as clMAGMA or ViennaCL. To the best of our knowledge, this kind of analysis using OpenCL libraries have not been previously conducted in the hyperspectral imaging processing literature, and in our opinion it is very important in order to achieve efficient implementations using parallel routines. The efficacy of our proposed implementations is demonstrated through Monte Carlo simulations for real data experiments and using high performance computing (HPC) platforms such as commodity graphics processing units (GPUs).
机译:在过去的十年中,高光谱光谱分解(HSU)分析已应用于许多遥感应用中。对于此过程,线性混合模型(LMM)已成为最流行的工具,用于在数据集的每个像素中查找纯光谱成分或末端成员及其分数丰度。分解过程包括三个阶段:(ⅰ)估计纯光谱特征或末端成员的数量,(ⅱ)自动识别估计的末端成员,以及(ⅲ)估计场景中每个像素中每个末端成员的分数丰度。但是,解混算法在计算上可能会非常昂贵,这一事实在实时约束下损害了它们在应用程序中的使用。这主要是由于分解过程的最后两个阶段最消耗的。在这项工作中,我们提出了基于并行Opencl-library的总和一约束最小二乘法(P-SCLSU)算法的实现,以通过使用诸如clMAGMA或ViennaCL的数学库来估计每个像素的分数丰度。据我们所知,在高光谱成像处理文献中尚未进行过使用OpenCL库的这种分析,并且在我们看来,使用并行例程实现有效的实现非常重要。通过针对实际数据实验的蒙特卡洛仿真以及使用高性能计算(HPC)平台(例如商品图形处理单元(GPU))的蒙特卡洛仿真,证明了我们提出的实施方案的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号