.png){kind=icon}
返回
Fast variogram computation with FFT
.png){kind=icon}
PRE
AI
DOI：10.1016/S0098-3004(96)00026-X.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Two programs are presented to compute direct- and cross-variograms, direct and cross-covariograms, and pseudo-cross-variograms. The programs are written in MATLAB and are based on the Fast Fourier Transform algorithm (FFT). The programs accept complete, or incomplete, regular grid data. The FFT appoach is shown to be faster than the spatial approach for this type of data. It gives exactly the same numerical variogram values as programs operating in the spatial domain. These programs could be most useful in image analysis, where images are usually 256 x 256 pixels, 512 x 512 pixels, or larger. For such large images, FFT is many orders of magnitude faster than the spatial approach. Copyright (C) 1996 Elsevier Science Ltd
Keyword:
variogram
cross-variogram
covariogram
Fast Fourier Transform
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
