• Journal of KIISE:Databases
• /
• v.32 no.3
• /
• pp.228-242
• /
• 2005

The projected clustering seeks to find clusters in different subspaces within a high dimensional dataset. We propose an algorithm to discover near optimal projected clusters without user specified parameters such as the number of output clusters and the average cardinality of subspaces of projected clusters. The objective function of the algorithm computes projected energy, quality, and the number of outliers in each process of clustering. In order to minimize the projected energy and to maximize the quality in clustering, we start to find best subspace of each cluster on the density of input points by comparing standard deviations of the full dimension. The weighting factor for each dimension of the subspace is used to get id of probable error in measuring projected distances. Our extensive experiments show that our algorithm discovers projected clusters accurately and it is scalable to large volume of data sets.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.1
• /
• pp.41-46
• /
• 2006

Ubiquitous location based services, offer helpful services anytime and anywhere by using real-time location information of objects based on ubiquitous network. Particularly, autonomous mobile robots can be a solution for various applications related to ubiquitous location based services, e.g. in hospitals, for cleaning, at airports or railway stations. However, a meaningful and still unsolved problem for most applications is to develop a robust and cheap positioning system. A typical example of position measurements is dead reckoning that is well known for providing a good short-term accuracy, being inexpensive and allowing very high sampling rates. However, the measurement always has some accumulated errors because the fundamental idea of dead reckoning is the integration of incremental motion information over time. The other hand, a localization system using RFID offers absolute position of robots regardless of elapsed time. We construct an absolute positioning system based on RFID and investigate how localization technique can be enhanced by RFID through experiment to measure the location of a mobile robot. Tags are placed on the floor at 5cm intervals in the shape of square in an arbitrary space and the accuracy of position measurement is investigated . To reduce the error and the variation of error, a weighting function based on Gaussian function is used. Different weighting values are applied to position data of tags since weighting values follow Gaussian function.

• The Journal of the Acoustical Society of Korea
• /
• v.29 no.1
• /
• pp.62-68
• /
• 2010

This paper proposes a new masking threshold adjustment strategy to improve the performance for speech signals in low bit-rate audio coding. After determining formant regions, the masking threshold is adjusted by using the energy ratio of each sub-band to the average energy of each formant. More quantization noises are added to the bands that have relatively large energy, but less distortion is allowed in spectral valley regions by allocating more bits, which reflects the concept of perceptual weighting widely used in speech coding. From the results of objective speech quality measure, we verified that the proposed method improves quality for the speech input signals compared to the conventional one.

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.7
• /
• pp.69-75
• /
• 2001

Intra-speaker variation, noise environments, and mismatch between training and test conditions are the major reasons for the speaker verification system unable to use it practically. In this study, we propose robust end-point detection algorithm, noise cancelling with the microphone property compensation technique, and inter-speaker discriminate technique by weighting cepstrum for robust speaker verification system. Simulation results show that the average speaker verification rate is improved in the rate of 17.65% with proposed end-point detection algorithm using LPC residue and is improved in the rate of 36.93% with proposed noise cancelling and microphone property compensation algorithm. The proposed weighting function for discriminating inter-speaker variations also improves the average speaker verification rate in the rate of 6.515%.

• Journal of the Korea Safety Management & Science
• /
• v.12 no.4
• /
• pp.255-263
• /
• 2010

The research developes short-run standardized control charts(SSCC) and short-run acceptance control charts(SACC) under the various demand patterns. The demand patterns considered in this paper are three types such as high-variety and repetitive low-volume pattern, extremely-high-variety and nonrepetitive low-volume pattern, and high-variety and extremely-low-volume pattern. The short-run standardized control charts developed by extending the long-run ${\bar{x}}$-R, ${\bar{x}}$-s and I-MR charts have strengths for practioners to understand and use easily. Moreover, the short-range acceptance control charts developed in the study can be efficiently used through combining the functions of the inspection and control chart. The weighting schemes such as Shewhart, moving average (MA) and exponentially weighted moving average (EWMA) can be considered by the reliability of data sets. The two types according to the use of control chart are presented in the short-range standardized charts and acceptance control charts. Finally, process capability index(PCI) and process performance index(PPI) classified by the demand patterns are presented.

• Journal of Sensor Science and Technology
• /
• v.28 no.2
• /
• pp.88-93
• /
• 2019

