Application of fast spherical Fourier transform to density estimation

被引:12
|
作者
Hendriks, H [1 ]
机构
[1] Univ Nijmegen, Dept Math, NL-6500 GL Nijmegen, Netherlands
关键词
band limited function; randomization of grid; box kernel; optimal convergence rate; Legendre polynomials;
D O I
10.1016/S0047-259X(02)00041-6
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
This paper is on density estimation on the 2-sphere, S-2, using the orthogonal series estimator corresponding to spherical harmonics. In the standard approach of truncating the Fourier series of the empirical density, the Fourier transform is replaced with a version of the discrete fast spherical Fourier transform, as developed by Driscoll and Healy. The fast transform only applies to quantitative data on a regular grid. We will apply a kernel operator to the empirical density, to produce a function whose values at the vertices of such a grid will be the basis for the density estimation. The proposed estimation procedure also contains a deconvolution step, in order to reduce the bias introduced by the initial kernel operator. The main issue is to find necessary conditions on the involved discretization and the bandwidth of the kernel operator, to preserve the rate of convergence that can be achieved by the usual computationally intensive Fourier transform. Density estimation is considered in L-2(S-2) and more generally in Sobolev spaces H-nu(S-2), any nugreater than or equal to0, with the regularity assumption that the probability density to be estimated belongs to H-s(S-2) for some s>nu. The proposed technique to estimate the Fourier transform of an unknown density keeps computing cost down to order O(n), where n denotes the sample size. (C) 2003 Elsevier Science (USA). All rights reserved.
引用
收藏
页码:209 / 221
页数:13
相关论文
共 50 条
  • [31] Application-specific DSP architecture for fast Fourier transform
    Heo, KL
    Cho, SM
    Lee, JH
    Sunwoo, MH
    IEEE INTERNATIONAL CONFERENCE ON APPLICATION-SPECIFIC SYSTEMS, ARCHITECTURES, AND PROCESSORS, PROCEEDINGS, 2003, : 369 - 377
  • [32] The Application of Fast Fourier Transform Algorithm in WiMAX Communications System
    Tang, Zhiling
    EDUCATION MANAGEMENT, EDUCATION THEORY AND EDUCATION APPLICATION, 2011, 109 : 711 - 719
  • [33] PREDICTION OF BREAKTHROUGH CURVES BY THE APPLICATION OF FAST FOURIER-TRANSFORM
    CHEN, TL
    HSU, JT
    AICHE JOURNAL, 1987, 33 (08) : 1387 - 1390
  • [34] Application of Fourier transform in current separation of fast scanning voltammetry
    Chen, ZH
    Lin, XQ
    Shao, XG
    Deng, ZX
    CHINESE JOURNAL OF ANALYTICAL CHEMISTRY, 2001, 29 (06) : 625 - 628
  • [35] FAST FOURIER-TRANSFORM CALCULATION OF ELECTRON-DENSITY MAPS
    TENEYCK, LF
    METHODS IN ENZYMOLOGY, 1985, 115 : 324 - 337
  • [36] Fast transform and frequency estimation algorithm of finite Ramanujan Fourier transformation
    Guo, Xujing
    Wang, Zulin
    Beijing Hangkong Hangtian Daxue Xuebao/Journal of Beijing University of Aeronautics and Astronautics, 2011, 37 (10): : 1317 - 1320
  • [37] SINUSOID PARAMETER-ESTIMATION USING THE FAST FOURIER-TRANSFORM
    CRINON, RJ
    1989 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-3, 1989, : 1033 - 1036
  • [38] Fast spherical Fourier algorithms
    Kunis, S
    Potts, D
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2003, 161 (01) : 75 - 98
  • [39] The fast Fourier transform and fast wavelet transform for patterns on the torus
    Bergmann, Ronny
    APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2013, 35 (01) : 39 - 51
  • [40] The future fast Fourier transform?
    Edelman, A
    McCorquodale, P
    Toledo, S
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1999, 20 (03): : 1094 - 1114