• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.9
• /
• pp.39-45
• /
• 2004

A design method is proposed for the sequence detection with fixed decision delay with less hardware complexity using the concept of the Voronoi diagram and its dual, the Delaunay tessellation. This detector design is based on the Fixed Delay Tree Search (FDTS) detection. The FDTS is a computationally efficient sequence detection algerian and has been shown to achieve near-optimal performance in the severe Intersymbol Interference (ISI) channels when combined with decision feedback equalization and the appropriate channel coding. In this approach, utilizing the information contained in the Voronoi diagram or equivalently the Delaunay tessellation, the relative location of the detector input sequence in the multi-dimensional Euclidean space is found without any computational redundancy, which leads to a reduced complexity implementation of the detector.

• Journal of the Korea Computer Graphics Society
• /
• v.21 no.1
• /
• pp.13-21
• /
• 2015

We present a robust GPU algorithm constructing a sweep volume boundary for a triangular mesh model. Sweeping geometric entities of a triangular mesh object is first approximated to a set of triangles, the envelope of which becomes the outer boundary of the sweep volume. We find the envelope by computing the arrangement of the triangle set and extracting its outmost boundary. To ensure robustness of the algorithm, we adopt random perturbation of sweep vertices and the interval arithmetic using multi-level precisions. The algorithm is implemented to perform most computation on GPU, and as a result it runs two orders of magnitude faster than other algorithms.

• The KIPS Transactions:PartC
• /
• v.12C no.3 s.99
• /
• pp.443-448
• /
• 2005

Efficient using of the web cache is becoming important factors that decide system management efficiency in the web base system. The cache performance depends heavily on the replacement algorithm which dynamically selects a suitable subset of objects for caching in a finite cache space. In this paper, the web caching algorithm is proposed for the efficient operation of the web base system. The algorithm is designed based on a divided scope that considered size reference characteristic and heterogeneity on web object. With the experiment environment, the algorithm is compared with conservative replacement algorithms, we have confirmed more than $15\%$ of an performance improvement.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2018.05a
• /
• pp.15-15
• /
• 2018

강우에 의해 발생되는 토양침식의 정도를 나타내는 강우침식인자의 산정공식은 미국에서 경험적인 방법으로 유도된 식이지만, 전 세계적으로 널리 활용되고 있다. 강우침식인자는 토양침식을 유발하는 호우사상의 지속기간 중에 발생한 총 강우에너지와 30분 최대 강우강도 값을 곱하여 호우사상별로 산정하게 되며, 이 값의 연간 총합이 연강우침식인자가 된다. 최근 강우침식인자에 대한 관심이 국내외적으로 고조되면서 많은 연구 산물이 학계에 보고되고 있다. 본 연구의 목적은 동일 기간, 동일 지점일지라도 연구자에 따라 강우침식인자 값이 달라지는 원인과 그 불확실성을 규명하기 위한 것이다. 이를 위하여 본 연구는 강우침식인자와 관련된 국내외 문헌연구를 토대로 연구방법에 따라 결과값이 달라지는 현상을 분석하고 이에 대한 대안을 제시하고자 한다. 연구결과, 강우침식인자 산정의 불확실성의 가장 큰 인자는 연구자가 사용하는 데이터로서, 5분 단위 이하의 강우자료를 사용하는 것과, 그 이상의 자료를 사용하는 것으로 구분할 수 있었다. 두 번째 중요한 인자는 유효 호우사상의 분류기준을 어떻게 적용하느냐에 있었다. 세 번째는 강우 에너지를 계산할 때 어떤 강우운동에너지식을 적용하는지에 따라 결과값이 달라지는 것을 알 수 있었다. 네 번째는 연구자가 어떤 프로그램을 이용하여 산정했느냐에 따라 차이가 발생할 수 있음을 알 수 있었다. 다섯 번째 지역단위 강우침식인자 산정시 어떤 공간분포 기법을 적용하느냐에 따라 결과값의 차이가 발생함을 알 수 있었다. 이를 바탕으로 본 연구에서는 국내에서 강우침식인자 산정시 연구자들이 적용할 수 있는 표준 계산 절차에 대해서 제안하였다.

• Journal of Broadcast Engineering
• /
• v.20 no.4
• /
• pp.557-567
• /
• 2015

Over the past decades, a variety of spatial saliency methods have been introduced. Recently, motion saliency has gained much interests, where motion data estimated from an image sequence are utilized. In general, motion saliency requires reliable motion data as well as image segmentation for producing satisfactory saliency map which poses difficulty in most natural images. To overcome this, we propose a motion-based saliency generation that enhances the spatial saliency based on the combination of spatial and motion saliencies as well as motion complexity without the consideration of complex motion classification and image segmentation. Further, an affinity model is integrated for the purpose of connecting close-by pixels with different colors and obtaining a similar saliency. In experiment, we performed the proposed method on eleven test sets. From the objective performance evaluation, we validated that the proposed method produces better result than spatial saliency based on objective evaluation as well as ROC test.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.8
• /
• pp.1843-1850
• /
• 2004

