• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.3
• /
• pp.15-26
• /
• 2012

Recently, due to applicability increase of vector data based digital map for geographic information and evolution of geographic measurement techniques, large volumed GIS(geographic information service) services having high resolution and large volumed data are flowing actively. This paper proposed an efficient vector map compression technique using the SEC(spatial energy compaction) based on classified bins for the vector map having 1cm detail and hugh range. We encoded polygon and polyline that are the main objects to express geographic information in the vector map. First, we classified 3 types of bins and allocated the number of bits for each bin using adjacencies among the objects. and then about each classified bin, energy compaction and or pre-defined VLC(variable length coding) were performed according to characteristics of classified bins. Finally, for same target map, while a vector simplification algorithm had about 13%, compression ratio in 1m resolution we confirmed our method having more than 80% encoding efficiencies about original vector map in the 1cm resolution. Also it has not only higher compression ratio but also faster computing speed than present SEC based compression algorithm through experimental results. Moreover, our algorithm presented much more high performances about accuracy and computing power than vector approximation algorithm on same data volume sizes.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2008.10a
• /
• pp.264-265
• /
• 2008

본 연구에서는 건물공사에 사용되는 CAD 도면자료를 공간데이터로 변환하기 위한 과정의 일환으로 수치지도 작성내규에 근거한 선형단순화 기법을 제안하였다. 이 기법은 외곽선의 절점들이 수치지도 작성내규의 곡선데이터 점간거리 규정에 만족할 때까지 반복적으로 절점의 구간을 늘려나가는 방식이다. 제안된 기법의 단순화효과를 비교하기 위하여 Douglas-Peucker 알고리듬 등 가장 흔히 사용되는 4개의 선형 단순화기법을 동일한 건물 외곽선에 적용하여 수치지도작성 내규 만족도, 절점수, 선길이, 면적에 대해 비교, 분석하였다. 분석결과 제안된 알고리듬의 경우 수치지도 내규 만족도 면에서 100%에 가까운 만족도를 보였으며 절점수를 효율적으로 줄이면서, 선길이, 면적의 측면에서도 다른 알고리듬들에 비해 거의 손실이 발생하지 않아 추후 건설도면의 변환에 유용하게 사용될 가능성이 높을 것으로 판단된다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10d
• /
• pp.160-162
• /
• 2002

지리정보시스템(GIS)에서 사용하는 지도는 여러 가지 목적의 응용 프로그램이나 지도의 축척등에 의해 서 다양하게 나타난다. 본 논문은 지리정보 시스템에 사용되는 지도중에서 관광안내지도를 대상으로 최적의 레이블링과 아이콘 표시방법을 통하여 관광지도 정보를 최적화하여 표현하기 위한 논문이다. 이를 위하여 서울시내의 여러 가지 관광버스의 노선도를 분석하여 이를 최적화된 방법으로 배치하고 표현하는 위한 방법을 연구하였다. 복잡한 버스의 노선은 주요 시설물을 중심으로 선분 간략화 알고리즘을 통하여 간략화 하였으며 간략화된 노선에서 중첩되는 레이블은 레이블 재배치 알고리즘을 이용하여 재배열하였다. 이러한 방법을 통하여 지리정보 데이터베이스로부터 자동화된 방식으로 구조화된 지도를 손쉽게 생성하는 방법을 제시한다.

• ETRI Journal
• /
• v.28 no.3
• /
• pp.291-300
• /
• 2006

A simple and general bit log-likelihood ratio (LLR) expression is provided for Gray-coded rectangular quadrature amplitude modulation (R-QAM) signals. The characteristics of Gray code mapping such as symmetries and repeated formats of the bit assignment in a symbol among bit groups are applied effectively for the simplification of the LLR expression. In order to reduce the complexity of the max-log-MAP algorithm for LLR calculation, we replace the mathematical max or min function of the conventional LLR expression with simple arithmetic functions. In addition, we propose an implementation algorithm of this expression. Because the proposed expression is very simple and constructive with some parameters reflecting the characteristic of the Gray code mapping result, it can easily be implemented, providing an efficient symbol de-mapping structure for various wireless applications.

• Journal of the Korean Society for Nondestructive Testing
• /
• v.32 no.2
• /
• pp.177-184
• /
• 2012

