• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.639-642
• /
• 2000

본 논문에서는 구름이나 연기와 같은 non-rigid object에 대한 영역 분할 방식에 대해 연구하였다. Non-rigid object의 효과적인 영역 분할을 위해서 object의 윤곽선을 정확히 파악해 낼 수 있는 장점을 가진 watershed 알고리즘을 사용하였다. 하지만 이 알고리즘은 object가 많은 영역으로 분할되는 oversegmentation 현상이 발생하여 본 논문에서는 pre, post-processing을 통해 이 oversegmentation 현상을 극복하고자 하였다. Pre-processing에서는 noise를 제거하고 영상을 단순화하면서 정확한 gradient magnitude를 구할 수 있는 방법에 대해서, post-processing에서는 통계적인 분석을 통한 region merging을 이용하여 object를 최적화 상태로 찾아줄 수 있는 방법에 대하여 연구하였다.

• Speech Sciences
• /
• v.9 no.1
• /
• pp.39-47
• /
• 2002

This paper proposes an effective method to remedy the acoustic modeling problem inherent in the usual log-normal Parallel Model Composition intended for achieving robust speech recognition. In particular, the Gaussian kernels under the prescribed log-normal PMC cannot sufficiently express the corrupted speech distributions. The proposed scheme corrects this deficiency by judiciously selecting the 'fairly' corrupted component and by re-estimating it as a mixture of two distributions using data-driven PMC. As a result, some components become merged while equal number of components split. The determination for splitting or merging is achieved by means of measuring the similarity of the corrupted speech model to those of the clean model and the noise model. The experimental results indicate that the suggested algorithm is effective in representing the corrupted speech distributions and attains consistent improvement over various SNR and noise cases.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10b
• /
• pp.661-663
• /
• 1998

합병 문제는 크기가 각각 l, m(l+m=n)인 두 개의 정렬된 리스트를 하나의 정렬된 리스트로 만드는 문제로 정렬 문제와 그래프 문제 등과 같은 여러 가지 문제를 해결하는데 필요한 중요한 문제이다. p($\theta${{{{ LEFT ( {λlogp} over {log(λ+1)} RIGHT ) }}}}).

• The Journal of Korea Robotics Society
• /
• v.8 no.4
• /
• pp.256-265
• /
• 2013

A local map-based exploration algorithm for mobile robots is presented. Segmented frontiers and their relative transformations constitute a tree structure. By the proposed efficient frontier segmentation and a local map management method, a robot can reduce the unknown area and update the local grid map which is assigned to each frontier node. Although this local map-based exploration method uses only local maps and their adjacent node information, mapping completion and efficiency can be greatly improved by merging and updating the frontier nodes. Also, we suggest appropriate graph search exploration methods for corridor and hall environments. The simulation demonstrates that the entire environment can be represented by well-distributed frontier nodes.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.12
• /
• pp.923-928
• /
• 2003

A severe drawback to the calculation of watershed images is over segmentation. Relevant object contours are lost in a sea of irrelevant ones. This is partly caused by random noise, inherent to a data, which gives rise to additional local minima, such that many catchments basins are further subdivided. Proposed watershed image segmentation algorithm is iteratively merging neighboring regions that have similar gray level distributions, to restore image.

• Journal of Navigation and Port Research
• /
• v.27 no.6
• /
• pp.645-652
• /
• 2003

A virtual vessel traffic control system is introduced to contribute to prevent a marine accident such as collision and stranding from happening. Existing VTS has its limit. The virtual vessel traffic control system consists of both data acquisition by satellite remote sensing and a simulation of traffic environment stress based on the satellite data, remotely sensed data And it could be used to provide timely and detailed information about the marine safety, including the location, speed and direction of ships, and help us operate vessels safely and efficiently. If environmental stress values are simulated for the ship information derived from satellite data, proper actions can be taken to prevent accidents. Since optical sensor has a high spatial resolution, JERS satellite data are used to track ships and extract their information. We present an algorithm of automatic identification of ship size and velocity. It lastly is shown that based on ship information extracted from JERS data, a qualitative evaluation method of environmental stress is introduced.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1495-1498
• /
• 1987

This paper described the design of register part, ROM and entire digital filter implementation by merging with ALU, control part last year. The register part consists of shift register, parallel load serial output register, multiplexer and selector, and we designed specially the 1024 memory cells ROM and decoder to decode the register data. Also, presented scaling algorithm to prevent the overflow.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.428-431
• /
• 2004

A multi-stage hierarchical clustering technique, which is an unsupervised technique, has been proposed in this paper for classifying the hyperspectral data .. The multistage algorithm consists of two stages. The 'local' segmentor of the first stage performs region-growing segmentation by employing the hierarchical clustering procedure with the restriction that pixels in a cluster must be spatially contiguous. The 'global' segmentor of the second stage, which has not spatial constraints for merging, clusters the segments resulting from the previous stage, using a context-free similarity measure. This study applied the multistage hierarchical clustering method to the data generated by band reduction, band selection and data compression. The classification results were compared with them using full bands.

• Proceedings of the KSRS Conference
• /
• v.1
• /
• pp.188-190
• /
• 2006

A multistage hierarchical clustering technique, which is an unsupervised technique, was suggested in this paper for classifying large remotely-sensed imagery. The multistage algorithm consists of two stages. The local segmentor of the first stage performs regiongrowing segmentation by employing the hierarchical clustering procedure of CN-chain with the restriction that pixels in a cluster must be spatially contiguous. This stage uses a sliding window strategy with boundary blocking to alleviate a computational problem in computer memory for an enormous data. The global segmentor of the second stage has not spatial constraints for merging to classify the segments resulting from the previous stage. The experimental results show that the new approach proposed in this study efficiently performs the segmentation for the images of very large size and an extensive number of bands

• The Bulletin of The Korean Astronomical Society
• /
• v.41 no.2
• /
• pp.60.1-60.1
• /
• 2016

To obtain a reliable estimate of the cold dark matter (CDM) substructure mass function in a dense cluster environment, one needs to understand how long a merged halo can survive within the host halo. Measuring disruption time scale of merged halos in a dense cluster environment, we attempt to construct the realistic CDM mass function that can be compared with stellar mass functions to get a stellar-to-halo mass ratio. For this, we performed a set of high-resolution simulations of cold dark matter halos with properties similar to the Virgo cluster. Field halos outside the main halo are detected using a Friend-of-Friend algorithm with a linking length of 0.02. To trace the sub-halo structures even after the merging with the main halo, we use their core structures that are defined to be the most 10% bound particles.