共查询到18条相似文献，搜索用时 140 毫秒
1.
在应用快速Hartly变换(FHT)或快速Fourier变换(FFT)计算Stokes积分公式时,总是先将Stokes 公式化成卷积形式,然后用 FHT或 FFT完成卷积运算,从而避免了复杂费时的积分计算。但由于 Stokes公式不严格满足卷积定义,欲将其化成卷积形式必须作一些近似。这种近似虽能在一定精度范围满足要求,但对于高精度要求仍有不能允许的计算误差。本文建议采用球面坐标转换方法,能有效地消除无论是用 FHT或 FFT 计算Stokes 积分卷积化所带来的误差影响。 相似文献
2.
为了实现精密星历数据的高速率播发,码移键控(CSK)调制技术将是下一代卫星导航系统的重要选项.CSK调制信号在解调时需要遍历计算各种码相位偏移的相关值,因此通常使用基于快速傅里叶变换(FFT)的频域解调算法.根据CSK频域解调仅需FFT部分输出结果的特点,提出了基于部分输出FFT的CSK信号频域解调算法.该算法对传统FFT的蝶形解算结构进行优化,通过定义计算节点以消除与输出结果无关的计算,从而降低解调的计算复杂度.以码率为1.023 Mcps的CSK(4,1023)调制信号为例,所提算法可节省约45.6%的计算量,这对下一代卫星导航接收机的设计具有重要的意义. 相似文献
3.
自然灾害发生后,由于救灾的紧迫性,应急测绘保障要求我们第一时间提供处理后的灾区影像,但是现阶段我们仅能做到原始影像的快速获取,无法有效地快速处理遥感影像。本文研究了图形处理器(GPU)的并行可编程性和CUDA编程模型特征,通过对遥感影像正射纠正,快速傅里叶变换(FFT)和高斯差分算法的CUDA编程设计,在GPU上实现这三种算法的快速并行处理,并与CPU结果对比,证明GPU能够在数据精度和CPU保持一致的基础上大幅缩短遥感影像处理时间,加速比可以达到一个数量级。 相似文献
4.
从快速 Hartley变换 (FHT)基本概念入手 ,给出了 Hotine核在平面近似、球面近似、Molodenskii近似下的反演模型。另对 FHT处理中所需的坐标转换以及边缘效应等问题加以讨论。同时 ,为了改善长波特性的重力场信息 ,利用 M阶次的参考重力场对上述 Molo-denskii模型进行了改化。 相似文献
5.
提出了一种用于Stokes积分和Hotine积分直接离散求和的快速算法。该算法将积分核表达为计算点纬度、流动点纬度和两点间经度差的函数,充分利用核函数的对称性,相同纬度的所有计算点只需计算一组核函数,计算次数远少于普通离散求和。基于EGM2008地球重力位模型的模拟实验表明,快速算法的计算效率远高于普通算法,有效解决了离散求和计算速度太慢的数值问题,且保留了球面积分的特性,可取代一维FFT用于计算Stokes积分和Hotine积分。 相似文献
6.
四种改进积分法的低空扰动引力计算 总被引：1，自引：0，他引：1
针对Stokes积分方法计算扰动引力中计算点从空中趋近地面时存在积分奇异和不连续的问题,该文提出了去中央奇异点法、奇异点积分值修正法、中央格网加密算法和改进积分式法4种改进Stokes积分的计算公式,并进行了实验计算。计算结果表明:近地空间范围内,4种改进算法都能在一定程度上改进原始积分的奇异性问题;相同条件下,奇异点积分值修正法和改进积分式法计算精度最高,适宜于低空计算;改进积分式法通过理论推导,得到了从球外部到球面统一、连续且无奇异的改进Stokes积分公式,理论严谨。 相似文献
7.
合成孔径雷达(SAR)图像会受到相干斑噪声的污染,对SAR图像的后续处理产生了很大影响.提出一种基于快速离散曲波变换(FDCT)抑制合成孔径雷达(SAR)图像相干斑噪声的方法.先通过FDCT把SAR图像变换到曲波域中,得到曲波系数,再应用自适应阈值算法估计不同尺度、不同方位曲波系数的阈值,分别对曲波系数进行硬阈值和软阈值化处理,最后通过FDCT反变换恢复出图像.对单视SAR原始图像进行处理,并与小波去噪方法进行各种量化比较,结果表明,Curvelet滤波器要比Wavelet滤波器效果好,软阈值算法的效果比硬阈值算法好.基于FDCT的SAR图像相干斑去噪,不仅抑制相干斑能力比较强,而且在目标的边缘及纹理信息的保持上也有很大的优势. 相似文献
8.
为提高利用逆Stokes公式反演测高重力的精度,将中央区大地水准面高表示成双三次多项式插值形式,引入了非奇异变换,推导出了重力异常的计算公式。大地水准面高理论模型下的分析表明,该公式有较高的精度。以分辨率为2′×2′的大地水准面高数据为背景场进行了实际计算,结果说明中央区对反演重力异常有不容忽视的贡献。本文导出的公式可为高精度重力异常的反演提供理论依据。 相似文献
9.
高斯投影的复变换与实变换相比具有独特的优势.使用Maple计算机代数系统,高斯投影正算及反算变换的核心就是方程求解及复积分计算.本文对高斯投影复变换进行了改进,只需建立正算变换计算式而不需要针对反算变换再建立一套变换计算式,给出了Maple系统方程求解的求根函数法以及复积分计算的积分级数分析法、椭圆积分函数法及直接积分... 相似文献
10.
论文系统研究了利用航空重力数据以及联合航空重力与地面重力数据确定高精度区域大地水准面的理论模型、实用算法和关键技术,细致分析了其中存在的关键问题,提出了多项思路、模型和方法以突破关键性难点.论文的主要工作和创新之处体现在:
(1)提出一种用于Stokes和Hotine积分等球面积分直接离散求和的快速算法,解决球面积分离散求和计算效率太低的数值问题.对于10°×10°范围共计57 600个点的2.5'×2.5'格网重力数据,积分球冠区半径取3°时,新算法用于基于解析核的Stokes和Hotine积分时计算速度比普通算法快约48倍,用于基于级数核的Stokes和Hotine积分时分别比普通算法快约276倍和294倍. 相似文献
11.
NING JinshengLI JianchengCHAO DingboNING Jinsheng Academician Professor School of Geo-science Surveying Engineering WTUSM Wuhan China 《地球空间信息科学学报》1998,(1)
This paper presents a method for the computation of the Stokes for-mula using the Fast Hartley Transform（FHT）techniques.The algorithm is mostsuitable for the computation of real sequence transform,while the Fast FourierTransform（FFT）techniques are more suitable for the computaton of complex se-quence transform.A method of spherical coordinate transformation is presented inthis paper.By this method the errors,which are due to the approximate term inthe convolution of Stokes formula,can be effectively eliminated.Some numericaltests are given.By a comparison with both FFT techniques and numerical integra-tion method,the results show that the resulting values of geoidal undulations byFHT techniques are almost the same as by FFT techniques,and the computation-al speed of FHT techniques is about two times faster than that of FFT techniques. 相似文献
12.
M. E. Ayhan 《Journal of Geodesy》1997,71(6):362-369
In the analyses of 2D real arrays, fast Hartley (FHT), fast T (FTT) and real-valued fast Fourier transforms are generally
preferred in lieu of a complex fast Fourier transform due to the advantages of the former with respect to disk storage and
computation time. Although the FHT and the FTT in one dimension are identical, they are different in two or more dimensions.
Therefore, first, definitions and some properties of both transforms and the related 2D FHT and FTT algorithms are stated.
After reviewing the 2D FHT and FTT solutions of Stokes' formula in planar approximation, 2D FHT and FTT methods are developed
for geoid updating to incorporate additional gravity anomalies. The methods are applied for a test area which includes a 64×64
grid of 3′×3′ point gravity anomalies and geoid heights calculated from point masses. The geoids computed by 2D FHT and FTT are found to
be identical. However, the RMS value of the differences between the computed and test geoid is ±15 mm. The numerical simulations
indicate that the new methods of geoid updating are practical and accurate with considerable savings on storage requirements.
Received: 15 February 1996; Accepted: 22 January 1997 相似文献
13.
I. N. Tziavos 《Journal of Geodesy》1996,70(6):357-373
The Stokes formula is efficiently evaluated by the one-and two- dimensional (1D, 2D) fast Fourier transform (FFT) technique in the plane and on the sphere in order to obtain precise geoid determinatiover a large area such as Europe. Using a high-pass filtered spherical harmonic reference model (OSU91A truncated to different degrees), gridded gravity anomalies and geoid heights were produced and the anomalies were used as input in the FFT software. Various tests were performed with respect to the different kernel functions used, to the spherical computations in bands, as well as to windowing, edge effects and extent of the area. It is thus demonstrated that, in geoid computations over large regions, the 1D spherical FFT and the 2D multiband spherical FFT in combination with discrete spectra for the kernel functions and 100% zero-padding give better results than those obtained by the other transform techniques. Additionally, numerical tests were carried out at the same test area using the planar fast Hartley transform (FHT) instead of the FFT and the results obtained by the two attractive alternatives were compared regarding the requirements in both computer time and computer memory needed in geoid height computations.A slightly modified version of the paper has been presented at the XX EGS General Assembly, Hamburg, 3–7 April, 1995 相似文献
14.
一种改进的星载干涉SAR复图像最大频谱配准算法 总被引：2，自引：1，他引：1
最大频谱法常用于星载干涉SAR复图像配准,但该方法计算量较大且易受噪声影响。本文提出一种改进的最大频谱配准算法。该方法利用chirp-z变换替换补零FFT变换,以相对较少的运算量达到较高的频谱峰值计算精度;通过设定合理的判决门限,判定控制点偏移量估计结果的可靠性,以便对位于不同区域的控制点自适应选取子图像截取窗口的长度,达到控制运算量的目的。利用该算法分别对来自ASAR和ERS-1/2的两对复图像进行验证,实验结果表明该算法可以有效实现配准,且比同条件下利用常规最大频谱算法得到的结果更加可靠。 相似文献
15.
重力与磁力测量数据向下延拓中最优正则化参数确定方法研究 总被引：2，自引：0，他引：2
向下延拓是重、磁测量数据处理的关键步骤之一,然而,向下延拓是一个典型的不适定问题,需要采用正则化方法实现有效延拓,因此,正则化参数的确定是重、磁测量数据向下延拓正则化方法研究中最重要内容。本文根据观测面和延拓面测量数据的Poisson积分平面近似关系,结合快速傅里叶变换算法,将其转换到频率域进行计算,提高了计算速度,为了克服计算的不稳定性并进一步提高计算结果的精度,引入Landweber正则化迭代法,在此基础上采用L曲线法研究了最优正则化参数的确定,最后采用模型磁测数据验证了所确定的正则化参数的有效性,并取得了较好的延拓结果。 相似文献
16.
邱卫根 《武汉大学学报(信息科学版)》1988,(1)
文章首先讨论了用配置法综合利用各种重力信息进一步提高虚拟单层密度精度的可行性,从理论上证明了解的唯一性,同时导出了虚拟单层密度与扰动位线性泛函之间的协方差函数,使该方法的实际计算成为可能。文章的第二部份提出了用快速傅立叶变换计算虚拟单层密度及局部地形改正,模拟计算表明该方法精度高、速度快,其工效比传统的迭代法提高几十倍。 相似文献
17.
Two numerical techniques are used in recent regional high-frequency geoid computations in Canada: discrete numerical integration
and fast Fourier transform. These two techniques have been tested for their numerical accuracy using a synthetic gravity field.
The synthetic field was generated by artificially extending the EGM96 spherical harmonic coefficients to degree 2160, which
is commensurate with the regular 5′ geographical grid used in Canada. This field was used to generate self-consistent sets of synthetic gravity anomalies and
synthetic geoid heights with different degree variance spectra, which were used as control on the numerical geoid computation
techniques. Both the discrete integration and the fast Fourier transform were applied within a 6∘ spherical cap centered at each computation point. The effect of the gravity data outside the spherical cap was computed using
the spheroidal Molodenskij approach. Comparisons of these geoid solutions with the synthetic geoid heights over western Canada
indicate that the high-frequency geoid can be computed with an accuracy of approximately 1 cm using the modified Stokes technique,
with discrete numerical integration giving a slightly, though not significantly, better result than fast Fourier transform.
Received: 2 November 1999 / Accepted: 11 July 2000 相似文献
18.
In the numerical evaluation of geodetic convolution integrals, whether by quadrature or discrete/fast Fourier transform (D/FFT) techniques, the integration kernel is sometimes computed at the centre of the discretised grid cells. For singular kernels—a common case in physical geodesy—this approximation produces significant errors near the computation point, where the kernel changes rapidly across the cell. Rigorously, mean kernels across each whole cell are required. We present one numerical and one analytical method capable of providing estimates of mean kernels for convolution integrals. The numerical method is based on Gauss-Legendre quadrature (GLQ) as efficient integration technique. The analytical approach is based on kernel weighting factors, computed in planar approximation close to the computation point, and used to convert non-planar kernels from point to mean representation. A numerical study exemplifies the benefits of using mean kernels in Stokes’s integral. The method is validated using closed-loop tests based on the EGM2008 global gravity model, revealing that using mean kernels instead of point kernels reduces numerical integration errors by a factor of ~5 (at a grid-resolution of 10 arc min). Analytical mean kernel solutions are then derived for 14 other commonly used geodetic convolution integrals: Hotine, Eötvös, Green-Molodensky, tidal displacement, ocean tide loading, deflection-geoid, Vening-Meinesz, inverse Vening-Meinesz, inverse Stokes, inverse Hotine, terrain correction, primary indirect effect, Molodensky’s G1 term and the Poisson integral. We recommend that mean kernels be used to accurately evaluate geodetic convolution integrals, and the two methods presented here are effective and easy to implement. 相似文献