• 한국정보처리학회논문지
• /
• 제4권4호
• /
• pp.1141-1151
• /
• 1997

본 논문에서는 오프라인 한자의 특징 추출을 위한 최대 블록화 방법(Maximum Block Method:MBM)을 제안한다. 최대 블록화란 처며 찾아진 화소로부터 블록을 점차 키워 나 아가감 으로서 입력문자의 골격선과 특징점을 추출하는 방법이다.기존의 세선화 방법 에서는 국소적인 잡음의 영향과 굴곡점, 누락점 등에서 발생되는 왜곡 현상이 특징 추출 을 어렵게 하는 단점이 있었다. 본 논문에서는 최대 블록 생성으로 인하여 잡음블록의 제거와 합성으로 직선과 사선획을 찾으므로서, 정확한 특징점 추출하는 앙법임을 입증 하였다. 실험 데이타로는 프린터 결과물, 중고등학교 한자 교과서와 기타 문서 등을 사용하였다. 한자 이외에도 한글 및 영, 숫자를 입력하여 실험한 결과, 인식의 전처리 과정인 골격선 추출과 획의 특징 추출에서 매우 효과적인 방법임을 확인하였다.

• 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.

• 한국산업융합학회 논문집
• /
• 제6권1호
• /
• pp.23-29
• /
• 2003

This paper proposes an efficient feature extraction of the images by using independent component analysis(ICA) based on neural networks of the hybrid learning algorithm. The proposed learning algorithm is the fixed point(FP) algorithm based on Newton method and moment. The Newton method, which uses to the tangent line for estimating the root of function, is applied for fast updating the inverse mixing matrix. The moment is also applied for getting the better speed-up by restraining an oscillation due to compute the tangent line. The proposed algorithm has been applied to the 10,000 image patches of $12{\times}12$-pixel that are extracted from 13 natural images. The 144 features of $12{\times}12$-pixel and the 160 features of $16{\times}16$-pixel have been extracted from all patches, respectively. The simulation results show that the extracted features have a localized characteristics being included in the images in space, as well as in frequency and orientation. And the proposed algorithm has better performances of the learning speed than those using the conventional FP algorithm based on Newton method.

• 융합신호처리학회논문지
• /
• 제1권1호
• /
• pp.42-48
• /
• 2000

본 논문에서는 칼라 CCD 카메라로부터 입력된 얼굴 영상에서 피부색 정보와 눈, 코, 입 등의 얼굴 영역 특징 자 및 턱 선의 선형 적 특징을 이용한 얼굴 영상 인식 알고리즘을 제안하져다. 제안한 알고리즘에서는 인간의 시각 체계와 비교적 유사한 HSI 좌표계 상에서 피부색에 대한 색상 정보와 명암값 정보를 함께 이용함으로써 얼굴영역 추출의 효율을 높였고, 인종에 따라 적응적인 추출이 가능하도록 하였다. 또한 추출된 얼굴 영역에서 얼굴 인식율 개선을 위해 눈, 코, 입 등의 구조적 위치정보와 턱선의 선형적인 특징값을 이용하여 얼굴 인식율을 개선하였다. 제안한 알고리즘에서는 기존의 명암 정보를 이용하는 방법과는 달리 색상 정보와 명암 정보를 함께 이용함으로써 정확한 얼굴영역의 검출이 가긍하였으며 인식 방법에 있어서 구조적 특징자 외에 턱선의 선형적인 관계값을 이용함으로써 인식 효율을 개선하였다.

• 한국측량학회지
• /
• 제37권2호
• /
• pp.55-62
• /
• 2019

The stereo geometry establishment based on the precise sensor modeling is prerequisite for accurate stereo data processing. Ground control points are generally required for the accurate sensor modeling though it is not possible over the area where the accessibility is limited or reference data is not available. For the areas, the relative orientation should be carried out to improve the geometric consistency between the stereo data though it does not improve the absolute positional accuracy. The relative orientation requires conjugate points that are well distributed over the entire image region. Therefore the automatic conjugate point extraction is required because the manual operation is labor-intensive. In this study, we applied the method consisting of the key point extraction, the search space minimization based on the epipolar line, and the rigorous outlier detection based on the RPCs (Rational Polynomial Coefficients) bias compensation modeling. We tested different parameters of window sizes for Kompsat-2 across track stereo data and analyzed the RPCs precision after the bias compensation for the cases whether the epipolar line information is used or not. The experimental results showed that matching outliers were inevitable for the different matching parameterization but they were successfully detected and removed with the rigorous method for sub-pixel level of stereo RPCs precision.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2007년도 하계종합학술대회 논문집
• /
• pp.251-252
• /
• 2007

