• Journal of the HCI Society of Korea
• /
• v.6 no.1
• /
• pp.9-16
• /
• 2011

The previous researches of 3D object modeling have been performed in a limited environment where a target object only exists. However, in order to model an object in the real environment, we need to consider a dynamic environment, which has various objects and a frequently changing background. Therefore, this paper presents a segmentation and tracking method for a foreground which includes a target object in the dynamic environment. By using depth information than color information, the foreground region can be segmented and tracked more robustly. In addition, the foreground region can be tracked on the sequential images by referring depth distributions of the foreground region because both the position and the status in the consecutive images of the foreground region are almost unchanged. Experimental results show that our proposed method can robustly segment and track the foreground region in various conditions of the real environment. Moreover, as an application of the proposed method, it is presented a method for modeling an object extracting the object regions from the foreground region that is segmented and tracked.

• Journal of the Semiconductor & Display Technology
• /
• v.19 no.2
• /
• pp.31-36
• /
• 2020

Most of the background subtraction algorithms show good performance in static scenes. In the case of dynamic scenes, they frequently cause false alarm to "temporal clutter", a repetitive motion within a certain area. In this paper, we propose a robust technique for the multiple interval pixel sampling (MIS) algorithm to handle highly dynamic scenes. An adaptive threshold scheme is used to suppress false alarms in low-confidence regions. We also utilize multiple background models in the foreground segmentation process to handle repetitive background movements. Experimental results revealed that our approach works well in handling various temporal clutters.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.805-807
• /
• 2005

본 논문에서는 동적 계획법(dynamic programming)과 이미지 세그먼트(segment)를 이용한 새로운 스테레오 정합(stereo matching)기법을 제안한다. 일반적으로 동적 계획법(dynamic programming)은 빠르면서도 비교적 정확하고, 조밀(dense)한 disparity map을 얻을 수 있다. 그러나 경계(boundary)근처의 폐색지역(occlusion region)이나, 텍스쳐가 적은 모호한 영역에서는 잘못된 결과를 유도할 수 있다. 본 논문에서는 이러한 문제점들을 해결하기 위해 먼저 이미지를 아주 작은 영역으로 분할(over-segmentation)하고, 이런 작은 영역들이 비슷한 disparity를 가질 것이라고 가정한다. 다음으로 동적 계획법(dynamic programming)을 통해 정합을 수행한다. 여기서 계산비용(cost)은 기존의 정합윈도우 안에서 세그먼트 영역을 적용한 새로운 비용함수를 사용하며, 이 새로운 비용함수를 통해 정확도를 높인다. 마지막으로 동적 계획법을 통하여 얻어진 조밀한 disparity map을 세그먼트 영역들의 시각특성(visibility)과 유사도(similarity)를 이용하여 에러를 찾아내고, 세그먼트 정합을 통해 수정함으로 정확한 disparity map을 찾아낸다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.6
• /
• pp.523-528
• /
• 2015

In this paper, we propose a new multiresolutional and dynamic approach of the EM algorithm. EM is a very popular and powerful clustering algorithm. EM, however, has problems that indexes multiresolution data and requires a priori information on a proper number of clusters in many applications, To solve such problems, the proposed EM algorithm can impose a multiresolution kd-tree structure in the E-step and allocates a cluster based on sequential data. To validate clusters, we use a merge criteria for cluster merging. We demonstrate the proposed EM algorithm outperforms for texture image segmentation.

• Proceedings of the IEEK Conference
• /
• 2001.06d
• /
• pp.89-92
• /
• 2001

In this paper, we propose a new approach for tracking a moving object in moving image sequences using active contour models and optical flow. In our approach object segmentation is achieved by active contours, and object tracking is done by motion estimation based on optical flow. To get more dynamic characteristics, Lagrangian dynamics combined to the active contour models. For the optical flow computation, a method, which is based on Spatiotempo-ral Energy Models, is employed to perform robust tracking under poor environments. A prototype real tracking system has been developed and applied to a contents-based video retrieval systems.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.55 no.4
• /
• pp.167-175
• /
• 2006

This paper presents a method to segment semiconductor wafer ID on poor quality images. The method is based on multiple templates and normalized gray-level correlation (NGC) method. If the lighting condition is not so good and hence, we can not control the image quality, target image to be inspected presents poor quality ID and it is not easy to identify and then recognize the ID characters. Conventional several method to segment the interesting ID regions fails on the bad quality images. In this paper, we propose a multiple template method, which uses combinational relation of multiple templates from model templates to match several characters of the inspection images. To find out the optimal solution of multiple template model in ID regions, we introduce newly-developed snake algorithm. Experimental results using images from real FA environment are presented.

• Journal of Multimedia Information System
• /
• v.8 no.1
• /
• pp.31-34
• /
• 2021

The classical HMM is defined by a parameter triple �� = (��, A, B), where each parameter represents a collection of probability distributions: initial state, state transition and output distributions in order. This paper proposes a new stationary parameter e = (e1, e2, …, eN) where N is the number of states and et = P(|xt = i, y) for describing how an input pattern y ends in state xt = i at time t followed by nothing. It is often said that all is well that ends well. We argue here that all should end well. The paper sets the framework for the theory and presents an efficient inference and training algorithms based on dynamic programming and expectation-maximization. The proposed model is applicable to analyzing any sequential data with two or more finite segmental patterns are concatenated, each forming a context to its neighbors. Experiments on online Hangul handwriting characters have proven the effect of the proposed augmentation in terms of highly intuitive segmentation as well as recognition performance and 13.2% error rate reduction.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.98.3-98
• /
• 2002

Vision-based systems for finding road lanes have to operate robustly under a wide variety of environ-mental conditions including large amount of scene clutters. This paper presents a method for finding the lane boundaries by combining a local line extraction method and dynamic programming as a search tool. The line extractor obtains an initial position estimation of road lane boundaries from the noisy edge fragments. Dynamic programming then improves the initial approximation to an accurate configuration of lane boundaries. Input image frame is divided into a few sub-regions along the vertical direction. The local line extractor then performs to extract candidate lines of road lanes in the...

• Proceedings of the KIEE Conference
• /
• 2003.07d
• /
• pp.2381-2383
• /
• 2003

This paper presents an effective approach to dynamic obstacle avoidance for mobile robot. The main concept of this approach includes modified polar mapping for recognition of the moving obstacle in vision-based robot systems. To simplify the segmentation of the moving obstacle from the background and to obtain its relative position data the modified polar mapping is proposed. Dynamic moving obstacles are avoided with a vision sensor and stationary obstacles are avoided with a sonar sensor.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.7
• /
• pp.105-115
• /
• 2011

In Vision-based Intelligent Transportation System(ITS) the segmentation of road region is a very basic functionality. Accordingly, in this paper, we propose a region segmentation method using adaptive pattern extraction technique to segment road regions and sky regions from original images. The proposed method consists of three steps; firstly we perform the initial segmentation using Mean Shift algorithm, the second step is the candidate region selection based on a static-pattern matching technique and the third is the region growing step based on a dynamic-pattern matching technique. The proposed method is able to get more reliable results than the classic region segmentation methods which are based on existing split and merge strategy. The reason for the better results is because we use adaptive patterns extracted from neighboring regions of the current segmented regions to measure the region homogeneity. To evaluate advantages of the proposed method, we compared our method with the classical pattern matching method using static-patterns. In the experiments, the proposed method was proved that the better performance of 8.12% was achieved when we used adaptive patterns instead of static-patterns. We expect that the proposed method can segment road and sky areas in the various road condition in stable, and take an important role in the vision-based ITS applications.