• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권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
• /
• 제42권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.

• 제어로봇시스템학회논문지
• /
• 제15권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.

• 대한전자공학회논문지SP
• /
• 제46권2호
• /
• pp.78-88
• /
• 2009

본 논문에서는 LDA를 이용한 얼굴 인식에서 발생하는 small sample size 문제를 해결하기 위한 효율적인 방법인 resampling 방법을 제안한다. 기존에는 regularization method를 사용하여 small sample size 문제를 해결하였는데, 이 방법을 사용하면 클래스내 분산행렬의 특이성을 없앨 수 있지만, 클래스내 분산행렬과 상수를 곱하는 과정에서 상수 값을 임의로 정해 주어야 하고, 이 상수 값에 따라 인식률이 개선되지 않을 수 있다는 문제점이 발생한다. 제안된 resampling 방법을 이용하여 학습 데이터의 수를 늘리면, regularization method보다 개선된 인식률을 얻을 수 있고, 또한 경험적으로 상수 값을 지정해 주는 과정을 거치지 않아도 되는 장점이 있다.

• Communications for Statistical Applications and Methods
• /
• 제21권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
• /
• 제24권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.

• 대한전자공학회논문지SP
• /
• 제39권2호
• /
• pp.50-55
• /
• 2002

영상 리샘플링의 전형적인 방법은 원래의 디지털 영상을 연속 모델에 맞춘 뒤 원하는 샘플링율로 다시 샘플링하는 접근방식에 기초한다. B-스플라인 함수는 다른 함수에 비해 오실레이션이 적어 연속 모델에 주로 사용되어 온 함수이다. 이 논문의 주 목표는 비정규 최적 리샘플링 알고리즘의 유도이다. 이 알고리즘을 유도하기 위해서 세단계의 근사화가 필요하다: 1) 역행렬 연산을 통한 B-스플라인 계수 구하기, 2) 직교 투사 이론에 의해 유도된 최적 리샘플링 알고리즘을 이용하여 변환된 B-스플라인 계수 구하기, 3) 간접B-스플라인 변환을 통해 결과를 다시 신호 영역으로 바꾸기. 이러한 방법을 통해 정규 리샘플링에서 그 우수성이 입증된 B-spline을 비정규 리샘플링에서도 이용할 수 있으며 실험 결과를 통해 성능의 우수성을 확인할 수 있다.

• Industrial Engineering and Management Systems
• /
• 제16권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.

• 한국환경과학회지
• /
• 제20권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.

• 한국군사과학기술학회지
• /
• 제25권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.