• Journal of Korean Society for Geospatial Information Science
• /
• v.24 no.4
• /
• pp.83-88
• /
• 2016

The use of consistent coastlines is an important element for the systematic management of maritime boundaries and the interests of local governments. The Hydrographic and Oceanographic Agency conducted a preliminary survey for consistent coastline production, since 2001. As a result, the length of coastline was different by year. Because of the lack of systematic management, the use of incorrect data, etc. We also changed the coastline on the sea chart to show on a digital map for realization of terrain expression method. However, there was a variation in shoreline length due to various surveying techniques and shoreline extraction methods. In this paper, the characteristics of Jeju-do coastline were analysed by using a modified divider method of fractal dimension. The accuracy of the vectorization was determined by converting the actual distance in the Public Survey Amendment for proper divider use. With 1:5,000 and 1:25,000 digital maps of Jeju-si and Seogwipo-si each fractal dimensions were calculated. Jeju-si=1.14 and Seogwipo-si=1.12 in 1: 5,000. Jeju-si=1.13 and Seogwipo-si=1.10 in 1: 25,000. Calculated fractal dimension were correlated to data from digital maps. It was considered that complexity and scale of coastlines affected. In the future coastline length statistics and minimum ratio of calculated coastline length to original length need to be determined for consistency of coastline length statistics.

• Journal of Korea Multimedia Society
• /
• v.17 no.1
• /
• pp.69-76
• /
• 2014

It is hard to represent massive terrain data in real-time even using recent graphics hardware. In order to process massive terrain data, mesh simplification method such as continuous Level-of-Detail is commonly used. However, existing GPU-based methods using quad-tree structure such as geometry splitting, produce lots of vertices to traverse the quad-tree and retransmit those vertices back to the GPU in each tree traversal. Also they have disadvantage of increase of tree size since they construct the tree structure using texture. To solve the problem, we proposed GPU-base chunked LOD technique for real-time terrain rendering. We restrict depth of tree search and generate chunks with tessellator in GPU. By using our method, we can efficiently render the terrain by generating the chunks on GPU and reduce the computing time for tree traversal.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.1
• /
• pp.1-8
• /
• 2010

Some methods employing the Active Contour Model have been widely used to extract face contour. Their performance, however, depends on the initial position of the model and the coefficients of the energy function which should be reconsidered whenever illumination and environmental condition of an input image is changed. Additionally, the number of points in the contour model should increase drastically in order to extract a fine contour. In this paper, we thus propose a novel approach which extracts face contour by segmenting the face region with threshold values obtained by a histogram analysis technique in the separated region of input image. The proposed method shows good performance under various illumination and environmental condition since it extracts face contour by considering the characteristics of the input image.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2005.11a
• /
• pp.479-482
• /
• 2005

본 논문에서는 퍼지 뉴럴네트워크의 새로운 구조인 Fuzzy Set-based Polynomial Neural Networks(FSPNN)을 소개한다. 제안된 모델은 일반적인 최적화 방법과 정보 입자를 이용하여 네트워크를 설계한다. 최종 구조는 Fuzzy Set-based Polynomial Neuron(FSPN)을 기반으로 설계한 FPNN과 동일하다. 첫째로 FSPNS의 종합적인 설계방법(유전자 알고리즘을 이용한 최적 구조 탐색)에 대해 소개한다. FSPNN에 관계되는 입력변수의 개수, 후반부 다항식의 차수, 멤버쉽 함수의 수 그리고 입력변수 개수에 따른 입력변수를 유전자 알고리즘을 통하여 동조한다. 두 번째로, 입력 변수의 개별적인 퍼지 규칙 형성과 퍼지 공간 분할 및 삼각형 멤버쉽 함수의 초기 정점을 HCM 클러스터링을 통한 Information Granules로 정의한다. 또한 데이터 입자의 중심을 이용하여 후반부의 구조를 결정한다. 이 네트워크의 성능은 기존에 퍼지 또는 뉴로퍼지 모델링에서 실험된 모델링 표준치를 이용하여 평가한다.

• Journal of Digital Contents Society
• /
• v.5 no.4
• /
• pp.269-274
• /
• 2004

The field based morping requires the user to set most of the control lines manually which require much time and skill to get satisfactory results. This tjesis proposes a method to acquire semi-automation of image morphing through first acquiring shape information from the source image and the target image, than after the user manually designates the least amount of a pair of feature points, these are used as standards for polygon based vertex to set the appropriate control line to the source image and target image, and then using the ratio of control line lengths and space. Using the proposed method the user can reduce the time setting the control line and unskilled persons can get natural image morphing results while desingnating the least amount of control line.

• Annual Conference of KIPS
• /
• 2001.10a
• /
• pp.641-644
• /
• 2001

