• Proceedings of the Korean Statistical Society Conference
• /
• 2002.11a
• /
• pp.109-114
• /
• 2002

In this paper we propose a change-point estimator with left and right regressions using the sample Fourier coefficients on the orthonormal bases. The asymptotic properties of the proposed change-point estimator are established. The limiting distribution and the consistency of the estimator are derived.

• Journal of the Korean Statistical Society
• /
• v.25 no.1
• /
• pp.123-131
• /
• 1996

The problerm of testing for a constant mean is considered. A Kolmogorov-Smirnov type test using the sample Fourier coefficients is suggested and its asymptotic distribution is derived. A simulation study shows that the proposed test is more powerful than the cusum type test when there is more than one change-point or there is a cyclic change.

• Communications for Statistical Applications and Methods
• /
• v.3 no.1
• /
• pp.207-217
• /
• 1996

The problem of detecting change with independent data is considered. The asymptotic distribution of the sample change process with the sample Fourier coefficients is shown as a Brownian Bridge process. We suggest to use dynamic statistics such as a sample Brownian Bridge and graphs as statistical animation. Graphs including change PP plots are given by way of illustration with the simulated data.

• Journal of the Korean Statistical Society
• /
• v.31 no.4
• /
• pp.533-543
• /
• 2002

In this paper we propose a change-point estimator with left and right regressions using the sample Fourier coefficients on the orthonormal bases. The window size is different according to the data in the left side and in the right side at each point. The asymptotic properties of the proposed change-point estimator are established. The limiting distribution and the consistency of the estimator are derived.

• Vacuum Magazine
• /
• v.2 no.3
• /
• pp.4-10
• /
• 2015

We developed a real-time three-polarizer spectroscopic ellipsometer based on a new data acquisition algorithm and a general data reduction (the process of extracting the ellipsometric sample parameters from the Fourier coefficients). The data acquisition algorithm measures Fourier coefficients of radiant flux waveform accurately and precisely. The general data reduction is introduced to represent the analytic functions of the standard uncertainties of the ellipsometric sample parameters, and the extracted theoretical values closely agree with the corresponding experimental data. Our approach can be used for optimization of measurement conditions, instrumentation, simulation, standardization, laboratory accreditation, and metrology.

• 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.

• Archives of Pharmacal Research
• /
• v.11 no.2
• /
• pp.99-113
• /
• 1988

Quantitation of ethenzamide, isopropylantipyrine and caffeine takes about 41 hrs by conventional GC method. Quantitation of allylisoprorylacetylurea takes about 40 hrs by conventional UV method. But quantitation of them takes about 6 hrs by DRIFT developing method. Each standard and sample sieved, powdered and acquired DRIFT spectrum. Out of them peak of each component was selected and ratio of each peak to standard peak was acquired, and then linear stepwise multiple regression was performed with these data and concentration. Reflectance value, Kubelka-Munk equation and Inverse-Kubelka-Munk equation were modified by us. Inverse-Kubelka-Munk equation completed the deficit of Kubelka-Munk equation. Correlation coefficients acquired by conventioanl GC and UV against DRIFT were more than 0.95.

• Journal of Intelligence and Information Systems
• /
• v.17 no.2
• /
• pp.97-107
• /
• 2011

Nowadays there are a lot of issues about copyright infringement in the Internet world because the digital content on the network can be copied and delivered easily. Indeed the copied version has same quality with the original one. So, copyright owners and content provider want a powerful solution to protect their content. The popular one of the solutions was DRM (digital rights management) that is based on encryption technology and rights control. However, DRM-free service was launched after Steve Jobs who is CEO of Apple proposed a new music service paradigm without DRM, and the DRM is disappeared at the online music market. Even though the online music service decided to not equip the DRM solution, copyright owners and content providers are still searching a solution to protect their content. A solution to replace the DRM technology is digital audio watermarking technology which can embed copyright information into the music. In this paper, the author proposed a new audio watermarking algorithm with two approaches. First, the watermark information is generated by two dimensional barcode which has error correction code. So, the information can be recovered by itself if the errors fall into the range of the error tolerance. The other one is to use chirp sequence of CDMA (code division multiple access). These make the algorithm robust to the several malicious attacks. There are many 2D barcodes. Especially, QR code which is one of the matrix barcodes can express the information and the expression is freer than that of the other matrix barcodes. QR code has the square patterns with double at the three corners and these indicate the boundary of the symbol. This feature of the QR code is proper to express the watermark information. That is, because the QR code is 2D barcodes, nonlinear code and matrix code, it can be modulated to the spread spectrum and can be used for the watermarking algorithm. The proposed algorithm assigns the different spread spectrum sequences to the individual users respectively. In the case that the assigned code sequences are orthogonal, we can identify the watermark information of the individual user from an audio content. The algorithm used the Walsh code as an orthogonal code. The watermark information is rearranged to the 1D sequence from 2D barcode and modulated by the Walsh code. The modulated watermark information is embedded into the DCT (discrete cosine transform) domain of the original audio content. For the performance evaluation, I used 3 audio samples, "Amazing Grace", "Oh! Carol" and "Take me home country roads", The attacks for the robustness test were MP3 compression, echo attack, and sub woofer boost. The MP3 compression was performed by a tool of Cool Edit Pro 2.0. The specification of MP3 was CBR(Constant Bit Rate) 128kbps, 44,100Hz, and stereo. The echo attack had the echo with initial volume 70%, decay 75%, and delay 100msec. The sub woofer boost attack was a modification attack of low frequency part in the Fourier coefficients. The test results showed the proposed algorithm is robust to the attacks. In the MP3 attack, the strength of the watermark information is not affected, and then the watermark can be detected from all of the sample audios. In the sub woofer boost attack, the watermark was detected when the strength is 0.3. Also, in the case of echo attack, the watermark can be identified if the strength is greater and equal than 0.5.