• Title/Summary/Keyword: Edge-based segmentation

Search Result 229, Processing Time 0.025 seconds

Expert system for segmentation of 2.5-D image

  • Ahn, Hongyoung
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10b
    • /
    • pp.376-381
    • /
    • 1992
  • This paper presents an expert system for the segmentation of a 2.5-D image. The results of two segmentation approaches, edge-based and region-based, are combined to produce a consistent and reliable segmentation. Rich information embedded in the 2.5-D image is utilized to obtain a view independent surface patch description of the image, which can facilitate object recognition considerably.

  • PDF

Dynamic Scene Segmentation Algorithm Using a Cross Mask and Edge Information (Cross Mask와 에지 정보를 사용한 동영상 분할)

  • 강정숙;박래홍;이상욱
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.8
    • /
    • pp.1247-1256
    • /
    • 1989
  • In this paper, we propose the dynamic scene segmentation algorithm using a cross mask and edge information. This method, a combination of the conventioanl feature-based and pixel-based approaches, uses edges as features and determines moving pixels, with a cross mask centered on each edge pixel, by computing similarity measure between two consecutive image frames. With simple calcualtion the proposed method works well for image consisting of complex background or several moving objects. Also this method works satisfactorily in case of rotaitional motion.

  • PDF

Post-processing Algorithm Based on Edge Information to Improve the Accuracy of Semantic Image Segmentation (의미론적 영상 분할의 정확도 향상을 위한 에지 정보 기반 후처리 방법)

  • Kim, Jung-Hwan;Kim, Seon-Hyeok;Kim, Joo-heui;Choi, Hyung-Il
    • The Journal of the Korea Contents Association
    • /
    • v.21 no.3
    • /
    • pp.23-32
    • /
    • 2021
  • Semantic image segmentation technology in the field of computer vision is a technology that classifies an image by dividing it into pixels. This technique is also rapidly improving performance using a machine learning method, and a high possibility of utilizing information in units of pixels is drawing attention. However, this technology has been raised from the early days until recently for 'lack of detailed segmentation' problem. Since this problem was caused by increasing the size of the label map, it was expected that the label map could be improved by using the edge map of the original image with detailed edge information. Therefore, in this paper, we propose a post-processing algorithm that maintains semantic image segmentation based on learning, but modifies the resulting label map based on the edge map of the original image. After applying the algorithm to the existing method, when comparing similar applications before and after, approximately 1.74% pixels and 1.35% IoU (Intersection of Union) were applied, and when analyzing the results, the precise targeting fine segmentation function was improved.

Color Image Segmentation Based on Edge Salience Map and Region Merging (경계 중요도 맵 및 영역 병합에 기반한 칼라 영상 분할)

  • Kim, Sung-Young
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.3
    • /
    • pp.105-113
    • /
    • 2007
  • In this paper, an image segmentation method which is based on edge salience map and region merging is presented. The edge salience map is calculated by combining a texture edge map with a color edge map. The texture edge map is computed over multiple spatial orientations and frequencies by using Gabor filter. A color edge is computed over the H component of the HSI color model. Then the Watershed transformation technique is applied to the edge salience map to and homogeneous regions where the dissimilarity of color and texture distribution is relatively low. The Watershed transformation tends to over-segment images. To merge the over-segmented regions, first of all, morphological operation is applied to the edge salience map to enhance a contrast of it and also to find mark regions. Then the region characteristics, a Gabor texture vector and a mean color, in the segmented regions is defined and regions that have the similar characteristics, are merged. Experimental results have demonstrated the superiority in segmentation results for various images.

  • PDF

A Study On Watershed Region Extraction Based On Edge Information (에지 정보를 이용한 watershed 영역 추출에 관한 연구)

  • 이원효;조상현;설경호;주동현;김두영
    • Proceedings of the IEEK Conference
    • /
    • 2003.11a
    • /
    • pp.449-452
    • /
    • 2003
  • This paper propose a extracting method of the region for image using segmentation and edge information. First propose algorithm extract information using canny edge detector and the image was divided by watershed segmentation. And it extract the mage with edge information by merging region. Finally we compare the proposed method with levelset method. In the result proposed method not only extract the image with accurate region but also reduce operation time.

  • PDF

