• Journal of the Korea Society of Computer and Information
• /
• v.13 no.3
• /
• pp.85-90
• /
• 2008

In this paper, we propose a new robot cleaning algorithm, which we call SetClean. The new algorithm cleans from the most less complex area. Sometimes, when the cleaning completion time can be longer or can not be estimated, cleaning larger area first is better than optimizing the whole time for cleaning. To do this, SetClean algorithm divides the whole area into cleanable sub-areas using Set Cover algorithm and cleans the area in the order of high efficiency that maximize the cleanable area per unit time. SetClean algorithm decides the navigation flow by considering not only the size of the area but also the distance from the current robot location to the area to be cleaned and the delay time caused by the number of turns within the area. The experimental results show the mechanism and performance of the SetClean algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.9
• /
• pp.1545-1550
• /
• 2006

In this paper, we propose a method for applying the CLEAN algorithm to an minimum variance distortionless response(MVDR) to estimate the location of multiple targets distributed in the ocean. The CLEAN algorithm is easy to implement in a linear processor, yet not in a nonlinear processor. In the proposed method, the CSDM of a Dirty map is separated into the CSDM of a Clean beam and the CSDM of the Residual, then an individual ambiguity surface(AMS) is generated. As such, the CLEAN algorithm can be applied to an MVDR, a nonlinear processor. To solve the ill-conditioned problem related to the matrix inversiion by an MVDR when using the CLEAN algorithm, Singular value decomposition(SVD) is carried out, then the reciprocal of small eigenvalues is replaced with zero. Experimental results show that the proposed method improves the performance of an MVDR.

• Journal of Broadcast Engineering
• /
• v.26 no.1
• /
• pp.3-13
• /
• 2021

We propose a moire artifacts removal algorithm for screen-shot images using multiple domain learning. First, we estimate clean preliminary images by exploiting complementary information of the moire artifacts in pixel value and frequency domains. Next, we estimate a clean edge map of the input moire image by developing a clean edge predictor. Then, we refine the pixel and frequency domain outputs to further improve the quality of the results using the estimated edge map as the guide information. Finally, the proposed algorithm obtains the final result by merging the two refined results. Experimental results on a public dataset demonstrate that the proposed algorithm outperforms conventional algorithms in quantitative and qualitative comparison.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2004.10a
• /
• pp.67-70
• /
• 2004

Semiconductor Wet Station has a very important place in semiconductor process. It is important that to discharge chemical with fit concentration and temperature using chemical supply system for clean process. The chemical supply system which is used currently is not only difficult to make a fit mixing rate of chemical which is need in clean' process, but also difficult to make fit concentration and temperature. Moreover, it has high stability but it is inefficient spatially because its volume is great. We propose In-line System to improve system with implement analysis of fluid and thermal transfer on chemical supply system and understand problem of system.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.1723-1726
• /
• 2003

Clean and well maintained roadway signs are important for preserving driver's safety. The existing signs on the roadway must be periodically re-painted in order to maintain clean state. However, current sign painting operations are manually performed now. These are very slow and workers are exposed to very dangerous and hazard working environment. In this paper, we present the method for automating this job with gantry robot and spray system. In addition, we suggest two design concepts to resolve the problem that it is impractical to make the gantry system so big as to cover whole lane width. In order to show the validity of this system, the painting operation is simulated and experimentally executed.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.21 no.4
• /
• pp.317-322
• /
• 2003

This paper have calculated a relative heights of an each station using the data which were observed by GPS permanent stations(Chejudo, Homigoj, Jumunjin, Marado, Palmido, Ulengdo, Youndo) established in Korea. We performed spectrum analysis with a calculated relative heights by CLEAN algorithm. Through these process, we estimated vertical displacement of earth surface by semi-dinural ocean tidal loading components, and compared them with the results which were calculated by improving ocean tide model(NA099jb) for adjacent seas around Japan and Korea. As the result of this study, we determined the ocean tidal loading components with loading effects of $M_2$ and $N_2$, and we noted that the amplitude and the phase lags of ocean tidal loading components from observed GPS data were almost equal to values calculated from ocean tide models. However, the loading components about semi-diurnal tide $S_2$, $K_2$ couldn't estimate because of periods. Also, the diurnal ocean tide loading components were not considered, because the noise level have increased during the diurnal frequency.

• Proceedings of the Korean Society Of Semiconductor Equipment Technology
• /
• 2004.05a
• /
• pp.123-128
• /
• 2004

Semiconductor Wet Station has a very important place in semiconductor process. It is important that to discharge chemical with fit concentration and temperature using chemical supply system for clean process. The chemical supply system which is used currently is not only difficult to make a fit mixing rate of chemical which is need in clean process, but also difficult to make fit concentration and temperature. Moreover, it has high stability but it is inefficient spatially because its volume is great. We propose In-line System to improve system with implement analysis of fluid and thermal transfer on chemical supply system and understand problem of system.

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.8
• /
• pp.42-47
• /
• 1999

In this paper, a mixture interacting multiple model (MIMM) algorithm is proposed to enhance speech contaminated by additive nonstationary noise. In this approach, a mixture hidden filter model (HFM) is used to model the clean speech and the noise process is modeled by a single hidden filter. The MIMM algorithm, however. needs large computation time because it is a recursive method based on multiple Kalman filters with mixture HFM. Thereby, a computationally efficient implementation of the algorithm is developed by exploiting the structure of the Kalman filtering equation. The simulation results show that the proposed method offers performance gain compared to the previous results in [4,5] with slightly increased complexity.

• The Journal of the Acoustical Society of Korea
• /
• v.23 no.7
• /
• pp.540-547
• /
• 2004

Since speech enhancement algorithms based on Kalman/Wiener filter require a priori knowledge of the noise and have focused on the minimization of the variance of the estimation error between clean and estimated speech signal, small estimation error on the noise statistics may lead to large estimation error. However, H/sub ∞/ filter does not require any assumptions and a priori knowledge of the noise statistics, but searches the best estimated signal among the entire estimated signal by applying least upper bound, consequently it is more robust to the variation of noise statistics than Kalman/Wiener filter. In this paper, we Propose a speech enhancement method using HMM and multi H/sub ∞/ filters. First, HMM parameters are estimated with the training data. Secondly, speech is filtered with multiple number of H/sub ∞/ filters. Finally, the estimation of clean speech is obtained from the sum of the weighted filtered outputs. Experimental results shows about 1dB∼2dB SNR improvement with a slight increment of computation compared with the Kalman filter method.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.4
• /
• pp.455-462
• /
• 2010

We investigate the worst case complexity regarding the number of comparisons for a simple and stable merging algorithm. The complexity analysis shows that the algorithm performs O(mlog(n/m)) comparisons for two sequences of sizes m and n $m{\leq}n$. So, according to the lower bound for merging $\Omega$(mlog(n/m)), the algorithm is asymptotically optimal regarding the number of comparisons. For proving the worst case complexity we divide the domain of all inputs into two disjoint cases. For either of these cases we will extract a special subcase and prove the asymptotic optimality for these two subcases. Using this knowledge for special cases we will prove the optimality for all remaining cases. By using this approach we give a transparent solution for the hardly tractable problem of delivering a clean complexity analysis for the algorithm.