• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10b
• /
• pp.431-436
• /
• 2006

외곽선 추적 알고리즘은 영상 인식 및 표현에 있어서 물체의 기본 성질을 파악하는데 중요하다. 따라서 많은 알고리즘들이 연구되어 왔으며, 이중에는 간단한 경계선 추적자 알고리즘(SBF: Simple Boundary Follower)이다. 이외에도 수정된 간단한 경계선 추적자 알고리즘 (MSBF: Modified Simple Boundary Follower), 개선된 간단한 경계선 추적자 알고리즘(ISBF: Improved Simple Boundary Follower), 무어-네이버 추적 알고리즘(MNT: Moore-Neighbor Tracer), 방사형 탐색 알고리즘(RSA: Radial Sweep Algorithm), 그리고 Theo Pavlidis 알고리즘(TPA)이 있다. 이러한 알고리즘들은 추적 경로 특성들이 다르며 각기 장점과 제약성이 있다.외곽선 알고리즘들의 제약성은 크게 두 가지로 나눌 수 있다. 하나는 알고리즘 특성에 따라 외곽선 픽셀간 인접 형태에 따라 추적하지 못하는 경우가 존재할 수 있다는 것이다. 또 다른 하나는 외곽선 추적 알고리즘의 시작과 종료 조건에 따라서 특정 위치 픽셀들을 찾지 못하는 경우도 존재한다는 점이다. 본 논문에서는 이러한 문제점들을 중심으로 외곽선 추적 알고리즘들의 성능을 분석하였다. 또한, ISBF의 시작 조건과 TPA의 인너코너 추적을 개선하는 기법들을 제안하여 이를 해결토록 하였다. 실험 결과 제안한 기법들은 외곽선 추적 성능을 개선하는데 효과적이었다.

• Proceedings of the KIEE Conference
• /
• 2007.10a
• /
• pp.419-420
• /
• 2007

영상에서 경계선 추적은 영상내에 존재하는 특정 물체가 배경과 구분되어지는 외각선을 검출하기 위해 사용되어지는 알고리즘이다. 이렇게 해서 얻어진 외각선의 데이터는 물체를 분석하는데 사용되어 질 수 있다. 본 논문에서는 물체의 외각선 데이터를 획득하기 위해 사용되어지는 경계선 추적 알고리즘중 검색윈도우의 중심점 이동 횟수를 개선한 이동벡터 윈도우 알고리즘과 간단한 경계 추적자(SBF:Simple Boundary Follower)알고리즘을 부분적으로 적용하여 검색윈도우의 중심점 이동횟수 및 검색픽셀의 수를 줄이기 위한 방법을 제안한다. 제안한 경계선 추적 방법은 직선보다는 곡선이 많이 포함되어 있는 물체의 경계선을 추적하는데 보다 효과적임을 실험을 통하여 확인 할 수 있었다.

• Journal of KIISE:Software and Applications
• /
• v.33 no.4
• /
• pp.427-439
• /
• 2006

The SBF (Simple Boundary Follower) is a boundary-following algorithm, and is used mainly for image recognition and presentation. The SBF is very popular because of its simplicity and efficiency in tracing the boundary of an object from an acquired binary image; however, it does have two drawbacks. First, the SBF cannot consistently process inner or inner-outer corners according to the follower's position and direction. Second, the SBF requires movement operations for the non-boundary pixels that are connected to boundary pixels. The MSBF (Modified Simple Boundary Follower) has a diagonal detour step for preventing inner-outer corner inconsistency, but is still inconsistent with inner-corners and still requires extra movement operations on non-boundary pixels. In this paper, we propose the ISBF (Improved Simple Boundary Follower), which solves the inconsistencies and reduces the extra operations. In addition, we have classified the tour maps by paths from a current boundary pixel to the next boundary pixel and have analyzed SBF, MSBF, and ISBF. We have determined that the ISBF has no inconsistency issues and reduces the overall number of operations.

• Journal of Korea Game Society
• /
• v.20 no.2
• /
• pp.91-100
• /
• 2020

Life-and-death problem in Go is a fundamental problem to be overcome for implementing a computer Go. To solve it, an important consideration is to find out who surrounds or is surrounded between black and white players. To figure out the boundary between black and white groups, we applied an influence function and a contour tracing algorithm. We found that applying the Moore-neighbor tracing among various contour tracing algorithms can create boundaries, and also suggested the possibility of tremendously reducing the search space of a game tree.

