• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2006.05a
• /
• pp.63-72
• /
• 2006

정보화 시대에 있어 급변하는 기술발전과 함께 인간의 문화적 욕구가 증대됨에 따라 3차원 공간정보에 대한 수요가 증가하고 있다. 하지만 현재 3차원 공간정보를 구축하는 과정은 일반적으로 수작업 또는 반자동에 의해 이루어지고 있다. 이는 데이터의 구축 및 표현에 많은 시간과 비용이 소요된다는 제약을 가지고 있다. 따라서 본 연구에서는 3차원 symbol 라이브러리를 구축하여 분류된 객체에 부합되는 3차원 symbol을 자동으로 선택하며, 선택된 3차원 symbol을 파라메타를 이용하여 자동으로 mapping 하는 과정을 구축하였다. 이를 통해 3차원 공간데이터의 구축 및 표현에 요구되는 시간과 오류를 최소화할 수 있었다. 또한 LiDAR(Light Detection And Range) 데이터의 3차원 정보를 활용하여 symbol의 자동 mapping을 위한 파라메타들을 산출하였고, symbol의 분류를 위한 기본 데이터로 활용하였다. 구축된 알고리즘의 평가를 위하여 실재 데이터의 3차원 공간데이터베이스를 구축하였다. 구축된 데이터에 대해 symbol선택 및 자동 mapping 과정에 대한 오류 검사를 수행하였고, 더불어 구축된 3차원 데이터의 활용 가능성을 평가하였다. 그 결과 본 연구로부터 구축된 알고리즘들은 3차원 공간정보를 표현함에 있어 신속하고 안정적으로 기여할 수 있을 것으로 판단되었다.

• Proceedings of the KSRS Conference
• /
• v.1
• /
• pp.106-109
• /
• 2006

Over the years, many researches have been performed to create 3D digital maps. Nevertheless, it is still time-consuming and involves a high cost because a large part of 3D digital mapping is conducted manually. To compensate this limitation, we propose methodologies to represent 3D objects as 3D symbols and locate these symbols into a base map automatically. First of all, we constructed the 3D symbol library to represent 3D objects as 3D symbols. In the 3D symbol library, the attribute and geometry information are stored, which defines factors related to the types of symbols and related to the shapes respectively. These factors were used to match 3D objects and 3D symbols. For automatic mapping of 3D symbols into a base map, we used predefined parameters such as the size, the height, the rotation angle and the center of gravity of 3D objects which are extracted from Light Detection and Ranging (LIDAR) data and 2D digital maps. Finally, the 3D map in urban area was constructed and the mapping results were tested using aerial photos as reference data. Through this research, we can identify that the developed the algorithms can be used as effective techniques for 3D digital cartographic techniques

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.24 no.5
• /
• pp.417-424
• /
• 2006

Despite of many researches related to create 3D digital maps, it is still time-consuming and costly because a large part of 3D digital mapping is conducted manually. To circumvent this limitation, we proposed methodologies to create 3D digital maps with 3D symbols automatically. For this purpose, firstly, the 3D symbol library to represent 3D objects as 3D symbols was constructed. In this library, we stored the attribute and geometry information of 3D objects which define types and shapes of symbols respectively. These information were used to match 3D objects with 3D symbols and extracted from 2D digital maps and LiDAR(Light Detection and Ranging) data. Then, to locate 3D symbols into a base map automatically, we used predefined parameters such as the size, the height, the rotation angle and the center of gravity of 3D objects which are extracted from LiDAR data. Finally, the 3D digital map in urban area was constructed and the results were tested. Through this research, we can identify that the developed algorithms can be used as effective techniques for 3D digital mapping.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12C
• /
• pp.1135-1141
• /
• 2007

In this paper, an adaptive bit-reliability mapping is proposed for the bit-level Chase combining in LDPC-coded high-order modulation systems. Contrary to the previously known bit-reliability mapping that assigns the information (or parity) bits to more (or less) reliable bit positions, the proposed mapping adaptively assigns codeword bits to the bit positions of various reliabilities by considering the characteristics of code and protection levels of bits in high-order modulation symbol. Compared with the symbol-level Chase combining and the constellation rearrangement bit mapping, the proposed mapping gives $0.7{\sim}1.3$ dB and $0.1{\sim}1.0$ dB performance gain at $FER=10^{-3}$ with no additional complexity, respectively. Adaptive bit-reliability mappings are derived for various environments and the validity of them is confirmed through simulation.