기존의 종이지도를 수치지도 처리과정으로 얻어진 등고선(contour line) 데이터는 원격탐사(Remote Sensing)와 지리정보시스템(GIS)의 응용분야에서 주로 사용되어지는 데이터이다. 이러한 등고선은 해당 지역의 DTM(Digital Terrain Model) 데이터 생성을 위해 보간(interpolation)하여 생성하는 데 연구가 집중되어 왔다. 본 논문에서는 DEM(Digital Elevation Model)으로부터 얻어진 등고선 데이터를 이용하여 사용자에게 3 차원으로 가시화 해 줄 수 있는 기법을 소개한다. 등고선 추출을 위한 방법으로는 기존의 소개되어진 Marching Square 알고리즘을 적용하였고, 지역적인 최고점(local minimum)과 최소점(maximum)을 구하기 위해 등고선을 열린 등고선(open contour)과 닫힌 등고선(closed contour)으로 분류하게 된다. 지역적 최고, 최소점을 찾기 위한 탐색공간을 줄이기 위해 닫힌 등고선만을 대상으로 등고선 트리를 생성하였으며, 생성된 트리의 리프노드에 대해서 최고, 최소점에 대한 근사(approximation)를 수행하게 된다. 이렇게 구해진 근사된 정점들과 등고선 데이터를 입력으로 하여 제한된 딜로니 삼각분할(Constrained Delaunay Triangulation)을 수행함으로써, 3 차원 지형을 재구성할 수 있다. 실험에서 USGS 로부터 획득한 지형 데이터를 이용하여 속도 측정을 하였다. 결과적으로 저장공간 측면에서 적은 량의 데이터를 가지면서 등고선을 표현할 수 있는 3 차원 지형을 렌더링 할 수 있음을 알 수 있다.

• Korean Journal of Organic Agriculture
• /
• v.23 no.4
• /
• pp.781-796
• /
• 2015

This study was carried out to investigate the effect of no-tillage and split irrigation on the growth of pepper plant under green house condition in Jeonnam province. Moisture content of soil at whole quantity irrigation in tillage was increased rapidly regardless of soil depth for initial irrigation and then was decreased continuously until next irrigation. Deviation of moisture content in soil was decreased with increasing depth of soil. Moisture contents of top soil and subsoil (20 cm) at whole quantity irrigation in no-tillage were increased with sunrise, and then decreased with sunset. Moisture contents of top soil in tillage, and top soil and subsoil (20 cm) in no-tillage at half quantity irrigation indicated a cyclic diurnal variation by evapotranspiration. Salinity of soil was increased after initial irrigation and then was decreased continuously until next irrigation. With increasing depth of soil, increases of salinity in soil was delayed. Salinity of top soil in no-tillage was increased between AM 11:00 and AM 12:00, and then showed the highest level between PM 2:00 and PM 6:00 on a cyclic diurnal variation by evapotranspiration. Salinity of subsoil (30 cm) in no-tillage was not measured a cyclic diurnal variation. Moisture content and salinity of soil was positive correlation regardless of tillage and no-tillage cultivation. Growth of pepper in no-tillage cultivation was higher than that in tillage cultivation. Main branch Length and stem diameter of half quantity irrigation plot was higher than that of whole quantity irrigation plot regardless of tillage and no-tillage cultivation. After harvesting, the number of pepper fruits of half quantity irrigation plot was increased remarkably by 49% and 47%, in tillage and no-tillage cultivation, respectively. Pepper yield of no-tillage cultivation plot was higher by 8% than that of tillage cultivation plot. Pepper yield of half quantity irrigation plot was increased remarkably by 36% and 39%, in tillage and no-tillage cultivation, respectively.

• Journal of the Korea Computer Graphics Society
• /
• v.8 no.3
• /
• pp.9-16
• /
• 2002

Recently, high dynamic range (HDR) compression has attracted much attention due to the wide availability of HDR images. In this paper, we present an HDR compression method using a progressive image, which is a multi-level image representation based on a progressive mesh. An HDR image can be decomposed into a base image and a sequence of details by conversion into a progressive image. This decomposition provides a good structure to highly compress the dynamic range while preserving image details. The base image and larger details are considerably scaled down but smaller details are slightly scaled down. Experimental results show that our method successfully generates HDR compressed images without halo artifacts by controlling two intuitive parameters.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.15 no.4
• /
• pp.339-344
• /
• 2009

The joint cruises of six times between Korea and China were carried out for a better understanding of the environmental and oceanographical characteristics of the Yellow Sea for 6 years from 1998 to 2003. Zooplankton samples were collected one time per year at 24 stations on 3 lines of the Yellow Sea. The aim of this study is to understand the seasonal fluctuation of zooplankton community in the Yellow Sea. There is no trend on the spatio-temporal distribution of zooplankton. Copepoda, the major taxon of the Yellow Sea, was high in distribution in the eastern part and Chaetognatha in the western part of the Yellow Sea. In this results, the dominant copepods were Calanus sinicus, Paracalanus parvus s.l., Oithona atlantica, and Corycaeus affinis during the study periods. The density fluctuation of these dominant species may be an important factor in determining the fisheries resource of the Yellow Sea.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.3
• /
• pp.95-101
• /
• 2024

The numberlink puzzle(NLP), which non-crossings with other numbers of connection in connecting lines through empty cells between a given pair of numbers, is an NP-complete problem with no known way to solve the puzzle in polynomial time. Until now, arbitrary numbers have been selected and puzzles have been solved using trial-and-error methods. This paper converts empty cells into vertices in lattice graphs connected by edge between adjacent cells for a given problem. Next, a straight line was drawn between the pairs of numbers and divided into groups of numbers where crossing occurred. A bypass route was established to avoid intersection in the cross-number group. Applying the proposed algorithm to 18 benchmarking data showed that the puzzle could be solved with a linear time complexity of O(n) for all data.