This paper is concerned with distributed fusion moving average prediction for continuous-time linear stochastic systems with multiple sensors. A distributed fusion with the weighted sum structure is applied to the optimal local moving average predictors. The distributed fusion prediction algorithm represents the optimal linear fusion by weighting matrices under the minimum mean square criterion. The derivation of equations for error cross-covariances between the local predictors is the key of this paper. Example demonstrates effectiveness of the distributed fusion moving average predictor.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2565-2574
• /
• 2000

The error diffusion method is good for reproducing continuous image to binary image. However the reproduction of edge characteristic is weak in power spectrum analysis of display error. In this paper. we present an edge-enhanced error-diffusion method which include pre-processing algorithm for edge characteristic enhancement. Pre-processing algorithm consists of the difference value between current pixel and local average of original image and weighting function of pre-filter. First. it is obtained the difference value between current pixel and the local average of peripheral pixels(5x5) in original image. Second, weighting function of pre-filter is composed by function including absolute value and sign of difference value. The improved Error diffusion algorithm using pre-processing algorithm, present a good result visually which edge characteristic is enhanced. The performance of the proposed algorithm is compared with that of the conventional edge-enhanced error diffusion by measuring the RAPSD of display error, the egde correlation and the local average accordance.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.57 no.4
• /
• pp.334-341
• /
• 2021

The fishery compensation by marine spatial planning such as routeing of ships and offshore wind farms is required objective data on whether fishing vessels are engaged in a target area. There has still been no research that calculated the number of fishing operation days scientifically. This study proposes a novel method for calculating the number of fishing operation days using the fishing trajectory data when investigating fishery compensation in marine spatial planning areas. It was calculated by multiplying the average reporting interval of trajectory data, the number of collected data, the status weighting factor, and the weighting factor for fishery compensation according to the location of each fishing vessel. In particular, the number of fishing operation days for the compensation of driftnet fishery was considered the daily average number of large vessels from the port and the fishery loss hours for avoiding collisions with them. The target area for applying the proposed method is the routeing area of ships of Jeju outer port. The yearly average fishing operation days were calculated from three years of data from 2017 to 2019. As a result of the study, the yearly average fishing operation days for the compensation of each fishing village fraternity varied from 0.0 to 39.0 days. The proposed method can be used for fishery compensation as an objective indicator in various marine spatial planning areas.

• Communications for Statistical Applications and Methods
• /
• v.7 no.2
• /
• pp.574-574
• /
• 2000

Consider the problem of estimating regression function from a set of data which is contaminated by a long-tailed error distribution. The linear smoother is a kind of a local weighted average of response, so it is not robust against outliers. The kernel M-smoother and the lowess attain robustness against outliers by down-weighting outliers. However, the kernel M-smoother and the lowess requires the iteration for computing the robustness weights, and as Wang and Scott(1994) pointed out, the requirement of iteration is not a desirable property. In this article, we propose the robust nonparametic regression method which does not require the iteration. Robustness can be achieved not only by down-weighting outliers but also by transforming outliers. The rank transformation is a simple procedure where the data are replaced by their corresponding ranks. Iman and Conover(1979) showed the fact that the rank transformation is a robust and powerful procedure in the linear regression. In this paper, we show that we can also use the rank transformation to nonparametric regression to achieve the robustness.

• Communications for Statistical Applications and Methods
• /
• v.7 no.2
• /
• pp.575-583
• /
• 2000

Consider the problem of estimating regression function from a set of data which is contaminated by a long-tailed error distribution. The linear smoother is a kind of a local weighted average of response, so it is not robust against outliers. The kernel M-smoother and the lowess attain robustness against outliers by down-weighting outliers. However, the kernel M-smoother and the lowess requires the iteration for computing the robustness weights, and as Wang and Scott(1994) pointed out, the requirement of iteration is not a desirable property. In this article, we propose the robust nonparametic regression method which does not require the iteration. Robustness can be achieved not only by down-weighting outliers but also by transforming outliers. The rank transformation is a simple procedure where the data are replaced by their corresponding ranks. Iman and Conover(1979) showed the fact that the rank transformation is a robust and powerful procedure in the linear regression. In this paper, we show that we can also use the rank transformation to nonparametric regression to achieve the robustness.