• Journal of the Korean Statistical Society
• /
• v.27 no.1
• /
• pp.113-132
• /
• 1998

In this paper, we consider a minimum distance (M.D.) estimation based on kernels for U-statistics. We use Cramer-von Mises type distance function which measures the discrepancy between U-empirical distribution function(d.f.) and modeled d.f. of kernel. In the distance function, we allow various integrating measures, which can be finite, $\sigma$-finite or discrete. Then we derive the asymptotic normality and study the qualitative robustness of M. D. estimates.

• Journal of Ubiquitous Convergence Technology
• /
• v.2 no.1
• /
• pp.18-26
• /
• 2008

The invariance relation existing in the non-negative matrix factorization (NMF) is used for constructing robust image hashes in this work. The image is first re-scaled to a fixed size. Low-pass filtering is performed on the luminance component of the re-sized image to produce a normalized matrix. Entries in the normalized matrix are pseudo-randomly re-arranged under the control of a secret key to generate a secondary image. Non-negative matrix factorization is then performed on the secondary image. As the relation between most pairs of adjacent entries in the NMF's coefficient matrix is basically invariant to ordinary image processing, a coarse quantization scheme is devised to compress the extracted features contained in the coefficient matrix. The obtained binary elements are used to form the image hash after being scrambled based on another key. Similarity between hashes is measured by the Hamming distance. Experimental results show that the proposed scheme is robust against perceptually acceptable modifications to the image such as Gaussian filtering, moderate noise contamination, JPEG compression, re-scaling, and watermark embedding. Hashes of different images have very low collision probability. Tampering to local image areas can be detected by comparing the Hamming distance with a predetermined threshold, indicating the usefulness of the technique in digital forensics.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.11
• /
• pp.42-48
• /
• 1990

In this paper robust test generation for stuck-open faults in CMOS circuits is proposed. By obtaining initialization patterns and test patterns using the relationship of bit position and Hamming weight among input vectors for CMOS circuit test generation time for stuck-open faults can be reduced, and the problem of input transition skew which make fault detection difficult is solved, and the number of test sequences are minimized. Also the number of test sequences is reduced by arranging test sequences using Hamming distance between initialization patterns and test patterns for circuit.

• The Journal of Korea Robotics Society
• /
• v.3 no.2
• /
• pp.117-122
• /
• 2008

This paper presents a multi-robot localization based on multidimensional scaling (MDS) in spite of the existence of incomplete and noisy data. While the traditional algorithms for MDS work on the full-rank distance matrix, there might be many missing data in the real world due to occlusions. Moreover, it has no considerations to dealing with the uncertainty due to noisy observations. We propose a robust MDS to handle both the incomplete and noisy data, which is applied to solve the multi-robot localization problem. To deal with the incomplete data, we use the Nystr$\ddot{o}$m approximation which approximates the full distance matrix. To deal with the uncertainty, we formulate a Bayesian framework for MDS which finds the posterior of coordinates of objects by means of statistical inference. We not only verify the performance of MDS-based multi-robot localization by computer simulations, but also implement a real world localization of multi-robot team. Using extensive empirical results, we show that the accuracy of the proposed method is almost similar to that of Monte Carlo Localization(MCL).

• Journal of Electrical Engineering and Technology
• /
• v.3 no.2
• /
• pp.207-212
• /
• 2008

This paper presents a robust and computationally efficient optimal design algorithm for electromagnetic devices by combining an adaptive response surface approximation of the objective function and($1+{\lambda}$) evolution strategy. In the adaptive response surface approximation, the design space is successively reduced with the iteration, and Pareto-optimal sampling points are generated by using Latin hypercube design with the Max Distance and Min Distance criteria. The proposed algorithm is applied to an analytic example and TEAM problem 22, and its robustness and computational efficiency are investigated.

• Communications for Statistical Applications and Methods
• /
• v.12 no.3
• /
• pp.625-634
• /
• 2005

