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

This paper presents an effective heuristic task scheduling algorithm for multiprocessor systems. To execute task scheduling effectively which is defined as an allocation of m's tasks onto n's processors(m > n), several problems almost at NP-hard should be cleaned up. The purpose of the task scheduling obtains the minimum execution time by mapping the tasks on a system topology or reduces the total execution time to give a minimum system topology. In order to solve this problem, in this paper, the task scheduling is done by redefining a task graph to a reconstructed task graph (RTG). An RTG is obtained by merging or copying nodes to equal the number of nodes on each level of the task graph to the number of processors of the system topology and then directly scheduled to the system topology. This method obtains a fast scheduling time and a simple scheduling method, and near-optimal execution time without executing steps such as the refinement step and the duplication step after the task scheduling.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.8
• /
• pp.31-40
• /
• 2012

In this paper, we propose a method of synthesizing faces of a user and an animation character using a 3D face model. The suggested method first receives two orthogonal 2D face images and extracts major features of the face through the template snake. It then generates a user-customized 3D face model by adjusting a generalized face model using the extracted facial features and by mapping texture maps obtained from two input images to the 3D face model. Finally, it generates a user-customized animation character by synthesizing the generated 3D model to an animation character reflecting the position, size, facial expressions, and rotational information of the character. Experimental results show some results to verify the performance of the suggested algorithm. We expect that our method will be useful to various applications such as games and animation movies.

• Journal of Internet Computing and Services
• /
• v.15 no.3
• /
• pp.11-19
• /
• 2014

The natural user interface/experience (NUI/NUX) is used for the natural motion interface without using device or tool such as mice, keyboards, pens and markers. Up to now, typical motion recognition methods used markers to receive coordinate input values of each marker as relative data and to store each coordinate value into the database. But, to recognize accurate motion, more markers are needed and much time is taken in attaching makers and processing the data. Also, as NUI/NUX framework being developed except for the most important intuition, problems for use arise and are forced for users to learn many NUI/NUX framework usages. To compensate for this problem in this paper, we didn't use markers and implemented for anyone to handle it. Also, we designed multi-modal NUI/NUX framework controlling voice, body motion, and facial expression simultaneously, and proposed a new algorithm of mouse operation by recognizing intuitive hand gesture and mapping it on the monitor. We implement it for user to handle the "hand mouse" operation easily and intuitively.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.243-249
• /
• 2013

In waste repository environment, we can process the waste history efficiently for reuse by recording the history trajectory of the vehicle which loaded waste and the dumping position of the waste vehicle. By mapping the unloaded waste to 3D and by extracting the dumping point, a new method was implemented so as to record the final dumping position and the waste content under various experiments. In this paper, we developed the algorithm which tracking the vehicle and deciding the moment of dumping in landfills. We first trace the position of vehicle using the difference image between current image and background image and then we decide the stop point from the shape of vehicle route and detect the dumping point by comparing the dumping image with the image that vehicle is stopping. From the camera parameters, The transform method between screen coordinate and real coordinate of landfills is proposed.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.5
• /
• pp.548-555
• /
• 2001

In this paper, we proposed a HVS(human visual system) model-based digital image watermarking which is not only invariant to rotation and translation but also more robust to lossy compression, cropping, and scaling as compared to the conventional method. Fourier transform and log-polar mapping is used to make the proposed algorithm invariant to rotation and translation, and in addition, watermark energy is embedded maximally based on spatial frequency sensitivity of HVS without the deterioration of the invisibility. As a result, the robustness of watermarking is improved both in general image processing operations such as cropping, low pass filtering, and lossy compression and in geometrical transforms such as rotation, translation, and scaling. And, by disjoint embedding of the watermark and the template without intersection, the deterioration of invisibility and robustness is prevented. Experimental results show that proposed watermarking is about 30~75 [%] more robust af compared to the conventional methods.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.4
• /
• pp.391-396
• /
• 2003

