• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2000.08a
• /
• pp.193-196
• /
• 2000

최근 컴퓨터를 이용한 CAD 디자인 시스템이 날염디자인제도(textile printing design trace)에 널리 사용되고 있다 CAD를 이용한 날염디자인은 기존의 수작업에 비해 공정을 간편하게 하고, 상당히 많은 시간과 경비의 단축을 가능하게 하였다. 그러나 CAD를 이용한 날염디자인제도 역시 상당부분 숙련자들의 수작업을 요구하고 있다. 본 논문에서는 날염디자인제도에서의 컬러 분할 전처리 과정으로 원 이미지를 저주파 통과 필터링하고 컬러분할을 수행하였다. 이렇게 분할된 이미지의 윤곽선을 추출하고 스플라인(Spline)기법을 사용, 더 부드럽고 완만한 곡선을 생성하도록 하였다. 모든 과정은 Matlab을 사용하여 구현하였으며 분할된 이미지를 날염제도공정으로의 적용 가능성에 대해 검토하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.175-177
• /
• 2004

최근, 이미지 검색기법에서는 객체추출 방법이나 관심영역 추출방법에 관한 연구가 활발히 이루어지고 있다. 그러나, 컬러 이미지의 경우 색상을 고려한 관심영역 특징추출 방법이나 인덱스 기법은 많이 연구되지 못하고 있다. 따라서, 본 논문에서는 컬러 이미지의 색상을 기반으로 하는 사분트리 분할 인덱스 기법을 제안한다. 사분트리 분할 인덱스 구조는 컬러 이미지의 공간 영역을 계층적인 영역으로 분할하여 각 공간 영역의 평균 색상 갓을 데이터베이스에 저장한다 저장되어진 각 영역의 평균 색상은 검색의 효율성을 높이기 위해 사분트리 인스턴스(Quad-tree distance)를 퍼지 값으로 계산하여 인덱스를 생성한다. 생성된 사분트리 분할 인덱스는 컬러 이미지의 관심영역(Region of Interest)의 색상을 검색할 때 유용하게 사용되며. 검색속도의 향상에 도움을 준다.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.271-274
• /
• 2001

미국의 National Library of Medicine에서 제공하는 Visible human 컬러영상을 이용하여, 신체 장기의 3차원 모델링 및 가시화 하기 위한 영역 분할 방법 연구가 활발히 진행되고 있다. 특히 다른 신체 장기 분할에 비해 뼈분할은 주위의 영역들과 모호한 경계를 지니고 있어 컬러영상만을 가지고 구분해 내기가 쉽지 않다. 이러한 문제점을 해결하기 위해 본 논문에서는 Visible human CT영상을 가지고 뼈 영역을 분할하고 분할 된 뼈 영역의 경계를 추출하여 그 경계를 컬러영상의 최적화된 위치로 변환해 최종적인 뼈 영역 분할을 시도한다. 제안된 방법은 Visible human 단면영상의 머리부분에 적용하여 좋은 결과를 얻음을 실험을 통해 효율성을 검증하였다.

• Journal of Korea Multimedia Society
• /
• v.3 no.5
• /
• pp.470-478
• /
• 2000

Color images from various application areas have their own characteristics. Practical segmentation systems need specialized methods to death with the characteristics. In this paper. we propose a distributed genetic algorithm based segmentation method for color breast carcinoma cell images. To extract positive nuclei and negative nuclei from the cell images, a distributed genetic algorithm with improved genetic operations and an evaluation function is used. As initial values, representative colors from images are introduced to work well with the cell images. A test to verify the validity of the proposed method shows well-segmented images. This result suggests that the method is pertinent to be but into practical use for the images haying limited objects with limited colors.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.11
• /
• pp.529-536
• /
• 2015

When rendering both three-dimensional objects and photo images together, the non-photorealistic rendering results are in visual discord since the two contents have their own independent color distributions. This paper proposes a non-photorealistic rendering technique which renders both three-dimensional objects and photo images such as cartoons and sketches. The proposed technique computes the color distribution property of the photo images and reduces the number of colors of both photo images and 3D objects. NPR is performed based on the reduced colormaps and edge features. To enhance the natural scene presentation, the image region segmentation process is preferred when extracting and applying colormaps. However, the image segmentation technique needs a lot of computational operations. It takes a long time for non-photorealistic rendering for large size frames. To speed up the time-consuming segmentation procedure, we use GPGPU for the parallel computing using the GPU. As a result, we significantly improve the execution speed of the algorithm.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.3
• /
• pp.99-105
• /
• 2011

In this paper, we proposed a method for estimating an accurate gamut based on segment maxima method. According to the number of segments in the segment maxima, a local concavity is generated in the vicinity of lightness axis or a gamut is reduced in high chroma region. It induces artifacts or deterioration of the image quality. To remove these artifacts, the number of segment is determined according to the number of samples. and a local concavity is modified by extending a detected concave point to the line connecting two adjacent boundary points. Experimental results show that the contours in a uniform color region and speckle artifacts from the conventional segment maxima algorithm are removed.

• Journal of Broadcast Engineering
• /
• v.18 no.6
• /
• pp.935-938
• /
• 2013

In this letter, we propose a method for colorization based coding, which divides the colorization matrix into smaller sub-matrices using the meanshift segmentation. Using the proposed method the computation speed becomes more than 30 times faster. Furthermore, the smearing artifact, which appears in conventional colorization based compression method, is greatly reduced.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.3 s.303
• /
• pp.7-14
• /
• 2005

In this paper we proposed the block-based color image segmentation method using the cylindrical metric to solve the problems such as long processing time and over segmentation due to noise and texture properties in the conventional methods. In the proposed method we define the new similarity function and the merge condition between regions to merge initial regions with the same size considering the color and texture properties of chromatic and achromatic regions which is defined according to the HSI color values, and we continue to merge boundary blocks into the adjacent region already segmented to maintain edges until the size of block is one. In the simulation results the proposed method is better than the conventional methods in the evaluation of the segmented regions of texture and edge region, and we found that the processing time is decreased by factor of two in the proposed method.

• The Journal of the Korea Contents Association
• /
• v.6 no.9
• /
• pp.19-27
• /
• 2006

Mean shift procedure is applied for the data points in the joint spatial-range domain and achieves a high quality. However, a color image is segmented differently according to the inputted spatial parameter or range parameter and the demerit is that the image is broken into many small regions in case of the small parameter. In this paper, to improve this demerit, we propose the method that groups similar regions using region merging method for over-segmented images. The proposed method converts a over-segmented image in RGB color space into in HSI color space and merges similar regions by hue information. Here, to preserve edge information, the region merge constraints are used to decide whether regions are merged or not. After then, we merge the regions in RGB color space for non-processed regions in HSI color space. Experimental results show the superiority in region's segmentation results.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.10
• /
• pp.83-92
• /
• 2009

In this paper, an extended snake algorithm using color variance energy is proposed for segmenting an interest object in color image. General snake algorithm makes use of energy in image to segment images into a interesting area and background. There are many kinds of energy that can be used by the snake algorithm. The efficiency of the snake algorithm is depend on what kind of energy is used. A general snake algorithm based on active contour model uses the intensity value as an image energy that can be implemented and analyzed easily. But it is sensitive to noises because the image gradient uses a differential operator to get its image energy. And it is difficult for the general snake algorithm to be applied on the complex image background. Therefore, the proposed snake algorithm efficiently segment an interest object on the color image by adding a color variance of the segmented area to the image energy. This paper executed various experiments to segment an interest object on color images with simple or complex background for verifying the performance of the proposed extended snake algorithm. It shows improved accuracy performance about 12.42 %.