• Journal of Creative Information Culture
• /
• v.6 no.1
• /
• pp.41-48
• /
• 2020

In order to represent and process spatial data, hierarchical data structures such as a quadtree or a bintree are used. Various approaches for linearly representing the bintree have been proposed. S-Tree has the advantage of compressing the storage space by expressing binary region image data as a linear binary bit stream, but the higher the resolution of the image, the longer the length of the binary bit stream, the longer the storage space and the lower the search performance. In this paper, we construct a hierarchical structure of multiple separated bintrees with a full binary tree structure and express each bintree as two linear binary bit streams to reduce the range required for image search. It improves the overall search performance by performing a simple number conversion instead of searching directly the binary bit string path. Through the performance evaluation by the worst-case space-time complexity analysis, it was analyzed that the proposed method has better search performance and space efficiency than the previous one.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.1
• /
• pp.70-75
• /
• 2002

Video conference system has guided swiftness of information transmission and business processing taking away time and manufacturing drug of space that is happened that long-distance people gather and talk. But, leakage of important meeting contents, peculation etc.. in that execute video -conferences can happen. Therefore, research about video conference system of safety is progressing under secure superhigh speed information communication fetters. This treatise studied about techniques to encipher videotex to prevent variation and outward flow of burn information, peculation etc.. except general encryption notation such as user certification to have drawn problem about stability of general video conference system, and is used present as countermeasure about here. Used improved Vernam's encryption techniques to encrypt videotex.

• Korean Journal of Remote Sensing
• /
• v.38 no.6_1
• /
• pp.1329-1341
• /
• 2022

Destroying the marine environment and marine ecosystem and causing marine accidents, marine debris is generated every year, and among them, submerged marine debris is difficult to identify and collect because it is on the seabed. Therefore, deep-learning-based semantic segmentation was experimented on waste fish nets and waste ropes using underwater images to identify efficient collection and distribution. For segmentation, a high-resolution network (HRNet), a state-of-the-art deep learning technique, was used, and the performance of each optimizer was compared. In the segmentation result fish net, F1 score=(86.46%, 86.20%, 85.29%), IoU=(76.15%, 75.74%, 74.36%), For the rope F1 score=(80.49%, 80.48%, 77.86%), IoU=(67.35%, 67.33%, 63.75%) in the order of adaptive moment estimation (Adam), Momentum, and stochastic gradient descent (SGD). Adam's results were the highest in both fish net and rope. Through the research results, the evaluation of segmentation performance for each optimizer and the possibility of segmentation of marine debris in the latest deep learning technique were confirmed. Accordingly, it is judged that by applying the latest deep learning technique to the identification of submerged marine debris through underwater images, it will be helpful in estimating the distribution of marine sedimentation debris through more accurate and efficient identification than identification through the naked eye.

• The KIPS Transactions:PartA
• /
• v.11A no.5
• /
• pp.303-312
• /
• 2004

In this paper, we propose a methodology solving the problem of the hardware-software partitioning in reconfigurable systems using a Y-chart design space exploration and implement a simulator according to the methodology. The methodology generates a mapping set between tasks and hardware elements using the hardware element model and the application model. We evaluate the throughput by simulating cases in each mapping set. With the throughput evaluation result, we can select the mapping case with the highest throughput. We also propose an heuristic improving the simulation time by reducing the mapping set on the basis of the relationship between workload and parallelism. Simulation results show that we can reduce the size of mapping set which poses difficulties on hardware-software partitioning by up to 80%.

• Journal of Korean Society of Transportation
• /
• v.15 no.1
• /
• pp.5-15
• /
• 1997

공간통계분석은 공간적으로 연계된 변수들간의 관계를 분석하는 통계분야이다. 일 반적으로 공간적으로 연계된 변수들간의 관계는 각 변수간의 공간적 분포정도에 따라서 영 향을 받는다. 전통적인 통계 분석의 방법은 동질의 자료발생과정에 의하여 확률적으로 축출 된 표본자료를 가정하고 있으나, 공간적인 자료는 이와 같은 동질의 자료발생과정의 가정을 부정한다. 교통류 및 교통사고 등과 같은 교통분야의 자료는 대부분 공간적인 상관관계에 의하여 축출된 이질적인 표본자료이며 따라서 공간상관관계를 동질적으로 가정한 전통적인 통계적 분석 방법은 오류를 범할 수 있다. 본 논문은 공간적인 관계를 고려한 공간자기상관 분석기법을 이용하여 고속도로상의 교통사고에 관하여 분석하였다. 분석의 결과에 의하면 4 개 고속도로 중 경인고속도로를 제외한 3개의 고속도로상의 교통사고건수는 통계적으로 현 저한 양의 공간적 상관관계가 있음을 알 수 있었다. 이에 따라 공간적 상관관계를 고려한 교통사고분석을 위하여 종속변수로 단위구간별 교통사고건수를 그리고 설명변수로서는 단위 구간별 교통량, I.C. 유무 및 화물차량비율을 이용하여 공간 자기회귀분석을 시도하였다. 분 석의 분석에서는 구간별 교통량과 화물차량의 비율이 호남/남해 고속도로의 경우에는 구간 별 교통량과 I.C. 유무가 통계적으로 유의한 것으로 분석되었다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.399-402
• /
• 2017