Linear Feature Extraction from Satellite Imagery using Discontinuity-Based Segmentation Algorithm

  • Niaraki, Abolghasem Sadeghi;Kim, Kye-Hyun;Shojaei, Asghar
    • Proceedings of the KSRS Conference
    • /
    • v.2
    • /
    • pp.643-646
    • /
    • 2006
  • This paper addresses the approach to extract linear features from satellite imagery using an efficient segmentation method. The extraction of linear features from satellite images has been the main concern of many scientists. There is a need to develop a more capable and cost effective method for the Iranian map revision tasks. The conventional approaches for producing, maintaining, and updating GIS map are time consuming and costly process. Hence, this research is intended to investigate how to obtain linear features from SPOT satellite imagery. This was accomplished using a discontinuity-based segmentation technique that encompasses four stages: low level bottom-up, middle level bottom-up, edge thinning and accuracy assessment. The first step is geometric correction and noise removal using suitable operator. The second step includes choosing the appropriate edge detection method, finding its proper threshold and designing the built-up image. The next step is implementing edge thinning method using mathematical morphology technique. Lastly, the geometric accuracy assessment task for feature extraction as well as an assessment for the built-up result has been carried out. Overall, this approach has been applied successfully for linear feature extraction from SPOT image.

  • PDF

FINE SEGMENTATION USING GEOMETRIC ATTRACTION-DRIVEN FLOW AND EDGE-REGIONS

  • Hahn, Joo-Young;Lee, Chang-Ock
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.11 no.2
    • /
    • pp.41-47
    • /
    • 2007
  • A fine segmentation algorithm is proposed for extracting objects in an image, which have both weak boundaries and highly non-convex shapes. The image has simple background colors or simple object colors. Two concepts, geometric attraction-driven flow (GADF) and edge-regions are combined to detect boundaries of objects in a sub-pixel resolution. The main strategy to segment the boundaries is to construct initial curves close to objects by using edge-regions and then to make a curve evolution in GADF. Since the initial curves are close to objects regardless of shapes, highly non-convex shapes are easily detected and dependence on initial curves in boundary-based segmentation algorithms is naturally removed. Weak boundaries are also detected because the orientation of GADF is obtained regardless of the strength of boundaries. For a fine segmentation, we additionally propose a local region competition algorithm to detect perceptible boundaries which are used for the extraction of objects without visual loss of detailed shapes. We have successfully accomplished the fine segmentation of objects from images taken in the studio and aphids from images of soybean leaves.

  • PDF

Optical Flow Measurement Based on Boolean Edge Detection and Hough Transform

  • Chang, Min-Hyuk;Kim, Il-Jung;Park, Jong an
    • International Journal of Control, Automation, and Systems
    • /
    • v.1 no.1
    • /
    • pp.119-126
    • /
    • 2003
  • The problem of tracking moving objects in a video stream is discussed in this pa-per. We discussed the popular technique of optical flow for moving object detection. Optical flow finds the velocity vectors at each pixel in the entire video scene. However, optical flow based methods require complex computations and are sensitive to noise. In this paper, we proposed a new method based on the Hough transform and on voting accumulation for improving the accuracy and reducing the computation time. Further, we applied the Boo-lean based edge detector for edge detection. Edge detection and segmentation are used to extract the moving objects in the image sequences and reduce the computation time of the CHT. The Boolean based edge detector provides accurate and very thin edges. The difference of the two edge maps with thin edges gives better localization of moving objects. The simulation results show that the proposed method improves the accuracy of finding the optical flow vectors and more accurately extracts moving objects' information. The process of edge detection and segmentation accurately find the location and areas of the real moving objects, and hence extracting moving information is very easy and accurate. The Combinatorial Hough Transform and voting accumulation based optical flow measures optical flow vectors accurately. The direction of moving objects is also accurately measured.

DETECTION AND COUNTING OF FLOWERS BASED ON DIGITAL IMAGES USING COMPUTER VISION AND A CONCAVE POINT DETECTION TECHNIQUE

  • PAN ZHAO;BYEONG-CHUN SHIN
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.27 no.1
    • /
    • pp.37-55
    • /
    • 2023
  • In this paper we propose a new algorithm for detecting and counting flowers in a complex background based on digital images. The algorithm mainly includes the following parts: edge contour extraction of flowers, edge contour determination of overlapped flowers and flower counting. We use a contour detection technique in Computer Vision (CV) to extract the edge contours of flowers and propose an improved algorithm with a concave point detection technique to find accurate segmentation for overlapped flowers. In this process, we first use the polygon approximation to smooth edge contours and then adopt the second-order central moments to fit ellipse contours to determine whether edge contours overlap. To obtain accurate segmentation points, we calculate the curvature of each pixel point on the edge contours with an improved Curvature Scale Space (CSS) corner detector. Finally, we successively give three adaptive judgment criteria to detect and count flowers accurately and automatically. Both experimental results and the proposed evaluation indicators reveal that the proposed algorithm is more efficient for flower counting.

Application of An Adaptive Self Organizing Feature Map to X-Ray Image Segmentation

  • Kim, Byung-Man;Cho, Hyung-Suck
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • 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.

  • PDF