• Title/Summary/Keyword: graph-based segmentation

Search Result 65, Processing Time 0.023 seconds

A Multiresolution Image Segmentation Method using Stabilized Inverse Diffusion Equation (안정화된 역 확산 방정식을 사용한 다중해상도 영상 분할 기법)

  • Lee Woong-Hee;Kim Tae-Hee;Jeong Dong-Seok
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.41 no.1
    • /
    • pp.38-46
    • /
    • 2004
  • Image segmentation is the task which partitions the image into meaningful regions and considered to be one of the most important steps in computer vision and image processing. Image segmentation is also widely used in object-based video compression such as MPEG-4 to extract out the object regions from the given frame. Watershed algorithm is frequently used to obtain the more accurate region boundaries. But, it is well known that the watershed algorithm is extremely sensitive to gradient noise and usually results in oversegmentation. To solve such a problem, we propose an image segmentation method which is robust to noise by using stabilized inverse diffusion equation (SIDE) and is more efficient in segmentation by employing multiresolution approach. In this paper, we apply both the region projection method using labels of adjacent regions and the region merging method based on region adjacency graph (RAG). Experimental results on noisy image show that the oversegmenation is reduced and segmentation efficiency is increased.

Automatic Clustering on Trained Self-organizing Feature Maps via Graph Cuts (그래프 컷을 이용한 학습된 자기 조직화 맵의 자동 군집화)

  • Park, An-Jin;Jung, Kee-Chul
    • Journal of KIISE:Software and Applications
    • /
    • v.35 no.9
    • /
    • pp.572-587
    • /
    • 2008
  • The Self-organizing Feature Map(SOFM) that is one of unsupervised neural networks is a very powerful tool for data clustering and visualization in high-dimensional data sets. Although the SOFM has been applied in many engineering problems, it needs to cluster similar weights into one class on the trained SOFM as a post-processing, which is manually performed in many cases. The traditional clustering algorithms, such as t-means, on the trained SOFM however do not yield satisfactory results, especially when clusters have arbitrary shapes. This paper proposes automatic clustering on trained SOFM, which can deal with arbitrary cluster shapes and be globally optimized by graph cuts. When using the graph cuts, the graph must have two additional vertices, called terminals, and weights between the terminals and vertices of the graph are generally set based on data manually obtained by users. The Proposed method automatically sets the weights based on mode-seeking on a distance matrix. Experimental results demonstrated the effectiveness of the proposed method in texture segmentation. In the experimental results, the proposed method improved precision rates compared with previous traditional clustering algorithm, as the method can deal with arbitrary cluster shapes based on the graph-theoretic clustering.

Unconstrained Object Segmentation Using GrabCut Based on Automatic Generation of Initial Boundary

  • Na, In-Seop;Oh, Kang-Han;Kim, Soo-Hyung
    • International Journal of Contents
    • /
    • v.9 no.1
    • /
    • pp.6-10
    • /
    • 2013
  • Foreground estimation in object segmentation has been an important issue for last few decades. In this paper we propose a GrabCut based automatic foreground estimation method using block clustering. GrabCut is one of popular algorithms for image segmentation in 2D image. However GrabCut is semi-automatic algorithm. So it requires the user input a rough boundary for foreground and background. Typically, the user draws a rectangle around the object of interest manually. The goal of proposed method is to generate an initial rectangle automatically. In order to create initial rectangle, we use Gabor filter and Saliency map and then we use 4 features (amount of area, variance, amount of class with boundary area, amount of class with saliency map) to categorize foreground and background. From the experimental results, our proposed algorithm can achieve satisfactory accuracy in object segmentation without any prior information by the user.

Region Growing Segmentation with Directional Features

  • Lee, Sang-Hoon
    • Korean Journal of Remote Sensing
    • /
    • v.26 no.6
    • /
    • pp.731-740
    • /
    • 2010
  • A region merging technique is suggested in this paper for the segmentation of high-spatial resolution imagery. It employs a region growing scheme based on the region adjacency graph (RAG). The proposed algorithm uses directional neighbor-line average feature vectors to improve the quality of segmentation. The feature vector consists of 9 components which includes an observation and 8 directional averages. Each directional average is the average of the pixel values along the neighbor line for a given neighbor line length at each direction. The merging coefficients of the segmentation process use a part of the feature components according to a given merging coefficient order. This study performed the extensive experiments using simulation data and a real high-spatial resolution data of IKONOS. The experimental results show that the new approach proposed in this study is quite effective to provide segments of high quality for the object-based analysis of high-spatial resolution images.

A Study on Video Object Segmentation using Nonlinear Multiscale Filtering (비선형 다중스케일 필터링을 사용한 비디오 객체 분할에 관한 연구)

  • 이웅희;김태희;이규동;정동석
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.10C
    • /
    • pp.1023-1032
    • /
    • 2003
  • Object-based coding, such as MPEG-4, enables various content-based functionalities for multimedia applications. In order to support such functionalities, as well as to improve coding efficiency, each frame of video sequences should be segmented into video objects. In this paper. we propose an effective video object segmentation method using nonlinear multiscale filtering and spatio-temporal information. Proposed method performs a spatial segmentation using a nonlinear multiscale filtering based on the stabilized inverse diffusion equation(SIDE). And, the segmented regions are merged using region adjacency graph(RAG). In this paper, we use a statistical significance test and a time-variant memory as temporal segmentation methods. By combining of extracted spatial and temporal segmentations, we can segment the video objects effectively. Proposed method is more robust to noise than the existing watershed algorithm. Experimental result shows that the proposed method improves a boundary accuracy ratio by 43% on "Akiyo" and by 29% on "Claire" than A. Neri's Method does.

