• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.227-236
• /
• 2001

This paper proposes a frequency-domain partially adaptive algorithm, called a censoring algorithm, to reduce the computational complexity of the frequency domain adaptive array. The proposed censoring algorithm determines the existence of interferences in the frequency-domain at each frequency bin using a constant false alarm rate (CFAR) processor. The censoring algorithm adapts only those parts of the weights that correspond to the frequency bins expected to contain interferences. The censoring algorithm is also expanded to overcome the signal cancellation phenomenon caused by smart jammers. Accordingly, a censoring spatial smoothing, which combines the censoring algorithm with spatial smoothing, is proposed. Simulation results show that the proposed algorithms are effective in removing interferences with only part of the computational complexity of conventional algorithms yet with the same level of performance.

• Journal of the Korean Society of Safety
• /
• v.27 no.4
• /
• pp.108-114
• /
• 2012

Traffic Accident Merging Index(TAMI) is developed for TMACS(Traffic Safety Information Management Complex System). TAMI is calculated by combining 'Severity Index' and 'Frequency'. This paper suggest the accurate TAMI prediction model by time series forecasting. Preventing the traffic accident by accurately predicting it in advance can greatly improve road traffic safety. Searches the model which minimizes the error of 230 local self-governing groups. TAMI of 2007~2009 years data predicts TAMI of 2010. And TAMI of 2010 compares an actual index and a prediction index. And the error is minimized the constant where selects. Exponential Smoothing model was selected. And smoothing constant was decided with 0.59. TAMI Forecasting model provides traffic next year safety information of the local government.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.12
• /
• pp.3694-3702
• /
• 1999

OSL algorithm has an advantage that repeated algorithm is easily derived, even though penalty function which has a complicated transcendental function. In order to solve this problem, we suggested MPEMG algorithm. However, though this algorithm extend convergence rate of smoothing constant, it include the problem that is not faster than OSL algorithm in the convergence rate increasing penalized log-likelihood. Accordingly, in this paper, we will suggest SMOSLG digital image restoration algorithm which is fast in the convergence rate as well as extend convergence region of smoothing constant. And also we will study the usefulness of algorithm suggested through digital image simulation.

• Communications for Statistical Applications and Methods
• /
• v.16 no.3
• /
• pp.519-528
• /
• 2009

This paper deals with nonparametric estimation of discontinuous regression curve. Quite number of researches about this topic have been done. These researches are classified into two categories, the indirect approach and direct approach. The major goal of the indirect approach is to obtain good estimates of jump locations, whereas the major goal of the direct approach is to obtain overall good estimate of the regression curve. Thus it seems that two approaches are quite different in nature, so people say that the comparison of two approaches does not make much sense. Therefore, a thorough comparison of them is lacking. However, even though the main issue of the indirect approach is the estimation of jump locations, it is too obvious that we have an estimate of regression curve as the subsidiary result. The point is whether the subsidiary result of the indirect approach is as good as the main result of the direct approach. The performance of two approaches is compared through a simulation study and it turns out that the indirect approach is a very competitive tool for estimating discontinuous regression curve itself.

• Journal of Korea Game Society
• /
• v.6 no.2
• /
• pp.51-60
• /
• 2006

Smoothing is a transmission plan where variable rate video data is converted to a constant bit rate stream. Among them are CBA, MCBA, MVBA, PCRTT and others. But, in these algorithm, a transmission plan is made in according to stored frame sequence in these algorithms. In case that the number of bytes in frames in GOP differs greatly each other, this may cause unnecessary transmission rate changes and may require high transmission rates abruptly when frame's byte is large. In result, it is difficult to use efficient network resource. In this paper, we proposed a smoothing algorithm that find the optimal frame sequence in short time by using backtracking method and smoothing's structure for the proposed smoothing algorithm. This algorithm decides the sequence of frames which requires the lowest variance of frame's bytes in GOP and make a transmission plan. In order to show the performance, we compared with MVBA algorithm by various evaluation factors such as the number of rate changes, peak rate, rate variability.

• Journal of Internet of Things and Convergence
• /
• v.8 no.1
• /
• pp.53-58
• /
• 2022

