• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.4
• /
• pp.2042-2059
• /
• 2019

Digital shadow puppet has traditionally relied on expensive motion capture equipments and complex design. In this paper, a low-cost driven technique is presented, that captures human pose estimation data with simple camera from real scenarios, and use them to drive virtual Chinese shadow play in a 2.5D scene. We propose a special method for extracting human pose data for driving virtual Chinese shadow play, which is called 2.5D human pose estimation. Firstly, we use the 3D human pose estimation method to obtain the initial data. In the process of the following transformation, we treat the depth feature as an implicit feature, and map body joints to the range of constraints. We call the obtain pose data as 2.5D pose data. However, the 2.5D pose data can not better control the shadow puppet directly, due to the difference in motion pattern and composition structure between real pose and shadow puppet. To this end, the 2.5D pose data transformation is carried out in the implicit pose mapping space based on self-network and the final 2.5D pose expression data is produced for animating shadow puppets. Experimental results have demonstrated the effectiveness of our new method.

• The KIPS Transactions:PartD
• /
• v.15D no.1
• /
• pp.87-98
• /
• 2008

In company with the demand of powerful processing units for embedded systems, the method to develop embedded software is also required to support the demand in new approach. In order to improve the resource utilization and system performance, software modeling techniques have to consider the features of hardware architecture. This paper proposes a partitioning technique of UML-based software models, which focus the generation of the allocatable software components into multiprocessor architecture. Our partitioning technique, at first, transforms UML models to CBCFGs(Constraint-Based Control Flow Graphs), and then slices the CBCFGs with consideration of parallelism and data dependency. We believe that our proposition gives practical applicability in the areas of platform specific modeling and performance estimation in model-driven embedded software development.

• ETRI Journal
• /
• v.35 no.6
• /
• pp.1029-1037
• /
• 2013

This paper introduces a novel and fast synthesizing method for 3D motions of quadrupedal animals that uses only a small set of motion capture data. Unlike human motions, animal motions are relatively difficult to capture. Also, it is a challenge to synthesize continuously changing animal motions in real time because animals have various gait types according to their speed. The algorithm proposed herein, however, is able to synthesize continuously varying motions with proper limb configuration by using only one single cyclic animal motion per gait type based on the biologically driven Froude number. During the synthesis process, each gait type is automatically determined by its speed parameter, and the transition motions, which have not been entered as input, are synthesized accordingly by the optimized asynchronous motion blending technique. At the start time, given the user's control input, the motion path and spinal joints for turning are adjusted first and then the motion is stitched at any speed with proper transition motions to synthesize a long stream of motions.

• Journal of the Korean Society for Precision Engineering
• /
• v.8 no.4
• /
• pp.84-94
• /
• 1991

In order to achieve high accuracy of teaching and increase productivity using industrial robots in polishing process of dies, an off-line task programming system was developed on IBM-PC/386 under WINDOWS 3.0 operating system. The internal structure and the machematical basis of CAMPoli are described. Surface modeling technique of polishing dies with sculptured surfaces is introduced by poing data interpolation methodology through the use of CL-data transmitted from conventional CAM system. Tool selection, polishing speed, polishing pressure and kinds of tool motions can be determined and selected by user specified polishing variables. Task creation and verification of polishing path via computer graphics simulation of polishing tool can be done by the menu- driven function of CAMPoli system. Post-processing module is attached to generate robot language. Some simulation results are provided as verification means of the system.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.22 no.1
• /
• pp.219-232
• /
• 2023

Mobility services need to change according to the regional characteristics of the target service area. Accordingly, analysis of mobility patterns and characteristics based on Origin-Destination (OD) data that reflect travel behaviors in the target service area is required. However, since conventional methods construct the OD data obtained from the administrative district-based zone system, it is hard to ensure spatial homogeneity. Hence, there are limitations in analyzing the inherent travel patterns of each mobility service, particularly for new mobility service like Demand Responsive Transit (DRT). Unlike the conventional approach, this study applies a data-driven clustering technique to conduct spatial analyses on OD travel patterns of regional mobility services based on reconstructed OD data derived from re-aggregation for original OD distributions. Based on the reconstructed OD data that contains information on the inherent feature vectors of the original OD data, the proposed method enables analysis of the spatial characteristics of regional mobility services, including public transit bus, taxi and DRT.

• Computers and Concrete
• /
• v.32 no.2
• /
• pp.217-232
• /
• 2023

Numerous studies have been performed on the behavior of pile foundations in cold regions. This study first attempted to employ artificial neural networks (ANN) to predict pile-bearing capacity focusing on pile data recorded primarily on cold regions. As the ANN technique has disadvantages such as finding global minima or slower convergence rates, this study in the second phase deals with the development of an ANN-based predictive model improved with an Elephant herding optimizer (EHO), Dragonfly Algorithm (DA), Genetic Algorithm (GA), and Evolution Strategy (ES) methods for predicting the piles' bearing capacity. The network inputs included the pile geometrical features, pile area (m²), pile length (m), internal friction angle along the pile body and pile tip (Ø°), and effective vertical stress. The MLP model pile's output was the ultimate bearing capacity. A sensitivity analysis was performed to determine the optimum parameters to select the best predictive model. A trial-and-error technique was also used to find the optimum network architecture and the number of hidden nodes. According to the results, there is a good consistency between the pile-bearing DA-MLP-predicted capacities and the measured bearing capacities. Based on the R2 and determination coefficient as 0.90364 and 0.8643 for testing and training datasets, respectively, it is suggested that the DA-MLP model can be effectively implemented with higher reliability, efficiency, and practicability to predict the bearing capacity of piles.

