• The KIPS Transactions:PartB
• /
• v.16B no.4
• /
• pp.271-280
• /
• 2009

In this paper, we propose a smoke detection method using region growing method in outdoor video sequences. Our proposed method is composed of three steps; the initial change area detection step, the boundary finding and expanding step, and the smoke classification step. In the first step, we use a background subtraction to detect changed areas in the current input frame against the background image. In difference images of the background subtraction, we calculate a binary image using a threshold value and apply morphology operations to the binary image to remove noises. In the second step, we find boundaries of the changed areas using labeling algorithm and expand the boundaries to their neighbors using the region growing algorithm. In the final step, ellipses of the boundaries are estimated using moments. We classify whether the boundary is smoke by using the temporal information.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.9
• /
• pp.2412-2420
• /
• 1997

An algorithm for detecting dominant points on a digital contour is proposed. The algorithm detects the dominant points from the given contour with the given number of points as a constraint condition. on the basis of the principle of the top-down approach. The dominant points are detected by minimizing the object function that presents the similarity between the given contour and the approximated polygon drawn by connecting the dominant points of candicate. The penalty multiplier method is applied to minimize the augmented Lagrangean function which is made by adding the penalty of the constraint condition to the object function. On the minimization, a local searching method by the partial problem division is considered, and it is clarified that the reasonable solution is obtained by the method. The proposed algorithm has a merit that the dominant points can be detected exactly and stably even for the digital contour composed of multiple-scale features and the similar contours, because it detects them on considering the property of a whole figure of the given contour. It is confirmed that the proposed algorithm is more excellent than other previously proposed algorithms by the comparison and the evaluation through the experiment on suing typical digital curves.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.07a
• /
• pp.79-82
• /
• 2012

컴퓨터 비전에서 영상 매칭 기술은 다양한 분야에 응용될 수 있는 기초적인 기술 중에 하나이다. 강인한 영상 매칭을 위해서는 정확하고 독특한 특징점을 검출하는 과정이 중요하다. 기존의 SIFT나 SURF 등 영상 매칭 알고리즘은 등방성 가우시안 필터링을 사용한 스케일 공간을 생성하여 특징점을 검출한다. 이러한 기존의 특징점 검출 방식은 스케일 공간에서 영상의 경계선을 모호하게 만들어 정확한 특징점 검출을 어렵게 만들고 영상 매칭의 성능을 떨어뜨리는 문제점을 가지고 있다. 본 논문에서는 SIFT 알고리즘의 강인한 특징점 검출을 위하여 양방향 필터링을 사용하여 스케일 공간 생성을 제안한다. 이러한 스케일 공간 생성 방식은 스케일 공간에서 영상의 경계선을 보존해 줌으로서 강인한 특징점 검출을 가능하게 하여 영상 매칭 성능을 향상시킨다. 특히 왜곡이 존재하는 영상들의 매칭에서 제안하는 특징점 검출 방법이 적용된 SIFT 알고리즘은 기존의 SIFT 알고리즘보다 우수한 영상 매칭 결과를 보여준다.

• The KIPS Transactions:PartB
• /
• v.9B no.3
• /
• pp.359-368
• /
• 2002

In this paper, we propose effective boundary line extraction algorithm for moving objects by matching error image and moving vectors, and fast tracking algorithm for moving object by partial boundary lines. We extracted boundary line for moving object by generating seeds with probability distribution function based on Watershed algorithm, and by extracting boundary line for moving objects through extending seeds, and then by using moving vectors. We processed tracking algorithm for moving object by using a part of boundary lines as features. We set up a part of every-direction boundary line for moving object as the initial feature vectors for moving objects. Then, we tracked moving object within current frames by using feature vector for the previous frames. As the result of the simulation for tracking moving object on the real images, we found that tracking processing of the proposed algorithm was simple due to tracking boundary line only for moving object as a feature, in contrast to the traditional tracking algorithm for active contour line that have varying processing cost with the length of boundary line. The operations was reduced about 39% as contrasted with the full search BMA. Tracking error was less than 4 pixel when the feature vector was $(15\times{5)}$ through the information of every-direction boundary line. The proposed algorithm just needed 200 times of search operation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04c
• /
• pp.343-345
• /
• 2003

