• Journal of Korea Multimedia Society
• /
• v.8 no.4
• /
• pp.492-501
• /
• 2005

In this paper, we proposed the new segmentation method of optic nerve head and optic cub to consider the depth of optic nerve head on stereo fundus image. We analyzed the error factor of stereo matching on stereo fundus image, and compensated them. For robust extraction of optic nerve head and optic cub, we proposed the modified active contour model to consider the 3D depth of optic nerve head. As experiment result to various stereo fundus images, we confirmed that proposed method can segment optic nerve head and optic cup effectively.

• Journal of KIISE:Databases
• /
• v.32 no.5
• /
• pp.509-525
• /
• 2005

In this paper, we propose the index structure based on a vector approximation for efficiently supporting the similarity search of multi-dimensional data. The proposed index structure splits a region with the space partition method and allocates to the split region dynamic bits according to the distribution of data. Therefore, the index structure splits a region to the unoverlapped regions and can reduce the depth of the tree by storing the much region information of child nodes in a internal node. Our index structure represents the child node more exactly and provide the efficient search by representing the region information of the child node relatively using the region information of the parent node. We show that our proposed index structure is better than the existing index structure in various experiments. Experimental results show that our proposed index structure achieves about $40\%$ performance improvements on search performance over the existing method.

• Journal of Korea Multimedia Society
• /
• v.9 no.9
• /
• pp.1150-1159
• /
• 2006

This paper proposed a curve progress control function of the area base instead of the existing edge indication function, in order to detect the brain ventricle area by utilizing a geodesic active contour model. The proposed curve progress control function is very effective in detecting the brain ventricle area and this function is based on the average brightness of the brain ventricle area which appears brighter in MRI images. Compared numerically by using various measures, the proposed method in this paper can detect brain ventricle areas better than the existing method. By examining images of normal and diseased brain's images by brain tumor, we compared the several brain ventricle detection algorithms with proposed method visually and verified the effectiveness of the proposed method.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2018.10a
• /
• pp.813-816
• /
• 2018

X-ray 진단에서 그리드 하드웨어의 사용은 산란선에 의한 영상의 왜곡을 보정할 수 있는 장점이 있는 반면, 반복되는 라인 형태의 그리드 아티팩트를 발생시키는 부작용을 수반한다. 본 논문에서는 이러한 그리드 라인을 제거하는 방법론으로서 이산코사인변환(DCT: discrete cosine transform)을 사용 하는 기법을 제안한다. X-ray 영상에서 그리드 라인의 특성은 피사체의 형태와 영상의 영역에 따라 서로 다른 특성을 갖는다. 이에 본 연구에서는 동적으로 재구성되는 분할 구조를 기반으로 DCT 변환을 적용하고 개별 영역별로 필터전달함수를 최적화하는 방법을 채택하였다. 추출된 주파수 영역 데이터에 대하여 그리드 라인의 대역을 검출하는 알고리즘을 제안하였으며, 필터전달함수로 Kaiser윈도우와 Butterworth 필터를 조합한 형태의 밴드스톱필러(BSF: band stop filter)를 구현하였다. 또한 블로킹 현상을 개선하기 위하여 다중 영상으로부터 경계선 부분의 픽셀값을 결정하는 방법론을 제안하였다. 제안된 이론에 대하여 실제 영상을 사용한 실험결과로부터 그 타당성을 평가하였다.

• Journal of Korean Society of Transportation
• /
• v.17 no.2
• /
• pp.163-178
• /
• 1999

Conventional shortest path searching a1gorithms are based on the partial searching method such as Dijsktra, Moore etc. The a1gorithms are effective to find a shortest path in mini-modal condition of a network. On the other hand, in multi-modal case they do not find a shortest path or calculate a shortest cost without network expansion. To copy with the problem, called Searching Area Problem (SAP), a global searching method is developed in this paper with Genetic Algorithm. From the results of two examples, we found that the a1gorithm is useful to solving SAP without network expansion.

• Journal of the Korean GEO-environmental Society
• /
• v.25 no.4
• /
• pp.21-28
• /
• 2024

