• 한국정보통신학회논문지
• /
• 제17권3호
• /
• pp.718-723
• /
• 2013

일반적으로 배경과 물체의 경계 부분은 화소값이 급격히 변화하는 지점이며, 영상의 특징을 분석함에 있어서 중요한 요소이다. 이러한 경계 부분을 이용하여 영상 내에서 물체의 위치나 모양에 대한 정보를 검출하며, 이를 위한 많은 연구들이 이루어져 왔다. 기존의 방법들은 구현이 비교적 간단하며 처리 속도가 빠른 반면, 고정된 가중치가 모든 화소에 동일하게 적용되므로 에지 검출 특성이 다소 미흡하다. 따라서 본 논문에서는 영상에 따라 적응하는 에지 검출을 위하여 마스크의 영역 분할을 이용한 에지 검출 알고리즘을 제안하였으며, 제안한 알고리즘에 의한 처리 결과는 에지 영역에서 우수한 에지 검출 특성을 나타내었다.

• 한국건설관리학회논문집
• /
• 제25권2호
• /
• pp.36-44
• /
• 2024

본 논문에서는 합성곱신경망과 ROI기법을 이용한 콘크리트 균열 분석에 관해 소개한다. 콘크리트 표면, 빔과 같은 구조물은 피로 응력, 주기 부하에 노출되며, 이는 일반적으로 구조물의 표면에서 미세한 수준에서 시작되는 균열을 야기한다. 구조물의 균열은 안정성을 저하시키고 구조물의 견고함을 감소시킨다. 조기 발견을 통해 손상 및 고장 가능성을 방지하기 위한 예방 조치를 취할 수 있다. 일반적으로 수동 검사 결과는 품질이 좋지 않고, 대규모 기반 시설의 경우 접근이 어려우며, 균열을 정확하게 감지하기 어렵다. 이러한 수동검사의 자동화는 기존 방식의 한계를 해결할 수 있기 때문에 컴퓨터 비전 기반의 연구들이 수행되었다. 하지만 다양한 유형의 균열이나, 열화상 카메라 등을 이용한 연구들은 부족한 상태이다. 따라서 본 연에서는 콘크리트 벽의 균열을 자동으로 감지하는 방법론을 개발하여 제시하며, 다음과 같은 연구 내용을 목표로 한다. 첫째, 균열 감지 이미지 기반 분석의 주요 장점인 이미지 처리 기술을 사용하여 기존의 수동 방법과 비교하여 정확도가 향상된 결과 및 정보를 제공한다. 둘째, 강화된 Sobel edge segmentation 기술 및 ROI 기법 기반의 알고리즘을 개발하여 비파괴 시험을 위한 자동 균열 감지 기술을 구현한다.

• 대한전자공학회논문지
• /
• 제26권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.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2006년도 Proceedings of ISRS 2006 PORSEC Volume II
• /
• 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.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 19-21 Oct. 1992
• /
• 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.

• 한국기계가공학회지
• /
• 제9권1호
• /
• pp.74-80
• /
• 2010

The purpose of reverse engineering design using 3D measurement data is an accurate reconstruction of real body. In oder to accomplish this object, it is important that creating exact extracting edges should be studying out first of all. This study used edge-based method to find out edge point from the measuring point data. The characteristics are analysed using the mean curvature block method on the fitting NURBS curve and defined edges through block removal condition. The results showed that only using the NURBS curve of maximum curvature analysis to define correct edge of real geometry is limited, but this segmentation approach provides simplified necessary condition for edge classification, and an effectiveness to classify a straight line, curves and fillets etc.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제27권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.

• 한국CDE학회논문집
• /
• 제4권3호
• /
• pp.173-179
• /
• 1999

In reverse engineering, when a shape containing multi-patched surfaces is digitized, the boundaries of these surfaces should be detected. The objective of this paper is to introduce a computationally efficient segmentation technique for extracting edges, ad partitioning the 3D measuring point data based on the location of the boundaries. The procedure begins with the identification of the edge points. An automatic edge-based approach is developed on the basis of local geometry. A parametric quadric surface approximation method is used to estimate the local surface curvature properties. the least-square approximation scheme minimizes the sum of the squares of the actual euclidean distance between the neighborhood data points and the parametric quadric surface. The surface curvatures and the principal directions are computed from the locally approximated surfaces. Edge points are identified as the curvature extremes, and zero-crossing, which are found from the estimated surface curvatures. After edge points are identified, edge-neighborhood chain-coding algorithm is used for forming boundary curves. The original point set is then broke down into subsets, which meet along the boundaries, by scan line algorithm. All point data are applied to each boundary loops to partition the points to different regions. Experimental results are presented to verify the developed method.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 하계종합학술대회 논문집(4)
• /
• pp.145-148
• /
• 2002

A study on image searching and management techniques is actively developed by user requirements for multimedia information that are existing as images, audios, texts data from various information processing devices. We had been studied an automatical shape region segmentation method using color. distribution and edge characteristics of moving images for. contents-base description. The Proposed method uses a color information quantized on human visual system and extracts overlapped regions to be matched by using edge characteristics of the image frame. The performance of the proposed method is represented by similarity for comparison to a segmented image and original image.

• 전자공학회논문지B
• /
• 제33B권10호
• /
• pp.120-129
• /
• 1996

This paper presents an efficient block segmentation and classification using the edge information of the document image. We extract four prominent features form the edge gradient and orientaton, all of which, and thereby the block clssifications, are insensitive to the background noise and the brightness variation of of the image. Using these four features, we can efficiently classify a document image into the seven categrories of blocks of small-size letters, large-size letters, tables, equations, flow-charts, graphs, and photographs, the first five of which are text blocks which are character-recognizable, and the last two are non-character blocks. By introducing the clumn interval and text line intervals of the document in the determination of th erun length of CRLA (constrained run length algorithm), we can obtain an efficient block segmentation with reduced memory size. The simulation results show that the proposed algorithm can rigidly segment and classify the blocks of the documents into the above mentioned seven categories and classification performance is high enough for all the categories except for the graphs with too much variations.