• Communications for Statistical Applications and Methods
• /
• v.7 no.3
• /
• pp.667-676
• /
• 2000

This paper focuses on the problem of detecting multiple leverage points and outliers in multivariate linear models. It is well known that he identification of these points is affected by masking and swamping effects. To identify them, Rousseeuw(1985) used robust estimators of MVE(Minimum Volume Ellipsoids), which have the breakdown point of 50% approximately. And Rousseeuw and van Zomeren(1990) suggested the robust distance based on MVE, however, of which the computation is extremely difficult when the number of observations n is large. In this study, e propose a new algorithm to reduce the computational difficulty of MVE. The proposed method is powerful in identifying multiple leverage points and outlies and also effective in reducing the computational difficulty of MVE.

• Proceedings of the KIEE Conference
• /
• 1987.11a
• /
• pp.425-429
• /
• 1987

This paper describes a collision avoidance method for planning safe trajectories for multi-robot system in common work space. Usually objects have been approximated to convex polyhedra in most previous researches, but in case using such the approximation method it is difficult to represent objects analytically in terms of functions and also to describe tile relationship between the objects. In this paper, in order to solve such problems a modeling method which approximates objects to cylinder ended by hemispheres and or sphere is used and the maximum distance functions is defined which call be calculated simply. Using an objective function with inequality constraints which are related to minimum distance functions, work range and maximum allowable angular velocities of the robots, tile collision avoidance for two robots is formulated to a constrained function optimization problem. With a view to solve tile problem a penalty function having simple form is defined and used. A simple numerical example involving two PUMA-type robots is described.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.2732-2734
• /
• 2000

This paper proposes a path planning algorithm for mobile robots. To generate a minimum-distance path for mobile robots, we use the Genetic Algorithm(GA) and Visibility Graph. After finding a minimum-distance path between a start and a goal point, the path is revised to find the smooth subminimum-distance path by a path-smoothing algorithm. Simulation results show that the proposed algorithms are effective.

• Communications for Statistical Applications and Methods
• /
• v.30 no.4
• /
• pp.411-421
• /
• 2023

This paper provides a new estimation equation based on the concept of a minimum distance between the empirical and theoretical distribution functions under the most widely used progressive Type-II censoring scheme. For illustrative purposes, simulated and real datasets from a three-parameter Weibull distribution are analyzed. For comparison, the most popular estimation methods, the maximum likelihood and maximum product of spacings estimation methods, are developed together. In the analysis of simulated datasets, the excellence of the provided estimation method is demonstrated through the degree of the estimation failure of the likelihood-based method, and its validity is demonstrated through the mean squared errors and biases of the estimators obtained from the provided estimation equation. In the analysis of the real dataset, two types of goodness-of-fit tests are performed on whether the observed dataset has the three-parameter Weibull distribution under the progressive Type-II censoring scheme, through which the performance of the new estimation equation provided is examined.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.23 no.3
• /
• pp.250-257
• /
• 2017

This paper investigates minimum safe distances relative to a ship's four cardinal sides, as perceived by Filipino navigators when encountering dangerous elements and in adverse weather conditions when maneuvering in and around harbors. It uses a descriptive research method in the form of a questionnaire survey for experienced Filipino navigators of various ranks. During the course of research, 71 responses were colleted and the resulting data is presented in graphical and tabulated forms. Statistical methods including Pearson-product moment correlations, Cronbach's Alpha and ANOVA were used to identify internal associations, consistencies and significances, respectively. It has been proven that there are no significant differences in minimum safe distances relative to a ship's four cardinal sides, whether maneuvering while approaching a port or within an inner harbor. This study has been deemed significant for training future navigators, managing traffic in fairways, and designing harbors and maneuvering areas in the approaches to ports, among other applications. This work can also be used as a preliminary study for comparison with the well known safe domains presently in use.

• Journal of the Korean Statistical Society
• /
• v.30 no.1
• /
• pp.41-61
• /
• 2001

