• International Journal of Internet, Broadcasting and Communication
• /
• 제11권1호
• /
• pp.39-46
• /
• 2019

This paper proposes an adaptive threshold watershed algorithm, which is the method used for image segmentation and boundary detection, which extends the region on the basis of regional minimum point. First, apply adaptive thresholds to determine regional minimum points. Second, it extends the region by applying adaptive thresholds based on determined regional minimum points. Traditional watershed algorithms create over-segmentation, resulting in the disadvantages of breaking boundaries between regions. These segmentation results mainly from the boundary of the object, creating an inaccurate region. To solve these problems, this paper applies an improved watershed algorithm applied with adaptive threshold in regional minimum point search and region expansion in order to reduce over-segmentation and breaking the boundary of region. This resulted in over-segmentation suppression and the result of having the boundary of precisely divided regions. The experimental results show that the proposed algorithm can apply adaptive thresholds to reduce the number of segmented regions and see that the segmented boundary parts are correct.

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

In this paper, a neural network based approach using a self-organizing feature map is proposed for the segmentation of X ray images. A number of algorithms based on such approaches as histogram analysis, region growing, edge detection and pixel classification have been proposed for segmentation of general images. However, few approaches have been applied to X ray image segmentation because of blur of the X ray image and vagueness of its edge, which are inherent properties of X ray images. To this end, we develop a new model based on the neural network to detect objects in a given X ray image. The new model utilizes Mumford-Shah functional incorporating with a modified adaptive SOFM. Although Mumford-Shah model is an active contour model not based on the gradient of the image for finding edges in image, it has some limitation to accurately represent object images. To avoid this criticism, we utilize an adaptive self organizing feature map developed earlier by the authors.[1] It's learning rule is derived from Mumford-Shah energy function and the boundary of blurred and vague X ray image. The evolution of the neural network is shown to well segment and represent. To demonstrate the performance of the proposed method, segmentation of an industrial part is solved and the experimental results are discussed in detail.

• Journal of Information Processing Systems
• /
• 제16권6호
• /
• pp.1424-1436
• /
• 2020

Although huge progress has been made in current image segmentation work, there are still no efficient segmentation strategies for tree image which is taken from natural environment and contains complex background. To improve those problems, we propose a method for tree image segmentation combining adaptive mean shifting with image abstraction. Our approach perform better than others because it focuses mainly on the background of image and characteristics of the tree itself. First, we abstract the original tree image using bilateral filtering and image pyramid from multiple perspectives, which can reduce the influence of the background and tree canopy gaps on clustering. Spatial location and gray scale features are obtained by step detection and the insertion rule method, respectively. Bandwidths calculated by spatial location and gray scale features are then used to determine the size of the Gaussian kernel function and in the mean shift clustering. Furthermore, the flood fill method is employed to fill the results of clustering and highlight the region of interest. To prove the effectiveness of tree image abstractions on image clustering, we compared different abstraction levels and achieved the optimal clustering results. For our algorithm, the average segmentation accuracy (SA), over-segmentation rate (OR), and under-segmentation rate (UR) of the crown are 91.21%, 3.54%, and 9.85%, respectively. The average values of the trunk are 92.78%, 8.16%, and 7.93%, respectively. Comparing the results of our method experimentally with other popular tree image segmentation methods, our segmentation method get rid of human interaction and shows higher SA. Meanwhile, this work shows a promising application prospect on visual reconstruction and factors measurement of tree.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권9호
• /
• pp.4375-4388
• /
• 2018

To solve the problem of transmission errors in stereoscopic images, this paper proposes a novel error concealment (EC) method using superpixel segmentation and adaptive disparity selection (SSADS). Our algorithm consists of two steps. The first step is disparity estimation for each pixel in a reference image. In this step, the numbers of superpixel segmentation labels of stereoscopic images are used as a new constraint for disparity matching to reduce the effect of mismatching. The second step is disparity selection for a lost block. In this step, a strategy based on boundary smoothness is proposed to adaptively select the optimal disparity which is used for error concealment. Experimental results demonstrate that compared with other methods, the proposed method has significant advantages in both objective and subjective quality assessment.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2004년도 추계학술발표논문집(상)
• /
• pp.891-894
• /
• 2004

