• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.6
• /
• pp.11-20
• /
• 1997

This paper proposes a modified dynamic programming for finding the correspondence between right and left images. A dynamic programming is based on the intensity of images for stereo matching. But htis method is intended to mismatch at uniformed intensity region. To reduce thd mismatching, the stereo images are segmented to various regions with respective uniform intensity, and the different cost function has applied to the segmented region during the dynamci programming. Cost function costains jump cost. And jump cost included two parameter .alpha. and .beta. which have influence on minimum cost path. Experimental results show that the 3D shape of some stereo pairs cna be finely obtained by this proposed algorithm.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2002.11a
• /
• pp.510-513
• /
• 2002

대부분의 이진화 알고리즘은 임계치를 결정하기 위하여 히스토그램을 사용하여 밝기분포를 분석한다. 배경과 물체의 명도차이가 큰 경우에는 분할을 위해 양봉(bimodal) 히스토그램으로 표현하여 최적의 임계치를 찾기 위해 히스토그램 골짜기(valley)를 선택하는 것만으로도 양호한 임계치 결과를 얻을수 있으나, 배경과 물체의 밝기 차이가 크지 않거나 밝기 분포가 양봉 특성을 보이지 않을 때는 히스토그램 분석만으로 적절한 임계치를 얻기 어렵다. 그리고 한 영상에서는 넓은 영역에 걸쳐 명암도 변화가 일어나고 다양한 유형의 물체가 포함되어 있으므로 스케치 특징점 유무를 판별하는 임계치의 결정에는 애매 모호함이 존재한다. 따라서 본 논문에서는 영상에 대해 삼각형 타입의 소속함수를 적용하여 임계치를 동적으로 설정하고 영상을 이진화하는 방법을 제안한다. 제안된 퍼지 이진화 방법은 평균 밝기 값을 기준으로 가장 어두운 픽셀 값과 가장 밝은 픽셀값의 거리를 계산하여 밝기의 조정률을 구하여 최소 밝기값과 최대 밝기 값을 설정하고 삼각형의 소속 함수에 적용한다. 소속 함수에 적용된 소속도를 a-cut 을 적용하여 영상을 이진화한다. 다양한 영상에 적용한 결과, 기존의 이진화 방법보다 제안된 퍼지 이진화 방법이 효율적인 것을 알 수 있었다.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2011.04a
• /
• pp.660-663
• /
• 2011

폭발하중은 매우 짧은 시간 내에 순간적인 높은 압력으로 발생된다. 따라서 폭발하중을 받는 구조물은 매우 복잡한 순간 동역학적 손상 거동을 나타낸다. 이러한 외부 하중에 대한 실험적 연구는 큰 비용, 시설, 그리고 군사적 보안 문제가 요구되기 때문에, 고성능 컴퓨팅 기술을 이용한 수치적 기법을 통해 구조물의 동적 비선형 해석을 수행하였다. 수치해석의 정확성을 높이기 위해 폭풍파와 같은 대기전파의 경우 Euler 기법, 콘크리트 재료의 경우 Lagrange 기법을 적용한 복합적 수치해석 (multi-solver coupling) 기법이 적용되었다. 제안된 수치해석 기법은 explicit 유한요소해석 프로그램인 AUTODYN을 이용하여 수행되었다. 그리고 클러스터 (cluster) 내 병렬 알고리즘 (parallel algorithm)을 이용하여 수치해석의 효율성을 높였다. RC 구조물의 수치해석 결과, 기존 실험 결과와 비교하여 잘 일치되었다. 또한 영역분할 개수가 증가할수록 수행시간은 감소되었고 Speed-up과 효율성은 높아졌다.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.57 no.1
• /
• pp.14-21
• /
• 2008

In this paper, we propose an adaptive contrast enhancement method using dynamic range segmentation. Histogram Equalization (HE) method is widely used for contrast enhancement. However, histogram equalization method is not suitable for commercial display because it may cause undesirable artifacts due to the significant change in brightness. The proposed algorithm segments the dynamic range of the histogram and redistributes the pixel intensities by the segment area ratio. The proposed method may cause over compressed effect when intensity distribution of an original image is concentrated in specific narrow region. In order to overcome this problem, we introduce an adaptive scale factor. The experimental results show that the proposed algorithm suppresses the significant change in brightness and provides wide histogram distribution compared with histogram equalization.

• KIISE Transactions on Computing Practices
• /
• v.23 no.6
• /
• pp.379-385
• /
• 2017

In enterprise environments, hybrid storage typically utilizes SSDs over disk-based RAID. Typically, SSDs over RAID are used as the data cache. Recently, the LeavO caching scheme was introduced to reduce the parity update overhead of the underlying RAID. In this paper, we combine the data caching and LeavO caching schemes and derive cost models of the combined cache to determine the optimal data and LeavO cache sizes. We also propose the Adaptive Combined Cache that dynamically adjusts the data cache and LeavO cache sizes for evolving workloads. Experimental results show that the performance of the Adaptive Combined Cache is significantly superior to that of the conventional data caching scheme and is comparable with that of the off-line optimal scheme.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2005.11a
• /
• pp.130-137
• /
• 2005

