• 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 IEEK Conference
• /
• 2000.11d
• /
• pp.65-68
• /
• 2000

This paper describes an approach for extracting invariant features using a view-based representation and recognizing an object with a high speed search method in FLIR. In this paper, we use a reformulated eigenspace technique based on robust estimation for extracting features which are robust for outlier such as noise and clutter. After extracting feature, we recognize an object using a partial distance search method for calculating Euclidean distance. The experimental results show that the proposed method achieves the improvement of recognition rate compared with standard PCA.

• Journal of the Korean Society for Precision Engineering
• /
• v.25 no.3
• /
• pp.147-156
• /
• 2008

A new approach based on cone prism intersection method combined with sorting algorithm is proposed for the fast and robust signed distance field computation. In the method, the space bounding the geometric model composed of triangular net is divided into multiple smaller cells. For the efficient calculation of distance fields, valid points among the triangular net which will generate minimum distances with current cell are selected by checking the intersection between current cell and cone prism generated at each point. The method is simple to implement and able to achieve an order of magnitude improvement in the computation time as compared to earlier approaches. Further the method is robust in handling the traditional sign problems. The validity of the suggested method was demonstrated by providing numerous examples including Boolean operation, shape deformation and morphing of complex geometric models.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.263-266
• /
• 2000

We proposes a new fingerprint minutia matching algorithm which matches the fingerprint minutiae by using adaptive distance. In general, fingerprint is deformed by pressure and orientation when a user press his fingerprint to sensor. These nonlinear deformations change the distance between minutiae and reduce verification rate. We define the adaptive distance using ridge frequency. Adaptive distance normalizes the distance between minutiae and compensates for nonlinear deformation. Our algorithm can distinguish two different fingerprints better and is more robust. Experimental results show that the performance of the proposed algorithm is superior to using Euclidean distance.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.3
• /
• pp.52-60
• /
• 2019

This paper presents a numerically robust algorithm to construct a Voronoi diagram of circles in the plane. The circles are allowed to have intersections among them, but one circle cannot fully contain another circle. The Voronoi diagram is a tessellation of the plane into Voronoi regions of given circles. Each circle has its Voronoi region which is defined by a set of points in the plane closer to the circle than any other circles. The distance from a point p to a circle $c_i$ of center $p_i$ and radius $r_i$ is ${\parallel}p-p_i{\parallel}-r_i$, which is the closest Euclidean distance from p to the circle boundary. The proposed algorithm first constructs the point Voronoi diagram of centers of given circles, then it enlarges each point to the circle and expands its Voronoi region accordingly. This region-expansion process is done by local modifications and after completing this process for the whole circles the desired circle Voronoi diagram can be obtained. The proposed algorithm is numerically robust and we provide with a few examples to show its robustness. The algorithm runs in $O(n^2)$ time in the worst case and O(n) time on average where n is the number of the circles. The experiment shows that the region-expansion algorithm is robust and runs fast with strong linear time behavior.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.15 no.1
• /
• pp.95-102
• /
• 2016

Wrinkle, spring-back, and fracture are major defects frequently found in the sheet metal forming process, and the reduction of such defects is difficult as they are affected by uncontrollable factors, such as variations in properties of the incoming material and process parameters. Without any countermeasures against these issues, attempts to reduce defects through optimal design methods often lead to failure. In this research, a new multi-attribute robust design methodology, based on the Mahalanobis Taguchi System (MTS), is presented for reducing the possibilities of wrinkle, spring-back, and fracture. MTS performs experimentation, based on the orthogonal array under various noise conditions, uses the SN ratio of the Mahalanobis distance as a performance metric. The proposed method is illustrated through a robust design of the sheet metal forming process of a cross member of automotive body.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2007.04a
• /
• pp.333-338
• /
• 2007

The concept of "Allowable Load Set (ALS)" introduced by the author allows an easy understanding of load and strength characteristics of a structure in relation to its integrity under uncertainties. Two criteria of safety are introduced: A relative safety index denotes the distance to the boundary of the ALS and a normalized safety index is a distance in terms of functional value. They have been utilized in several examples, including multi-body mechanical systems such as a biomechanical system. Both formulations amount to robust designs in the sense that designs most insensitive to uncertainties are obtained in the context of newly defined safety indices, without using any input probability information.

• Journal of the Korean Data and Information Science Society
• /
• v.17 no.1
• /
• pp.213-220
• /
• 2006

Since Beran (1977) developed the minimum Hellinger distance estimation, this method has been a popular topic in the field of robust estimation. In the process of defining a distance, a kernel density estimator has been widely used as a density estimator. In this article, however, we show that a combination of a kernel density estimator and an empirical density could result a smaller bias of the minimum Hellinger distance estimator than using just a kernel density estimator for a location parameter.

• The Journal of Korea Robotics Society
• /
• v.19 no.1
• /
• pp.106-116
• /
• 2024

Ensuring robust 3D object detection is a core challenge for autonomous driving systems operating in urban environments. To tackle this issue, various 3D representation, including point cloud, voxels, and pillars, have been widely adopted, making use of LiDAR, Camera, and Radar sensors. These representations improved 3D object detection performance, but real-world urban scenarios with unexpected situations can still lead to numerous false positives, posing a challenge for robust 3D models. This paper presents a post-processing algorithm that dynamically adjusts object detection thresholds based on the distance from the ego-vehicle. While conventional perception algorithms typically employ a single threshold in post-processing, 3D models perform well in detecting nearby objects but may exhibit suboptimal performance for distant ones. The proposed algorithm tackles this issue by employing adaptive thresholds based on the distance from the ego-vehicle, minimizing false negatives and reducing false positives in the 3D model. The results show performance enhancements in the 3D model across a range of scenarios, encompassing not only typical urban road conditions but also scenarios involving adverse weather conditions.

• Communications for Statistical Applications and Methods
• /
• v.5 no.2
• /
• pp.517-529
• /
• 1998

When the sample size is small the robust minimum Hellinger distance (HD) estimator can have substantially poor relative efficiency at the true model. Similarly, approximating the exact null distributions of the ordinary Hellinger distance tests with the limiting chi-square distributions can be quite inappropriate in small samples. To overcome these problems Harris and Basu (1994) and Basu et at. (1996) recommended using a modified HD called penalized Hellinger distance (PHD). Lindsay (1994) and Basu et al. (1997) showed that another density based distance, namely the negative exponential disparity (NED), is a major competitor to the Hellinger distance in producing an asymptotically fully efficient and robust estimator. In this paper we investigate the small sample performance of the estimates and tests based on the NED and penalized NED (PNED). Our results indicate that, in the settings considered here, the NED, unlike the HD, produces estimators that perform very well in small samples and penalizing the NED does not help. However, in testing of hypotheses, the deviance test based on a PNED appears to achieve the best small-sample level compared to tests based on the NED, HD and PHD.