If the location information of a great number of cars kept for business with telematics terminals is acquired and managed efficiently, this information forms the foundation for controlling cars and traffic flows. The studies on the pure spatial indices have focused on the efficient retrievals. However, the acquisition and management of the terminal location of moving objects are more important than the efficiency of the query processing in the moving object databases. Therefore, it will be need to adopt parallel processing system for the moving object databases which should maintain the object's current location as precise as possible. This paper proposes a location management system using CDMA communications of telematics terminals. More precisely, we propose a architecture of spatial indexing mobile objects using multiple processors, and also newly propose a method of splitting buckets using the properties of moving objects in order to minimize the number of database updates. We also propose a acquisition method for gathering the location information of moving objects and passing the information of the bucket extents in order to reduce the amount of passed messages between processors.

• Journal of Korean Society for Geospatial Information Science
• /
• v.13 no.4 s.34
• /
• pp.3-9
• /
• 2005

The extraction of traffic information based on image processing is under broad research recently because the method based on image processing takes less cost and effort than the traditional method based on physical equipment. The main purpose of the algorithm based on image processing is to extract vehicles from an image correctly. Before the extraction, the algorithm needs the pre-processing such as background subtraction and binary image thresholding. During the pre-processing much noise is brought about because roadside tree and passengers in the sidewalk as well as vehicles are extracted as traffic flow. The noise undermines the overall accuracy of the algorithm. In this research, most of the noise could be removed by extracting the exact road area which does not include sidewalk or roadside tree. To extract the exact road area, traffic lanes in the image were used. Algorithm speed also increased. In addition, with the ratio between the sequential images, the problem caused by vehicles' shadow was minimized.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.527-531
• /
• 2003

Previous researches on scalability problem of distributed virtual environment (DVE) have been mainly focused on spatial partitioning of area of interest (AOI). Congestion phenomena by avatar groups in AOI have been neglected relatively. However, AOI congestion is highly related to scalability of DVT because it exhausts system resources such as network bandwidth and rendering time, and could be a bar to perform collaboration among participants. In this paper, this will be defined as the problem that must be solved for the realization of the scalable DVE, and a model will be proposed to measure and control congestion situation in AOI. The purposes of the proposed model are to prevent high density of participants in AOI, and to protect stable collaboration in DVE. For evaluation of the performance it is compared with a previous method by defining the resource cost model which is dynamically activated to AOI congestion.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.13 no.3
• /
• pp.288-300
• /
• 2002

In this paper, a novel method of equalization of RF transceivers is suggested for MIMO(Multiple Input Multiple Output) antenna actively studied for high speed data transmission in the recent IMT-2000 system. The core of suggestion is in equalizing the transfer characteristics of multiple transceivers using feedback and memory during the predefined calibration time. This makes it possible to weight the signals in the intermediate frequency, which is easier in the application of recently developed DoA(Direction of Arrival) algorithms. In addition, the time varying optimum cell formation according to traffic is feasible by antenna beam-forming based on the DoA information. The suggested method of equalizing multiple transceivers are successfully verified using envelope simulation. two outputs. This paper is concerned with the diagnosis of multiple crosstalk-faults in OSM. As the network size becomes larger in these days, the convent.
nal diagnosis methods based on tests and simulation be.
me inefficient, or even more impractical. We propose a simple and easily implementable alg？ithm for detection and isolation of the multiple crosstalk-faults in OSM. Specifically, we develop an algorithm for isolation of the source fault in switc.
ng elements whenever the multiple crosstalk-faults are.
etected in OSM. The proposed algorithm is illustrated by an example of 16$\times$16 OSM.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.2
• /
• pp.69-78
• /
• 2002

This paper addresses a method to automatically detect out a person's face from a given image that consists of a hair and face view of the person and a complex background scene. Out method involves an effective detection algorithm that exploits the spatial distribution characteristics of human skin color via an adaptive fuzzy color classifier (AFCC), The universal skin-color map is derived on the chrominance component of human skin color in Cb, Cr and their corresponding luminance. The desired fuzzy system is applied to decide the skin color regions and those that are not. We use RGB model for extracting the hair color regions because the hair regions often show low brightness and chromaticity estimation of low brightness color is not stable. After some preprocessing, we apply convex-hull to each region. Consequent face detection is made from the relationship between a face's convex-hull and a head's convex-hull. The algorithm using the convex-hull shows better performance than the algorithm using pattern method. The performance of the proposed algorithm is shown by experiment. Experimental results show that the proposed algorithm successfully and efficiently detects the faces without constrained input conditions in color images.