共查询到20条相似文献，搜索用时 609 毫秒
1.
本文提出了利用快速Hartley变换(FHT)计算Stokes公式的方法,这一算法最适合于用来计算实序列的积分变换,而快速Fourier变换(FFT)较适合于用来计算复序列的积分变换。计算Stokes公式只涉及实序列问题,用FHT计算Stokes公式比用FFT算法更有效。本文详细地描述了用FHΥ计算Stokes公式的算法,进行了数值计算,与相应的FFT计算结果作了比较。结果表明,两种算法可以得到相同的精度,但是,FHT的计算速度比FFT的计算速度快一倍以上,且所需要的内存空间只是后者的一半。 相似文献
2.
在应用快速Hartly变换(FHT)或快速Fourier变换(FFT)计算Stokes积分公式时,总是先将Stokes 公式化成卷积形式,然后用 FHT或 FFT完成卷积运算,从而避免了复杂费时的积分计算。但由于 Stokes公式不严格满足卷积定义,欲将其化成卷积形式必须作一些近似。这种近似虽能在一定精度范围满足要求,但对于高精度要求仍有不能允许的计算误差。本文建议采用球面坐标转换方法,能有效地消除无论是用 FHT或 FFT 计算Stokes 积分卷积化所带来的误差影响。 相似文献
3.
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 相似文献
4.
邱卫根 《武汉大学学报(信息科学版)》1988,(1)
文章首先讨论了用配置法综合利用各种重力信息进一步提高虚拟单层密度精度的可行性,从理论上证明了解的唯一性,同时导出了虚拟单层密度与扰动位线性泛函之间的协方差函数,使该方法的实际计算成为可能。文章的第二部份提出了用快速傅立叶变换计算虚拟单层密度及局部地形改正,模拟计算表明该方法精度高、速度快,其工效比传统的迭代法提高几十倍。 相似文献
5.
一种改进的星载干涉SAR复图像最大频谱配准算法 总被引：2，自引：1，他引：1
最大频谱法常用于星载干涉SAR复图像配准,但该方法计算量较大且易受噪声影响。本文提出一种改进的最大频谱配准算法。该方法利用chirp-z变换替换补零FFT变换,以相对较少的运算量达到较高的频谱峰值计算精度;通过设定合理的判决门限,判定控制点偏移量估计结果的可靠性,以便对位于不同区域的控制点自适应选取子图像截取窗口的长度,达到控制运算量的目的。利用该算法分别对来自ASAR和ERS-1/2的两对复图像进行验证,实验结果表明该算法可以有效实现配准,且比同条件下利用常规最大频谱算法得到的结果更加可靠。 相似文献
6.
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. 相似文献
7.
提出利用地面重力异常数据计算地面扰动位径向二阶梯度，将该梯度的积分表达式转换为卷积形式的谱表达式，便于应用ＦＦＴ／ＦＨＴ技术进行快速计算。这一将地面重力异常化为重力梯度的实用算法为将卫星重力梯度和航空重力梯度观测数据与地面重力数据的联合处理提供了一种有效途径。最后，以本文导出的数学模型为基础，给出了模型（ＷＤＭ９４）数据的试算结果并作了分析 相似文献
8.
Michael G. Sideris 《Journal of Geodesy》1995,70(1-2):2-12
The fast Fourier transform (FFT) and, recently, the fast Hartley transform (FHT) have been extensively used by geodesists for efficient geoid determination. For this kind of efficiency, data must be given on a regular grid and, consequently, a pre-processing step of interpolation is required when only point measurements are available. This paper presents a way of computing a grid of geoid undulations N without explicitly gridding the data. The method is applicable to all FFT or FHT techniques of geoid or terrain effects determination, and it works with planar as well as spherical formulas. This method can be used not only for, e.g., computing a grid of undulations from irregular gravity anomalies g but it also lends itself to other applications, such as the gridding of gravity anomalies and, since the contribution of each data point is computed individually, the update of N- or g-grids as soon as new point measurements become available. In the case that there are grid cells which contain no measurements, the results of gravity interpolation or geoid estimation can be drastically improved by incorporating into the procedure a frequency-domain interpolating function. In addition to numerical results obtained using a few simple interpolating functions, the paper presents briefly the mathematical formulas for recovering missing grid values and for transforming values from one grid to another which might be rotated and/or scaled with respect to the first one. The geodetic problems where these techniques may find applications are pointed out throughout the paper.Presented at theIAG General Meeting, Beijing, P.R. China, Aug. 6–13, 1993 相似文献
9.
Gravity anomalies from satellite altimetry: comparison between computation via geoid heights and via deflections of the vertical 总被引：3，自引：0，他引：3
The accumulation of good quality satellite altimetry missions allows us to have a precise geoid with fair resolution and to compute free air gravity anomalies easily by fast Fourier transform (FFT) techniques.In this study we are comparing two methods to get gravity anomalies. The first one is to establish a geoid grid and transform it into anomalies using inverse Stokes formula in the spectral domain via FFT. The second one computes deflection of the vertical grids and transforms them into anomalies.The comparison is made using different data sets: Geosat, ERS-1 and Topex-Poseidon exact repeat misions (ERMs) north of 30°S and Geosat geodetic mission (GM) south of 30°S. The second method which transforms the geoid gradients converted into deflection of the vertical values is much better and the results have been favourably evaluated by comparison with marine gravity data. 相似文献
10.
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 相似文献
11.
There exist three types of convolution formulae for the efficient evaluation of gravity field convolution integrals, i.e., the planar 2D convolution, the spherical 2D convolution and the spherical 1D convolution. The largest drawback of both the planar and the spherical 2D FFT methods is that, due to the approximations in the kernel function, only inexact results can be achieved. Apparently, the reason is the meridian convergence at higher latitudes. As the meridians converge, the ??,?λ blocks do not form a rectangular grid, as is assumed in 2D FFT methods. It should be pointed out that the meridian convergence not only leads to an approximation error in the kernel function, but also causes an approximation error during the implementation of 2D FFT in computer. In order to meet the increasing need for precise determination of the vertica deflections, this paper derives a more precise planar 2D FFT formula for the computation of the vertical deflections. After having made a detailed comparison between the planar and the spherical 2D FFT formulae, we find out the main source of errors causing the loss in accuracy by applying the conventional spherical 2D FFT method. And then, a modified spherical 2D FFT formula for the computation of the vertical deflections is developed in this paper. A series of numerical tests have been carried out to illustrate the improvement made upon the old spherical 2D FFT. The second part of this paper is to discuss the influences of the spherical harmonic reference field, the limited capsize, and the singular integral on the computation of the vertical deflections. The results of the vertical deflections over China by applying the spherical 1D FFT formula with different integration radii have been compared to the astro-observed vertical deflections in the South China Sea to obtain a set of optimum deflection computation parameters. 相似文献
12.
1 ＩｎｔｒｏｄｕｃｔｉｏｎＴｈｅｆａｓｔＦｏｕｒｉｅｒｔｒａｎｓｆｏｒｍ (ＦＦＴ)ｔｅｃｈｎｉｑｕｅｉｓａｖｅｒｙｐｏｗｅｒｆｕｌｔｏｏｌｆｏｒｔｈｅｅｆｆｉｃｉｅｎｔｅｖａｌｕａｔｉｏｎｏｆｇｒａｖｉｔｙｆｉｅｌｄｃｏｎｖｏｌｕｔｉｏｎｉｎｔｅｇｒａｌｓ.Ｔｈａｎｋｓｔｏｔｈｅｇｏｏｄｃｏｍｐｕｔａｔｉｏｎｅｆｆｉｃｉｅｎｃｙ ,ｔｈｅＦＦＴｔｅｃｈｎｉｑｕｅ ,ｉｎｔｈｅｍｉｄ＿1 980ｓ ,ｂｅｇａｎｔｏｆｉｎｄｗｉｄｅｓｐｒｅａｄｕｓｅｉｎｇｅｏｉｄｄｅｔｅｒｍｉｎａｔｉｏｎ ,ｗｈｅｎｃｏｍｐａｒ… 相似文献
13.
从快速 Hartley变换 (FHT)基本概念入手 ,给出了 Hotine核在平面近似、球面近似、Molodenskii近似下的反演模型。另对 FHT处理中所需的坐标转换以及边缘效应等问题加以讨论。同时 ,为了改善长波特性的重力场信息 ,利用 M阶次的参考重力场对上述 Molo-denskii模型进行了改化。 相似文献
14.
重力与磁力测量数据向下延拓中最优正则化参数确定方法研究 总被引：2，自引：0，他引：2
向下延拓是重、磁测量数据处理的关键步骤之一,然而,向下延拓是一个典型的不适定问题,需要采用正则化方法实现有效延拓,因此,正则化参数的确定是重、磁测量数据向下延拓正则化方法研究中最重要内容。本文根据观测面和延拓面测量数据的Poisson积分平面近似关系,结合快速傅里叶变换算法,将其转换到频率域进行计算,提高了计算速度,为了克服计算的不稳定性并进一步提高计算结果的精度,引入Landweber正则化迭代法,在此基础上采用L曲线法研究了最优正则化参数的确定,最后采用模型磁测数据验证了所确定的正则化参数的有效性,并取得了较好的延拓结果。 相似文献
15.
16.
本文利用Topex/Poseidon卫星测高资料,从快速Hartley变换(FHT)基本概念入手,给出了Hotine公式在平面近似、球面近似、Molodenskii近似下,反演中国近海海洋重力的数学模型。另对FHT处理中所需的坐标转换以及边缘效应等问题进行了讨论。同时,为了改善长波特性的重力场信息,引入了M阶次的OSU91A参考重力场对上述Molodenskii模型进行了改化。 相似文献
17.
Estimation of dynamic ocean topography in the Gulf Stream area using the Hotine formula and altimetry data 总被引：3，自引：2，他引：1
Changyou Zhang 《Journal of Geodesy》1998,72(9):499-510
Two modifications of the Hotine formula using the truncation theory and marine gravity disturbances with altimetry data are
developed and used to compute a marine gravimetric geoid in the Gulf Stream area. The purpose of the geoid computation from
marine gravity information is to derive the absolute dynamic ocean topography based on the best estimate of the mean surface
height from recent altimetry missions such as Geosat, ERS-1, and Topex. This paper also tries to overcome difficulties of
using Fast Fourier Transformation (FFT) techniques to the geoid computation when the Hotine kernel is modified according to
the truncation theory. The derived absolute dynamic ocean topography is compared with that from global circulation models
such as POCM4B and POP96. The RMS difference between altimetry-derived and global circulation model dynamic ocean topography
is at the level of 25cm. The corresponding mean difference for POCM4B and POP96 is only a few centimeters. This study also
shows that the POP96 model is in slightly better agreement with the results derived from the Hotine formula and altimetry
data than POCM4B in the Gulf Stream area. In addition, Hotine formula with modification (II) gives the better agreement with
the results from the two global circulation models than the other techniques discussed in this paper.
Received: 10 October 1996 / Accepted: 16 January 1998 相似文献
18.
由于人类识别图像特征涉及非线性的识别机制,本文提出了基于改进二维Log Butterworth滤波器的全方向边缘检测方法,该方法从频域角度出发,利用正反快速傅里叶变换来实现边缘检测工作。首先,将非线性Log函数引入Butterworth滤波器,获得二维Log Butterworth滤波器。当图像行列数不一致时,中心频率分布于椭圆之上,椭圆的长短轴之比与图像长宽比相等,进而给出以角度为变量滤波器表达式;其次,为方便滤波器参数的优化选取,本文对二维 Log Butterworth滤波器参数进行归一化等处理;再次,本文利用F-measure和PSNR (峰值信噪比)值来衡量不同参数下的边缘检测结果,确定最优的二维 Log Butterworth滤波器参数范围;然后,为了分析本文方法的边缘检测效率,对比了本文方法与空域算子（Canny算子）的乘法次数和加法次数,同时以不同大小的图像作为实验数据来比较两种方法的边缘检测耗时;最后,以BSDS（伯克利图像分割数据库）图像和高空间分辨率遥感图像为实验数据,对本文方法的边缘检测结果进行了评价分析。结果表明：本文方法可以有效地应用于图像边缘检测。 相似文献
19.
关于Stokes公式的球面卷积和平面卷积的注记 总被引：2，自引：0，他引：2
晁定波 《武汉大学学报(信息科学版)》2003,28(6):651-654
讨论了Stokes公式球面卷积和平面卷积形式的近似性和严密性问题,分析了Stokes函数球面卷积形式和平面卷积形式的关系,推导了其间的差值表达式,估算了最大差值及其对计算大地水准面差距的误差影响。同时指出,将顾及Stokes函数全项的平面卷积公式称为严密公式的提法,仅仅是相对仅顾及Stokes函数首项的简单平面卷积公式而言,认为更合理的提法应该是“高精度Stokes平面近似卷积公式”。理论分析表明,球面卷积不可能严格转化为等效的平面卷积。 相似文献
20.
Deconvolution with wavelets and vaguelettes 总被引：2，自引：0，他引：2
The use of wavelets for the solution of convolution equations is studied as a possible alternative to the well-established
Fast Fourier Transform (FFT) technique. Two possible solution strategies are investigated: (1) The use of wavelets for the
representation of both the given data and the unknown solution. This leads to an algorithm with good de-noising and data-compression
properties. In terms of computational efficiency this algorithm is inferior to FFT. (2) The use of wavelets for the representation
of the unknown solution and of so-called vaguelettes for the representations of the given data. This leads to an algorithm
which is even faster than FFT.
Received: 14 October 1998 / Accepted: 30 November 1999 相似文献