• Journal of Korean Society for Geospatial Information Science
• /
• v.17 no.1
• /
• pp.61-69
• /
• 2009

By the advent of the high resolution satellite imagery, a ground-coverage included by a single satellite image is decreased. By the reason, there are increasing needs in image mosaicking technology to use images to various GIS fields. This paper describes an edge-based seamline extraction algorithm using edge information such as rivers, roads, buildings for image mosaicking. For this, we developed a method to track and link discontinuous edges extracted by edge detection operator. To estimate the effectiveness of the proposed algorithm, we applied the algorithm to IKONOS, KOMPSAT-1 and SPOT-5 satellite images. The experimental results showed that the algorithm successfully dealts with discontinuities caused by geometric differences in two images.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.2
• /
• pp.596-605
• /
• 1997

The synamic systrm emplohing the self-squared function, , $f(Z)=z^2+c$, provides the Mandelbrot set which classifies constants c using the divergence of the sequence starting from the origin.To speed-up the generation of Mandelbrot set images, two approaches , called as the divide-and-conquer technique and the triangular boundary tracing technique, have been developed.However , the divede-and-conquer technique genrates sequences of some pixels that so not affect graphical representations of the Mandelbrot set.The triangular boundary tracing tech-mique does noot represent some 8-connected components of the Mandelbrost set.In this paper, we prorose a new ;method which solves the 8-connectivity problem of triangular boundary tracing technique.This algorithm considers the divergence for only pixels which are essential to the graphical repressentation of the Mandelbrot set.It also foves good representations for 8-connected components like hairly structures.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.337-340
• /
• 2000

비디오객체 추출 기법은 MPEG-4 및 MPEG-7의 응용을 목표로 최근 활발하게 연구되고 있다. 이들 연구는 객체 추출의 전체적인 구조와 정확한 윤곽선 검출 알고리즘의 개발에 초점을 맞추고 있으며 제한적인 조건하에서 만족할 만한 성능을 내고 있다 그러나, 카메라 움직임, 객체의 빠른 움직임, 비강체 운동 등 보다 일반적인 상황에서는 객체 추출의 안정성이 떨어진다. 본 논문에서는 객체 추출의 안정성을 높이기 위해 칼라, 움직임 정보 등의 특징정보(feature)가 균일한 영역으로 사전분할하고, 분할된 균일영역을 추적하는 알고리즘을 제안한다. 추적된 균일 영역간의 경계는 각 영역의 통계적 분포와 영역경계의 윤곽선으로 정의된 에너지를 레벨셑 방법으로 최소화함으로 조정된다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.6
• /
• pp.1-8
• /
• 2000

This paper describes an algorithm for semantic video object tracking using semi automatic method. In the semi automatic method, a user specifies an object of interest at the first frame and then the specified object is to be tracked in the remaining frames. The proposed algorithm consists of three steps: object boundary projection, uncertain area extraction, and boundary refinement. The object boundary is projected from the previous frame to the current frame using the motion estimation. And uncertain areas are extracted via two modules: Me error-test and color similarity test. Then, from extracted uncertain areas, the exact object boundary is obtained by boundary refinement. The simulation results show that the proposed video object extraction method provides efficient tracking results for various video sequences compared to the previous methods.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.35T no.2
• /
• pp.28-34
• /
• 1998

In this paper, I'd like to make a suggestion for boundary line detect algorithm which is used 3-D image processing system in order to track moving object. Through this study, more than anything else, difference image method was adopted to detect moving object in input image. To detect moving object, I made use of detect windows constructed by 4's predictive areas and object area for the purpose of reducing processing time and its size was determined by the size of moving object and prediction parameter directed center position. And also, tracking camera was movable toward the direction of X, Y by DC motor. As a conclusion of the study proposed algorithm, I found out the following results that tracking error was less than 6% of total moving object size and maximum tracking time 2 seconds by toy-car simulation.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.5
• /
• pp.29-32
• /
• 2012

In this paper, we propose a novel method to extract muscle area from lumbar ultrasonographic image. The muscle area resided in lumbar area can be defined as the area between thoracic vertebra and subcutaneous fat area. A modified 4-directional contour tracing algorithm is designed to detect the boundaries and candidate areas are extracted and verified by the morphological characteristics of lumbar area. The experiment using 392 lumbar images verifies that the proposed method is sufficiently effective by showing over 94% accuracy in extraction.