We consider an sensor partitioning problem for energy-efficient measurement scheduling in a spatially correlated sensor field where sensors are located randomly. We divide the whole sensors into subsets of k sensors in the way of letting each subset give similar amount of mutual information. Then it allows more prolonged life time of the sensor field than measuring the sensors that gives most information only. To this end, we compute the Shapley value of each sensor and compose the subsets so that each subset can have total Shapley value similar with the other subsets.

• Journal of the Korea Computer Graphics Society
• /
• v.12 no.1
• /
• pp.9-15
• /
• 2006

본 논문에서는 점묘화를 생성하기 위한 회화적 렌더링 기법을 제안한다. 신인상파(Neo-Impressionist) 화가 쇠라는 캔버스위의 독립 색채들은 망막위에서 재조직된다는 이론을 바탕으로 점묘화를 제안한다. 이는 색의 병치혼합과 보색대비를 이용해 빛의 가산혼합이 회화작품에 적용될 수 있도록 하기위해 브러시 스트로크로 작은 점을 이용한다. 이러한 점묘화를 표현하기위해서 쇠라의 작품과 동시대의 색이론 분석을 통해 색의 분할과 병치혼합의 이론적 배경을 알아보고 이를 통해 점묘 스트로크의 색상, 모양, 방향등을 결정할 수 있는 알고리즘을 소개한다. 먼저 신인상파의 팔레트 분석을 통해 칼라모델을 설계한다. 그리고 입력영상을 영상분할 기법을 이용해 공간적 구도를 잡고 각 분할 영역의 관계를 고려해 색상을 할당한다. 각 할당된 색은 보색과 함께 정의된다. 각 분할영역은 해당영역에서 표현될 수 있는 색상의 작은 점묘 브러시 스트로크로 렌더링이 된다. 이때 입력영상의 밝기정보를 유지할 수 있도록 점묘 스트로크는 색상이 결정된다. 점묘 스트로크의 방향은 입력영상의 에지방향을 따르도록 보간법을 이용해 계산한다.

• Smart Media Journal
• /
• v.8 no.2
• /
• pp.74-79
• /
• 2019

Traditional compound noun decomposition algorithms often face challenges of decomposing compound nouns into separated nouns when unregistered unit noun is included. It is very difficult for those traditional approach to handle such issues because it is impossible to register all existing unit nouns into the dictionary such as proper nouns, coined words, and foreign words in advance. In this paper, in order to solve this problem, compound noun decomposition problem is defined as tag sequence labeling problem and compound noun decomposition method to use syllable unit embedding and deep learning technique is proposed. To recognize unregistered unit nouns without constructing unit noun dictionary, compound nouns are decomposed into unit nouns by using LSTM and linear-chain CRF expressing each syllable that constitutes a compound noun in the continuous vector space.

• Journal of Korean Society for Geospatial Information Science
• /
• v.3 no.1 s.5
• /
• pp.91-104
• /
• 1995

The spatial aggregation of data, in transportation and other planning processes, is an important theoretical consideration because the results of any analysis are not entirely independent of the delineation of zones. Moreover, using a different spatial aggregation may lead to different, and sometimes contradictory conclusions. Two criteria have been considered as important in designing zone systems. They are scale and aggregation. The scale problem arises because of uncertainty about the number of zones needed for a study and the aggregation problem arises because of uncertainty about how the data are to be aggregated to from a given scale problem. In a transportation study, especially in the design of traffic analysis zone(TAZ), the scale problem is directly related to the number dof zones and the aggregation problem involves spatial clustering, meeting the general requirements of forming the zones system such as equal traffic generation, convexity, and the consistency with the political boundary. In this study, first, the comparative study of delineating spatial units has been given. Second, a FORTRAN-based heuristic algorithm for designing TAZ based on socio-economic data has been developed and applied to the Korean peninsula containing 132 micro parcels. The vector type ARC/INFO GIS topological data mosel has been used to provise the adjacency information between parcels. The results, however, leave some to be desired in order to overcome such problems as non-convexity of the agglomerated TAZ system and/or uneven traffic phenomenon for each TAZ.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.22 no.1
• /
• pp.35-44
• /
• 2009

This paper describes an application of domain decomposition method for parallel finite element analysis which is required to large scale 3D structural analysis. A parallel finite element method system which adopts a domain decomposition method is developed. Node is generated if its distance from existing node points is similar to the node spacing function at the point. The node spacing function is well controlled by the fuzzy knowledge processing. The Delaunay triangulation method is introduced as a basic tool for element generation. Domain decomposition method using automatic mesh generation system holds great benefits for 3D analyses. Aa parallel numerical algorithm for the finite element analyses, domain decomposition method was combined with an iterative solver, i.e. the conjugate gradient(CG) method where a whole analysis domain is fictitiously divided into a number of subdomains without overlapping. Practical performance of the present system are demonstrated through several examples.