• Journal of Navigation and Port Research
• /
• v.40 no.6
• /
• pp.369-374
• /
• 2016

Recently, due to the rapid development of smart computing technology, there have been a lot of studies on 3D navigation, and consequently the advanced commercial 3D navigation system and 3D VTS system are on the market. Even the 3D technology is well known and wide spreaded, unfortunately, the secret of code behind is still unleashed. The purpose of this paper is to show the basic methodologies to display ENC features under 3D display environment to meet the requirement of S-52 standards. The OpenGL ES is used to develop 3D ENC Viewer for further use on mobile platforms and web based vessel monitoring system. P articularly, area object triangulation, complex line drawing, polygon pattern filling and symbol drawing by texture mapping are explained in detail. The result of performance test is shown as table for correlation of SENC file size to display speed.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.05b
• /
• pp.49-52
• /
• 2003

OFDM(Orthogonal Frequency Division Multiplexing) scheme can compensate for distortions caused by multipath delay spread and reduce the burst errors caused by the Doppler effect since OFDM signals have long symbol durations. However, OFDM is required to be improved for high speed data transmission and large capacity. Therefore, coding schemes should be combined with OFDM. In this paper, it was studied that the performance of OFDM transmission scheme was improved in mobile communication channel by applying TCM, which has advantages of error correction and bandwidth efficiency. Simulation was carried out for two TCM models with different code efficient length. By mapping two models to square 16QAM, the model with the code efficient length of 2 achieved 3dB better than the other for the BER of 10/sub -3/. In conclusion, if we want to achieve a better performance with TCNA in OFDM applications, we should select a TCM with larger code efficient length.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8A
• /
• pp.777-784
• /
• 2010

Recently, the necessity of underwater communication and demand for transmitting and receiving various data such as voice or high resolution image data are increasing as well. The performance of underwater acoustic communication system is influenced by characteristics of the underwater communication channels. Especially, ISI(inter symbol interference) occurs because of delay spread according to multi-path and communication performance is degraded. In this paper, we study the OFDM technique to overcome the delay spread in underwater channel and by using CP, we compensate for delay spread. But PAPR which OFDM system has problem is very high. Therefore, we use DFT-spread OFDM method to avoid nonlinear distortion by high PAPR and to improve efficiency of amplifier. DFT-spread OFDM technique obtains high PAPR reduction effect because of each parallel data loads to all subcarrier by DFT spread processing before IFFT. In this paper, we show performance about delay spread through OFDM system and verify method that DFT spread OFDM is more suitable than OFDM for underwater communication. And we analyze performance according to two subcarrier mapping methods(Interleaved, Localized). Through the simulation results, performance of DFT spread OFDM is better about 5~6dB at $10^{-4}$ than OFDM. When compared to BER according to subcarrier mapping, Interleaved method is better about 3.5dB at $10^{-4}$ than Localized method.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.6
• /
• pp.3-8
• /
• 2013

Bit patterned media (BPM) storage is one of the promising technologies to overcome the limitations of the conventional magnetic recording. However, there are some problems in a high areal density BPM storage, inter-track interference, inter-symbol interference and noise which are severely degrading performance of the system with reducing the bit error rate. In this paper, we present a simple iterative two-dimensional equalizer based on the contraction mapping theorem to mitigate these adverse effects. Furthermore, we examine that the channel characteristics of the proposed two-dimensional equalizer satisfies the convergence conditions. In the simulation we demonstrate the bit separation characteristics of the one-dimensional equalizer and the two-dimensional equalizer and evaluate the BER performance of the proposed equalizer comparing with the conventional equalizers. According to the results of experiments, the proposed equalizer is an promising equalizer with maintaining proper complexity for a high areal density BPM storage.