• Communications for Statistical Applications and Methods
• /
• v.29 no.1
• /
• pp.127-150
• /
• 2022

We discuss multiple change-point estimation as edge detection in piecewise smooth functions with finitely many jump discontinuities. In this paper we propose change-point estimators using concentration kernels with Fourier coefficients. The change-points can be located via the signal based on Fourier transformation system. This method yields location and amplitude of the change-points with refinement via concentration kernels. We prove that, in an appropriate asymptotic framework, this method provides consistent estimators of change-points with an almost optimal rate. In a simulation study the proposed change-point estimators are compared and discussed. Applications of the proposed methods are provided with Nile flow data and daily won-dollar exchange rate data.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.106-109
• /
• 2009

Recently, image matching becomes important in Computer Aided Diagnosis (CAD) due to the huge amount of medical images. Specially, texture feature is useful in medical image matching. However, texture features such as co-occurrence matrices can't describe well the spatial distribution of gray levels of the neighborhood pixels. In this paper we propose a frequency domain-based texture feature extractor that describes the local spatial distribution for medical image retrieval. This method is based on 2D Local Discrete Fourier transform of local images. The features are extracted from local Fourier histograms that generated by four Fourier images. Experimental results using 40 classes Brodatz textures and 1 class of Emphysema CT images show that the average accuracy of retrieval is about 93%.

• Journal of applied mathematics & informatics
• /
• v.41 no.5
• /
• pp.1057-1069
• /
• 2023

In this paper, we have determined the degree of approximation of function belonging of Lipschitz class by using Deferred-Generalized Nörlund (D^𝛾_𝛽.N_pq) means of Fourier series and conjugate series of Fourier series, where {p_n} and {q_n} is a non-increasing sequence. So that results of DEGER and BAYINDIR [23] become special cases of our results.

• ETRI Journal
• /
• v.45 no.6
• /
• pp.1035-1045
• /
• 2023

We propose a novel graphics processing unit (GPU) algorithm that can handle a large-scale 3D fast Fourier transform (i.e., 3D-FFT) problem whose data size is larger than the GPU's memory. A 1D FFT-based 3D-FFT computational approach is used to solve the limited device memory issue. Moreover, to reduce the communication overhead between the CPU and GPU, we propose a 3D data-transposition method that converts the target 1D vector into a contiguous memory layout and improves data transfer efficiency. The transposed data are communicated between the host and device memories efficiently through the pinned buffer and multiple streams. We apply our method to various large-scale benchmarks and compare its performance with the state-of-the-art multicore CPU FFT library (i.e., fastest Fourier transform in the West [FFTW]) and a prior GPU-based 3D-FFT algorithm. Our method achieves a higher performance (up to 2.89 times) than FFTW; it yields more performance gaps as the data size increases. The performance of the prior GPU algorithm decreases considerably in massive-scale problems, whereas our method's performance is stable.

• Proceedings of the KIEE Conference
• /
• 1986.07a
• /
• pp.293-295
• /
• 1986

• Honam Mathematical Journal
• /
• v.35 no.3
• /
• pp.435-443
• /
• 2013

We give an $L^p$ Fourier multiplier condition which implies the H$\ddot{o}$rmander-Mikhlin multiplier theorem.

• The Pure and Applied Mathematics
• /
• v.11 no.1
• /
• pp.89-96
• /
• 2004

We prove de Leeuw's restriction theorem result Jodeit, Jr. [4] for multipliers on $H^{p}$ spaces, p＜1.

• Proceedings of the Optical Society of Korea Conference
• /
• 2007.02a
• /
• pp.173-174
• /
• 2007

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.377-381
• /
• 2005

We present a convenient recursive formula for the sums of alternating harmonic series of odd order. The recursion is obtained by expanding in Fourier series certain elementary functions.

• Journal of the Korean Mathematical Society
• /
• v.50 no.5
• /
• pp.1105-1127
• /
• 2013

Let C[0, $t$] denote the function space of real-valued continuous paths on [0, $t$]. Define $X_n\;:\;C[0,t]{\rightarrow}\mathbb{R}^{n+1}$ and $X_{n+1}\;:\;C[0,t]{\rightarrow}\mathbb{R}^{n+2}$ by $X_n(x)=(x(t_0),x(t_1),{\ldots},x(t_n))$ and $X_{n+1}(x)=(x(t_0),x(t_1),{\ldots},x(t_n),x(t_{n+1}))$, respectively, where $0=t_0 <; t_1 <{\ldots} < t_n < t_{n+1}=t$. In the present paper, using simple formulas for the conditional expectations with the conditioning functions $X_n$ and $X_{n+1}$, we evaluate the $L_p(1{\leq}p{\leq}{\infty})$-analytic conditional Fourier-Feynman transforms and the conditional convolution products of the functions, which have the form $fr((v_1,x),{\ldots},(v_r,x)){\int}_{L_2}_{[0,t]}\exp\{i(v,x)\}d{\sigma}(v)$ for $x{\in}C[0,t]$, where $\{v_1,{\ldots},v_r\}$ is an orthonormal subset of $L_2[0,t]$, $f_r{\in}L_p(\mathbb{R}^r)$, and ${\sigma}$ is the complex Borel measure of bounded variation on $L_2[0,t]$. We then investigate the inverse conditional Fourier-Feynman transforms of the function and prove that the analytic conditional Fourier-Feynman transforms of the conditional convolution products for the functions can be expressed by the products of the analytic conditional Fourier-Feynman transform of each function.