• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.4 no.4
• /
• pp.391-397
• /
• 2003

This paper is about the digital image decimation algorithm which generates a value of decimated element by an average of a target pixel value and a value of neighbor intelligible element to adaptively reflect the merits of ZOD method and FOD method on the decimated image. First, a target pixel located at the center of sliding window is selected, then the gradient amplitudes of its right neighbor pixel and its lower neighbor pixel are calculated using first order derivative operator respectively. Secondly, each gradient amplitude is divided by the summation result of two gradient amplitudes to generate each intelligible weight. Next, a value of neighbor intelligible element is obtained by adding a value of the right neighbor pixel times its intelligible weight to a value of the lower neighbor pixel times its intelligible weight. The decimated image can be acquired by applying the process repetitively to all pixels in input image which generates the value of decimated element by calculating the average of the target pixel value and the value of neighbor intelligible element.

• Journal of the Korea Computer Industry Society
• /
• v.8 no.3
• /
• pp.155-166
• /
• 2007

In this paper, captured face-image was pre-processing, segmentation, and extracting features from thinning by differential operator and minute-delineation. A straight line in slope-intercept form was transformed at the $r-\theta$ domain using Hough Transform, instead of Housdorff distance are extract feature as length, rotation, displacement of lines from thinning line components by differentiation. This research proposed a new approach compare with Hough Transformation and Housdorff Distance for face recognition so that Hough transform is simple and fast processing of face recognition than processing by Housdorff Distance. Rcognition accuracy rate is that Housdorff method is higher than Hough transformation's method.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04b
• /
• pp.664-666
• /
• 2002

기울기 연산자나 표면접합에 의한 윤곽추출과는 다른 본 논문에서는 확장과 수축방법론을 이용한 윤곽추출 및 잡음제거 방법론을 제안한다. 제안한 알고리즘은 전처리과정을 거친 후 확장과 수축 방법론을 적용함으로써 영상 윤곽 추출률을 높이고자한다 특히, 기존의 윤곽선 추출방법인 소벨과 프리위트알고리즘은 전처리과정인 미디안필터를 거친 후에 사용하였으며, 제안한 방법은 기존의 윤곽선 추출 필터를 거친 후에 사용하였다. 구체적으로 서술하면 확장알고리즘에서는 일정한 임계치를 초과하면 흰색으로 대치하였고, 수축 알고리즘에서는 검정색으로 대치했다. 기존의 잡음제거과정은 윤곽선의 손실은 없었으나 잡음제거가 소량 이루어졌으며, 제안한 방법에서는 약간의 윤곽선 손실을 보였으나 완전하게 잡음을 제거시킬 수 있었다.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.11 no.1
• /
• pp.193-200
• /
• 2003

This paper proposes a novel algorithm to recognize the curve of a structured road. The proposed algorithm uses an LCF (Lane Curve Function) obtained by the transformation of a parabolic function defined on world coordinate into image coordinate. Unlike other existing methods, the algorithm needs no transformation between world coordinate and image coordinate owing to the LCF. In order to search for an LCF describing the lane best, the differential comparison between the slope of an assumed LCF and the phase angle of edge pixels in the LROI (Lane Region Of Interest) constructed by the LCF is implemented. As finding the true LCF, the lane curve is determined. The proposed method is proved to be efficient through various kinds of images, providing the reliable curve direction and the valid curvature compared to the real road.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.05b
• /
• pp.385-388
• /
• 2003

영상의 에지는 입력 영상에 대한 중요 정보들을 가지고 있으며, 에지 추출은 영상인식의 성능을 좌우하는 중요 요소이다. 영상 에지 추출은 영상 분할의 첫 번째 단계이며, 영상의 구성을 결정하기 위해서 화소들을 하나의 영역으로 만드는데 사용되고 있다. 또한 에지 강도를 갖고 있는 모든 에지들을 검출하기 위해 많은 방법들이 제안되었다 기존의 에지 짐출은 흑백영상의 명암도의 변화에 국한되어 있었다 그러나 칼라영상을 이용하여 에지를 추출하는 경우에는 흑백영상보다 이용할 수 있는 정보가 많을 뿐 아니라 인간의 시각체계와도 유사하여 보다 나은 에지 추출을 기대할 수 있다. 본 논문에서는 칼라영상에서 직접적으로 얻을 수 있는 RGB 정보 중 광도를 분리하여 사용하는 YCbCr성분을 이용하여, 기존의 기울기연산자나 표면접합 템플릿에 의한 에지 추출이 아닌 3$\times$3 마스크안의 데이터값의 차에 따라 가변적으로 변하는 BBM템플릿을 제안하였다. 제안된 가변 BBM템플릿은 모의 실험한 결과 기존의 Sobel, Preweet, Roberts 같은 연산 템플릿보다 성능이 우수함을 확인하였다.

• The KIPS Transactions:PartD
• /
• v.10D no.7
• /
• pp.1171-1176
• /
• 2003