This paper proposes a new approach that converts continuous-valued attributes to categorical-valued ones considering the distribution of target attributes(classes). In this approach, It can be possible to get optimal interval boundaries by considering the distribution of data itself without any requirements of parameters. For each attributes, the distribution of target attributes is projected to one-dimensional space. And this space is clustered according to the criteria like as the density value of each target attributes and the amount of overlapped areas among each density values of target attributes. Clusters which are made in this ways are based on the probabilities that can predict a target attribute of instances. Therefore it has an interval boundaries that minimize a loss of information of original data. An improved performance of proposed discretization method can be validated using C4.5 algorithm and UCI Machine Learning Data Repository data sets.

• Journal of Biomedical Engineering Research
• /
• v.24 no.2
• /
• pp.61-68
• /
• 2003

This paper presents a quantitative analysis method for fall in sick times of the cerebral infarction patients using three types of magnetic resonance image, which play an important role in deciding method of medical treatment. For this object, image characteristics obtained by three radiographic methods of MRI and their relation were analyzed by means of object centered hierarchical Planning method. This methode presents an approach to the knowledge based processes for image interpretation and analysis. To compare three type of MRI. a multiple warping algorithm and affine transform method performed for image matching. Then each fall in sick times level of cerebral infarction was quantified and pseudo-color mapping performed by comparing gray level value one another according to Previously obtained hand maid data. The result of this study was compared to a medical doctors decision.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.4
• /
• pp.430-436
• /
• 2014

Matrix-star and Half-Pancake graphs are modified versions of Star graphs, and has some good characteristics such as node symmetry and fault tolerance. This paper analyzes embedding between Matrix-star and Half-Pancake graphs. As a result, Matrix-star graphs $MS_{2,n}$ can be embedded into Half-Pancake graphs $HP_{2n}$ with dilation 5 and expansion 1. Also, Half Pancake Graphs, $HP_{2n}$ can be embedded into Matrix Star Graphs, $MS_{2,n}$ with the expansion cost, O(n). This result shows that algorithms developed from Star Graphs can be applied at Half Pancake Graphs with additional constant cost because Star Graphs, $S_n$ is a part graph of Matrix Star Graphs, $MS_{2,n}$.

• Journal of Broadcast Engineering
• /
• v.22 no.6
• /
• pp.850-853
• /
• 2017

In this paper, we propose an image analysis system based on omnidirectional image and object tracking image display using super wide angle camera. In order to generate spherical images, the projection process of converting from two wide-angle images to the equirectangular panoramic image was performed and the spherical image was expressed by converting rectangular to spherical coordinate system. Object tracking was performed by selecting the desired object initially, and KCF(Kernelized Correlation Filter) algorithm was used so that robust object tracking can be performed even when the object's shape is changed. In the initial dialog, the file and mode are selected, and then the result is displayed in the new dialog. If the object tracking mode is selected, the ROI is set by dragging the desired area in the new window.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.06a
• /
• pp.1034-1039
• /
• 2005

SALM(Simultaneous localization and mapping) and AI(Artificial intelligence) have been active research areas in robotics for two decades. In particular, localization is one of the most important tasks in mobile robot research. Until now expensive sensors such as a laser sensor have been used for mobile robot localization. Currently, the proliferation of RFID technology is advancing rapidly, while RFID reader devices, antennas and tags are becoming increasingly smaller and cheaper. So, in this paper, the smart floor using passive RFID tags is proposed and, passive RFID tags are mainly used for identifying location of the mobile robot in the smart floor. We discuss a number of challenges related to this approach, such as tag distribution (density and structure), typing and clustering. In the smart floor using RFID tags, the localization error results from the sensing area of the RFID reader, because the reader just knows whether the tag is in the sensing range of the sensor and, until now, there is no study to estimate the heading of mobile robot using RFID tags. So, in this paper, two algorithms are suggested to. The Markov localization method is used to reduce the location(X,Y) error and the Kalman Filter method is used to estimate the heading($\theta$) of mobile robot. The algorithms which are based on Markov localization require high computing power, so we suggest fast Markov localization algorithm. Finally we applied these algorithms our personal robot CMR-P3. And we show the possibility of our probability approach using the cheap sensors such as odometers and RFID tags for mobile robot localization in the smart floor