• Journal of Korea Multimedia Society
• /
• 제14권11호
• /
• pp.1383-1391
• /
• 2011

Following the appearance of the latest medical equipment with improved function, the importance of image analysis which enables effective image processing and analysis consistent with the hardware performance is on the rise. As well as, ongoing study is being done on the 2D medical image processing and 3D reconstruction. This paper segments chest CT images into each stage and finally shows 3D reconstruction of each segmented result. Among various image segmentation methods, Region Growing and apply sharpening and Gamma Controller as for image improvement for effective segmentation, image segmentation in order of bronchus and lung, bronchus, lung. Human organs image of segmented is use VTK(Visualization Toolkit) to make 3D reconstruction, two and three-dimensional medical image processing and analysis for lesions diagnosis are able to utilized.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제26권7B호
• /
• pp.968-974
• /
• 2001

최근 정보통신기술의 발전과 함께 영상매체의 급속한 증가로 영상의 효율적인 관리와 검색의 필요성이 요구되면서 내용기반 영상검색이 핵심기술로 대두되고 있다. 내용기반 영상검색에서 영상의 특징을 표현하기 위해 색상 히스토그램을 많이 사용하고 있으나, 색상만을 고려하는 것은 많은 단점을 지니고 있으므로 본 논문에서는 먼저 순차영역분할(sequential clustering)기법을 도입하여 영역을 분할하며, 분할된 영역의 색상평균값과 영역의 중심점으로부터의 거리 히스토그램을 영상의 특징으로 구하여 이를 비교함으로써 색상과 공간정보를 함께 고려하는 방법을 제안한다. 제안된 방법의 특성의 수가 18개로 타 방법보다 매우 작은 저장공간을 가지면서도 동시에 검색효율이 8.5% 이상 개선되었다. Precision 대 Recall에서도 각 질의영상에서 대부분의 Recall 값에서 제안한 방법의 우수함이 확인되었으며, 시각적으로도 양호한 검색결과를 얻을 수 있었다.

• Journal of Korea Multimedia Society
• /
• 제7권9호
• /
• pp.1240-1245
• /
• 2004

This paper presents the moving objects segmentation algorithms from the sequence images in the stationary backgrounds such as surveillance camera and video phone and so on. In this paper, the moving object area is extracted with proposed object searching algorithm and then moving object is segmented within the moving object area. Also the proposed algorithms have the robustness against noise problems and results show the proposed algorithm is able to efficiently segment and track the moving object area.

• Proceedings of the Korea Information Processing Society Conference
• /
• 한국정보처리학회 2005년도 추계학술발표대회 및 정기총회
• /
• pp.693-696
• /
• 2005

한의학은 우수한 진단 능력을 보유하고 있음에도 불구하고 임상의의 직관에 머물러 있었던데 비해 서양의학은 다양한 진단 기기 개발로 인해 시장 성숙도 및 선호도에서 발전을 거듭하는 결과를 가져왔다. 본 논문에서는 한방의 직관적 진단법을 시각화, 객관화하기 위해 4진 방법 중 안면 망진 기법을 기기로 구현하기 위한 방법론을 제안하고자 한다. 이를 위해 우선적으로 찰색에 필요한 영역을 자동으로 분할하기 위한 방법을 개발하여 질병 진단에 필요한 진단 데이터를 시각화, 정량화, 계량화하기 위한 작업을 행하고자 한다. 또한 얼굴 안면의 색상 보정을 위해 화이트 밸런스 촬영으로 이미지를 분석하고 얼굴영역을 추출하며, 이목구비와 명당 영역을 추출하여 찰색에 필요한 영역을 분할해 내고자 한다. 끝으로 실험에 의해 제안한 방법의 유용성을 입증하고자 한다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• 제41권6호
• /
• pp.25-32
• /
• 2004

