• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.11a
• /
• pp.290-293
• /
• 2003

다중 물체 추적은 움직이는 물체를 추출하고 검출된 정보와 물체 정보를 이용하여 움직임 궤도률 추적하는 것이다. 따라서 정확한 움직임 추적이 수행되려면 효율적인 물체의 추출이 선행 되어 져야 한다. 일반적으로 영상 분할 알고리즘은 다양한 증류의 영상에 대한 물체의 수학적 모델이 찌대로 설정되어 있지 않기 때문에 물체를 정확하게 분리해 내기 어렵다. 그러나 물체의 추출에 주로 처리 속도가 빠른 배경영상을 이용한 차(difference) 영상 기법과 반 자동 영상분할인 Snake Model이 갖는 Active Contour 알고리즘과 같이 물체 추출 과정에서 물체의 정의니 semantic 정보를 부여 한다면 개선된 영상 분할의 결과를 얻을 수 있다. 따라서 차 영상 기법과 semantic 정보를 가진 영상분할 알고리즘은 동영상에서 움직임 물체의 VOP(Video Object Plane)를 생성하는 매우 현실적인 방법이다. 본 논문에서는 영상의 상위 레벨Semantic 정보를 이용하기 위해 변형 Snake Model를 이용한 영상분할 방법을 이용하여 영상을 추출한다. 추출된 물체는 윤곽선(곡선) 정보와 함께 에지 성분의 기울기에서 얻은 특징 점을 이용하여 물체를 추적해 나간다.

• Journal of Advanced Navigation Technology
• /
• v.16 no.5
• /
• pp.846-852
• /
• 2012

The result of imaging segmentation becomes different with the parameters involved in the segmentation algorithms; therefore, the parameters for the optimal segmentation have been found through a try and error. In this paper, we propose the method to find the best values of parameters involved in the area-based active contour method using three-way ANOVA. The segmentation result applied by three-way ANOVA is compared with the optimal segmentation which is drawn by user. We use the global consistency rate for comparing two segmentations. Finally, we estimate the main effects and interactions between each parameter using three-way ANOVA, and then calculate the point and interval estimate to find the best values of three parameters. The proposed method will be a great help to find the optimal parameters before working the motion segmentation using piecewise constant model.

• Journal of the Institute of Convergence Signal Processing
• /
• v.6 no.1
• /
• pp.15-22
• /
• 2005

In this paper, we propose a face recognition system by using the CCD color image. We first get the face candidate image by using YCbCr color model and adaptive skin color information. And we use it initial curve of active contour model to extract face region. We use the Eye map and mouth map using color information for extracting facial feature from the face image. To obtain center point of Log-polar image, we use extracted facial feature from the face image. In order to obtain feature vectors, we use extracted coefficients from DCT and wavelet transform. To show the validity of the proposed method, we performed a face recognition using neural network with BP learning algorithm. Experimental results show that the proposed method is robuster with higher recogntion rate than the conventional method for the rotation and scale variant.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.385-386
• /
• 2009

활성 윤곽선 모델은 스네이크 모델이라고도 하며 영상에서 물체의 경계를 검출하기위한 효과적인 방법으로 사용되고 있다. 본 논문에서는 초기 윤곽선 문제와 효과적인 경계선 검출을 위해 다해상도 기반의 유전자 알고리즘을 이용한 활성 윤곽선 모델을 제안한다. 입력영상의 해상도를 영상 피마리드 기법으로 저해상도로 축소시키고 초기 윤곽선을 설정한다. 설정된 윤곽선상의 연속된 두 좌표를 유전인자로 선택하고, 유전 연산자를 적용하여 물체의 경계를 찾아간다. 경계가 검출된 저해상도 영상을 단계적으로 확대하여, 보간될 영역의 국부적 활성 윤곽선 에너지를 계산하여 최소 에너지를 갖는 위치에 새로운 윤곽선 좌표를 삽입하여 경계를 형성한다. 제안된 방법은 초기 윤곽선의 위치에 상관없이 경계선을 검출했으며, 형태가 복잡한 물체의 경우에도 효과적으로 경계선을 검출하고 계산 복잡도를 감소시켰다.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.1
• /
• pp.1-7
• /
• 2011

