• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.33 no.5
• /
• pp.2033-2040
• /
• 2013

There have been noticeable developments for the optimization of the highway and railroad alignments with the IT and computerized tools. The designers expect that all of the quantitative design elements should be considered. This study developed a methodology which can be useful for the vertical alignment design. It provides a accurate "vertical control point" searching method, and makes the vertical alignment optimization more efficiently. The vector method makes the searching faster and calculates more accurate application sections. The results from this method generate more reliable vertical alignments than the conventional raster method for less computation time.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.22 no.8
• /
• pp.777-783
• /
• 2012

Vibration intensity has been used to identify the location of a vibration source in a vibrating system. By using vectors representation, the source of the power flow and the vibration energy transmission paths can be revealed. However, due to the large surface area of a plate-like structure, clear transmission paths cannot be achieved using the vectors representation. Experimentally, for a large surface object, the number of measured points will also be increased. This requires a lot of time for measurement. In this study, streamlines representation is used to clearly indicate the power flow transmission paths at all surface plate for FEM and experiment. To clearly improve the vibration intensity transmission paths, streamlines representation from experimental works and FEM computations are compared. Improved transmission paths visualization for both FEM and experiment are shown in comparison to conventional vectors representation. These streamlines visualization is useful to clearly identify vibration source and detail energy transmission paths especially for large surface plate-like structures. Not only that, this visualization does not need many measured point either for experiment or FEM analysis.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.10
• /
• pp.731-740
• /
• 2003

Since motion estimation remove the redundant data to employ the temporal correlations between adjacent frames in a video sequence, it plays an important role in digital video coding. And in the block matching algorithm, search patterns of different shapes or sizes and the distribution of motion vectors have a large impact on both the searching speed and the image quality. In this paper, we propose a new fast block matching algorithm using the small-cross search pattern and the block-based gradient descent search pattern. Our algorithm first finds the motion vectors that are close to the center of search window using the small-cross search pattern, and then quickly finds the other motion vectors that are not close to the center of search window using the block-based gradient descent search pattern. Through experiments, compared with the block-based gradient descent search algorithm(BBGDS), the proposed search algorithm improves as high as 26-40% in terms of average number of search point per motion vector estimation.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.1
• /
• pp.57-65
• /
• 2004

In the block matching algorithm, search patterns of different shapes or sizes and the distribution of motion vectors have a large impact on both the searching speed and the image quality. In this paper, we propose a new fast block matching algorithm using the unit-diamond search pattern and the flat-hexagon search pattern. Our algorithm first finds the motion vectors that are close to the center of search window using the unit-diamond search pattern, and then fastly finds the other motion vectors that are not close to the center of search window using the flat-hexagon search pattern. Through experiments, compared with the hexagon-based search algorithm(HEXBS), the proposed unit-diamond and flat-hexagonal pattern search algorithm(UDFHS) improves as high as 11∼51% in terms of average number of search point per motion vector estimation and improves about 0.05∼0.74㏈ in terms of PSNR(Peak Signal to Noise Ratio).

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.7
• /
• pp.83-88
• /
• 2001

In this paper, matched field processing algorithm robust to environmental mismatches in an ocean waveguide based on feature extraction is summarized. However, in applying this processor to localize a source there are two preliminary issues to be resolved. One is the number of eigenvectors to be extracted and the other is the number of environmental samples to be used. To determine these issues, the relation between the number of dominant modes propagating in a given ocean waveguide and that of eigenvectors to be extracted is analyzed. Then, the analysis results are confirmed by the subspace analysis. This analysis quantifies the similarity between the subspace spanned by the signal vectors and that spanned by the eigenvectors to be extracted. The error index is defined as a relative difference between the location estimated by the current processor and the real source location. It is identified that in the case of extracting the largest eigenvectors equal to the number of dominant modes in a given environment, the processor localizes the source successfully. From the numerical simulations, it is shown that use of at least 30 environmental samples guarantee stable performance of the proposed processor.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2015.05a
• /
• pp.626-626
• /
• 2015

본 연구에서는 하천공간정보의 웹서비스를 위해 SOAP(Simple Object Access Protocol) API 및 REST(Representation State Transfer) API로 제공하는 HydroG-OneFlow 웹서비스를 개발하였다. HydroG-OneFlow는 GML 기반의 서비스를 제공하며 GetBasin, GetGeoVariable 및 GetData 등의 기본서비스로 구성된다. GML은 GIS S/W의 벡터 GML 포맷과 공간정보 오픈플랫폼 서비스인 브이월드 데이터 API에서 제공하는 GML 포맷을 참고하여 하천공간 벡터정보를 제공할 수 있도록 GML을 구성하였다. GDM 공간 데이터에 대한 벡터정보 ML 수용 수준을 향상시킬 수 있도록 벡터구조의 점, 선, 면 정보에 대하여 GML의 PointPropertyType, CurvePropertyType, SurfacePropertyType을 도입하였다. 또한 일반적인 공간자료에서는 Multi 객체에 대한 지원도 필요하다. 현 GDM 데이터베이스에서도 OGC 표준의 MultiPoint, MultiLineString, MultiPolygon을 지원하고 있다. 이를 위하여 GML의 상응 요소인MultiPointPropertyType, MultiCurvePropertyType, MultiSurfacePropertyType을 하천공간정보 벡터 스키마에 도입하여 활용하였다. 클라이언트 서버 통신은 메시지 교환프로토콜인 SOAP을 사용하여 서버의 객체를 직접 호출하여 이루어진다. 서버는 서버의 제공 서비스를 WSDL(Web Service Description Language)를 통하여 게시하고 클라이언트는 이 기준(Criteria)을 참고하여 접근한다. GetData의 경우 Type(GRID or VECTOR), GDM(Geospatial Data Model) 여부(true or false), LayerName, BasinID, GenTime을 인자로 받아 GeoData에서 검색된 정보를 반환한다. SOAP버전은 1.1과 1.2를 지원하여 접근하는 클라이언트에서 선택할 수 있도록 개발하였다.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2021.06a
• /
• pp.370-370
• /
• 2021