Smoothing is a transmission plan that converts video data stored at a variable bit rate into a constant bit rate. In the study of [6-7], when a data rate increase is required, the frame with the smallest increase is set as the start frame of the next transmission rate section, when a data tate decrease is required. the frame with the largest decrease is set as the start frame of the next transmission rate section, And the smoothing algorithm was proposed and performance was evaluated in an environment where network traffic is not considered. In this paper, the smoothing algorithm of [6-7] evaluates the adaptive CBA algorithm and performance with minimum frame rate, average frame rate, and frame rate variation from 512KB to 32MB with E.T 90 video data in an environment that considers network traffic. As a result of comparison, the smoothing algorithm of [6-7] showed superiority in the comparison of the minimum refresh rate.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1984.10a
• /
• pp.101-103
• /
• 1984

The proposed seal identification procedure consists of the thresholding smoothing, rotation, thinning, and matching techniques. The weighted map is constructed by ditance weighted correlation CK is computed. The CK is compared with the dicision constant Cs or Cd for the purpose of seal identification.

• Journal of Digital Contents Society
• /
• v.12 no.4
• /
• pp.485-490
• /
• 2011

Smoothing is a transmission plan where variable rate video data is converted to a constant bit rate stream. These smoothing algorithms include CBA, MCBA, MVBA, PCRTT and others. But, these algorithms build a transmission plan per frame unit. So, these algorithms cause frame burst or GOP burst. In order to improve it, MVBAG algorithm build a transmission plan per GOP. But this algorithm may not guarantee QoS when frame's size is abruptly larger or smaller than the computed transmission rate. In this paper, a smoothing algorithm is proposed to enhance MVBAG algorithm's problem. In order to show the proposed algorithm's performance, the proposed algorithm is compared with MVBAG algorithm using various evaluation factors such as number of frames that do not meet the QoS, average transmission rate variability per frame, average transmission rate variability per GOP. Experimental results show that the proposed algorithm outperforms MVBAG algorithm in number of frames that do not meet the QoS.

• Journal of the Ergonomics Society of Korea
• /
• v.30 no.6
• /
• pp.689-694
• /
• 2011

Objective: The aim of this study is to evaluate the fluctuation of signal amplitude during repetitive dynamic contraction based on surface electromyography(EMG). Background: The most previous studies were considered isometric muscle contraction and they were difference to smoothing window length by moving average filter. In practical, the human movement is dynamic state. Dynamic EMG signal which indicated as the nonstationary pattern should be analyzed differently compared with the static EMG signal. Method: Ten male subjects participated in this experiment, and EMG signal was recorded by biceps brachii, anterior/posterior deltoid, and upper/lower trapezius muscles. The subject was performed to repetitive right horizontal lifting task during ten cycles. This study was considered three independent variables(muscle, amplitude processing technique, and smoothing window length) as the within-subject experimental design. This study was estimated muscular activation by means of the linear envelope technique(LE). The dependent variable was set coefficient of variation(CV) of LE for each cycle. Results: The ANOVA results showed that the main and interaction effects between the amplitude processing technique and smoothing window length were significant difference. The CV value of peak LE was higher than mean LE. According to increase the smoothing window length, this study shows that the CV trend of peak LE was decreased. However, the CV of mean LE was analyzed constant fluctuation trend regardless of the smoothing window length. Conclusion: Based on these results, we expected that using the mean LE and 300ms window length increased reproducibility and signal noise ratio during repetitive dynamic muscle contraction. Application: These results can be used to provide fundamental information for repetitive dynamic EMG signal processing.

• Journal of Korea Game Society
• /
• v.7 no.2
• /
• pp.33-40
• /
• 2007

Smoothing is a transmission plan where variable rate video data is converted to a constant bit rate stream. Among them are CBA, MCBA, MVBA and others. However, these smoothing algorithms produce a transmission plan where extra bandwidth in server is not considered. This may cause difficulty in providing videos to many clients in a server. In this paper, we propose the smoothing algorithm with monotonic transmission rate increase and abrupt transmission rate decrease, in order to provide videos to as many clients in server with limited network bandwidth as possible. In order to show the performance of our proposed algorithm, various evaluation factors were used such as the maximum number of clients, the average number of clients, and so on. Experiments demonstrated that the proposed algorithm outperformed other algorithms in evaluation factors such as the maximum number of clients and the average number of clients.