• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.915-918
• /
• 2001

In this paper we study a new convergence behavior of the least mean fourth (LMF) algorithm where the error raised to the power of four is minimized for a multiple sinusoidal input and Gaussian measurement noise. Here we newly obtain the convergence equation for the sum of the mean of the squared weight errors, which indicates that the transient behavior can differ depending on the relative sizes of the Gaussian noise and the convergence constant. It should be noted that no similar results can be expected from the previous analysis by Walach and Widrow.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.12A
• /
• pp.2043-2049
• /
• 2001

In this paper we study the convergence behavior of the least mean fourth(LMF) algorithm where the error raised to the power of four is minimized for a multiple sinusoidal input and Gaussian measurement noise. Here we newly obtain the convergence equation for the sum of the mean of the squared weight errors, which indicates that the transient behavior can differ depending on the relative sizes of the Gaussian noise and the convergence constant. It should be noted that no similar results can be expected from the previous analysis by Walach add Widrow.

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.2E
• /
• pp.3-9
• /
• 1999

In this paper we study the convergence behavior of the least mean fourth(LMF) algorithm where the error raised to the power of four is minimized for a multiple sinusoidal input and Gaussian measurement noise. Here we newly obtain the convergence equation for the sum of the mean of the squared weight errors, which indicates that the transient behavior can differ depending on the relative sizes of the Gaussian noise and the convergence constant. It should be noted that no similar results can be expected from the previous analysis by Walach and Widrow/sup [1]/.

• Journal of Korea Multimedia Society
• /
• v.18 no.9
• /
• pp.1019-1026
• /
• 2015

In this paper, we propose a new method of eye, face, and lip makeup techniques on the target face image from several makeup examples without losing detail features such as eyelids, eyebrows, hair. After detection of the feature layer for the skin, we applied our makeup techniques to the target face by using a blending technique. We used a cartoon rendering using bilateral filter. In order to smoothly makeup the target face, we created two Gaussian Weight maps for natural skin makeup effects. Our method did not need to perform complex operations, so the makeup results are so natural. Our experimental results show good performances in various makeups.

• Journal of the Korean Mathematical Society
• /
• v.34 no.2
• /
• pp.293-307
• /
• 1997

In this paper we present the $L^2$-estimation for the kernel $K_n$ of the remaider term for the Gaussian quadrature with respect to one of four Chebyshev weight functions and the error bound of the type on the contour $$ $\mid$R_n(f)$\mid$ \leq \frac{2\pi}{\sqrt{l(\Gamma)}} max_{z\in\Gamma}$\mid$f(z)$\mid$ (\smallint_\Gamma $\mid$K_n(z)$\mid$^2$\mid$dz$\mid$)^\frac{2}{1}, $$ where $l(\Gamma)$ denotes the length of the contour $\Gamma$.

• Journal of KIISE:Software and Applications
• /
• v.32 no.7
• /
• pp.612-624
• /
• 2005

In this paper, we propose a surface-based registration using a gaussian weighted distance map for PET-CT brain image fusion. Our method is composed of three main steps: the extraction of feature points, the generation of gaussian weighted distance map, and the measure of similarities based on weight. First, we segment head using the inverse region growing and remove noise segmented with head using region growing-based labeling in PET and CT images, respectively. And then, we extract the feature points of the head using sharpening filter. Second, a gaussian weighted distance map is generated from the feature points in CT images. Thus it leads feature points to robustly converge on the optimal location in a large geometrical displacement. Third, weight-based cross-correlation searches for the optimal location using a gaussian weighted distance map of CT images corresponding to the feature points extracted from PET images. In our experiment, we generate software phantom dataset for evaluating accuracy and robustness of our method, and use clinical dataset for computation time and visual inspection. The accuracy test is performed by evaluating root-mean-square-error using arbitrary transformed software phantom dataset. The robustness test is evaluated whether weight-based cross-correlation achieves maximum at optimal location in software phantom dataset with a large geometrical displacement and noise. Experimental results showed that our method gives more accuracy and robust convergence than the conventional surface-based registration.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.6
• /
• pp.2302-2316
• /
• 2015

We propose an efficient method of extracting targets within a region of interest in non-homogeneous infrared images by using a principal component analysis (PCA) plane and adaptive Gaussian kernel. Existing approaches for extracting targets have been limited to using only the intensity values of the pixels in a target region. However, it is difficult to extract the target regions effectively because the intensity values of the target region are mixed with the background intensity values. To overcome this problem, we propose a novel PCA based approach consisting of three steps. In the first step, we apply a PCA technique minimizing the total least-square errors of an IR image. In the second step, we generate a binary image that consists of pixels with higher values than the plane, and then calculate the second derivative of the sum of the square errors (SDSSE). In the final step, an iteration is performed until the convergence criteria is met, including the SDSSE, angle and labeling value. Therefore, a Gaussian kernel is weighted in addition to the PCA plane with the non-removed data from the previous step. Experimental results show that the proposed method achieves better segmentation performance than the existing method.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.5
• /
• pp.218-223
• /
• 2013

The performances of previous edge detection methods such as Sobel, Prewitt, and LoG(Laplacian of Gaussian) are insufficient for images degraded in AWGN(additive white Gaussian noise). Therefore, in this paper, we proposed an edge detection algorithm using a modified coefficient masks with gradient masks and distance weight mask. In order to confirm and verify the performance of the proposed algorithm, we simulated and compared proposed algorithm to conventional methods on various standard images added AWGN with a standard deviation ${\sigma}$=15, 30 and proposed algorithm shows superior edge detection characteristics in processed images.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.2
• /
• pp.259-264
• /
• 2017

Birth weight of a new born baby provides very important information in evaluating many clinical issues such as fetal growth restriction. This paper analyzes birth weight data of babies born in Korea from 2011 to 2013, and it shows that there is a biologically implausible distribution of birth weights in the data. This implies that some errors may be generated in the data collection process. In particular, this paper analyzes the relationship between gestational period and birth weight, and it is shown that the birth weight data mostly of gestational periods from 28 to 32 weeks have noticeable errors. Therefore, this paper employs the finite Gaussian mixture model to classify the collected data points into two classes: non-corrupted and corrupted. After the classification the paper removes data points that have been predicted to be corrupted. This adjustment scheme provides more natural and medically plausible percentile values of birth weights for all the gestational periods.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.7
• /
• pp.45-50
• /
• 2010

In this paper, we analysis the performance of cooperative spectrum sensing with distance based weight for cognitive radio (CR) systems and CR systems sense the spectrum of the licensed user by using a energy detection method. Threshold is determined in accordance with the constant false alarm rate (CFAR) algorithm for energy detection. The signal of licensed user is OFDM signal and the wireless channel between a licensed user and CR systems is modeled as Gaussian channel. From the simulation results, the cooperative spectrum sensing with distance based weight combining (DWC) and equal gain combing (EGC) methods shows higher spectrum sensing performance than single spectrum sensing does. And the detection probability performance with the DWC is higher than that with the EGC.