• Journal of Korean Society for Geospatial Information Science
• /
• v.16 no.3
• /
• pp.35-41
• /
• 2008

Recently needs for the convergence of CAD and GIS data are increasing, and many studies on converting two systems to each other are being carried out. In this study, to revise and update the building data of digital map using CAD data for construction, the outline of building is abstracted from the CAD data and the outline is generalized to the same level of detail with the building data of digital map. Several line simplification algorithms to generalize the outline are adopted and compared, especially at the view of satisfaction to the drawing rule for digital map. Douglas-Peucker algorithm, Lang's algorithm, Reumann-Witkam algorithm, and Opheim algorithm are applied as the line simplification method. To evaluate the results of these algorithms, visual assessment and variation ratio of the number of points, total length of lines, the area of polygon, and satisfaction ratio to the drawing rule of digital map are analyzed. The result of Lang algorithm and Douglas-Peucker algorithm show superior satisfaction ratio. But general satisfaction ratio is 50~60% for all algorithm. Therefore there seems to be a limit to use these algorithms for the simplification method to update the building data in digital map and it is necessary to develop line simplification algorithm which satisfy the drawing rule well.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.446-449
• /
• 2002

This paper represents a improved data compression algorithm of mixed text file by 2 byte completion Hangout and 1 byte alphabet from. Original LZW algorithm efficiently compress a alphabet text file but inefficiently compress a 2 byte completion Hangout text file. To solve this problem, data compression algorithm using 2 byte prefix field and 2 byte suffix field for compression table have developed. But it have a another problem that is compression ratio of alphabet text file decreased. In this paper, we proposes improved LZW algorithm, that is, compression table in the Extended LZW(ELZW) algorithm uses 2 byte prefix field for pointer of a table and 1 byte suffix field for repeat counter. where, a prefix field uses a pointer(index) of compression table and a suffix field uses a counter of overlapping or recursion text data in compression table. To increase compression ratio, after construction of compression table, table data are properly packed as different bit string in accordance with a alphabet, Hangout, and pointer respectively. Therefore, proposed ELZW algorithm is superior to 1 byte LZW algorithm as 7.0125 percent and superior to 2 byte LZW algorithm as 11.725 percent. This paper represents a improved data Compression algorithm of mixed text file by 2 byte completion Hangout and 1 byte alphabet form. This document is an example of what your camera-ready manuscript to ITC-CSCC 2002 should look like. Authors are asked to conform to the directions reported in this document.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.162-165
• /
• 2007

Chlorophyll concentration is an important factor for physical oceanography as well as biological oceanography. For these necessity many oceanographic researchers have been investigated it for a long time. But investigation using vessel is very inefficient, on the other hands, ocean color remote sensing is a powerful means to get fine-scale (spatial and temporal scale) measurements of chlorophyll concentration. Geostationary Ocean Color Imager (GOCI), for ocean color sensor, loaded on COMS (Communication, Ocean and Meteorological Satellite), will be launched on late 2008 in Korea. According to the necessity of algorithm for GOCI, we developed chlorophyll algorithm for GOCI in this study. There are two types of chlorophyll algorithms. One is an empirical algorithm using band ratio, and the other one is a fluorescence-based algorithms. To develop GOCI chlorophyll algorithm empirically we used bands centered at 412 nm, 443 nm and 555 nm for the DOM absorption, chlorophyll maximum absorption and for absorption of suspended solid material respectively. For the fluorescence-based algorithm we analyzed in-situ remote sensing reflectance $(R_{rs})$ data using baseline method. Fluorescence Line Height $({\Delta}Flu)$ calculated from $R_{rs}$ at bands centered on 681 nm and 688 nm, and ${\Delta}Flu_{(area)}$ are used for development of algorithm. As a result ${\Delta}Flu_{(area)}$ method leads the best fitting for squared correlation coefficient $(R^2)$.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.13 no.1
• /
• pp.99-108
• /
• 2014

Recently, the interest in autonomous vehicle which is an aggregate of the automotive control technology is increasing. In particular, researches on the self-localization technology that is directly connected with stable driving of autonomous vehicle have been performed. Various dead reckoning technologies which are solutions for resolving the limitation of GPS have been introduced. However, the conventional dead reckoning technologies have two disadvantages to apply on the autonomous vehicle. First one is that the expensive sensors must be equipped additionally. The other one is that the accuracy of self-localization decreases caused by wheel slip when the vehicle's motion changed rapidly. Based on this background, in this paper, the wheel speed sensor which is equipped on most of vehicles was used and the dead reckoning algorithm considering wheel slip ratio was developed for autonomous vehicle. Finally, in order to evaluate the performance of developed algorithm, the various simulation were conducted and the results were compared with the conventional algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.2
• /
• pp.514-522
• /
• 2017

