• The Korean Journal of Applied Statistics
• /
• v.15 no.2
• /
• pp.269-279
• /
• 2002

We considered the problem for confirmation of multiple outliers and leverage points. Identification of multiple outliers and leverage points is difficult because of the masking effect and swamping effect. Rousseeuw and van Zomeren(1990) identified multiple outliers and leverage points by using the Least Median of Squares and Minimum Value of Ellipsoids which are high-breakdown robust estimators. But their methods tend to declare too many observations as extremes. Atkinson(1987) suggested a method for confirming of outliers and Fung(1993) pointed out Atkinson method's limitation and proposed another method by using the add-back model. But we analyzed that Fung's method is affected by adjacent effect. In this thesis, we proposed one procedure for confirmation of outliers and leverage points and compared three example with Fung's method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.9
• /
• pp.1921-1927
• /
• 2009

In this paper, a point-to-multipoint wireless communication system based on Bluetooth specifications, which is possibly applied to very large vessels, is implemented and analyzed. Here, a communication network is composed of a slave Bluetooth module connected to the task computer and multiple master Bluetooth modules equipped with a sensor. And exploiting the point-to-multipoint data communication among the Bluetooth modules, a surveillance system that recognizes and controls a variety of emergency situations happened on a large vessel is implemented. It is, therefore, considered that the wireless communication system implemented in this paper is possibly exploited a basic technology for the digital shipbuilding of the next generation.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.42 no.11
• /
• pp.911-918
• /
• 2014

In this paper, a selective activation strategy of cohesive elements using user subroutine UMPC was studied as an efficient solution for the added compliance problem in cohesive zone model crack propagation analyses. The cohesive elements were inserted between every bulk elements in region where cracks were expected to initiate and propagate, but initially not activated by tying the cohesive nodes using multi-point constraints. During analyses, the cohesive elements for which specified criterion was met were selectively activated by releasing the constraints. The effect of initial cohesive stiffness and the release criterion on the crack propagation behavior was carefully investigated.

• Communications for Statistical Applications and Methods
• /
• v.3 no.3
• /
• pp.11-23
• /
• 1996

본 연구에서는 선형회귀분석에서 Hadi와 Simonoff의 다중이상점 식별방법을 수정하여 새로운 알고리즘을 제시하였다. Hadi와 Simonoff의 알고리즘 첫 단계에서 이상점일 가능성이 없는 점들의 집합을 추출할 때 가장효과와 편승효과에 영향을 받을 수 있음으로, 이 첫 단계를 수정하였다. 우리는 잔차가 일정한 분산을 갖는 정규분포에 다르다는 가정하에서 잔차의 신뢰구간을 생각하고, 이 구간안에서 잔차의 MAD가 최소인 새로운 모형을 탐색하고, 이를 이상점일 가능성이 없는 점들의 집합을 추출하는데 일용하는 새로운 알로리즘을 제시하였다. 제시된 방법은 실제자료에서 다른 방법에 비해 효율적으로 이상점을 식별할 수 있었다.

• The Korean Journal of Applied Statistics
• /
• v.32 no.4
• /
• pp.561-572
• /
• 2019

We study false discovery rate segmentation (FDRSeg) and simultaneous multiscale change-point estimator (SMUCE) methods for multiscale multiple change-point estimation, and compare empirical behavior via simulation. FSRSeg is based on the control of a false discovery rate while SMUCE used for the multiscale local likelihood ratio tests. FDRSeg seems to work best if the number of change-points is large; however, FDRSeg and SMUCE methods can both provide similar estimation results when there are only a small number of change-points. As a real data application, multiple change-points estimation is done with the well-log data.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.47 no.5
• /
• pp.379-387
• /
• 2019

The complexity of path planning for visiting multiple mission points is even larger than that of single pair path planning. Deciding a path for visiting n mission points requires conducting $n^2+n$ times of single pair path planning. We propose Multiple Mission $D^*$ Lite($MMD^*L$) which is an optimal path planning algorithm for visiting multiple mission points in dynamic environments. $MMD^*L$ reduces the complexity by reusing the computational data of preceding single pair path planning. Simulation results show that the complexity reduction is significant while its path optimality is not compromised.

• Journal of the Institute of Convergence Signal Processing
• /
• v.19 no.1
• /
• pp.1-6
• /
• 2018

In this paper, we propose the method to eliminate repetitive processes for key-point detection on multi-scale image space. The proposed method detects key-points from the original image, and select a good key-points using the cluster filters, and create the key-point clusters. And it select reference objects by using direction angles of the key-point clusters, predict the scale of the original image by using the distributed distance ratio. It transform the scale of the reference image, and apply the detection of key-points to the transformed reference image. In the results of the experiment, the proposed method can be found to improve the key-points detection time by 75 % and 71 % compared to SIFT method and scaled ORB method using the multi-scale images.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1996.10a
• /
• pp.801-806
• /
• 1996

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1999.10a
• /
• pp.174-174
• /
• 1999

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.2 s.46
• /
• pp.131-139
• /
• 2007

This paper proposed a multi-resolution algorithm. Its search point and complexity were compared with those of block match algorithm. Also the speed up comparison was made with the block match algorithm. The proposed multi-resolution NTSS-3 Level algorithm was compared again with its targets, TSS-3 Level algorithm and NTSS algorithm. The comparison results showed that the NTSS-3 Level algorithm was superior in search point and speed up. Accordingly, the proposed NTSS-3 Level algorithm was two to three times better in search point and two to four times better in complexity calculation than those of the compared object, the block match algorithm. In speed up, the proposed NTSS-3 Level algorithm was two times better. Accordingly, the proposed multi-resolution NTSS-3 Level algorithm showed PSNR ration portion excellency in search point and speed up.