Convolution on the -Sphere With Application to PDF Modeling

Dept. of Electron. Syst. & Inf. Process., Univ. of Zagreb, Zagreb, Croatia
IEEE Transactions on Signal Processing (Impact Factor: 2.79). 04/2010; 58(3):1157 - 1170. DOI: 10.1109/TSP.2009.2033329
Source: IEEE Xplore


In this paper, we derive an explicit form of the convolution theorem for functions on an n -sphere. Our motivation comes from the design of a probability density estimator for n -dimensional random vectors. We propose a probability density function (pdf) estimation method that uses the derived convolution result on Sn. Random samples are mapped onto the n -sphere and estimation is performed in the new domain by convolving the samples with the smoothing kernel density. The convolution is carried out in the spectral domain. Samples are mapped between the n -sphere and the n -dimensional Euclidean space by the generalized stereographic projection. We apply the proposed model to several synthetic and real-world data sets and discuss the results.

Full-text preview

Available from:
  • Source
    • "The MCLT is a particular kind of 2 oversampled generalized DFT filter bank [1]. Indeed, the MDCT and the MDST are, respectively, the real and imaginary components of the modified odd-time odd-frequency discrete Fourier transform [11]. "
    [Show abstract] [Hide abstract]
    ABSTRACT: A new recursive fast radix-2 algorithm for an efficient computation of the modulated complex lapped transform (MCLT) is presented. Based on a new proposed alternative recursive sparse matrix factorization for the MDCT (modified discrete cosine transform) matrix and a relation between the MDCT and the MDST (modified discrete sine transform), firstly a new recursive fast radix-2 MDST algorithm is derived. The corresponding fast MDCT and MDST computational structures are regular and complementary to each other. Consequently, this fact enables us by their composition to construct a fast MCLT computational structure representing the fast recursive radix-2 MCLT algorithm. The fast MCLT computational structure is regular and all its stages may be realized in parallel. Combining the proposed fast radix-2 MCLT algorithm with an existing generalized fast mixed-radix MDCT algorithm defined for the composite lengths N = 2 × qm, m ≥ 2, where q is an odd positive integer, we can compute the MCLT for the composite lengths N = 2n × qm, n, m ≥ 2, thus supporting a wider range of transform sizes compared to existing fast MCLT algorithms.
    Full-text · Article · Dec 2012 · IEEE Transactions on Signal Processing
  • [Show abstract] [Hide abstract]
    ABSTRACT: We propose a simple model for approximate scaling of spherical functions in the Fourier domain. The proposed scaling model is analogous to the scaling property of the classical Euclidean Fourier transform. Spherical scaling is used for example in spherical wavelet transform and filter banks or illumination in computer graphics. Since the function that requires scaling is often represented in the Fourier domain, our method is of significant interest. Furthermore, we extend the result to higher-dimensional spheres. We show how this model follows naturally from consideration of a hypothetical continuous spectrum. Experiments confirm the applicability of the proposed method for several signal classes. The proposed algorithm is compared to an existing linear operator formulation.
    No preview · Article · Dec 2010 · IEEE Transactions on Signal Processing
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this correspondence, a novel robust adaptive beamformer is proposed based on the worst-case semi-definite programming (SDP). A recent paper has reported that a beamformer robust against large steering direction error can be constructed by using linear constraints on magnitude response in SDP formulation. In practice, however, array system also suffers from many other array imperfections other than steering direction error. In order to make the adaptive beamformer robust against all kinds of array imperfections, the worst-case optimization technique is proposed to reformulate the beamformer by minimizing the array output power with respect to the worst-case array imperfections. The resultant beamformer has the mathematical form of a regularized SDP problem and possesses superior robustness against arbitrary array imperfections. Although the formulation of robust beamformer uses weighting matrix, with the help of spectral factorization approach, the weighting vector can be obtained so that the beamformer can be used for both signal power and waveform estimation. Simple implementation, flexible performance control, as well as significant signal-to-interference-plus-noise ratio (SINR) enhancement, support the practicability of the proposed method.
    No preview · Article · Dec 2010 · IEEE Transactions on Signal Processing
Show more