태풍으로 인한 피해를 줄이기 위해 경로, 강도 및 폭풍해일의 사전 예측은 매우 중요하다. 이중, 태풍의 경로와는 달리 강도 및 폭풍해일의 예측에 있어서 바람장은 수치 모델의 초기 입력값으로 요구되기 때문에 정확한 바람장 정보는 필수적이다. 대기 바람장 예측 방법은 크게 해석적 모델링, 라디오존데 측정과 위성 사진을 통한 산출로 구분할 수 있다. Holland의 해석적 모델링은 비교적 적은 입력값이 필요하지만 정확도가 낮고, 라디오존데 측정은 정확도가 높지만 점 측정에 가깝기 때문에 이차원 바람장을 산출하기에 한계가 있다. 위성 사진을 통한 바람장 산출은 위성기술의 고도화로 관측 채널 수 및 시공간 해상도가 크게 증가하고 있기 때문에 다양한 기법들이 개발되고 있다. 본 연구에서는 생성적 적대 신경망 (Generative Adversarial Network, GAN)을 통해 일련의 연속된 과거 적외 채널 위성 사진 흐름의 패턴을 학습시켜 미래 위성 사진을 예측하고, 예측된 연속적인 위성 사진들의 교차상관 (cross-correlation)을 통해 바람장을 산출하였다. GAN을 적용함에 있어 2011년부터 2019년까지 한반도 근방에 접근했던 태풍 중에 4등급 이상인 68개의 태풍의 한 시간 간격으로 촬영된 총 15,683개의 위성 사진을 학습시켜 생성된 이미지들은 실측 위성 사진들과 매우 유사한 것으로 나타났다. 또한, 생성된 이미지들의 교차상관으로 얻어진 바람장 벡터들의 풍향, 풍속, 벡터 일관성 및 수치 모델과의 비교를 통해 각각의 벡터들의 품질 계수를 구하고 정확도가 높은 벡터들만 결과에 포함하였다. 마지막으로 국내 6개의 라디오존데 관측점에서의 실측 벡터와의 비교를 통해 본 연구 결과의 실효성을 검증하였다. 본 연구에서 확장하여, 이와 같이 AI 기법과 이미지 교차상관 기법을 사용하여 얻어진 바람장으로부터 태풍 강도예측에 필요한 요소인 태풍의 눈의 위치, 최고 속도와 태풍 반경을 직접적으로 산출할 수 있고. 이러한 위성 사진을 기반으로 한 바람장은 단순화된 해석적 바람장을 대체하여 폭풍 해일 모델링의 예측 성능 개선에 기여할 것으로 보여진다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.8
• /
• pp.440-444
• /
• 2002

This paper presents an efficient and robust algorithm to compute the isophote of a surface of revolution. A surface of revolution can be decomposed to a set of cross-sectional circles. The surface normals along each cross-sectional circle form a cone. Using the characteristics of the normal vectors and the symmetric property of the surface of revolution, we propose a method to find the connected components of an isophote, which requires intersecting a planar curve(and its reflection) with two rays. Moreover, we propose a closed-form representation of an isophote as a parametric curve.

• Journal of Educational Research in Mathematics
• /
• v.24 no.4
• /
• pp.573-594
• /
• 2014

Capacity of making assessment items among teacher's assessment competency is essential element in validity and reliability of assessment. Errors in test items on the formal and content aspects can be a big stumbling block to derive a correct evaluation result. Through this assessment, the positive feedback can not be derived. In this study, By analyzing midterm and final 60 exam papers for geometry and vector in 45 high Schools of Seoul GyeonggiIncheon area, We argue error items and improvements on the formal and content aspect the paper-based assessment of mathematics. Through this, Our intention is to improve the skills of teachers for making assessment items.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.4 s.32
• /
• pp.85-91
• /
• 2004

The use of gestures provides an attractive alternate to cumbersome interface devices for human-computer interaction. This has motivated a very active research area concerned with computer vision-based analysis and interpretation of hand gestures The most important issues in gesture recognition are the simplification of algorithm and the reduction of processing time. The mathematical morphology based on geometrical set theory is best used to perform the processing. The key idea of proposed algorithm is to track a trajectory of center points in primitive elements extracted by morphological shape decomposition. The trajectory of morphological center points includes the information on shape orientation. Based on this characteristic we proposed the morphological gesture sequence recognition algorithm using feature vectors calculated to the trajectory of morphological center points. Through the experiment, we demonstrated the efficiency of proposed algorithm.