• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.6
• /
• pp.1023-1030
• /
• 2020

We address the sampling set selection problem for arbitrary graph signals such that the original graph signal is reconstructed from the signal values on the nodes in the sampling set. We introduce a variation difference as a new indirect metric that measures the error of signal variations caused by sampling process without resorting to the eigen-decomposition which requires a huge computational cost. Instead of directly minimizing the reconstruction error, we propose a simple and fast greedy selection algorithm that minimizes the variation differences at each iteration and justify the proposed reasoning by showing that the principle used in the proposed process is similar to that in the previous novel technique. We run experiments to show that the proposed method yields a competitive reconstruction performance with a substantially reduced complexity for various graphs as compared with the previous selection methods.

• Journal of the Korea Society for Simulation
• /
• v.32 no.3
• /
• pp.67-74
• /
• 2023

A semiconductor fabrication facility(FAB) is one of the most capital-intensive and large-scale manufacturing systems which operate under complex and uncertain constraints through hundreds of fabrication steps. To improve fab performance with intuitive scheduling, practitioners have used weighted-sum scheduling. Since the determination of weights in the scheduling significantly affects fab performance, they often rely on simulation-based decision making for obtaining optimal weights. However, a large-scale and high-fidelity simulation generally is time-intensive to evaluate with an exhaustive search. In this study, we investigated three sampling methods (i.e., Optimal latin hypercube sampling(OLHS), Genetic algorithm(GA), and Decision tree based sequential search(DSS)) for the optimization. Our simulation experiments demonstrate that: (1) three methods outperform greedy heuristics in performance metrics; (2) GA and DSS can be promising tools to accelerate the decision-making process.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.18 no.10
• /
• pp.2523-2532
• /
• 1994

In this paper, active noise control is performed in a duct system using the periodic pulse train which corresponds to the periodic component of noise source as a reference signal. Control algorithm applied in this study is possible to eliminate the acoustic feedback which occurs in the conventional filtered-x and filtered-u LMS algorithm by using electrical reference signal and has the fast adaptation speed with low filter orders by using synchronous sampling method is discussed via computer simulations and experiments of case studies such as frequency modulation, amplitude modulation and frequency differency between source signal and reference signal.

• Journal of the Korean Statistical Society
• /
• v.26 no.4
• /
• pp.493-505
• /
• 1997

The analysis of binary data appears to many areas such as statistics, biometrics and econometrics. In many cases, data are often collected in which some observations are incomplete. Assume that the missing covariates are missing at random and the responses are completely observed. A method to Bayesian analysis of the binary regression model with incomplete data is presented. In particular, the desired marginal posterior moments of regression parameter are obtained using Meterpolis algorithm (Metropolis et al. 1953) within Gibbs sampler (Gelfand and Smith, 1990). Also, we compare logit model with probit model using Bayes factor which is approximated by importance sampling method. One example is presented.

• International Journal of Contents
• /
• v.9 no.2
• /
• pp.1-7
• /
• 2013

This paper proposes an efficient matching algorithm based on ASIFT (Affine Scale-Invariant Feature Transform) which is fully invariant to affine transformation. In our approach, we proposed a method of reducing similar measure matching cost and the number of outliers. First, we combined the Manhattan and Chessboard metrics replacing the Euclidean metric by a linear combination for measuring the similarity of keypoints. These two metrics are simple but really efficient. Using our method the computation time for matching step was saved and also the number of correct matches was increased. By applying an Optimized Random Sampling Algorithm (ORSA), we can remove most of the outlier matches to make the result meaningful. This method was experimented on various combinations of affine transform. The experimental result shows that our method is superior to SIFT and ASIFT.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.7
• /
• pp.3217-3238
• /
• 2018

In this paper, a depth image up-sampling method is put forward by using pixel classifying and jointed bilateral filtering. By analyzing the edge maps originated from the high-resolution color image and low-resolution depth map respectively, pixels in up-sampled depth maps can be classified into four categories: edge points, edge-neighbor points, texture points and smooth points. First, joint bilateral up-sampling (JBU) method is used to generate an initial up-sampling depth image. Then, for each pixel category, different refinement methods are employed to modify the initial up-sampling depth image. Experimental results show that the proposed algorithm can reduce the blurring artifact with lower bad pixel rate (BPR).

• The Transactions of the Korean Institute of Electrical Engineers B
• /
• v.48 no.9
• /
• pp.517-522
• /
• 1999

This paper addresses the issue of current sampling in a high performance AC drive system fed by a discontinuous PWM inverter. The effect of the sampling error due to the measurement delay produced by an input stage low pass filter and an A/D converter is described in the case of discontinuous PWM. To compensate for the sampling error, a method to estimate the delay time of the whole measurement system based on the measured current is proposed and its effectiveness is verified by experimental results. The proposed algorithm can automatically estimate the system delay introduced by the low pass filter and the A/D converter at the commissioning stage. By delaying the current sampling by the estimated value, experimental results indicate that more than 50% reduction of current ripple can be achieved.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.50 no.11
• /
• pp.809-817
• /
• 2022

The development of unmanned robots and UAVs has increased the need for path planning methods such as RRT^* algorithm. It mostly works well in various environments and is utilized in many fields. A lot of research has been conducted to obtain a better path in terms of efficiency through various modifications to the RRT^* algorithm, and the performance of the algorithm is continuously improved thanks to these efforts. In this study, a method using the limitation of sampling range is proposed as an extension of these efforts. Based on the idea that a path passing close to obstacles is similar to the optimal path in obstacle environments, nodes are produced around the obstacle. Also, rewiring algorithm is modified to quickly obtain the path. The performance of the proposed algorithm is validated by comparative analysis of the previous basic algorithm and the generated path is tracked by a UAV's kinematic model for further verification.

• Management Science and Financial Engineering
• /
• v.20 no.1
• /
• pp.27-32
• /
• 2014

This paper introduces three different simulation algorithms of the shifted Poisson distribution. The first algorithm is the inverse transform method, the second is the rejection sampling, and the third is gamma-Poisson hierarchy sampling. Three algorithms have different regions of parameters at which they are efficient. We numerically compare those algorithms with different sets of parameters. As an application, we give a simulation method of the constant elasticity of variance model.

• Communications for Statistical Applications and Methods
• /
• v.22 no.6
• /
• pp.557-573
• /
• 2015

In this paper we develop a Bayesian inference for a multiplicative double seasonal autoregressive (DSAR) model by implementing a fast, easy and accurate Gibbs sampling algorithm. We apply the Gibbs sampling to approximate empirically the marginal posterior distributions after showing that the conditional posterior distribution of the model parameters and the variance are multivariate normal and inverse gamma, respectively. The proposed Bayesian methodology is illustrated using simulated examples and real-world time series data.