Traffic offloading is a promising solution to solve the explosive growth of mobile traffic. One of offloading schemes, in LIPA/SIPTO(Local IP Access and Selected IP Traffic Offload) offloading, we can offload mobile traffic that can satisfy QoS requirement for application. In addition, it is necessary for traffic offloading using social context due to large traffic from SNS. Thus, we propose the LIPA/SIPTO offloading algorithm using social context. We define the application selection probability using social context, the application popularity. Then, we find the optimal offloading weighting factor to maximize the QoS(Quality of Service) of small cell users in term of effective data rate. Finally, we determine the offloading ratio by this application selection probability and optimal offloading weighting factor. By performance analysis, the effective data rate achievement ratio of the proposed algorithm is similar with the conventional one although the total offloading ratio of the proposed algorithm is about 46 percent of the conventional one.

• Journal of Broadcast Engineering
• /
• v.17 no.6
• /
• pp.924-932
• /
• 2012

Decomposition of a stereo signal into the primary and ambient components is a key step to the stereo upmix and it is often based on the principal component analysis (PCA). However, major shortcoming of the PCA-based method is that accuracy of the decomposed components is dependent on both the primary-to-ambient power ratio (PAR) and the panning angle. Previously, a modified PCA was suggested to solve the PAR-dependent problem. However, its performance is still dependent on the panning angle of the primary signal. In this paper, we proposed a new PCA-based primary-ambient decomposition algorithm whose performance is not affected by the PAR as well as the panning angle. The proposed algorithm finds scale factors based on a criterion that is set to preserve the powers of the mixed components, so that the original primary and ambient powers are correctly retrieved. Simulation results are presented to show the effectiveness of the proposed algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11A
• /
• pp.862-869
• /
• 2009

We propose a new adaptive K-best Sphere Decoding (SD) algorithm for Multiple Input Multiple Output (MIMO) systems where the number of survivor paths, K is changed based on the characteristics of path metrics which contain the instantaneous channel condition. In order to overcome a major drawback of Maximum Likelihood Detection (MLD) which exponentially increases the computational complexity with the number of transmit antennas, the conventional adaptive K-best SD algorithms which achieve near to MLD performance have been proposed. However, they still have redundant computation complexity since they only employ the channel fading gain as a channel condition indicator without instantaneous Signal to Noise Ratio (SNR) information. hi order to complement this drawback, the proposed algorithm use the characteristics of path metrics as a simple channel indicator. It is found that the ratio of the minimum path metric to the other path metrics reflects SNR information as well as channel fading gain. By adaptively changing K based on this ratio, the proposed algorithm more effectively reduce the computation complexity compared to the conventional K-best algorithms which achieve same performance.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.62 no.2
• /
• pp.90-94
• /
• 2013

In this paper, we propose a new algorithm to improve the contrast ratio, to preserve information of bright regions and to maintain the color of backlight image that appears with a great relative contrast. Backlight images of the natural environment have characteristics for difference of local brightness; the overall image contrast improvement is not easy. To improve the contrast of the backlight images, MSR (Multi-Scale Retinex) algorithm using the existing multi-scale Gaussian filter is applied. However, existing multi-scale Gaussian filter involves color distortion and information loss of bright regions due to excessive contrast enhancement and noise because of the brightness improvement of dark regions. Moreover, it also increases computational complexity due to the use of multi-scale Gaussian filter. In order to solve these problems, a linear MSR is performed that reduces the amount of computation from the HSV color space preventing the color distortion and information loss due to excessive contrast enhancement. It can also remove the noise of the dark regions which is occurred due to the improved contrast through edge preserving filter. Through experimental evaluation of the average color difference comparison of CIELAB color space and the visual assessment, we have confirmed excellent performance of the proposed algorithm compared to conventional MSR algorithm.

• The Journal of the Korea Contents Association
• /
• v.12 no.4
• /
• pp.69-75
• /
• 2012

In this paper, to provide various services of QoS, and moreover applying traffic ratio to CAC(Call Admission Control) algorithm tested how long average data rate and the average packet delay time. When CAC algorithm is not applied, traffic mixture ratio is 1:1:4:4, the FTP Service 0.4, web services 0.6, streaming service 0.7, the packet delay requirements are not satisfied. On the other hand CAC Algorithm is applied, all the service of packet delay are satisfied with arrival rate. Therefore, we can make sure that applying of CAC of traffic control WWW, FTP, Video, VoIP can guarantee the various services of QoS.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.12
• /
• pp.4856-4871
• /
• 2015

Backpressure based scheduling has been considered as a promising technique for improving the throughput of a wide range of communication networks. However, this scheduling technique has not been well studied for heterogeneous wireless networks. In this paper, we propose a virtual-queue based backpressure scheduling (VQB) algorithm for heterogeneous multi-hop wireless networks. The VQB algorithm introduces a simple virtual queue for each flow at a node for backpressure scheduling, whose length depends on the cache size of the node. When calculating flow weights and making scheduling decisions, the length of a virtual queue is used instead of the length of a real queue. We theoretically prove that VQB is throughput-optimal. Simulation results show that the VQB algorithm significantly outperforms a classical backpressure scheduling algorithm in heterogeneous multi-hop wireless networks in terms of the packet delivery ratio, packet delivery time, and average sum of the queue lengths of all nodes per timeslot.