In this study, a polyhedral domain decomposition method for Smoothed Particle Hydrodynamics (SPH) analysis is introduced. SPH which is one of meshless methods is a numerical analysis method for fluid flow simulation. It can be useful for analyzing fluidic soil or fluid-structure interaction problems. SPH is a particle-based method, where increased particle count generally improves accuracy but diminishes numerical efficiency. To enhance numerical efficiency, parallel processing algorithms are commonly employed with the Cartesian coordinate-based domain decomposition method. However, for parallel analysis of complex geometric shapes or fluidic problems under dynamic boundary conditions, the Cartesian coordinate-based domain decomposition method may not be suitable. The introduced polyhedral domain decomposition technique offers advantages in enhancing parallel efficiency in such problems. It allows partitioning into various forms of 3D polyhedral elements to better fit the problem. Physical properties of SPH particles are calculated using information from neighboring particles within the smoothing length. Methods for sharing particle information physically separable at partitioning and sharing information at cross-points where parallel efficiency might diminish are presented. Through numerical analysis examples, the proposed method's parallel efficiency approached 95% for up to 12 cores. However, as the number of cores is increased, parallel efficiency is decreased due to increased information sharing among cores.

• 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 Society of Broadcast Engineers Conference
• /
• 2019.06a
• /
• pp.185-188
• /
• 2019

3D 영상 데이터 중 하나인, 포인트 클라우드는 3 차원 데이터를 정밀하게 획득 할 수 있다는 장점으로 인해 군사, 교육, 의료, 건축 등의 다양한 분야에서 사용되고 있다. 특히, 자율 주행 분야에서 사용되는 동적 획득 포인트 클라우드는 광범위한 영역을 표현하므로 방대한 양의 데이터를 갖고 있어, 효율적인 압축이 필수적이다. 비디오 코덱을 활용하여 3 차원 데이터 압축을 진행하는 V - PCC 의 경우, 신뢰성과 범용성이 높다는 장점이 있으나, 2D 비디오 영상을 활용하기 때문에 대용량 및 광범위한 데이터의 압축이 불가능하다는 한계를 지니고 있다. 따라서, 본 논문에서는 V- PCC 의 한계를 극복하고, 광범위한 영역의 정보를 표현하는 동적 획득 포인트를 압축하기 위해 포인트 클라우드를 분할 및 양자화하는 방안을 제시하였다.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.5A
• /
• pp.861-872
• /
• 2006

The element free Galerkin method is extended by the local partition of unity method to model the cohesive cracks in two dimensional continuum. The shape function of a particle whose domain of influence is completely cut by a crack is enriched by the step enrichment function. If the domain of influence contains a crack tip inside, it is enriched by a branch enrichment function which does not have the LEFM stress singularity. The discrete equations are obtained directly from the standard Galerkin method since the enrichment is only for the displacement field, which satisfies the local partition of unity. Because only particles whose domains of influence are influenced by a crack are enriched, the system matrix is still sparse so that the increase of the computational cost is minimized. The condition for crack growth in dynamic problems is obtained from the material instability; when the acoustic tensor loses the positive definiteness, a cohesive crack is inserted to the point so as to change the continuum to a discontiuum. The crack speed is naturally obtained from the criterion. It is found that this method is more accurate and converges faster than the classical meshless methods which are based on the visibility concept. In this paper, several well-known static and dynamic problems were solved to verify the method.

• Proceedings of the Optical Society of Korea Conference
• /
• 2002.07a
• /
• pp.52-53
• /
• 2002

파장분할 다중화 광통신 선로 상에서, 특정 파장 채널을 임의로 선택하여 분리/첨가 할 수 있는 동적파장가감기(wavelength-division dynamic optical add-drop multiplexer)는 광 네트워크의 효율을 높이는데 핵심 소자라 할 수 있다. 지난 수년간 개발된 수많은 기술들 중에서, LiNbO$_3$ 광도파로 음향광학소자(acousto-optic tunable filter： AOTF)는 몇 가지의 특징적인 장점들을 보여줬는데, 예를 들면 넓은 영역의 파장 선택성, 짧은 스위칭 시간, 다중 채널 동작 가능성 등이다. (중략)