We propose a hierarchical disparity estimation algorithm with edge-preserving energy-based regularization. Initial disparity vectors are obtained from downsampled stereo images using a feature-based region-dividing disparity estimation technique. Dense disparities are estimated from these initial vectors with shape-adaptive windows in full resolution images. Finally, the vector fields are regularized with the minimization of the energy functional which considers both fidelity and smoothness of the fields. The first two steps provide highly reliable disparity vectors, so that local minimum problem can be avoided in regularization step. The proposed algorithm generates accurate disparity map which is smooth inside objects while preserving its discontinuities in boundaries. Experimental results are presented to illustrate the capabilities of the proposed disparity estimation technique.

• Journal of Information Technology and Architecture
• /
• 제10권1호
• /
• pp.113-122
• /
• 2013

In this paper, we propose the method that automatically corrects the composition of a picture stylishly as well as reliably by cropping pictures based on the Rule of Thirds. The region of interest (ROI) is extracted from a picture by applying the Saliency Map and the Image Segmentation technology, the composition of the photo is amended based on this area to satisfy the Rule of Thirds. In addition, since the face region of the person is added to ROI by the Face Detection technique and the composition is amended by the various scenario according to ROI, the little more natural picture is acquired. The experimental result shows that the photo of the corrected composition was naturally amended compared with the original photo.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제35권3A호
• /
• pp.254-259
• /
• 2010

In this paper, we propose a low-complexity carrier frequency offset (CFO) estimation algorithm for OFDM based wireless LAN, IEEE 802.11a. The complexity of the arctangent operation to calculate the argument of auto-correlation for CFO estimation is reduced by a novel range pointer method. The proposed algorithm estimates fine CFO value first and then based on the fine CFO value, simple criteria is used for the boundary decision of integer CFO estimation. The simulation results show that the performance of the proposed algorithm is slightly better than the conventional method while the computational complexity is reduced by 50%. Furthermore, the proposed method can be easily implemented for the low complex next generation MIMO-OFDM based WLAN systems.

• Journal of Digital Convergence
• /
• 제12권11호
• /
• pp.309-316
• /
• 2014

In this paper, we propose an efficient detph map creation method using Graph Cut and Discrete Wavelet Transform. First, we have segmented the original image by using Graph Cut to process with its each areas. After that, the information which describes segmented areas of original image have been created by proposed labeling method for segmented areas. And then, we have created four subbands which contain the original image's frequency information. Finally, the depth map have been created by frequency map which made with HH, HL subbands and depth information calculation along the each segmented areas. The proposed method can perform efficient depth map creation process because of dynamic allocation using depth information. We also have tested the proposed method using PSNR(Peak Signal to Noise Ratio) method to evaluate ours.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• 제46권1호
• /
• pp.10-21
• /
• 2009

In order to enhance the contrast in the regions where the pixels have similar intensities, this paper presents a new histogram equalization scheme. Conventional global equalization schemes over-equalizes those regions so that too bright or dark pixels are resulted and local equalization schemes produce unexpected discontinuities at the boundaries of the blocks. The proposed algorithm segments the original histogram into sub-histograms with reference to brightness level and equalizes each sub-histogram with the limited extents of equalization considering its mean and variance. The final image is determined as the weighted sum of the equalized images obtained by using the sub-histogram equalizations. By limiting the maximum and minimum ranges of equalization operations on individual sub-histograms, the over-equalization effect is eliminated. Also the result image does not miss feature information in low density histogram region since the remaining these area is applied separating equalization. This paper includes how to determine the segmentation points in the histogram. The proposed algorithm has been tested with more than 100 images having various contrast in the images and the results are compared to the conventional approaches to show its superiority.

• Journal of Korea Spatial Information System Society
• /
• 제9권1호
• /
• pp.31-43
• /
• 2007

Sensor data have the characteristics such as numerous and continuous data. Therefore, it is required to develop an index which could retrieve a specific sensor data efficiently from numerous sensed data. The index should have an efficient delete operation for the past data to support the data archiving. In this paper, we have proposed and implemented an index splitting technique to support the sensor data archiving. These splitted indexes compose of a virtual index (that is, index management component), which is shown as single tree from outside. Experimental results show that in the case of 100,000 insert operations the splitted index performs 8% better than the traditional TB-tree maximumly. And the splitted index outperforms TB-tree with retrieving queries when the region of query is small and the size of time domain is large.