• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.2
• /
• pp.462-482
• /
• 2014

This paper proposes a new resampling detection method for images that detects whether an image has been resampled and recovers the corresponding resampling rate. The proposed method uses a given set of zeroing masks for various resampling factors to evaluate the convolution values of the input image with the zeroing masks. Improving upon our previous work, the proposed method detects more resampling factors by checking for some periodicity with an approximate detection mechanism. The experimental results demonstrate that the proposed method is effective and efficient.

• ETRI Journal
• /
• v.42 no.6
• /
• pp.932-942
• /
• 2020

To recover the neural activity from Magnetoencephalography (MEG) and Electroencephalography (EEG) measurements, we need to solve the inverse problem by utilizing the relation between dipole sources and the data generated by dipolar sources. In this study, we propose a new approach based on the implementation of a particle filter (PF) that uses minimum sampling variance resampling methodology to track the neural dipole sources of cerebral activity. We use this approach for the EEG data and demonstrate that it can naturally estimate the sources more precisely than the traditional systematic resampling scheme in PFs.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.6
• /
• pp.619-625
• /
• 2009

FastSLAM which uses the Rao-Blackwellized particle filter is one of the famous solutions to SLAM (Simultaneous Localization and Mapping) problem that estimates concurrently a robot's pose and surrounding environment. However, the particle depletion problem arises from the loss of the particle diversity in the resampling process of FastSLAM. Then, the performance of FastSLAM degenerates over the time. In this work, DIR (Density Information-based Resampling) technique is proposed to solve the particle depletion problem. First, the cluster is constructed based on the density of each particle, and the density of each cluster is computed. After that, the number of particles to be reserved in each cluster is determined using a linear method based on the distance between the highest density cluster and each cluster. Finally, the resampling process is performed by rejecting the particles which are not selected to be reserved in each cluster. The performance of the DIR proposed to solve the particle depletion problem in FastSLAM was verified in computer simulations, which significantly reduced both the RMS position error and the feature error.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.2
• /
• pp.78-88
• /
• 2009

In many face recognition problems, the number of available images is limited compared to the dimension of the input space which is usually equal to the number of pixels. This problem is called as the 'small sample size' problem and regularization methods are typically used to solve this problem in feature extraction methods such as LDA. By using regularization methods, the modified within class matrix becomes nonsingu1ar and LDA can be performed in its original form. However, in the process of adding a scaled version of the identity matrix to the original within scatter matrix, the scale factor should be set heuristically and the performance of the recognition system depends on highly the value of the scalar factor. By using the proposed resampling method, we can generate a set of images similar to but slightly different from the original image. With the increased number of images, the small sample size problem is alleviated and the classification performance increases. Unlike regularization method, the resampling method does not suffer from the heuristic setting of the parameter producing better performance.

• Communications for Statistical Applications and Methods
• /
• v.21 no.5
• /
• pp.387-393
• /
• 2014

Recurrent gap times are analyzed with diverse methods under several assumptions such as a marginal model or a frailty model. Several resampling techniques have been recently suggested to estimate the covariate effect; however, these approaches can be applied with a time-fixed covariate. According to simulation results, these methods result in biased estimates for a time-varying covariate which is often observed in a longitudinal study. In this paper, we extend a resampling method by incorporating new weights and sampling scheme. Simulation studies are performed to compare the suggested method with previous resampling methods. The proposed method is applied to estimate the effect of an educational program on traffic conviction data where a program participation occurs in the middle of the study.

• Communications for Statistical Applications and Methods
• /
• v.24 no.4
• /
• pp.339-351
• /
• 2017

Resampling approaches were the first techniques employed to compute a variance for the Gini coefficient; however, many authors have shown that an analysis of the Gini coefficient and its corresponding variance can be obtained from a regression model. Despite the simplicity of the regression approach method to compute a standard error for the Gini coefficient, the use of the proposed regression model has been challenging in economics. Therefore in this paper, we focus on a comparative study among the regression approach and resampling techniques. The regression method is shown to overestimate the standard error of the Gini index. The simulations show that the Gini estimator based on the modified regression model is also consistent and asymptotically normal with less divergence from normal distribution than other resampling techniques.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.2
• /
• pp.50-55
• /
• 2002