The minimum negative exponential disparity estimator(MNEDE), introduced by Lindsay(1994), is an excellenet competitor to the minimum Hellinger distance estimator(Beran 1977) as a robust and yet efficient alternative to the maximum likelihood estimator in parametric models. In this paper we define the negative exponential deviance test(NEDT) as an analog of the likelihood ratio test(LRT), and show that the NEDT is asymptotically equivalent to he LRT at the model and under a sequence of contiguous alternatives. We establish that the asymptotic strong breakdown point for a class of minimum disparity estimators, containing the MNEDE, is at least 1/2 in continuous models. This result leads us to anticipate robustness of the NEDT under data contamination, and we demonstrate it empirically. In fact, in the simulation settings considered here the empirical level of the NEDT show more stability than the Hellinger deviance test(Simpson 1989). The NEDT is illustrated through an example data set. We also define a goodness-of-fit statistic to assess adequacy of a specified parametric model, and establish its asymptotic normality under the null hypothesis.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.2
• /
• pp.69-75
• /
• 2010

In this paper, we analyze an effect co-existence between digital television (DTV) and 802.22 wireless regional area network (WRAN) systems. We set DTV as an interfering system and 802.22 WRAN as a victim system. When they share the same spectrum, we calculate the minimum separation distance. In analysis, we compare a minimum coupling loss (MCL) with a transmission loss (TL) for determining whether there exists the potential interference or not. The minimum separation distance is determined when the TL is larger than the MCL. In this case, the DTV system does not affect any harmful effect to 802.22 WRAN.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2009.05a
• /
• pp.7-8
• /
• 2009

Non-contact critical current measurement apparatus was developed using hall probe which measures the magnetic field distribution across the width of superconducting tape. The hall probe consists of 7 independent hall sensors which lie in a line 600 ${\mu}m$. The difference between maximum and minimum magnetic field in the magnetic filed distribution is a main parameter to determine the critical current. As preliminary research, we calculated the magnetic field intensity at the middle sensor, which is a minimum magnetic field and generated by the circular shielding current modeled by Bean model. We confirmed that there are some parameters that affect on the minimum magnetic field; the distance between superconducting layer and hall sensor, the width of superconducting tape, and the critical current distribution across the width of superconducting tape. Among these parameters, the distance between superconducting layer and hall sensor highly influences on the minimum magnetic field.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.26-28
• /
• 2007

The motion estimation is the most important technique in the image compression of the video standards. In the case of next generation standards in the video codec as H.264, a high compression-efficiency can be also obtained by using a motion compensation. To obtain the accurate motion search, a motion estimation should be achieved up to 1/2 pixel and 1/4 pixel uiuts. To do this, the computational complexity is increased although the image compression rate is increased. Therefore, in this paper, we propose the advanced sub-pixel block matching algorithm to reduce the computational complexity by using a statistical characteristics of SAD(Sum of Absolute Difference). Generally, the probability of the minimum SAD values is high when searching point is in the distance 1 from the reference point. Thus, we reduced the searching area and then we can overcome the computational complexity problem. The main concept of proposed algorithm, which based on TSS(Three Step Search) method, first we find three minimum SAD points which is in integer distance unit, and then, in second step, the optimal point is in 1/2 pixel unit either between the most minimum SAD value point and the second minimum SAD point or between the most minimum SAD value point and the third minimum SAD point In third step, after finding the smallest SAD value between two SAD values on 1/2 pixel unit, the final optimized point is between the most minimum SAD value and the result value of the third step, in 1/2 pixel unit i.e., 1/4 pixel unit in totally. The conventional TSS method needs an eight.. search points in the sub-pixel steps in 1/2 pixel unit and also an eight search points in 1/4 pixel, to detect the optimal point. However, in proposed algorithm, only total five search points are needed. In the result. 23 % improvement of processing speed is obtained.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.418-418
• /
• 2000

This paper proposes a path planning algorithm for mobile robot. To generate an optimal path and minimum time path for a mobile robot, we use the Genetic Algorithm(GA) and Visibility Graph. After finding a minimum-distance between start and goal point, the path is revised to find the minimum time path by path-smoothing algorithm. Simulation results show that the proposed algorithms are more effective.