• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1990.06a
• /
• pp.120-123
• /
• 1990

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.10
• /
• pp.2419-2424
• /
• 2013

In a conventional MOG algorithm, a small threshold for background decision causes the background recognition delay in a periodic background and a large threshold makes it recognize passing objects as background in a stationary background. This paper proposes the improved MOG algorithm using adaptive threshold. The proposed algorithm estimates changes of weight in the dominant model of the MOG algorithm both in the short and long terms, classifies backgrounds into the stationary and periodic ones, and assigns proper thresholds to them. The simulation results show that the proposed algorithm decreases the maximum number of frame in background recognition delay from 137 to 4 in the periodic background keeping the equal performance with the conventional algorithm in the stationary background.

• The KIPS Transactions:PartB
• /
• v.10B no.6
• /
• pp.619-628
• /
• 2003

In this paper, an effective watermark detection technique in the wavelet transform domain is proposed. In this proposed method, the image is 2-level wavelet transformed, and then the watermark with a binary logo is embedded into middle band except baseband and high band to consider Invisibility and robustness. In this paper, we use an asymmetric thresholds watermarking (ATW) in which detection threshold is higher than inserting threshold in order to enhance watermark detection ratio in attacked images. In watermark detection phase, the detection value is not changed when the difference of the selected wavelet neighboring coefficient pairs Is smaller than specific value. The experimental results show that the proposed method has good quality and is robust to various attacks such as the JPEG lossy compression, noise addition, cropping, blurring, etc.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.4 s.304
• /
• pp.51-58
• /
• 2005

This paper proposes a robust scene change detection technique that uses the weighted chi-square test and the automated threshold-decision algorithms. The weighted chi-square test can subdivide the difference values of individual color channels by calculating the color intensities according to NTSC standard, and it can detect the scene change by joining the weighted color intensities to the predefined chi-square test which emphasize the comparative color difference values. The automated threshold-decision at algorithm uses the difference values of frame-to-frame that was obtained by the weighted chi-square test. At first, The Average of total difference values is calculated and then, another average value is calculated using the previous average value from the difference values, finally the most appropriate mid-average value is searched and considered the threshold value. Experimental results show that the proposed algorithms are effective and outperform the previous approaches.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.2
• /
• pp.19-27
• /
• 1999

This paper propose a contention resolution policy featuring dynamic change of the threshold for the occupancy of the input buffer for an input buffering ATM switching architecture and its hardware implementation strategy. The strategy is provided with the aim of the simple structure that achieves the reduction of the signal path and the power consumption. The threshold is changed dynamically every time slot based both the arrived of cells and the cell service resulting from the contention resolution. The performance on the cell loss of the proposed policy is performed and compared with the conventional policy under the diverse traffic conditions through both the analysis based ont the Markov chain and the simulation.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.215-219
• /
• 2005

Generally, the mobile nodes in MANET have the limited power capacity available for actual communications. Thus, the power management is very important for packet routing or forwarding. Although MTPR, MBCR and MMBCR are proposed to treat the problem of power consumption, there have been few researches resolving the link breakdown that is occurred by the power exhaustion during transmission. In this sense, the reliable scheme should be required to ensure the routing connectivity. In this paper, we propose three schemes to enforce the routing connectivity. If the signal strength is dropped below a signal threshold, the candidate route is previously selected to prepare the link breakdown. Also, on multi-channel, we propose the lifetime increment scheme of a node that it manage its available power to the needed power of a new link. The simulation results show the enforcement of the link connectivity and the performance improvements of the delay time through the effective connection management.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11a
• /
• pp.649-652
• /
• 2002

PCA 방법은 입력 차원을 수학적으로 줄일 수 있는 장점 때문에 패턴인식 부분에서 널리쓰이고 있다. 얼굴인식에서의 PCA는 학습 패턴의 분산을 최대로 하는 기저 벡터들인 고유얼굴을 만들어 얼굴인식이 필요한 영상을 이 기저 벡터에 투사시켜 이때 나온 인자들과 원래 각 개인의 대표 인자값과의 거리 비교로 얼굴을 인식하는 방법이다. 그러나 조명등의 영향에 매우 민감하며 거리값으로 얼굴을 인식하기 때문에 다양한 변화에 따라 오인식률이 높아진다. 이는 인식률을 높이고자 임계값을 높게 설정하는 과정에서 발생하는 오류이며, 이를 방지하기 위해 임계치를 낮게 설정하면 오거부율이 높아진다. 이에 본 연구에서는 PCA에 입력되는 패턴들을 사전에 비교, 분류하여 PCA 연산시에 분산과 변위를 최대한으로 가질 수 있도록 하였다. 그러하여, 기존의 PCA보다 상당히 낮은 임계값으로도 오거부율의 증가를 막았으며, 낮은 임계값 설정으로 인하여 오인식률을 낮추는 결과를 얻을 수 있었다. 이는 기존의 PCA 방법을 사용하는 인식시스템에서 종종 발생하는 허가되지 않아야 하는 외부인을 인증시키는 사례를 줄일 수 있다.

• Journal of the Korean Data and Information Science Society
• /
• v.20 no.4
• /
• pp.705-712
• /
• 2009

Histogram is the oldest and most widely used density estimator for presentation and exploration of observed univariate data. The structure of a histogram really depends on the number of bins and the width of the bins, so that slight changes on bins can produce totally different shape of a histogram. In order to solve this problem the fuzzy histogram was introduced and the result was good enough (Loquin and Strauss, 2008). In particular, when estimating loss distribution related with operational risk a histogram has been widely used. In this article, instead of an ordinary histogram we try to use a fuzzy histogram for estimating loss distribution and show that a fuzzy histogram provide more stable results.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.8
• /
• pp.535-542
• /
• 2013

Since case-based reasoning(CBR) has many advantages, it has been used for supporting decision making in various areas including medical checkup, production planning, customer classification, and so on. However, there are several factors to be set by heuristics when designing effective CBR systems. Among these factors, this study addresses the issue of selecting appropriate neighbors in case retrieval step. As the criterion for selecting appropriate neighbors, conventional studies have used the preset number of neighbors to combine(i.e. k of k-nearest neighbor), or the relative portion of the maximum similarity. However, this study proposes to use the absolute similarity threshold varying from 0 to 1, as the criterion for selecting appropriate neighbors to combine. In this case, too small similarity threshold value may make the model rarely produce the solution. To avoid this, we propose to adopt the coverage, which implies the ratio of the cases in which solutions are produced over the total number of the training cases, and to set it as the constraint when optimizing the similarity threshold. To validate the usefulness of the proposed model, we applied it to a real-world target marketing case of an online shopping mall in Korea. As a result, we found that the proposed model might significantly improve the performance of CBR.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.6
• /
• pp.1122-1128
• /
• 2007

The denoising for image restoration based on the Wavelet Packet Transform with AA(Absolute Average) making-threshold is presented. The wavelet packet transform leads to be better in the part of high frequency than wavelet transform to eliminate noise. And the existing threshold determination is used standard deviation estimated results in increasing the noise and threshold, and damaging an image quality. In addition that is decreased image restoration PSNR by using the same threshold in spite of changing image because of installing a threshold in proportion of noise size. In contrast the AA thresholding method with wavelet packet is adapted by changing image to set up threshold by statistic quantity of resolved image and is avoided an extreme impact. The results on the experiment has improved 10% and 5% over than the denoising based on simple wavelet transform and wavelet packet respectively.