The thesis proposed the Text Extraction Algorithm which is a text extraction algorithm which uses the Coiflet Wavelet, YCbCr Color model and the close curve edge feature of adaptive LoG Operator in order to complement the demerit of the existing research which is weak in complexity of background, variety of light and disordered line and similarity of text and background color. This thesis is simulated with natural images which include naturally text area regardless of size, resolution and slant and so on of image. And the proposed algorithm is confirmed to an excellent by compared with an existing extraction algorithm in same image.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 제36회 하계학술대회 논문집 D
• /
• pp.2921-2923
• /
• 2005

This paper presents to generate 3D building model using estimation of rooftop surface after 3D line segment extraction using hybrid stereo matching techniques in terms of the co-operation of area-based stereo and feature-based stereo. we first performed a junction extraction from 3D line segment data which was obtained by stereo images, and finally generated building's reliable rooftop surface model using LSE(Least Square Error) method after creating surfaces by grouped and fixed junction points. we generated synthetic images for experimentation by photo-realistic simulation on Avenches data set of Ascona aerial images.

• 한국HCI학회:학술대회논문집
• /
• 한국HCI학회 2007년도 학술대회 1부
• /
• pp.44-49
• /
• 2007

반짝이는 특성의 물체에 대해 이미지를 기반으로 색을 추출하는 경우 반짝이는 특성을 포함하면서 내재되어 있는 색 특성을 표현하기 위해 색 곡선(color line)을 이용한다. 이 경우 추출하려는 색이 왜곡되지 않은 가장 적합한 이미지를 선정하는 방법이 필요하다. 이를 위해서 실감모델링을 위해 색 곡선을 기반으로 색을 추출하는 방법을 제시하고 제시된 방법을 위해 색을 추출하기 가장 적합한 이미지를 선정하는 기준을 색포화율(color saturation ratio)을 통해 제안한다. 색포화율이란 색을 구성하는 요소 중에서 최소한 하나 이상의 색이 포화된 픽셀들을 최대 색거리를 가진 픽셀들로 간주하여 계산된 색거리의 총합에 대해 최소한 하나 이상의 색이 포화된 픽셀들의 색거리 총합의 비율를 의미한다. 이상적으로 이 비율이 최소가 되면 하이라이트를 제외한 어떤 픽셀도 포화되지 않기 때문에 반짝이는 특성을 가진 물체의 색을 추출하기 위해 촬영된 이미지는 하이라이트를 제외한 모든 색이 왜곡되지 않은 가장 적합한 이미지가 생성된다. 또한, 이렇게 선정된 이미지에서 추출된 색의 효율성을 보이기 위해 색 공간과 이미지 상에서 다양한 형태의 응용 결과를 제시하였다.

• 한국통신학회논문지
• /
• 제36권7C호
• /
• pp.428-434
• /
• 2011

Recently, subspace analysis has raised its performance to a higher level through the adoption of kernel-based nonlinearity. Especially, the radial basis function, based on its nonparametric nature, has shown promising results in face recognition. However, due to the endemic small sample size problem of face data, the conventional kernel-based feature extraction methods have difficulty in data representation. In this paper, we introduce a novel variant of the RBF kernel to alleviate this problem. By adopting the concept of the nearest feature line classifier, we show both effectiveness and generalizability of the proposed method, particularly regarding the small sample size issue.

• Journal of Computational Design and Engineering
• /
• 제3권2호
• /
• pp.102-111
• /
• 2016

In this paper, we study the problem of computing smooth feature curves from CAD type point clouds models. The proposed method reconstructs feature curves from the intersections of developable strip pairs which approximate the regions along both sides of the features. The generation of developable surfaces is based on a linear approximation of the given point cloud through a variational shape approximation approach. A line segment sequencing algorithm is proposed for collecting feature line segments into different feature sequences as well as sequential groups of data points. A developable surface approximation procedure is employed to refine incident approximation planes of data points into developable strips. Some experimental results are included to demonstrate the performance of the proposed method.