• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.5
• /
• pp.609-614
• /
• 2009

The purpose of this paper is to design the metal object detection system for drive inside protection. To do this, we propose the algorithm for designing the color filter that can detect the metal object using fuzzy theory and the algorithm for detecting area of the driver's face using fuzzy skin color filter. Also, by using the proposed algorithm, we propose the algorithm for detecting the metallic object candidate regions. And, the metallic object color filter is then applied to find the candidate regions. Finally, we show the effectiveness and feasibility of the proposed method through some experiments.

• Journal of Broadcast Engineering
• /
• v.7 no.3
• /
• pp.248-261
• /
• 2002

In this paper, we proposed a new 3-dimensional(3-D) object-tracking algorithm that can control a stereo camera using a variable window mask supported by which uses ,B-D information and an optical BPEJTC. Hence, three-dimensional information characteristics of a stereo vision system, distance information from the stereo camera to the tracking object. can be easily acquired through the elements of a stereo vision system. and with this information, we can extract an area of the tracking object by varying window masks. This extractive area of the tracking object is used as the next updated reference image. furthermore, by carrying out an optical BPEJTC between a reference image and a stereo input image the coordinates of the tracking objects location can be acquired, and with this value a 3-D object tracking can be accomplished through manipulation of the convergence angie and a pan/tilt of a stereo camera. From the experimental results, the proposed algorithm was found to be able to the execute 3-D object tracking by extracting the area of the target object from an input image that is independent of the background noise in the stereo input image. Moreover a possible implementation of a 3-D tele-working or an adaptive 3-D object tracker, using the proposed algorithm is suggested.

• The KIPS Transactions:PartB
• /
• v.9B no.1
• /
• pp.99-104
• /
• 2002

Existing methods of object tracking use template matching, re-detection of object boundaries or motion information. The template matching method requires very long computation time. The re-detection of object boundaries may produce false edges. The method using motion information shows poor tracking performance in moving camera. In this paper, a robust object tracking algorithm is proposed, using projected motion and histogram intersection. The initial object image is constructed by selecting the regions of interest after image segmentation. From the selected object, the approximate displacement of the object is computed by using 1-dimensional intensity projection in horizontal and vortical direction. Based on the estimated displacement, various template masks are constructed for possible orientations and scales of the object. The best template is selected by using the modified histogram intersection method. The robustness of the proposed tracking algorithm has been verified by experimental results.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.9 no.4
• /
• pp.436-443
• /
• 1999

Most of the 3D object reconstruction techniques divide the object into multiplane and approximate the surfaces of the object. The Marching Cubes Algorithm which initializes the mesh structure using a given isovalue. and Delaunay Tetrahedrisation are widely used. Deformable models are well-suited for general object reconstruction because they make little assumptions about the shape to recover and they can reconstruct objects *om various types of datasets. Now, many researchers are studying the reconstruction systems based on a deformable model. In this paper, we propose a novel method for reconstruction of 3D objects. This method, for a 3D object composed of curved planes, compresses the 3D object based on the adaptive simplexmesh technique. It changes the pre-defined mesh structure, so that it may approach to the original object. Also, we redefine the geometric characteristics such as curvatures. As results of simulations, we show reconstruction of the original object with high compression and concentration of vertices towards parts of high curvature in order to optimize the shape description.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.2 s.302
• /
• pp.37-48
• /
• 2005

In this paper, a new object detection method for FLIR images is proposed. The proposed method consists of intensity ranking feature and a classification algerian using the feature. The intensity ranking feature is a representation of an image, from which intensity distribution is regularized. Each object candidate region is classified as object or non-object by the proposed classification algorithm which is based on the intensity ranking similarity between the candidate and object training images. Using the proposed algorithm pixel-wise detection results can be obtained without any additional candidate selection algorithm. In experimental results, it is shown that the proposed ranking feature is appropriate for object detection in a FLIR image and some vehicle detection results in the situation of existing noise, scale variation, and rotation of the objects are presented.

