• 전자공학회논문지S
• /
• 제34S권3호
• /
• pp.97-107
• /
• 1997

Image segmentation is teh important step in image infromation extraction for computer vison sytems. Fuzzy clustering methods have been used extensively in color image segmentation. Most analytic fuzzy clustering approaches are derived from the fuzzy c-means (FCM) algorithm. The FCM algorithm uses th eprobabilistic constraint that the memberships of a data point across classes sum to 1. However, the memberships resulting from the FCM do not always correspond to the intuitive concept of degree of belongingor compatibility. moreover, the FCM algorithm has considerable trouble above under noisy environments in the feature space. Recently, the possibilistic C-mean (PCM) for solving growing for color image segmentation. In the PCM, the membersip values may be interpreted as degrees of possibility of the data points belonging to the classes. So, the problems in the FCM can be solved by the PCM. The clustering results by just PCM are not smoothly bounded, and they often have holes. So, the region growing was used as a postprocessing. In our experiments, we illustrated that the proposed method is reasonable than the FCM in noisy enviironments.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2012년도 한국컴퓨터종합학술대회논문집 Vol.39 No.1(C)
• /
• pp.448-450
• /
• 2012

본 논문에서는 Kinect 방식의 RGB-D 영상센서를 사용하여, 깊이(Depth) 영상으로부터 3차원 객체의 기하정보를 표현하는 표면 정규 벡터(Surface Normal Vector)를 추출하고, 그 결과를 영상화하는 방법을 제안하며, 제안된 방법으로 생성된 영상으로부터 깊이 영상의 특징점 및 특징 기술자를 추출하여 3차원 객체 인식 성능을 향상시키는 방법을 제안한다. 또한 생성된 RGB-D 특징 기술자들을 객체 단위로 구분 가능한 코드북(CodeBook) 학습을 통한 인식방법을 제안하여 객체의 인식 성능을 높이는 방법을 제안한다. 제안하는 RGB-D 기반의 특징 추출 및 학습 방법은 텍스쳐 유무, 카메라 회전 및 이동 변화 등의 환경변화에 강건함을 실험적으로 증명하였으며, 이 방법은 Kinect 방식의 RGB-D 영상을 사용하는 3차원 객체/공간 인식 및 추적, 혹은 이를 응용하는 증강현실 시스템에 적용하여 사용될 수 있다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2015년도 추계학술발표대회
• /
• pp.1442-1445
• /
• 2015

본 논문은 SAR 영상에서 객체를 추출하는 새로운 방법으로 특징점 기반 분할 히스토그램 기법을 제안한다. 제안하는 방법은 영상 히스토그램에서 객체로 추정될 수 있는 영역을 세밀하게 추출하기 위해 영상에서 특징점을 추출한 후, 특징점의 밝기를 기준으로 히스토그램을 분할한다. 분할 히스토그램이 배경과 객체 성분을 모두 포함하고 있을 경우 해당 영역의 혼합 확률밀도함수가 교차되는 임계점을 계산한다. 계산된 임계점을 기준으로 현재 영역이 전체 영상에서 차지하는 비율을 비교하여 배경과 객체 여부를 판단한다. 제안하는 방법은 무인 감시 정찰 시스템 등 다양한 응용 기술에 활용될 수 있을 것으로 기대한다.

• 대한원격탐사학회지
• /
• 제22권5호
• /
• pp.439-443
• /
• 2006

Image co-registration is the process of overlaying two images of the same scene. One of which is a reference image, while the other (sensed image) is geometrically transformed to the one. Numerous methods were developed for the automated image co-registration and it is known as a timeconsuming and/or computation-intensive procedure. In order to improve efficiency and effectiveness of the co-registration of satellite imagery, this paper proposes a pre-qualified area matching, which is composed of feature extraction with Laplacian filter and area matching algorithm using correlation coefficient. Moreover, to improve the accuracy of co-registration, the outliers in the initial matching point should be removed. For this, two outlier detection techniques of studentized residual and modified RANSAC algorithm are used in this study. Three pairs of Landsat images were used for performance test, and the results were compared and evaluated in terms of robustness and efficiency.

• 반도체디스플레이기술학회지
• /
• 제17권4호
• /
• pp.105-108
• /
• 2018

Face Detection is an essential first step of the face recognition, and this is significant effects on face feature extraction and the effects of face recognition. Face detection has extensive research value and significance. In this paper, we present and analysis the principle, merits and demerits of the classic AdaBoost face detection and ASM algorithm based on point distribution model, which ASM solves the problems of face detection based on AdaBoost. First, the implemented scheme uses AdaBoost algorithm to detect original face from input images or video stream. Then, it uses ASM algorithm converges, which fit face region detected by AdaBoost to detect faces more accurately. Finally, it cuts out the specified size of the facial region on the basis of the positioning coordinates of eyes. The experimental result shows that the method can detect face rapidly and precisely, with a strong robustness.

