• International Journal of Control, Automation, and Systems
• /
• v.6 no.1
• /
• pp.109-118
• /
• 2008

We present two estimators for discrete non-Gaussian and nonstationary probability density estimation based on a dynamic Bayesian network (DBN). The first estimator is for off line computation and consists of a DBN whose transition distribution is represented in terms of kernel functions. The estimator parameters are the weights and shifts of the kernel functions. The parameters are determined through a recursive learning algorithm using maximum likelihood (ML) estimation. The second estimator is a DBN whose parameters form the transition probabilities. We use an asymptotically convergent, recursive, on-line algorithm to update the parameters using observation data. The DBN calculates the state probabilities using the estimated parameters. We provide examples that demonstrate the usefulness and simplicity of the two proposed estimators.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.5
• /
• pp.63-71
• /
• 2011

In this paper, we propose a new real time image retargeting method which preserves the contents of an image. Since the conventional seam carving which is the well-known content-based image retargeting technology uses the dynamic programming method, the repetitive update procedure of the accumulation minimum energy map is absolutely needed. The energy map update procedure cannot avoid the processing time delay because of many operations by the image full-searching. The proposed method calculates the diffusion region of each seam candidates in the accumulation minimum energy map in order to reduce the update processing time. By using the diffusion region, several seams are extracted at the same time and the update number of accumulation energy map is reduced. Therefore, although the fast processing is possible, the quality of an image can be analogously maintained with an existing method. The experimental results show that the proposed method can preserve the contents of an image and adjust the image size on a real-time.

• ETRI Journal
• /
• v.38 no.6
• /
• pp.1197-1206
• /
• 2016

Performing continuous skyline queries of dynamic data sets is now more challenging as the sizes of data sets increase and as they become more volatile due to the increase in dynamic updates. Although previous work proposed support for such queries, their efficiency was restricted to small data sets or uniformly distributed data sets. In a production database with many concurrent queries, the execution of continuous skyline queries impacts query performance due to update requirements to acquire exclusive locks, possibly blocking other query threads. Thus, the computational costs increase. In order to minimize computational requirements, we propose a method based on a multi-layer grid structure. First, relational data object, elements of an initial data set, are processed to obtain the corresponding multi-layer grid structure and the skyline influence regions over the data. Then, the dynamic data are processed only when they are identified within the skyline influence regions. Therefore, a large amount of computation can be pruned by adopting the proposed multi-layer grid structure. Using a variety of datasets, the performance evaluation confirms the efficiency of the proposed method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.6
• /
• pp.1266-1272
• /
• 2004

Location-Based Services(LBS) give rise to location-dependent queries of which results depend on the positions of moving objects. Because positions of moving objects change continuously, indexes of moving object must perform update operations frequently for keeping the changed position information. Existing spatial index (Grid File, R-Tree, KDB-tree etc.) proposed as index structure to search static data effectively. There are not suitable for index technique of moving object database that position data is changed continuously. In this paper, I propose a dynamic hashing index that insertion/delete costs are low. The dynamic hashing structure is that apply dynamic hashing techniques to combine a hash and a tree to a spatial index. The results of my extensive experiments show the dynamic hashing index outperforms the $R^$ $R^*$-tree and the fixed grid.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.3
• /
• pp.523-531
• /
• 2007

In this paper, we are going to develop a newly designed indexing scheme which is compatible to manage the moving objects and propose a cost model of the scheme. We propose a dynamic hashing index that insertion/delete costs are low. The dynamic hashing structure is that apply dynamic hashing techniques to combine a hash and a tree to a spatial index. We analyzed the dynamic index structure and the cost model by the frequent position update of moving objects and verified through a performance assessment experiment. The results of our extensive experiments show that the newly proposed indexing schemes(Dynamic Hashing Index) are much more efficient than the traditional the fixed grid and R-tree.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.139-141
• /
• 2006

무선 센서 네트워크에서 이벤트 영역을 탐지하는데 있어 이동성을 가진 target objects의 첫 boundary information을 탐지하는 것도 중요하지만 탐지 후 변화하는 boundary information을 지속적으로 반영하는 것 또한 매우 중요하다. 따라서 본 논문에서는 boundary information의 지속적인 반영방법에 대해, Event의 발생빈도수에 따른 clustering update 모델링과 특정 상황에 따른 cluster를 재구성해야 하는 방안을 비교 분석한 후 이에 대한 클러스터링의 에너지 효율적인 방법에 대해서 제안하고 있다.

• The Bulletin of The Korean Astronomical Society
• /
• v.38 no.2
• /
• pp.101.2-101.2
• /
• 2013

We present a new computational fluid dynamic (CFD) simulation code. The code employs the moving and polyhedral unstructured mesh scheme, which is known as a superior approach to the conventional SPH (smoothed particle hydrodynamics) and AMR (adaptive mesh refinement) schemes. The code first generates unstructured meshes by the Voronoi tessellation at every time step, and then solves the Riemann problem for surfaces of every Voronoi cell to update the hydrodynamic states as well as to move former generated meshes. For the second-order accuracy, the MUSCL-Hancock scheme is implemented. To increase efficiency for generating Voronoi tessellation we also develop the incremental expanding method, by which the CPU time is turned out to be just proportional to the number of particles, i.e., O(N). We will discuss the applications of our code in the context of cosmological simulations as well as numerical experiments for galaxy formation.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2016.05a
• /
• pp.305-307
• /
• 2016

The purpose of this paper is to determine the optimal values of the gain parameters used in the tracking module for a highly dynamic warship. The algorithm of the tracking module uses the ${\alpha}-{\beta}-{\gamma}$ filter to compute accurate estimates and update the state variables, that is, positions, velocity and acceleration. The filtering coefficients ${\alpha}$, ${\beta}$ and ${\gamma}$ are determined from set values of the damping parameter, ${\xi}$. Optimization is achieved by plotting a range of the damping parameter ${\xi}$ against the corresponding residual error and then selecting the best value of ${\xi}$ with the minimum residual error. Optimal values of the smoothing coefficients are subsequently computed from the selected damping parameter, ${\xi}$.

• Journal of Korea Multimedia Society
• /
• v.7 no.12
• /
• pp.1729-1736
• /
• 2004

This paper proposes an efficient collision detection method in the dynamic spatial subdivisions for the MMORPG engine which requires realtime interactions. An octree is a suitable structure for static scenes or terrain processing. An octree spatial subdivision enhances rendering speed of scenes. Current spatial subdivisions tend to be highly optimized for efficient traversal, but are difficult to update quickly for a changing geometry. When an object moves to the outside extent for the spatial subdivisions, the acceleration structure would normally have to be rebuilt. The OSP based on a tree is used to divide dynamically wide outside which is the subject of 3D MMORPG. TBV does not reconstruct all tree nodes of OSP and has reduced rebuilding times by TBV information of a target node. A collision detection is restricted to those objects contained in the visibility range of sight by using the information established in TBV. We applied the HBV and ray tracing for an efficient collision detection.

• International Journal of Precision Engineering and Manufacturing
• /
• v.9 no.1
• /
• pp.12-18
• /
• 2008

This paper describes two run-to-run controllers, a nonlinear multiple exponential-weight moving-average (NMEWMA) controller and a dynamic model-tuning minimum-variance (DMTMV) controller, for photolithography processes. The relationships between the input recipes (exposure dose and focus) and output variables (critical dimensions) were formed using an experimental design method, and the photolithography process model was built using a multiple regression analysis. Both the NMEWMA and DMTMV controllers could update the process model and obtain the optimal recipes for the next run. Quantified improvements were obtained from simulations and real photolithography processes.