Extraction of Tongue Region using Graph and Geometric Information (그래프 및 기하 정보를 이용한 설진 영역 추출)

  • Kim, Keun-Ho;Lee, Jeon;Choi, Eun-Ji;Ryu, Hyun-Hee;Kim, Jong-Yeol
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.56 no.11
    • /
    • pp.2051-2057
    • /
    • 2007
  • In Oriental medicine, the status of a tongue is the important indicator to diagnose one's health like physiological and clinicopathological changes of inner parts of the body. The method of tongue diagnosis is not only convenient but also non-invasive and widely used in Oriental medicine. However, tongue diagnosis is affected by examination circumstances a lot like a light source, patient's posture and doctor's condition. To develop an automatic tongue diagnosis system for an objective and standardized diagnosis, segmenting a tongue is inevitable but difficult since the colors of a tongue, lips and skin in a mouth are similar. The proposed method includes preprocessing, graph-based over-segmentation, detecting positions with a local minimum over shading, detecting edge with color difference and estimating edge geometry from the probable structure of a tongue, where preprocessing performs down-sampling to reduce computation time, histogram equalization and edge enhancement. A tongue was segmented from a face image with a tongue from a digital tongue diagnosis system by the proposed method. According to three oriental medical doctors' evaluation, it produced the segmented region to include effective information and exclude a non-tongue region. It can be used to make an objective and standardized diagnosis.

AUTOMATIC IMAGE SEGMENTATION OF HIGH RESOLUTION REMOTE SENSING DATA BY COMBINING REGION AND EDGE INFORMATION

  • Byun, Young-Gi;Kim, Yong-II
    • Proceedings of the KSRS Conference
    • /
    • 2008.10a
    • /
    • pp.72-75
    • /
    • 2008
  • Image segmentation techniques becoming increasingly important in the field of remote sensing image analysis in areas such as object oriented image classification. This paper presents a new method for image segmentation in High Resolution Remote Sensing Image based on Seeded Region Growing (SRG) and Edge Information. Firstly, multi-spectral edge detection was done using an entropy operator in pan-sharpened QuickBird imagery. Then, the initial seeds were automatically selected from the obtained edge map. After automatic selection of significant seeds, an initial segmentation was achieved by applying SRG. Finally the region merging process, using region adjacency graph (RAG), was carried out to get the final segmentation result. Experimental results demonstrated that the proposed method has good potential for application in the segmentation of high resolution satellite images.

  • PDF

Estimation of the Medium Transmission Using Graph-based Image Segmentation and Visibility Restoration (그래프 기반 영역 분할 방법을 이용한 매체 전달량 계산과 가시성 복원)

  • Kim, Sang-Kyoon;Park, Jong-Hyun;Park, Soon-Young
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.4
    • /
    • pp.163-170
    • /
    • 2013
  • In general, images of outdoor scenes often contain degradation due to dust, water drop, haze, fog, smoke and so on, as a result they cause the contrast reduction and color fading. Haze removal is not easier problem due to the inherent ambiguity between the haze and the underlying scene. So, we propose a novel method to solve single scene dehazing problem using the region segmentation based on graph algorithm that has used a gradient value as a cost function. We segment the scene into different regions according to depth-related information and then estimate the global atmospheric light. The medium transmission can be directly estimated by the threshold function of graph-based segmentation algorithm. After estimating the medium transmission, we can restore the haze-free scene. We evaluated the degree of the visibility restoration between the proposed method and the existing methods by calculating the gradient of the edge between the restored scene and the original scene. Results on a variety of outdoor haze scene demonstrated the powerful haze removal and enhanced image quality of the proposed method.

Hair Classification and Region Segmentation by Location Distribution and Graph Cutting (위치 분포 및 그래프 절단에 의한 모발 분류와 영역 분할)

  • Kim, Yong-Gil;Moon, Kyung-Il
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.3
    • /
    • pp.1-8
    • /
    • 2022
  • Recently, Google MedeiaPipe presents a novel approach for neural network-based hair segmentation from a single camera input specifically designed for real-time, mobile application. Though neural network related to hair segmentation is relatively small size, it produces a high-quality hair segmentation mask that is well suited for AR effects such as a realistic hair recoloring. However, it has undesirable segmentation effects according to hair styles or in case of containing noises and holes. In this study, the energy function of the test image is constructed according to the estimated prior distributions of hair location and hair color likelihood function. It is further optimized according to graph cuts algorithm and initial hair region is obtained. Finally, clustering algorithm and image post-processing techniques are applied to the initial hair region so that the final hair region can be segmented precisely. The proposed method is applied to MediaPipe hair segmentation pipeline.

Efficient Classification of High Resolution Imagery for Urban Area

  • Lee, Sang-Hoon
    • Korean Journal of Remote Sensing
    • /
    • v.27 no.6
    • /
    • pp.717-728
    • /
    • 2011
  • An efficient method for the unsupervised classification of high resolution imagery is suggested in this paper. It employs pixel-linking and merging based on the adjacency graph. The proposed algorithm uses the neighbor lines of 8 directions to include information in spatial proximity. Two approaches are suggested to employ neighbor lines in the linking. One is to compute the dissimilarity measure for the pixel-linking using information from the best lines with the smallest non. The other is to select the best directions for the dissimilarity measure by comparing the non-homogeneity of each line in the same direction of two adjacent pixels. The resultant partition of pixel-linking is segmented and classified by the merging based on the regional and spectral adjacency graphs. This study performed extensive experiments using simulation data and a real high resolution data of IKONOS. The experimental results show that the new approach proposed in this study is quite effective to provide segments of high quality for object-based analysis and proper land-cover map for high resolution imagery of urban area.