In this paper, we propose an effective bar code detection algorithm using the feature analysis and the labeling. After computing the direction of pixels using four line operators, we obtain the histogram about the direction of pixels by a block unit. We calculate the difference between the maximum value and the minimum value of the histogram and consider the block that have the largest difference value as the block of the bar code region. We get the line passing by the bar code region with the selected block but detect blocks of interest to get the more accurate line. The largest difference value is used to decide the threshold value to obtain the binary image. After obtaining a binary image, we do the labeling about the binary image. Therefore, we find blocks of interest in the bar code region. We calculate the gradient and the center of the bar code with blocks of interest, and then get the line passing by the bar code and detect the bar code. As we obtain the gray level of the line passing by the bar code, we grasp the information of the bar code.

• KIPS Transactions on Software and Data Engineering
• /
• v.6 no.1
• /
• pp.23-28
• /
• 2017

Shape from focus (SFF) is a technique used to reconstruct 3D shape of objects from a sequence of images obtained at different focus settings of the lens. In this paper, a new shape from focus method for 3D reconstruction of microscopic objects is described, which is based on gradient operator in Mathematical Morphology. Conventionally, in SFF methods, a single focus measure is used for measuring the focus quality. Due to the complex shape and texture of microscopic objects, single measure based operators are not sufficient, so we propose morphological operators with multi-structuring elements for computing the focus values. Finally, an optimal focus measure is obtained by combining the response of all focus measures. The experimental results showed that the proposed algorithm has provided more accurate depth maps than the existing methods in terms of three-dimensional shape recovery.

• Korean Journal of Cognitive Science
• /
• v.4 no.2
• /
• pp.181-200
• /
• 1994

In the learning phase of multilyer feedforword neural network,there are problems such that local minimum,learning praralysis and slow learning speed when backpropagation algorithm used.To overcome these problems, the genetic algorithm has been used as learing method in the multilayer feedforword neural network instead of backpropagation algorithm.However,because the genetic algorith, does not have any mechanism for fine-tuned local search used in backpropagation method,it takes more time that the genetic algorithm converges to a global optimal solution.In this paper,we suggest a new GA-BP method which provides a fine-tunes local search to the genetic algorithm.GA-BP method uses gradient descent method as one of genetic algorithm's operators such as mutation or crossover.To show the effciency of the developed method,we applied it to the 3-parity bit problem with analysis.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.4
• /
• pp.805-814
• /
• 1998

An efficient image processing algorithm is proposed to recognize both the height and width modulated barcodes which are rotated and printed at an arbitrary position. The main feature of this algorithm is to utilize the gradient information of a rotated barcode with a Sobel operator. The barcode area is extracted using the gradient information, and the barcode is decoded from the binary image of the extracted area. Theis algorithm is successfully applied to the 4 state and width modulated barcodes. It takes 0.86 secoden to process a letter, and the recognition rate reaches above 98% under various testing conditions. Since both the width and height modulated barcodes are processed with the proposed algorithm, it can be applied to postal service automation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.285-290
• /
• 2006

본 논문에서는 출입국자 관리의 효율성과 체계적인 출입국 관리를 위하여 여권 코드를 자동으로 인식하고 위조 여권을 판별할 수 있는 여권 인식 및 얼굴 인증 방법을 제안한다. 본 논문의 구성은 여권 인식과 얼굴 인증 부분으로 구성되며, 여권 인식 부분에서는 소벨 연산자, 수평 최소값 필터 등을 적용한 후, 8 방향 윤곽선 추적 알고리즘을 적용하여 코드의 문자열 영역을 추출하고 기울기를 보정한다. 추출된 문자열은 반복 이진화 방법을 적용하여 코드의 문자열 영역을 이진화 한다. 이진화된 문자열 영역에 대해 8 방향 윤곽선 추적 알고리즘을 적용하여 개별 코드를 추출한 후에 SOM(Self-Organizing Maps) 알고리즘을 적용하여 여권 코드를 인식한다. 얼굴 인증 부분에서는 여권 사진 영역의 특징을 이용하여 얼굴 후보 영역을 추출한 후, RGB와 YCbCr 색공간에서 피부색 정보를 이용하여 얼굴 영역을 추출한다. 추출된 얼굴 영역은 PCA(Principal Component Analysis) 알고리즘을 적용하여 특징 벡터를 구하고 여권 코드가 인식된 결과를 바탕으로 여권 소지자의 데이터 베이스에 있는 얼굴 영상의 특징벡터와의 거리 값을 계산하여 사진 위조 여부를 판별한다. 제안된 여권 인식 및 얼굴 인증 방법의 성능 평가를 위하여 원본 여권의 얼굴 부분을 위조한 여권과 기울어진 여권 영상을 대상으로 실험한 결과, 제안된 방법이 여권의 코드 인식 및 얼굴 인증에 있어서 우수한 성능이 있음을 확인하였다.