• Proceedings of the Korean Statistical Society Conference
• /
• 2000.11a
• /
• pp.241-246
• /
• 2000

A simple random sample is taken from a population and a particular survey item is subject to nonresponse that corresponds to random subsampling of the sampled values within adjustment cells. Our object is to estimate Bayesian probability interval of the population mean.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1998.06e
• /
• pp.7-10
• /
• 1998

일반적으로 매우 낮은 차단주파수를 가지는 FIR 저역통과 필터의 경우 그 과도영역의 폭이 상대적으로 매우 좁기 때문에 긴 임펄스 응답을 가지게 되며, 따라서 많은 계산량을 필요로 하게 된다. 본 논문에서는, FIR 필터의 계수를 서브샘플링(subsampling)하여 계산량의 현저한 감소를 도모하고, 그로 인하여 발생하는 주파수 영역의 이미지를 IIR 필터를 사용하여 제거하는 기법을 제안한다. IIR 필터로 인하여 발생하는 위상의 왜곡은 앞단의 FIR 필터의 계수를 조절함으로써 상쇄시킬 수 있다. 제안된 알고리듬을 채택할 경우, 동일한 성능의 일반 FIR 필터에 비하여 사용하는 메모리의 양은 거의 같으나, 계산량은 수십분의 일까지 감소시킬 수 있다.

• Communications for Statistical Applications and Methods
• /
• v.22 no.2
• /
• pp.201-207
• /
• 2015

Support vector machine (SVM) is a well known kernel-trick supervised learning tool. This study proposes a working scheme for kernel-trick regression and classification (KtRC) as a SVM alternative. KtRC fits the model on a number of random subsamples and selects the best model. Empirical examples and a simulation study indicate that KtRC's performance is comparable to SVM.

• Journal of Broadcast Engineering
• /
• v.17 no.3
• /
• pp.491-502
• /
• 2012

Flat panel-based parallax barrier or lenticular based 3D display devices that have been developed recently are designed to feel depth. In order to see a three-dimensional(3D) image by the display device, a multi-view image displayed on the flat panel must be regenerated from images of multi-views using a subsampling method. Previous subsampling methods are focused on reducing crosstalk. In this paper, we focus on a misalignment that is occurred on manufacture process of slanted parallax barrier based autostereoscopic display device. Therefore, we propose a interleaving method that considers tilt of slanted parallax barrier, aperture size, and distance between an autostereoscopic display device and a viewer to see a 3D image regardless of a viewer position.

• Journal of Broadcast Engineering
• /
• v.28 no.1
• /
• pp.3-20
• /
• 2023

A computer-generated hologram (CGH) is a digitally calculated and recorded hologram in which the amplitude and phase information of an image is transmitted in free space. The CGH is in the form of a complex hologram, but it is converted into a phase-only hologram to display through a phase-only spatial light modulator (SLM). In this paper, in the process of including the amplitude information of an object in the phase information, when a technique that includes subsampling such as DPAC is used, we showed experimentally that the bandwidth of the phase-only hologram increases, and as a result, aliasing that was not present in the complex hologram can occur. In addition, it was experimentally shown that it is possible to generate a high-quality phase-only hologram by restricting the spatial frequency range even at a distance where the numerical reconstruction performance is degraded by aliasing.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.12
• /
• pp.73-86
• /
• 1993

This paper proposes an automatic variable block truncation coding (BTC) method. It selects the block size automatically based on the mode of the discontinutiy measure of blocks. The combination of an automatic block-size determination scheme and the conventional BTC results in the proposed automatic variable BTC techniques. For color images, subsampling in I and Q chrominance components is adopted along with the variable BTC. To show the effectiveness of the proposed algorithm, its simulation results are compared to those of the several conventional BTC algorithms for monochrome and color test images. Computer simulation shows that the proposed algorithm gives better performance than the conventional ones based on the subjective and objective performance evaluation.

• The Journal of the Acoustical Society of Korea
• /
• v.15 no.2E
• /
• pp.24-32
• /
• 1996

A rigorous theory for modeling, analysis, optimum nonseparable filter bank in multidimensional M-band quantized subband codec are developed in this paper. Each pdf-optimized quantizer is modeled by a nonlinear gain-plus-additive uncorrelated noise and embedded into the subband structure. We then decompose the analysis/synthesis filter banks into their polyphase components and shift the down-and up-samplers to the right and left of the analysis/synthesis polyphase matrices respectively. Focusing on the slow clock rate signal between the samplers, we derive the exact expression for the output mean square quantization error by using spatial-invariant analysis. We show that this error can be represented by two uncorrelated components : a distortion component due to the quantizer gain, and a random noise component due to fictitious uncorrelated noise at the uantizer. This mean square error is then minimized subject to perfect reconstruction (PR) constraints and the total bit allocation for the entire filter bank. The algorithm gives filter coefficients and subband bit allocations. Numerical design example for the optimum nonseparable orthonormal filter bank is given with a quincunx subsampling lattice.

• Communications for Statistical Applications and Methods
• /
• v.23 no.4
• /
• pp.355-362
• /
• 2016

Ensemble methods often help increase prediction ability in various predictive models by combining multiple weak learners and reducing the variability of the final predictive model. In this work, we demonstrate that ensemble methods also enhance the accuracy of prediction under kernel ridge regression and kernel logistic regression classification. Here we apply bagging and random forests to two kernel-based predictive models; and present the procedure of how bagging and random forests can be embedded in kernel-based predictive models. Our proposals are tested under numerous synthetic and real datasets; subsequently, they are compared with plain kernel-based predictive models and their subsampling approach. Numerical studies demonstrate that ensemble approach outperforms plain kernel-based predictive models.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.939-940
• /
• 2008

In this paper, we propose a novel image clustering method based on weighted sub-sampling to reduce clustering time and the number of clusters for target detection and tracking. Our proposed method first obtain sub-sampling image with specific weights which is the number of target pixels in sampling region. After performing clustering procedure, the cluster center position is properly obtained using weights of target pixels in the cluster. Therefore, our proposed method can not only reduce clustering time, but also obtain proper cluster center.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.9
• /
• pp.77-83
• /
• 1997

We present a fast adaptive block matching algorithm using variable search area and subsampling to estimate motion vector more exactly. In the presented method, the block is classified into one of three motion categories: zero motion vector block, medium-motion bolck or high-motion block according to mean absolute difference of the block. By the simulation, the computation amount of the presented methoe comparable to three step search algorithm and new three step search algorithm. In the fast image sequence, the PSNR of our algorithm increased more than TSS and NTSS, because our algorithm estimated motion vector more accurately.