The standard approach of image resampling is to fit the original image with continuous model and resample the function at a desired rate. We used the B-spline function as the continuous model because it oscillates less than the others. The main purpose of this paper is the derivation of a nonuniform optimal resampling algorithm. To derive it, needing approximation can be computed in three steps: 1) determining the I-spline coefficients by matrix inverse process, 2) obtaining the transformed-spline coefficients by the optimal resampling algorithm derived from the orthogonal projection theorem, 3) converting of the result back into the signal domain by indirect B-spline transformation. With these methods, we can use B-spline in the non-uniform resampling, which is proved to be a good kernel in uniform resampling, and can also verify the applicability from our experiments.

• Industrial Engineering and Management Systems
• /
• v.16 no.1
• /
• pp.92-102
• /
• 2017

In this paper, we consider a typical health care system via the help of Wireless Sensor Network (WSN) for wireless patient tracking. The wireless patient tracking module of this system performs localization out of samples of Received Signal Strength (RSS) variations and tracking through a Particle Filter (PF) for WSN assisted by multiple transmit-power information. We propose a modified PF, Kullback-Leibler Distance (KLD)-resampling PF, to ameliorate the effect of RSS variations by generating a sample set near the high-likelihood region for improving the wireless patient tracking. The key idea of this method is to approximate a discrete distribution with an upper bound error on the KLD for reducing both location error and the number of particles used. To determine this bound error, an optimal algorithm is proposed based on the maximum gap error between the proposal and Sampling Important Resampling (SIR) algorithms. By setting up these values, a number of simulations using the health care system's data sets which contains the real RSSI measurements to evaluate the location error in term of various power levels and density nodes for all methods. Finally, we point out the effect of different power levels vs. different density nodes for the wireless patient tracking.

• Journal of Environmental Science International
• /
• v.20 no.1
• /
• pp.93-106
• /
• 2011

Physically-based resampling scheme for roughness coefficient of surface runoff considering the spatial landuse distribution was suggested for the purpose of effective operational application of recent grid-based distributed rainfall runoff model. Generally grid scale(mother scale) of hydrologic modeling can be greater than the scale (child scale) of original GIS thematic digital map when the objective basin is wide or topographically simple, so the modeler uses large grid scale. The resampled roughness coefficient was estimated and compared using 3 different schemes of Predominant, Composite and Mosaic approaches and total runoff volume and peak streamflow were computed through distributed rainfall-runoff model. For quantitative assessment of biases between computational simulation and observation, runoff responses for the roughness estimated using the 3 different schemes were evaluated using MAPE(Mean Areal Percentage Error), RMSE(Root-Mean Squared Error), and COE(Coefficient of Efficiency). As a result, in the case of 500m scale Mosaic resampling for the natural and urban basin, the distribution of surface runoff roughness coefficient shows biggest difference from that of original scale but surface runoff simulation shows smallest, especially in peakflow rather than total runoff volume.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.25 no.4
• /
• pp.412-424
• /
• 2022

Since traditional derivative-based optimization for noisy simulation shows bad performance, evolutionary algorithms are considered as substitutes. Especially in case when outputs are binary, more simulation trials are needed to get near-optimal solution since the outputs are discrete and have high and heterogeneous variance. In this paper, we propose a genetic algorithm called SARAGA which adopts dynamic resampling and fitness approximation using surrogate. SARAGA reduces unnecessary numbers of expensive simulations to estimate success probabilities estimated from binary simulation outputs. SARAGA allocates number of samples to each solution dynamically and sometimes approximates the fitness without additional expensive experiments. Experimental results show that this novel approach is effective and proper hyper parameter choice of surrogate and resampling can improve the performance of algorithm.