• 한국멀티미디어학회논문지
• /
• 제17권10호
• /
• pp.1171-1181
• /
• 2014

In this paper, we propose improved methods which are image conversion and extraction method of watershed seed using morphological characteristic of teeth on complement image. Conventional tooth segmentation methods are occurred low detection ratio at molar region and over, overlap segmentation owing to specular reflection and morphological feature of molars. Therefore, in order to solve the problems of the conventional methods, we propose the image conversion method and improved extraction method of watershed seed. First, the image conversion method is performed using RGB, HSI space of tooth image for to extract boundary and seed of watershed efficiently. Second, watershed seed is reconstructed using morphological characteristic of teeth. Last, individual tooth segmentation is performed using proposed seed of watershed by watershed algorithm. Therefore, as a result of comparison with marker controlled watershed algorithm and the proposed method, we confirmed higher detection ratio and accuracy than marker controlled watershed algorithm.

• 대한의용생체공학회:의공학회지
• /
• 제38권2호
• /
• pp.82-88
• /
• 2017

Enlargement of the lateral ventricles have been identified as a surrogate marker of neurological disorders. Quantitative measure of the lateral ventricle from MRI would enable earlier and more accurate clinical diagnosis in monitoring disease progression. Even though it requires an automated or semi-automated segmentation method for objective quantification, it is difficult to define lateral ventricles due to insufficient contrast and brightness of structural imaging. In this study, we proposed a fully automated lateral ventricle segmentation method based on a graph cuts algorithm combined with atlas-based segmentation and connected component labeling. Initially, initial seeds for graph cuts were defined by atlas-based segmentation (ATS). They were adjusted by partial volume images in order to provide accurate a priori information on graph cuts. A graph cuts algorithm is to finds a global minimum of energy with minimum cut/maximum flow algorithm function on graph. In addition, connected component labeling used to remove false ventricle regions. The proposed method was validated with the well-known tools using the dice similarity index, recall and precision values. The proposed method was significantly higher dice similarity index ($0.860{\pm}0.036$, p < 0.001) and recall ($0.833{\pm}0.037$, p < 0.001) compared with other tools. Therefore, the proposed method yielded a robust and reliable segmentation result.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제32권6호
• /
• pp.523-531
• /
• 2005

확산(Diffusion)을 이용한 기존의 칼라영상 분할은 확산의 횟수가 반복될수록 경계선 정보가 적절히 유지되지 못하거나 잡음을 제거하지 못함으로써 워터쉐드(Watershed) 알고리즘을 적용하는 경우, 과분할을 피할 수 없다는 단점을 갖고 있다. 본 논문에서는 수리 형태학(Mathematical Morphology)과 비선형 확산(Non-Linear Diffusion)을 함께 적용하여 과분할의 문제점을 제거한 워터쉐드 결과를 얻을 수 있는 칼라영상 분할방법을 제안한다. 임의의 칼라 영상을 LUV 색상공간으로 변환하여, 그 각각의 색상공간에 수리 형태학을 응용한 재구성에 의한 닫힘(Reconstruction) 연산과 비선형 확산을 함께 적용하여 경계선을 적절히 유지하면서 잡음을 제거한 단순 영상을 획득할 수 있다. 이 영상에서 칼라 영상의 기울기(Gradient) 정보를 획득하고, 워터쉐드 알고리즘을 적용하여 영상을 분할한다. 실험 결과, 기존의 방법보다 과분할이 현저히 제거되고, 칼라 영상이 매우 효과적으로 분할됨을 확인하였다

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.1377-1381
• /
• 2003

This paper describes real time object tracking of 3D objects in 2D image sequences. The moving objects are segmented from the image sequence using morphological operations. The moving objects are segmented by the method of differential image followed by the process of morphological dilation. The moving objects are recognized and tracked using statistical moments. The direction of moving objects are determined by the Hough transform. The straight lines in the moving objects are found with the help of Hough transform. The direction of the moving object is calculated from the orientation of the straight lines in the direction of the principal axes of the moving objects. The direction of the moving object and the displacement of the object in the image sequence is used to calculate the velocity of the moving objects. The simulation results of the proposed method are promising on the test images.

• 전기전자학회논문지
• /
• 제4권2호
• /
• pp.288-294
• /
• 2000

