• Title/Summary/Keyword: 형태학 영역기반 분할

Search Result 23, Processing Time 0.043 seconds

A Color Image Segmentation Algorithm based on Region Merging using Hue Differences (색상 차를 이용하는 영역 병합에 기반한 칼라영상 분할 알고리즘)

  • 박영식
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.40 no.1
    • /
    • pp.63-71
    • /
    • 2003
  • This paper describes a color image segmentation algorithm based on region merging using hue difference as a restrictive condition. The proposed algorithm using mathematical morphology and a modified watershed algorithm does over-segmentation in the RGB space to preserve contour information of regions. Then, the segmentation result of color image is acquired by repeated region merging using hue differences as a restrictive condition. This stems from human visual system based on hue, saturation, and intensity. Hue difference between two regions is used as a restrictive condition for region merging because it becomes more important factor than color difference if intensity is not low. Simulation results show that the proposed color image segmentation algorithm provides efficient segmentation results with the predefined number of regions for various color images.

Moving Object Segmentation Using Spatio-temporal Entropic Thresholding (시공간 엔트로피 임계법을 이용한 형태학적 이동 객체 분할)

  • 백경환;신민수;곽노윤
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2003.05b
    • /
    • pp.410-414
    • /
    • 2003
  • 본 논문은 비디오 시퀀스에 카메라 패닝 보상과 2차원 시공간 엔트로피 임계법을 적용하여 추출한 객체포함영역을 대상으로 영상 분할을 수행하는 이동 객체 분할 기법에 관한 것이다. 우선, 웨이블렛 변환에 의해 구성한 피라미드 계층 구조상에서 카메라 패닝 벡터를 추정하여 전역 움직임을 보상한다. 이후, 전역 움직임이 보상된 기준영상을 대상으로 각 프레임간에서 2차원 시공간 엔트로피 임계법을 적용하여 이동 객체가 포함될 가능성이 있는 영역을 블록 단위로 추출한다. 다음으로, 2차원 시공간 엔트로피 입계법에 의해 분류된 영역을 토대로 각 블록을 움직임블록, 준 움직임 블록, 비 움직임 블록 중 어느 하나로 분류한 검색 테이블을 작성한다. 이어서, 검색 테이블을 참조하여 초기 탐색 계층 및 탐색 영역을 적응적으로 선정함으로써 피라미드 계층 구조상에서 효율적인 고속 움직임 추정을 수행하여 이동 객체에 해당하는 객체포함영역만을 추출한다. 최종적으로, 이렇게 추출된 객체포함영역에서 임계 기울기 영상을 정의한 후, 이를 기준 삼아 객체포함영역에 화소 단위의 형태학 기반 영상 분할 알고리즘을 적용함으로써 비디오 시퀀스에 포함된 이동 객체를 분할한다. 컴퓨터 시뮬레이션 결과를 통해 고찰할 때, 제안된 방법은 이동 객체에 대한 상대적으로 우수한 분할 특성을 제공할 수 있고, 특히 저대조 경계면의 분할 특성을 제고시키고 있음을 확인할 수 있다.

  • PDF

Block-based Color Image Segmentation Using HSV Color Space. (HSV 칼라를 이용한 블록단위 영상 분할)

  • 서동하;임재혁;원치선
    • Proceedings of the IEEK Conference
    • /
    • 2000.09a
    • /
    • pp.651-654
    • /
    • 2000
  • 본 논문에서는 칼라 영역으로 확장된 블록단위 영상분할 알고리듬을 제안한다. 즉, 기존의 휘도 성분을 기반으로 한 블록단위 알고리듬을 HSV 칼라 성분을 기반으로 하는 칼라 영상분할로 확장한다. 기존의 수학적 형태학(mathematical morphology)에 기반한 영상분할기법이나 블록단위 영상분할 기법들이 밝기 정보만을 활용했던 것에 대해 제안된 블록단위 영상분할 기법은 밝기뿐만이 아니라 칼라 성분도 고려하여 영상분할의 정확도를 향상시켰다. 실험의 결과 휘도 성분만을 고려한 영상분할 결과 보다 칼라 성분을 사용한 영상분할의 결과가 더 정확함을 알 수 있었다.

  • PDF