• Journal of KIISE:Software and Applications
• /
• v.33 no.9
• /
• pp.741-750
• /
• 2006

In this paper, we propose a method for reconstructing a 3D object (or a set of objects) from a 2D drawing provided by a designer. The input 2D drawing consists of a set of contours that may partially overlap each other or be self-overlapping. Accordingly, the resulting 3D object(s) may occlude each other or be self-occluding. The proposed method is composed of three major steps: 2D contour analysis, 3D skeleton computation, and 3D object construction. Our main contribution is to compute the 3D skeleton from the self-intersecting 2D counterpart. We formulate the 3D skeleton construction problem as a sequence of optimization problems, to shape the skeleton and place it in the 3D space while satisfying C1-continuity and intersection-free conditions. Our method is mainly for a silhouette-based sketching interface for the design of 3D objects including self-intersecting objects.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.7
• /
• pp.817-822
• /
• 2005

Recently tile study that exploits visual information for tile services of robot in indoor environments is active. Conventional image processing approaches are based on the pre-defined geometric models, so their performances are likely to decrease when they are applied to the uncertain and dynamic environments. For this, diverse researches to manage the uncertainty based on the knowledge for improving image recognition performance have been doing. In this paper we propose a Bayesian network modeling method for predicting the existence of target objects when they are occluded by other ones for improving the object detection performance of the service robots. The proposed method makes object relationship, so that it allows to predict the target object through observed ones. For this, we define the design method for small size Bayesian networks (primitive Bayesian netqork), and allow to integrate them following to the situations. The experiments are performed for verifying the performance of constructed model, and they shows $82.8\%$ of accuracy in 5 places.

• Journal of KIISE:Computing Practices and Letters
• /
• v.12 no.1
• /
• pp.56-65
• /
• 2006

Recently the study on service robots has been proliferated in many fields, and there are active developments for indoor services such as supporting for elderly people. It is important for robot to recognize objects and situations appropriately for effective and accurate service. Conventional object recognition methods have been based on the pre-defined geometric models, but they have limitations in indoor environments with uncertain situation such as the target objects are occluded by other ones. In this paper we propose a Bayesian network model to reason the probability of target objects for effective detection. We model the relationships between objects by activities, which are applied to non-static environments more flexibly. Overall structure is constructed by combining common-cause structures which are the units making relationship between objects, and it makes design process more efficient. We test the performance of two Bayesian networks for verifying the proposed Bayesian network model through experiments, resulting in accuracy of $86.5\%$ and $89.6\%$ respectively.

• Journal of the Korea Computer Graphics Society
• /
• v.13 no.1
• /
• pp.25-32
• /
• 2007

Computer graphics technology has advanced such that all objects can be represented within a computer display. However, because computer displays have a finite resolution, the variety of objects that can be realistically represented together in the same view is restricted by the difference in their relative size. In addition, objects cannot be rendered according to their physical properties in terms of real length units in current computer graphics technology. To solve these problems, we have defined a method that allows objects to be described using real-world physical property units, such as metric units, in a computer graphics system, and developed a 3D browser based on X3D, which implements the concept of relative proportion properties.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.2
• /
• pp.137-146
• /
• 1990

A series of images whose sized and resolutions differ by a constant factor are called an image pyramid. Because the images at high levels are small, large object can be detected on high levels of the pyramid at low cost, But in this way, the boundaries of objects are not accurately localized. Therefore the pyramid algorithms extracte the objects by segmentation the constructed image using bottom-up method and description it in an original resolution using inverse bottom-up method. In this paper, we can project an object down to the next lower level of the pyramid and apply to the boundary adjustment algorithm at that level to localize it more precisely. We repeat the process at successively lower levels. In this paper, we present a method of boundary adjustment using an image pyramid to obtain optimal boundary. The performance of the proposed algorithm is compared to those of the conventional method in term of subjective quality of object boundary.