• ETRI Journal
• /
• 제40권6호
• /
• pp.788-793
• /
• 2018

3D reconstruction of urban architecture, land, and roads is an important part of building a "digital city." Unmanned aerial vehicles (UAVs) are gradually replacing other platforms, such as satellites and aircraft, in geographical image collection; the reason for this is not only lower cost and higher efficiency, but also higher data accuracy and a larger amount of obtained information. Recent 3D reconstruction algorithms have a high degree of automation, but their computation time is long and the reconstruction models may have many voids. This paper decomposes the object into multiple regional parallel reconstructions using the clustering principle, to reduce the computation time and improve the model quality. It is proposed to detect the planar area under low resolution, and then reduce the number of point clouds in the complex area.

• International Journal of Advanced Culture Technology
• /
• 제6권4호
• /
• pp.317-322
• /
• 2018

We use edge detection technique for the input image to extract the entire edges of the object in the image and then select only the edges that construct the outline of the object. By examining the positional relation between these pixels composing the outline, a simplified version of the outline of the object in the input image is generated by removing unnecessary pixels while maintaining the condition of connection of the outline. For each pixel constituting the outline, its direction is calculated by examining the positional relation with the next pixel. Then, we group the consecutive pixels with same direction into one and then change them to a line segment instead of a point. Among those line segments composing the outline of the object, a line segment whose length is smaller than a predefined minimum length of acceptable line segment is removed by merging it into one of the adjacent line segments. As a result, an outline composed of line segments of over a certain length is obtained through this process.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송∙미디어공학회 2020년도 추계학술대회
• /
• pp.328-329
• /
• 2020

처음 방문하는 도시에서 건물의 외형만을 보고 목적지를 찾는 것은 매우 어려운 일이다. 따라서 본 연구에서는 스마트폰 카메라로부터 촬영된 영상에서 특징점을 추출하고 이를 이미 데이터베이스에 저장된 영상과 매칭하는 작업을 통해 해당 건물의 이름이 무엇인지 알려주는 시스템을 개발하였다. Oriented fast and rotated brief 알고리즘을 이용하여 크기 변화, 회전 등에 강인한 특징점을 추출하였고 알고리즘과 Brute-Force Matcher와 K-Nearest Neighbor 방법을 이용하여 특징점을 매칭하였다. 제안된 시스템은 실제 스마트폰으로 촬영된 영상을 데이터베이스에 연동하여 실험한 결과 90% 이상의 정확도를 보여 주었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권4호
• /
• pp.1562-1578
• /
• 2020

Vector data compression algorithm can meet requirements of different levels and scales by reducing the data amount of vector graphics, so as to reduce the transmission, processing time and storage overhead of data. In view of the fact that large threshold leading to comparatively large error in Douglas-Peucker vector data compression algorithm, which has difficulty in maintaining the uncertainty of shape features and threshold selection, a segmented Douglas-Peucker algorithm based on node importance is proposed. Firstly, the algorithm uses the vertical chord ratio as the main feature to detect and extract the critical points with large contribution to the shape of the curve, so as to ensure its basic shape. Then, combined with the radial distance constraint, it selects the maximum point as the critical point, and introduces the threshold related to the scale to merge and adjust the critical points, so as to realize local feature extraction between two critical points to meet the requirements in accuracy. Finally, through a large number of different vector data sets, the improved algorithm is analyzed and evaluated from qualitative and quantitative aspects. Experimental results indicate that the improved vector data compression algorithm is better than Douglas-Peucker algorithm in shape retention, compression error, results simplification and time efficiency.

• 센서학회지
• /
• 제20권5호
• /
• pp.343-350
• /
• 2011

The compliance and stiffness of artery are closely related with disease of arteries. Pulse wave velocity(PWV) in the blood vessel is a basic and common parameter in the hemodynamics of blood pressure and blood flow wave traveling in arteries because the PWV is affected directly by the conditions of blood vessels. However, there is no standardized method to measure the PWV and it is difficult to measure. The conventional PWV measurement has being done by manual calculation of the pulse wave transmission time between coronary arterial proximal and distal points on a strip chart on which the pulse wave and ECG signal are recorded. In this study, a pressure sensor consisting of strain gauges is used to measure the blood pressure of arteries in invasive method and regular ECG electrodes are used to record the ECG signal. The R-peak point of ECG is extracted by using a reference level and time windowing technique and the ascending starting point of blood pressure is determined by using differentiation of the blood pressure signal and time windowing technique. The algorithm proposed in this study, which can measure PWV automatically, shows robust and good results in the extraction of feature points and calculation of PWV.