Color Image Segmentation Using Characteristics of Human Visual System (인간 시각 시스템의 특성을 이용한 칼라 영상 분할)

  • 박영식
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2002.05c
    • /
    • pp.272-276
    • /
    • 2002
  • 본 논문은 영역을 병합할 때 두 영역의 색상 차를 영역 병합의 제한 조건으로 사용하는 칼라 영상 분할 기법을 제안하였다. 이는 먼저 영역의 경계선 정보를 잘 보존하기 위해서 RGB 공간상에서 수리형태학 필터와 변형된 워터쉐드 알고리즘을 이용하여 칼라 영상을 과분할 한다. 그리고 영역 간의 색상 차를 제한 조건으로 사용하는 영역 병합 과정을 반복 수행하여 칼라 영상의 분할 결과를 얻는다. 이는 인간 시각 시스템이 색상, 채도, 명도의 형태로 색을 구분하는 것을 기반으로 한다. 명도가 낮지 않는 경우에 색차 보다 색상 차가 중요한 요소로 작용하기 때문에 이를 영역 병합의 제한 조건으로 사용한다. 실험결과에서 제안된 칼라 영상 분할 기법은 다양한 칼라 영상에 대하여 적은 개수의 영역으로 동일한 색상을 가지는 영역의 경계선을 유지하는 효율적인 분할을 보임을 확인하였다.

  • PDF

Image Segmentation Using Mathematical Morphology (수리형태학을 이용한 영상 분할)

  • Cho Sun-gil;Kang Hyunchul
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.11C
    • /
    • pp.1076-1082
    • /
    • 2005
  • Recently, there have been much efforts in the image segmentation using morphological approach. Among them, the watershed algorithm is one of powerful tools which can take advantages of both of the conventional edge-based segmentation and region-based segmentation. The concept of watershed is based on topographic analogy. But, its high sensitivity to noise yields a very large number of resulting segmented regions which leads to oversegmentation. So we suggest the restricted waterfall algorithm which reduce the oversegmentation by eliminate not only local minima but also local maxima. As a result, the restricted waterfall algorithm has a good segmented image than the other methods, and has a better binary image than the histogram thresholding method.

Image Segmentation Using A Combined Segmentation Measure for Region-Based Coding (영역 기반 부호화를 위한 결합 분할 척도를 이용한 영상 분할)

  • Song, Kun-Woen;Kim, Kyeong-Man;Min, Gak;Lee, Chae-Soo;Nam, Jae-Yeal;Ha, Yeong-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.38 no.5
    • /
    • pp.518-528
    • /
    • 2001
  • In this paper, we firstly define a new combined segmentation measure and propose a segmentation algorithm using this measure. The combined segmentation measure is a weighted sum of intensity, motion, and a change segmentation measure that is extracted from the resulting image of the proposed change detector. The change segmentation measure is defined as an absolute change value difference between an pixel and its neighboring region from the eroded image, which results from morphological erosion filtering to eliminate many inaccurate components included in the resulting image of a conventional change detector. The change segmentation measure can be used as an efficient segmentation measure for the accurate segmentation of neighboring moving objects and static background regions. Therefore, the proposed combined segmentation measure can determine exact boundaries in the segmentation process of region-based coding even though the estimated motion vectors around the boundaries of moving objects and static background regions are inaccurate and the intensities around the boundaries are similar.

  • PDF