This paper proposes an improved image segmentation algorithm by the watershed algorithm based on the local adaptive threshold on local minima search and the fixing threshold on label allocation. The previous watershed algorithm generates the problem of over-segmentation. The over-segmentation makes the boundary in the inaccuracy region by occurring around the object. In order to solve those problems we quantize the input color image by the vector quantization, remove noise and find the gradient image. We sorted local minima applying the local adaptive threshold on local minima search of the input color image. The simulation results show that the proposed algorithm controls over-segmentation and makes the fine boundary around segmented region applying the fixing threshold based on sorted local minima on label allocation.

• 한국멀티미디어학회논문지
• /
• 제17권5호
• /
• pp.547-555
• /
• 2014

This paper presents a method for hand segmentation using depth information, and adaptive threshold by means of histogram analysis and color clustering in HSV color model. We consider hand area as a nearer object to the camera than background on depth information. And the threshold of hand color is adaptively determined by clustering using the matching of color values on the input image with one of the regions of hue histogram. Experimental results demonstrate 95% accuracy rate. Thus, we confirmed that the proposed method is effective for hand segmentation in variations of hand color, scale, rotation, pose, different lightning conditions and any colored background.

• 한국HCI학회:학술대회논문집
• /
• 한국HCI학회 2009년도 학술대회
• /
• pp.193-196
• /
• 2009

단일 영상에서 피부색 영역을 추출하기 위해서 기존의 많은 방법들이 하나의 고정된 피부색 모델을 사용한다. 그러나 영상에 특성에 따라 영상에 포함된 피부색의 분포가 다양하기 때문에 이러한 방법을 이용하여 피부색을 검출할 경우 낮은 검출율이나 높은 긍정 오류율이 발생할 수 있다. 따라서 영상의 특징에 따라 적응적으로 피부색 영역을 추출할 수 있는 방법이 필요하다. 이에 본 논문에서는 영상의 특징에 따라 2단계의 과정을 거쳐 피부색 모델을 수정하는 방법으로, 다양한 조명과 환경 조건에서 높은 검출율과 낮은 긍정 오류율을 동시에 가지는 알고리즘을 제안한다.

• 정보처리학회논문지B
• /
• 제14B권2호
• /
• pp.99-106
• /
• 2007

본 논문에서는 적응적 관심영역(AAW: Adaptive Attention Window)에 기반한 세포영상 분할 기법을 제안한다. 적응적 관심영역은 분할하기 위해, 명암지도를 이용하여 초기 관심윈도우(IAW: Initial AW)를 생성한다. 생성된 초기 관심윈도우는 쿼드-트리 분할을 이용하여 실제의 관심영역(ROI: Region of Interest)과 유사한 크기가 될 때까지 축소된다. 이렇게 생성된 적응적 관심윈도우는 세포 영상에서 배경을 제거하고 관심영역 추출의 처리 시간을 줄이기 위해서 사용된다. 마지막으로 적응적 관심영역 안에서 영역을 분할하고, 관심영역만을 분리하기 위한 영역 병합과 제거를 수행한다. 실험에서 제안된 기법은 세포영상의 관심영역을 효과적으로 분리하여 인간 시각과 유사한 향상된 영상 분할 결과를 보여준다.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제12권1호
• /
• pp.36-41
• /
• 2012

We tested a single pendulum simulation and observed the influence of several situation space segmentation types in reinforcement learning processes in order to propose a new adaptive automation for situation space segmentation. Its segmentation is performed by the Contraction Algorithm and the Cell Division Approach. Also, its automation is performed by "entropy," which is defined on action values’ distributions. Simulation results were shown to demonstrate the influence and adaptability of the proposed method.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 추계종합학술대회 논문집
• /
• pp.525-528
• /
• 1999

Abstract - In this paper, a segmentation method for brain Magnetic Resonance(MR) image using region clustering technique with statistical distribution of gradient image and fuzzy rules is described. The brain MRI consists of gray matter and white matter, cerebrospinal fluid. But due to noise, overlap, vagueness, and various parameters, segmentation of MR image is a very difficult task. We use gradient information rather than intensity directly from the MR images and find appropriate thresholds for region classification using gradient approximation, rayleigh distribution function, region clustering, and merging techniques. And then, we propose the adaptive fuzzy rules in order to extract anatomical structures and diseases from brain MR image data. The experimental results shows that the proposed segmentation algorithm given better performance than traditional segmentation techniques.