• Journal of Distribution Science
• /
• v.15 no.4
• /
• pp.33-40
• /
• 2017

Purpose - This study aims to examine the analysis of pattern on Arab countries consumers' preferences of the Korean Contents using social media, Facebook since Korean entertainment contents have been distributed in the global marketplace. Then we focus on developing Predictive model using a Data Mining Technique. Research design, data and methodology - In order to understand preference growth of Korean contents in Arabic countries, we- collected data from two popular Facebook pages: 'Korean movies and drama' and 'K-pop'. Then, we adopted a data-driven approach based on Data Mining techniques. Results - It is obvious that the number of likes for K-pop will increase for all North African and Middle Eastern countries, however concerning Korean Movies and Drama except Tunisia it is decreasing for Algeria, Egypt and Morocco. Also, concerning Saudi Arabia and United Arab Emirates, the number of likes will decrease for Korean Movies and Drama which is not the case for Iraq. Conclusions - It is noted in this study that K-contents such as drama, movie and music are sometimes a gateway to a wider interest in Korean culture, food and brands. Moreover, this study gives significant implications for developing predictive model to forecast Korean contents' consumption and preferences.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.5
• /
• pp.1-9
• /
• 2012

In this paper, we presents the modeling and implementation of the DDS(Direct Digital synthesizer) driven offset PLL(Pghase Locked Loop) with DAC(Digital Analog Converter) for coarse tune. The PLL synthesizer was designed for minimizing the size and offset frequency and DDS technique was used for ultra low noise and fast lock up time, also DAC was used for coarse tune. The output phase noise was analyzed by superposition theory with the phase noise transfer function and noise source modeling. the phase noise prediction was evaluated by comparing with the measured data. The designed synthesizer has ultra fast lock time within 6 usec and ultra low phase noise performance of -120 dBc/Hz at 10KHz offset frequency.

• Journal of the Korean Society for Precision Engineering
• /
• v.23 no.6 s.183
• /
• pp.166-173
• /
• 2006

In this study, a probe array has been developed for use in a data storage device that is based on scanning probe microscope (SPM) and MEMS technology. When recording data bits by poling the PZT thin layer and reading them by sensing its piezoresponse, commercial probes of which the tip heights are typically shorter than $3{\mu}m$ raise a problem due to the electrostatic forces occurring between the probe body and the bottom electrode of a medium. In order to reduce this undesirable effect, a poly-silicon probe with a high aspect-ratio tip was fabricated using a molding technique. Poly-silicon probes fabricated by the molding technique have several features. The tip can be protected during the subsequent fabrication processes and have a high aspect ratio. The tip radius can be as small as 15 nm because sharpening oxidation process is allowed. To drive the probe, electrostatic actuation mechanism was employed since the fabrication process and driving/sensing circuit is very simple. The natural frequency and DC sensitivity of a fabricated probe were measured to be 18.75 kHz and 16.7 nm/V, respectively. The step response characteristic was investigated as well. Overshoot behavior in the probe movement was hardly observed because of large squeeze film air damping forces. Therefore, the probe fabricated in this study is considered to be very useful in probe-based data storages since it can stably approach toward the medium and be more robust against external shock.

• Journal of Computing Science and Engineering
• /
• v.1 no.2
• /
• pp.177-194
• /
• 2007

Index selection is one of the most important decisions to take in the physical design of relational data warehouses. Indices reduce significantly the cost of processing complex OLAP queries, but require storage cost and induce maintenance overhead. Two main types of indices are available: mono-attribute indices (e.g., B-tree, bitmap, hash, etc.) and multi-attribute indices (join indices, bitmap join indices). To optimize star join queries characterized by joins between a large fact table and multiple dimension tables and selections on dimension tables, bitmap join indices are well adapted. They require less storage cost due to their binary representation. However, selecting these indices is a difficult task due to the exponential number of candidate attributes to be indexed. Most of approaches for index selection follow two main steps: (1) pruning the search space (i.e., reducing the number of candidate attributes) and (2) selecting indices using the pruned search space. In this paper, we first propose a data mining driven approach to prune the search space of bitmap join index selection problem. As opposed to an existing our technique that only uses frequency of attributes in queries as a pruning metric, our technique uses not only frequencies, but also other parameters such as the size of dimension tables involved in the indexing process, size of each dimension tuple, and page size on disk. We then define a greedy algorithm to select bitmap join indices that minimize processing cost and verify storage constraint. Finally, in order to evaluate the efficiency of our approach, we compare it with some existing techniques.