The Algorithm of Protein Spots Segmentation using Watersheds-based Hierarchical Threshold (Watersheds 기반 계층적 이진화를 이용한 단백질 반점 분할 알고리즘)

  • Kim Youngho;Kim JungJa;Kim Daehyun;Won Yonggwan
    • The KIPS Transactions:PartB
    • /
    • v.12B no.3 s.99
    • /
    • pp.239-246
    • /
    • 2005
  • Biologist must have to do 2DGE biological experiment for Protein Search and Analysis. This experiment coming into being 2 dimensional image. 2DGE (2D Gel Electrophoresis : two dimensional gel electrophoresis) image is the most widely used method for isolating of the objective protein by comparative analysis of the protein spot pattern in the gel plane. The process of protein spot analysis, firstly segment protein spots that are spread in 2D gel plane by image processing and can find important protein spots through comparative analysis with protein pattern of contrast group. In the algorithm which detect protein spots, previous 2DGE image analysis is applies gaussian fitting, however recently Watersheds region based segmentation algorithm, which is based on morphological segmentation is applied. Watersheds has the benefit that segment rapidly needed field in big sized image, however has under-segmentation and over-segmentation of spot area when gray level is continuous. The drawback was somewhat solved by marker point institution, but needs the split and merge process. This paper introduces a novel marker search of protein spots by watersheds-based hierarchical threshold, which can resolve the problem of marker-driven watersheds.

Region-based Canopy Cover Mapping Using Airborne Lidar Data (항공 라이다 자료를 이용한 영역 기반 차폐율 지도 제작)

  • Kim, Yong-Min;Eo, Yang-Dam;Jeon, Min-Cheol;Kim, Hyung-Tae;Kim, Chang-Jae
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.19 no.1
    • /
    • pp.29-36
    • /
    • 2011
  • The main purpose of this paper is to make a map showing canopy cover by using airborne Lidar data based on region. Watershed algorithm was applied to elevation data to conduct segmentation, and then canopy cover was estimated through the regions extracted. In the process of transforming point data to raster, we solved the problems about overestimation and underestimation by using frequency method. Also, canopy cover map could be produced with various scales by differing level of segmentation and it provides more accurate and precise information than ones of ordinary public forest map.

Hierarchical Image Segmentation Based on HVS Characteristic for Region-Based Very Low Bit Rate Coding (영역기반 초저속 부호화를 위한 인간 시각 체계에 기반한 계층적 영상 분할)

  • Song, Kun-Woen;Park, Young-Sik;Han, Kyu-Phil;Nam, Jae-Yeal;Ha, Yeong-Ho
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.1
    • /
    • pp.70-80
    • /
    • 1999
  • In this paper, a new hierarchical image segmentation algorithm based on human visual system(HVS) characteristic is proposed which can efficiently reduce and control transmission information quantity without the degradation of the subjective and objective image quality. It consists of image segmentation based on mathematical morphology and region merging considering HVS characteristic for the pairs of two adjacent regions at each level of the hierarchy. Image segmentation is composed of 3-level hierarchical structure. In the region merging structure of each level, we extract the pairs of two adjacent regions which human vision can't discriminate, and then merge them. The proposed region merging method extracts pairs of two neighbor regions to be merged and performs region merging according to merging priority based on HVS characteristics. The merging priority for each adjacent pair is determined by the proposed merging priority function(MPF). First of all, the highest priority pair is merged. The information control factor is used to regulate the transmission information at each level. The proposed segmentation algorithm can efficiently improve bottleneck problem caused by excessive contour information at region-based very low bit rate coding. And it shows that it is more flexible structure than that of conventional method. In experimental results, though PSNR and the subjective image quality by the proposed algorithm is similar to that of conventional method, the contour information quantity to be transmitted is reduced considerably. Therefore it is an efficient image segmentation algorithm for region-based very low bit rate coding.

  • PDF

Image Segmentation Using Block Classification and Watershed Algorithm (블록분류와 워터쉐드를 이용한 영상분할 알고리듬)

  • Lim, Jae-Hyuck;Park, Dong-Kwon;Won, Chee-Sun
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.1
    • /
    • pp.81-92
    • /
    • 1999
  • In this paper, we propose a new image segmentation algorithm which can be use din object-based image coding applications such as MPGA-4. Since the conventional objet segmentation methods based on mathematical morphology tend to yield oversegmented results, they normally need a postprocess which merges small regions to obtain a larger one. To solve this oversegmentation problem, in this paper, we prosed a block-based segmentation algorithm that can identify large texture regions in the image. Also, by applying the watershed algorithm to the image blocks between the homogeneous regions, we can obtain the exact pixel-based contour. Experimental results show that the proposed algorithm yields larger segments, particularly in the textural area, and reduces the computational complexities.

  • PDF