Terrain, building location and area, and building shape information is in need of implementing 3D map. This paper proposes a method of extracting a building area by an improved semi-automatic snake algorithm. The method consists of 3-stage: pre-processing, initializing control points, and applying an improved snake algorithm. In the first stage, after transforming a satellite image to a gray image and detecting the approximate edge of the gray image, the method combines the gray image and the edge. In the second stage, the user looks for the center point of a building and the system sets the circular or rectangular initial control points by an procedural method. In the third stage, the enhanced snake algorithm extracts the building area. In particular, this paper sets the one tenn of the snake in a new way in order to use the proposed method for specializing building area extraction. Finally, this paper evaluated the performance of the proposed method using sky view satellite image and it showed that the matching percentage to the exact building area is 75%.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.9
• /
• pp.1972-1978
• /
• 2010

AAM(Active Appearance Model) is one of the most effective ways to detect deformable 2D objects and is a kind of mathematical optimization methods. The cost function is a convex function because it is a least-square function, but the search space is not convex space so it is not guaranteed that a local minimum is the optimal solution. That is, if the initial value does not depart from around the global minimum, it converges to a local minimum, so it is difficult to detect face contour correctly. In this study, an AAM-based face tracking algorithm is proposed, which is robust to various lighting conditions and backgrounds. Eye detection is performed using SIFT and Genetic algorithm, the information of eye are used for AAM's initial matching information. Through experiments, it is verified that the proposed AAM-based face tracking method is more robust with respect to pose and background of face than the conventional basic AAM-based face tracking method.

• Journal of Digital Convergence
• /
• v.12 no.7
• /
• pp.239-245
• /
• 2014

In this paper, a weighted value wrinkle detection method is suggested based on the analysis on the entire facial features such as face contour, face size, eyes and ears. Firstly, the main facial elements are detected with AAM method entirely from the input screen images. Such elements are mainly composed of shape-based and appearance methods. These are used for learning the facial model and for matching the face from new screen images based on the learned models. Secondly, the face and background are separated in the screen image. Four points with the biggest possibilities for wrinkling are selected from the face and high wrinkle weighted values are assigned to them. Finally, the wrinkles are detected by applying Canny edge algorithm for the interested points of weighted value. The suggested algorithm adopts various screen images for experiment. The experiments display the excellent results of face and wrinkle detection in the most of the screen images.

• Journal of Korea Multimedia Society
• /
• v.10 no.9
• /
• pp.1117-1124
• /
• 2007

In this paper, an algorithm that can define the threshold value automatically proposed in order to detect a brain ventricle in MRI brain images. After the wavelet transform, edge sharpness, which means the average magnitude of detail signals on the contour of the object, was computed by using the magnitude of horizontal and vertical detail signals. The contours of a brain ventricle were detected by increasing the threshold value repeatedly and computing edge sharpness. When the edge sharpness became maximal, the optimal threshold was determined, and the detection of a brain ventricle was accomplished finally. In this paper, we compared the proposed algorithm with the geodesic active contour model numerically and verified the efficiency of the proposed algorithm by applying real MRI brain images.

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

• The KIPS Transactions:PartB
• /
• v.8B no.5
• /
• pp.539-548
• /
• 2001

In this paper, we propose that fast tracking algorithm for moving object is separated from background, using partial boundary line information. After detecting boundary line from input image, we track moving object by using the algorithm which takes boundary line information as feature of moving object. we extract moving vector on the imput image which has environmental variation, using high-performance BMA, and we extract moving object on the basis of moving vector. Next, we extract boundary line on the moving object as an initial feature-vector generating step for the moving object. Among those boundary lines, we consider a part of the boundary line in every direction as feature vector. And then, as a step for the moving object, we extract moving vector from feature vector generated under the information of the boundary line of the moving object on the previous frame, and we perform tracking moving object from the current frame. As a result, we show that the proposed algorithm using feature vector generated by each directional boundary line is simple tracking operation cost compared with the previous active contour tracking algorithm that changes processing time by boundary line size of moving object. The simulation for proposed algorithm shows that BMA operation is reduced about 39% in real image and tracking error is less than 2 pixel when the size of feature vector is [$10{\times}5$] using the information of each direction boundary line. Also the proposed algorithm just needs 200 times of search operation bout processing cost is varies by the size of boundary line on the previous algorithm.