• Journal of applied mathematics & informatics
• /
• v.8 no.3
• /
• pp.731-742
• /
• 2001

A Gaussian smoothing algorithm obtained from a cascade of convolutions with a seven-point kernel is described. We prove that the change of local sums after applying our algorithm to sinusoidal signals is reduced to about two thirds of the change by the binomial coefficients. Hence, our seven point kernel is better than the binomial coefficients when trend curves are needed to be generated. We also prove that if our Gaussian convolution is applied to sinusoidal functions, the amplitude of higher frequencies reduces faster than the lower frequencies and hence that it is a low pass filter.

• Journal of the Korean Society of Industry Convergence
• /
• v.18 no.4
• /
• pp.191-196
• /
• 2015

In this paper, we present a path-smoothing algorithm for a robot arm manipulator that finds the path using a joint space-based rapidly-exploring random tree. Unlike other smoothing algorithms which require complex mathematical computation, the proposed path-smoothing algorithm is done using a Gaussian process. To find the optimal hyperparameters of the Gaussian process, we use differential evolution hybridized with opposition-based learning. The simulation result indicates that the Gaussian process whose hyperparameters were optimized by hybrid differential evolution successfully smoothed the path generated by the joint space-based rapidly-exploring random tree.

• Communications for Statistical Applications and Methods
• /
• v.12 no.3
• /
• pp.743-758
• /
• 2005

This paper consider penalized likelihood regression with data from exponential family. The fast computation method applied to Gaussian data(Kim and Gu, 2004) is extended to non Gaussian data through asymptotically efficient low dimensional approximations and corresponding algorithm is proposed. Also smoothing parameter selection is explored for various exponential families, which extends the existing cross validation method of Xiang and Wahba evaluated only with Bernoulli data.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.35 no.3
• /
• pp.289-297
• /
• 2011

The explicit finite element method is an essential tool for solving large problems with severe nonlinear characteristics, but its results can be difficult to interpret. In particular, it can be impossible to evaluate its acceleration responses because of severe discontinuity, extreme noise or aliasing. We suggest a new post-processing method for transient responses and their response spectra. We propose smoothing methods using a Gaussian kernel without in depth knowledge of the complex frequency characteristics; such methods are successfully used in the filtering of digital signals. This smoothing can be done by measuring the velocity results and monitoring the response spectra. Gaussian kernel smoothing gives a better smoothness and representation of the peak values than other approaches do. The floor response spectra can be derived using smoothed accelerations for the design.

• Proceedings of the KSMRM Conference
• /
• 2003.10a
• /
• pp.75-75
• /
• 2003

목적： MR 영상에 나타나는 bias field, 즉 영상의 특정 부분이 주위보다 어둡거나 밝게 나타나는 현상을 보다 균일하게 보정시키는 방법으로 제시된 N3 방법에서 Gaussian kernel을 사용한 smoothing 방법 대신에 Wavelet(Daubechies, D4)함수를 smoothing기법으로 사용했을 때 어느 정도 균일함에 향상이 일어나는지를 알아보는 것이다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.7
• /
• pp.709-718
• /
• 1992

A new edge detection operator superimposing two displaced Gaussian smoothing filters Is proposed as an approximate operator for the DroG(flrst derivative of Gaussian) known as a sub-op-timal step edge detector. The performance of the proposed edge detector Is very close to that of the DroG with the performance criteria . signal to noise ratio, locality, and multiple response. And the computational complexity can be reduced almost by a half of that of DroG, because of the use of common 2-D smoothing filter for DroG and LoG ( Laplacian of Gausslan) systems.

• Journal of information and communication convergence engineering
• /
• v.8 no.4
• /
• pp.405-410
• /
• 2010

Image processing operations like smoothing and edge detection, and many more are very widely used in areas like Computer Vision. We classify the image processing domain as seven branches-image acquirement and output, image coding and compression, image enhancement and restoration, image transformation, image segmentation, image description, and image recognition and description. We implemented algorithms of gaussian smoothing, laplace sharpening, image contrast effect, image black and white effect, image fog effect, image bright and dark effect, image median filter, and canny edge detection. Such experimental results show the figures respectively.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.502-507
• /
• 2003

Toward the development of practical methods for observed data oriented bispectral estimation, an automatic means for determining the smoothing bandwidth of bispectral windows is proposed, that can also provide an associated optimum bispectral estimate of stationary non-Gaussian signals, systematically only from an observed time series datum of finite length. For the conventional non-parametric bispectral estimation, the MSE (mean squared error) of the normalized estimate is reviewed under a certain mixing condition and sufficient data length, mainly from the viewpoint of the inverse relation between its bias and variance with respect to the smoothing bandwidth. Based on the fundamental relation, a systematic method not only for determining the bandwidth, but also for obtaining the optimum bispectral estimate is presented by newly introducing a MSE evaluation index of the estimate only from an observed time series datum of finite length. The effectiveness and fundamental features of the proposed method are illustrated by the basic results of numerical experiments.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 1995.10a
• /
• pp.80-85
• /
• 1995

Too see the effects of finite record on the estimation of WVD in practice, a window which has time varying length is examined. Its length increases linearly with time in the first half of the record, and decreases from the center of the record. The bias error due to this window decreases inversely proportionally to the window length as time increases in the first half. In the second half, the bias error increases and the resolution decreases as time increases. The bias error due to the smoothing of WVD, which is obtained by two-dimensional convolution of the true WVD and the smoothing window, which has fixed lengths along time and frequency axes, is derived for arbitrary smoothing window function. In the case of using a Gaussian window as a smoothing window, the bias error is found to be expressed as an infinite summation of differential operators. It is demonstrated that the derived formula is well applicable to the continuous WVD, but when WVD has some discontinuities, it shows the trend of the error. This is a consequence of the assumption of the derivation, that is the continuity of WVD. For windows other than Gaussian window, the derived equation is shown to be well applicable for the prediction of the bias error.

• Journal of the Korean Society of Radiology
• /
• v.8 no.7
• /
• pp.443-447
• /
• 2014

$^{134}Cs$ radioactive concentration among soil samples is difficult to classify due to the background impact on crust originated natural radioactive nuclide, and overlapping and interfering between peaks. The ways to identify true peaks in gamma-ray spectroscopy are as follows to reduce statistical fluctuation by smoothing based on the fact that the shapes of peak are mostly Gaussian, to inspect the levels of width and height of peaks, to add functions on low-energy trailing phenomena, or 4) to check the peaks after modifying Gaussian function itself. Therefore, it is considered that information and knowledge for spectrum analysis are necessary.