본 논문은 심장이 수축$\cdot$이완함에 따라 그 형태와 위치가 변하는 관상동맥의 구조와 그 움직임을 사실적으로 표현하기 위한 매개변수적 모델링 기법을 제안한다. 완성된 모델은 관상동맥의 움직임을 관찰함으로써 심장질환 판단에 도움을 주고, 심장시술 시뮬레이션 및 시술계획수립에 사용될 수 있다. 매개변수적 기법으로 생성된 모델은 메쉬 정점의 인덱스만으로 모델간 매칭을 위한 대응점을 찾을 수 있으므로, 시간대별로 달라지는 정점의 위치를 쉽게 추적함으로써 모델의 움직임을 표현할 수 있다. 그러나 이러한 기법으로 생성된 모델은 분리, 접합 등의 변형조작이 어렵고, 트리형태 객체에 적용하기 힘든 단점이 있다. 본 논문에서는 이를 극복하기 위해 분할된 혈관영역의 골격데이타에서 찾아낸 분기점을 중심으로 Generalized Cylinder를 이용하여 실린더 형태의 각 혈관세그먼트를 모델링 한 후, 분기영역을 3개의 하프파이프(half pipe)와 2개의 삼각형 패치로 연결하여 모델링하였다. 완성된 모델은 다시점 관상동맥데이터에 적용하였고, 각 시점에서 구해진 정점의 위치를 선형보간함으로써 부드러운 혈관의 움직임을 나타내었다.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.15 no.1
• /
• pp.127-138
• /
• 1991

A gear forming method by cold extrusion and an analytical method with its numerical solution program based on the upper bound method were developed. In the analysis the involute curve was as a shape of die and the upper bound method was used to calculate energy dissipation rate. By this method the power requirement and optimum conditions necessary for extruding helical(spur) gear were successfully calculated. These numerical solutions are in good agreement with experimental data. In the experiment, 4-6 class helical gear of KS standard for automobile transmission was successfully manufactured.

• The KIPS Transactions:PartB
• /
• v.9B no.4
• /
• pp.481-490
• /
• 2002

Off-line handwritten character recognition is in difficulty of incomplete preprocessing because it has not dynamic information has various handwriting, extreme overlap of the consonant and vowel and many error image of stroke. Consequently off-line handwritten character recognition needs to study about preprocessing of various methods such as binarization and thinning. This paper considers running time of watershed algorithm and the quality of resulting image as preprocessing for off-line handwritten Korean character recognition. So it proposes application of effective watershed algorithm for segmentation of character region and background region in gray level character image and segmentation function for binarization by extracted watershed image. Besides it proposes thinning methods that effectively extracts skeleton through conditional test mask considering routing time and quality of skeleton, estimates efficiency of existing methods and this paper's methods as running time and quality. Average execution time on the previous method was 2.16 second and on this paper method was 1.72 second. We prove that this paper's method removed noise effectively with overlap stroke as compared with the previous method.

• The KIPS Transactions:PartA
• /
• v.10A no.6
• /
• pp.665-670
• /
• 2003

In the applications like automatic masks generation for semiconductor production, a drawing consists of lots of polygons that are partitioned into trapezoids. The addition/deletion of a polygon to/from the drawing is performed through geometric operations such as insertion, deletion, and search of trapezoids. Depending on partitioning algorithm being used, a polygon can be partitioned differently in terms of shape, size, and so on. So, It's necessary to invent some comparison algorithm of sets of trapezoids in which each set represents interested parts of a drawing. This comparison algorithm, for example, may be used to verify a software program handling geometric objects consisted of trapezoids. In this paper, given k sets of trapezoids in which each set forms the regions of interest of each drawing, we present how to compare the k sets to see if all k sets represent the same geometric scene. When each input set has the same number n of trapezoids, the algorithm proposed has O(2$^{k-2}$ $n^2$(log n＋k)) time complexity. It is also shown that the algorithm suggested has the same time complexity O( $n^2$ log n) as the sweeping-based algorithm when the number k(<< n) of input sets is small. Furthermore, the proposed algorithm can be kn times faster than the sweeping-based algorithm when all the trapezoids in the k input sets are almost the same.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.26 no.5
• /
• pp.385-392
• /
• 2013

The finite element method has become the most widely used method of structural analysis and recently, the method has often been applied to complex dynamic and nonlinear structural analyses problems. Even for these complex problems, where the responses are hard to predict, finite element analyses yield reliable results if appropriate element types and meshes are used. However, the dynamic and nonlinear behaviors of a structure often include large deformations in various portions of the structure and if the same mesh is used throughout the analysis, some elements may deform to shapes beyond the reliable limits; thus dynamically adapting finite element meshes are needed in order for the finite element analyses to be accurate. In addition, to satisfy the users requirement of quick real run time of finite element programs, the algorithms must be computationally efficient. This paper presents an adaptive finite element mesh generation scheme for dynamic analyses of structures that may adapt at each time step. Representative strain values are used for error estimates and combinations of the h-method(node movement) and the r-method(element division) are used for mesh refinements. A coefficient that depends on the shape of an element is used to limit overly distorted elements. A simple frame example shows the accuracy and computational efficiency of the scheme. The aim of the study is to outline the adaptive scheme and to demonstrate the potential use in general finite element analyses of dynamic and nonlinear structural problems commonly encountered.