본 논문에서는 색상 정보와 변형 모델을 이용한 얼굴 영역 및 얼굴의 특징 영역의 자동 검출 방법을 제시한다. 영상으로부터 획득할 수 있는 정보 중 가장 빠르고 쉽게 얻을 수 있는 정보가 색상 정보이며, 색상정보는 사물을 판단함에 있어서 가장 효율적이면서 컴퓨터의 계산량을 줄일 수 있다는 장점을 갖고 있기 때문에 얼굴 영역 검출 방법으로 많이 이용되고 있다. 본 연구에서는 얼굴영역 및 얼굴 특성 추출함에 있어 컬러모델 사용 시 외부 조명의 영향을 줄여주는 조명 보정 방법을 제시하고, 조명 보정에 의해 평활화된 YCbCr 색상모델에 적용하여 각 성분 특성을 고려한 얼굴영역 및 얼굴의 특성 영역에 해당하는 후보 영역을 검출하는 방법을 제시한다. 검출된 얼굴후보 영역 및 특성 영역은 가변 모델인 동적 윤곽선 모델의 초기값으로 자동 적용되어 윤곽선 모델 적용시 문제점가운데 하나인 초기값 설정문제를 해결함과 동시에 얼굴 및 얼굴 특징 정보의 정확한 윤곽선을 추출하는데 사용된다. 실험 결과 제시된 방법을 적용한 결과 빠르고 효과적으로 얼굴 및 특성 영역을 검출 할 수 있음을 입증 할 수 있었다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2019.07a
• /
• pp.89-90
• /
• 2019

본 논문에서는 ultrasound image Right Parasagittal Liver에 edge detection을 적용한 후, 특징점 검출 알고리즘인 Scale Invarient Feature Transfom(SIFT)를 이용하여 특징점의 위치를 살펴보도록 한다. edge detection 알고리즘으로는 Canny edge detection과 Prewitt edge detection을 적용하기로 한다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.4
• /
• pp.75-79
• /
• 2009

In this paper the method was proposed which uses ${\lambda}$-fuzzy measure to detect the edge of the features of the face region. In the conventional method the features was founded using valley, brightness and edge. This method had its drawbacks that it is so sensitive to the external noises and environments. This paper proposed ${\lambda}$-fuzzy measure to cope with this drawbacks. By considering each weight of the pixels the integral evaluation was considered using the center of area method. Thus the continuity of the edge was kept by way of the neighborhood information and the reduction of time complexity wad resulted in.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.3
• /
• pp.90-97
• /
• 2007

For a highly reliable fingerprint recognition system, the precise and accurate feature extraction is indispensable. In this paper, We propose a highly efficient crease extraction method, which can improve the accuracy of feature extraction within the fingerprint image. The proposed method applies the 1-dimensional directional slit for each pixel in fingerprint image. And then it calculates the average grey level and variance to determine whether the current pixel composes the crease, and estimates the direction of crease. Once the direction of every pixel in crease candidate area is estimated, it is decomposed into 8 different images depending on their direction. From the 8 directional images, the crease clusters are estimated by utilizing the property of crease area. The proposed method finally extracts the crease from the crease clusters estimated from directional images. In conclusion, the proposed method highly improved the accuracy of overall feature extraction by accurate and precise extraction of the crease from fingerprint image.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2019.07a
• /
• pp.91-94
• /
• 2019

스케치를 거쳐 생성되는 디지털 자료로 건축도면이나 제품 디자인시안 등은 수요가 많음에도 불구하고 디지털 도면 자동생성에 대한 영상처리는 아직 연구되지 않고 있다. 현행 필기인식에 대한 영상처리 연구는 주로 글자나 숫자에 국한되어 있어 본 연구에서는 선으로 이루어진 필기를 인식하여 도면이라는 이진영상의 특징을 이용해 특징점을 도출하고 디지털 도면을 생성하는 영상처리를 제안한다. 먼저 입력받은 아날로그 스캔이미지를 메디안블러링과 OSTU임계처리로 노이즈가 없는 이진영상으로 변환한 후 해리스코너검출기를 이용하여 특징점을 검출하고 좌표를 추출하고, 좌표값을 활용해 외곽선과 내부윤곽선까지 구현하여 디지털도면을 양산한다.

• 전자공학회논문지 IE
• /
• v.44 no.2
• /
• pp.32-40
• /
• 2007

In this paper, the crease extraction method is proposed to improve the accuracy of feature extraction within the fingerprint image. First of all, for each pixel in fingerprint image, it calculates the average grey level and variance to determine if the current pixel composes the crease, and estimates the direction of crease. Secondly, once the direction of every pixel in crease candidate area is estimated, it is decomposed into 8 different images, depending on their direction. The properties of crease consists of the length of the crease candidate area, the correspondence between the crease direction and the pixel distribution direction, the difference between the ridge direction and the pixel distribution direction, and finally the grey level of the candidate pixels. The proposed method finally extracts the crease from the crease clusters estimated from directional images. In conclusion, applying the proposed method improved the accuracy of overall feature extraction by 91.4% by accurately and precisely extracting the crease from fingerprint image.