An optical defect detection method using ESPI(electronic speckle pattern interferometry) is proposed. ESPI is widely used as a non-contact measurement system which show deformation and phase map in real time. ESPI can be divided as the in-plane, out-of-plane and shearography by operation principle and target object and also divided with bulk type and optic fiber type by the optic configurations. This paper is focused on optic fiber type out-of-plane ESPI, which has the following advantages: (1) low cost; (2) reduction of the unreliable factors generated by separated optic components; (3) simplification of the optic configuration; (4) great reduction of volume; (5) flexibility, to be easily designed into different structures to adapt to inaccessible environments such as pipeline cavity and so on.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.2
• /
• pp.827-833
• /
• 2012

In this paper, we propose an improved optical flow algorithm which reduces computational complexity as well as noise level. This algorithm reduces computational time by applying level simplification technique and removes noise by using eigenvectors of objects. Optical flow is one of the accurate algorithms used to generate depth information from two image frames using the vectors which track the motions of pixels. This technique, however, has disadvantage of taking very long computational time because of the pixel-based calculation and can cause some noise problems. The level simplifying technique is applied to reduce the computational time, and the noise is removed by applying optical flow only to the area of having eigenvector, then using the edge image to generate the depth information of background area. Three-dimensional images were created from two-dimensional images using the proposed method which generates the depth information first and then converts into three-dimensional image using the depth information and DIBR(Depth Image Based Rendering) technique. The error rate was obtained using the SSIM(Structural SIMilarity index).

• Journal of Industrial Convergence
• /
• v.20 no.12
• /
• pp.195-202
• /
• 2022

Underground Geospatial Information Map Management System(UGIMMS) integrates various underground facilities in the underground space into 3D mesh data, and supports to check the 3D image and location of the underground facilities in the mobile app. However, there is a problem that it takes a long time to run in the app because various underground facilities can exist in some areas executed by the app and can be seen layer by layer. In this paper, we propose a deep learning-based K-means vertex clustering algorithm as a method to reduce the execution time in the app by reducing the size of the data by reducing the number of vertices in the 3D mesh data within the range that does not cause a problem in visibility. First, our proposed method obtains refined vertex feature information through a deep learning encoder-decoder based model. And second, the method was simplified by grouping similar vertices through K-means vertex clustering using feature information. As a result of the experiment, when the vertices of various underground facilities were reduced by 30% with the proposed method, the 3D image model was slightly deformed, but there was no missing part, so there was no problem in checking it in the app.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2004.04a
• /
• pp.265-268
• /
• 2004

At these days, electronic maritime chart is in positively using various fields. But most of electronic maritime chart and topography information system is hard to using various fields despite that demand because that difficult approach from separately and specific constitution. This thesis apply to image filtering that extract requirement topography data from simplification of the whole system. And as constructing database of simple structure that getting various information from sounding depth and existing database, propose electronic maritime chart system to practicable 3D embodiment. And also propose convenience and commonplace to simple process about frequently renewal.

• The KIPS Transactions:PartA
• /
• v.16A no.3
• /
• pp.143-152
• /
• 2009

One of the main issues in comparative genomics is to study chromosomal gene order in one or more related species. For this purpose, the whole genome alignment is usually applied to find the horizontal gene transfer, gene duplication, and gene loss between two related genomes. Also it is well known that the novel visualization tool with whole genome alignment is greatly useful for us to understand genome organization and evolution process. There are a lot of algorithms and visualization tools already proposed to find the "gene clusters" on genome alignments. But due to the huge size of whole genome, the previous visualization tools are not convenient to discover the relationship between two genomes. In this paper, we propose AlignScope, a novel visualization system for whole genome alignment, especially useful to find gene clusters between two aligned genomes. This AlignScope not only provides the simplified structure of genome alignment at any simplified level, but also helps us to find gene clusters. In experiment, we show the performance of AlignScope with several microbial genomes such as B. subtilis, B.halodurans, E. coli K12, and M. tuberculosis H37Rv, which have more than 5000 alignment pairs (matched DNA subsequence).

• Journal of Korea Multimedia Society
• /
• v.5 no.4
• /
• pp.361-371
• /
• 2002

An efficient access technique is one of the most Important requirements in GIS. Using level -of-detailed data, we can access spatial data efficiently, because of no access to the fully detailed spatial data. Previous spatial access methods do not access data with level of detail efficiently. To solve it, a few spatial access methods for spatial data with level of detail, are known. However these methods support only a few kinds of data with level of detail, i.e, data through selection and simplification operations. For the effects, we propose a new spatial indexing method supporting fast searching in all kinds of data with level of detail. In the proposed method, the collection of indexes in its own level are integrated into a single index structure. Experimental results show that our method offers both no data redundancy and high search performance.