arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1807.08084math.NAcs.DScs.NAeess.SPstat.CO

快速矩阵求逆与行列式计算用于极化合成孔径雷达

Fast Matrix Inversion and Determinant Computation for Polarimetric Synthetic Aperture Radar

Graduate Program of Electrical and Computer Engineering Department, University of Calgary(卡尔加里大学电气与计算机工程研究生项目);Signal Processing Group, Departamento de Estatística, Universidade Federal de Pernambuco(伯南布哥联邦大学统计系信号处理组);Department of Electrical and Computer Engineering, University of Calgary(卡尔加里大学电气与计算机工程系);Laboratório de Computação Científica e Análise Numérica, Universidade Federal de Alagoas(阿拉戈阿斯联邦大学科学计算与数值分析实验室)

D. F. G. Coelho, R. J. Cintra, A. C. Frery, V. S. Dimitrov

AI总结:

本文提出一种快速算法,用于极化合成孔径雷达图像处理中小型矩阵的求逆和行列式计算,基于伴随矩阵和输入矩阵的对称性,实现GPU加速,相比传统Cholesky分解方法有约两倍的加速效果。

摘要:

本文介绍了一种快速算法,用于在全极化合成孔径雷达(PolSAR)图像处理和分析中同时求解小型矩阵的逆和行列式。所提出的快速算法基于伴随矩阵的计算和输入矩阵的对称性。该算法在通用图形处理单元(GPGPU)上实现,并与基于Cholesky分解的传统方法进行了比较。使用模拟观测数据和实际PolSAR传感器数据的评估显示,与传统Cholesky分解相比,该方法的速度提升约为两倍。此外,本文提供的表达式可以在任何平台上实现。

英文摘要:

This paper introduces a fast algorithm for simultaneous inversion and determinant computation of small sized matrices in the context of fully Polarimetric Synthetic Aperture Radar (PolSAR) image processing and analysis. The proposed fast algorithm is based on the computation of the adjoint matrix and the symmetry of the input matrix. The algorithm is implemented in a general purpose graphical processing unit (GPGPU) and compared to the usual approach based on Cholesky factorization. The assessment with simulated observations and data from an actual PolSAR sensor show a speedup factor of about two when compared to the usual Cholesky factorization. Moreover, the expressions provided here can be implemented in any platform.

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

↑