본 논문에서는 동영상 압축 기법을 향상시키기 위하여 효율적인 detail 추출 기법을 제안한다. 기존의 top-hat 변환을 이용한 기법은 고립되어 있고 시각적으로 중요한 detail의 추출에는 효율적이지만, 영역의 경계에서는 비효율적이다. 제안된 기법은 수리형태학적 Laplacian 연산의 영역경계 정보추출의 성질을 이용하여 압축을 향상시키고 저비트율을 제공한다. 실험결과를 통해서 제안된 기법이 기존 기법보다 효율적임을 보이고 수리형태학적 Laplacian 연산 적용의 타당성을 설명한다.

• 제어로봇시스템학회논문지
• /
• 제14권5호
• /
• pp.438-443
• /
• 2008

In this paper, segmenting and classifying low contrast defects on flat panel display is one of the key problems for automatic inspection system in practice. Problems become more complicated when the quality of acquired image is degraded by the illumination irregularity. Many algorithms are developed and implemented successfully for the defects segmentation. However, vision algorithms are inherently prone to be dependent on parameters to be set manually. In this paper, one morphological segmentation algorithm is chosen and a technique using frequency domain analysis of input images is developed for automatically selection the morphological parameter. An extensive statistical performance analysis is performed to compare the developed algorithms.

• 대한의용생체공학회:의공학회지
• /
• 제26권3호
• /
• pp.171-176
• /
• 2005

This paper proposes an automatic liver segmentation method using improved partial histogram threshold (PHT) algorithms. This method removes neighboring abdominal organs regardless of random pixel variation of contrast enhanced CT images. Adaptive multi-modal threshold is first performed to extract a region of interest (ROI). A left PHT (LPHT) algorithm is processed to remove the pancreas, spleen, and left kidney. Then a right PHT (RPHT) algorithm is performed for eliminating the right kidney from the ROI. Finally, binary morphological filtering is processed for removing of unnecessary objects and smoothing of the ROI boundary. Ten CT slices of six patients (60 slices) were selected to evaluate the proposed method. As evaluation measures, an average normalized area and area error rate were used. From the experimental results, the proposed automatic liver segmentation method has strong similarity performance as the MSM by medical Doctor.

• 대한전자공학회논문지SP
• /
• 제43권3호
• /
• pp.84-91
• /
• 2006

본 논문에서는 수학적 모폴로지 연산과 가우시안 혼합 모형에 기초한 새로운 칼라 영상 분할 알고리즘을 제안한다. 우리는 혼합 모형에서 구성 성분의 수를 결정하고, 각 구성 성분의 중심값을 계산하는데 모폴로지의 연산과 라벨링 연산을 이용한다. 그리고 칼라 특징 벡터의 확률 모형으로 가우시안 혼합 모형을 사용하고, 이들의 모수 값들을 추정하는데 결정적 어닐링 EM알고리즘을 사용한다. 최종적으로 혼합 모형으로부터 계산된 사후 확률을 이용하여 칼라 영상을 분할한다. 실험 결과를 통하여 모폴로지 연산이 혼합모형의 수를 자동으로 결정하고 각 성분의 모드를 계산하는데 아주 효율적인 방법임을 보였고, 또한 결정적 어닐링 EM 알고리즘에 의하여 추정된 가우시안 혼합 모형을 사용하여 계산된 사후 확률에 의한 영상 분할 방법이 기존의 분할 알고리즘보다 정확한 분할 방법임을 보였다.

• IEIE Transactions on Smart Processing and Computing
• /
• 제3권4호
• /
• pp.191-194
• /
• 2014

This paper proposes a fast and efficient method to extract the skin and bone automatically in CT images. First, the images were smoothed by applying an anisotropic diffusion filter to remove noise. The whole body was then detected by thresholding, which was set automatically. In addition, the contour of the skin was segmented using morphological operators and connected component labeling (CCL). Finally, the bone was extracted by iterative thresholding.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2015년도 하계학술대회
• /
• pp.516-517
• /
• 2015

The automatic traffic sign detection and recognition has been one of the highly researched and an important component of advanced driver assistance systems (ADAS). They are designed especially to warn the drivers of imminent dangers such as sharp curves, under construction zone, etc. This paper presents a traffic sign recognition (TSR) system using morphological operations and multiple descriptors. The TSR system is realized in three stages: segmentation, shape classification and recognition stage. The system is designed to attain maximum accuracy at the segmentation stage with the inclusion of morphological operations and boost the computation time at the shape classification stage using MB-LBP descriptor. The proposed system is tested on the German traffic sign recognition benchmark (GTSRB) and on Korean traffic sign dataset.