A procedure is proposed to identify multiple outliers in the logistic regression. It detects the leverage points by means of hierarchical clustering of the robust distances based on the minimum covariance determinant estimator, and then it employs a V-mask type criterion on the scatter plot of robust residuals against robust distances to classify the observations into vertical outliers, bad leverage points, good leverage points, and regular points. Effectiveness of the proposed procedure is evaluated on the basis of the classic and artificial data sets, and it is shown that the procedure deals very well with the masking and swamping effects.

• Journal of information and communication convergence engineering
• /
• v.8 no.6
• /
• pp.640-644
• /
• 2010

When we talk with hands-free in a car or noisy lobby, the performance of the echo canceller degrade because background noise added to echo caused by the distance from mouth to microphone is relatively long. It gives a reason for necessity of noise-robust and high convergence speed adaptive algorithm. And if acoustic echo canceller operated not perfectly, residual signal going through the echo canceller to far-end speaker remains residual echo, which degrade quality of talk. To solve this problem, post-processing needed to remove residual echo ones more. In this paper, we propose a new acoustic echo canceller, which has noise robust and high convergence speed, linked with linear predictor as a post-processor. By computer simulation, it is confirmed that the proposed algorithm shows better performance from acoustic interference cancellation (AIC) viewpoint.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.283-286
• /
• 2001

In this paper, we present a robust region segmentation method based on the watershed transformation of a pseudo-distance map (PDM). A usual approach for the segmentation of a gray-scale image with the watershed algorithm is to apply it to a gradient magnitude image or the Euclidean distance map (EDM) of an edge image. However, it is well known that this approach suffers from the oversegmentation of the given image due to noisy gradients or spurious edges caused by a thresholding operation. In this paper we show thor applying the watershed algorithm to the EDM, which is a regularized version of the EDM and is directly computed form the edgestrength function (ESF) of the input image, significantly reduces the oversegmentation, and the final segmentation results obtained by a simple region-merging process are more reliable and less noisy than those of the gradient-or EDM-based methods. We also propose a simple and efficient region-merging criterion considering both boundary strengths and inner intensities of regions to be merged. The robustness of our method is proven by testing it with a variety of synthetic and real images.

• Journal of the Korean Society for Precision Engineering
• /
• v.30 no.2
• /
• pp.177-184
• /
• 2013

This paper proposes an enhanced Simultaneous Localization and Mapping (SLAM) algorithm based on matching laser image and Extended Kalman Filter (EKF). In general, laser information is one of the most efficient data for localization of mobile robots and is more accurate than encoder data. For localization of a mobile robot, moving distance information of a robot is often obtained by encoders and distance information from the robot to landmarks is estimated by various sensors. Though encoder has high resolution, it is difficult to estimate current position of a robot precisely because of encoder error caused by slip and backlash of wheels. In this paper, the position and angle of the robot are estimated by comparing laser images obtained from laser scanner with high accuracy. In addition, Speeded Up Robust Features (SURF) is used for extracting feature points at previous laser image and current laser image by comparing feature points. As a result, the moving distance and heading angle are obtained based on information of available points. The experimental results using the proposed laser slam algorithm show effectiveness for the SLAM of robot.

• The Journal of Korea Robotics Society
• /
• v.16 no.3
• /
• pp.189-198
• /
• 2021

In this paper, we introduce the software/hardware system that can reliably calculate the distance from sensor to the model regardless of point cloud density. As the 3d point cloud map is widely adopted for SLAM and computer vision, the accuracy of point cloud map is of great importance. However, the 3D point cloud map obtained from Lidar may reveal different point cloud density depending on the choice of sensor, measurement distance and the object shape. Currently, when measuring map accuracy, high reflective bands are used to generate specific points in point cloud map where distances are measured manually. This manual process is time and labor consuming being highly affected by Lidar sparsity level. To overcome these problems, this paper presents a hardware design that leverage high intensity point from three planar surface. Furthermore, by calculating distance from sensor to the device, we verified that the automated method is much faster than the manual procedure and robust to sparsity by testing with RGB-D camera and Lidar. As will be shown, the system performance is not limited to indoor environment by progressing the experiment using Lidar sensor at outdoor environment.