• Communications for Statistical Applications and Methods
• /
• v.24 no.1
• /
• pp.1-13
• /
• 2017

This manuscript summarized advances in bootstrap methods for long-range dependent time series data. The stationary linear long-memory process is briefly described, which is a target process for bootstrap methodologies on time-domain and frequency-domain in this review. We illustrate time-domain bootstrap under long-range dependence, moving or non-overlapping block bootstraps, and the autoregressive-sieve bootstrap. In particular, block bootstrap methodologies need an adjustment factor for the distribution estimation of the sample mean in contrast to applications to weak dependent time processes. However, the autoregressive-sieve bootstrap does not need any other modification for application to long-memory. The frequency domain bootstrap for Whittle estimation is provided using parametric spectral density estimates because there is no current nonparametric spectral density estimation method using a kernel function for the linear long-range dependent time process.

• Journal of the Korea Computer Graphics Society
• /
• v.7 no.1
• /
• pp.11-17
• /
• 2001

Fractal image coding provides many promising qualities including the high compression ratio. The coding process however suffers from the long search time of domain block pool because the size of the domain block pool is often very large. In this paper, we introduce a hybrid domain block pool search method that combines the block classification and the variance based searching. This hybrid method makes use of the fact that the variance of a block is independent of the block classification. Thus, this hybrid method enhances the search speed by up to an O(number of classes) factor over the purely variance based searching method. An experimental result shows that our method enhances the search speed by up to 17 times over the purely variance based searching method. We also propose an adjustable variance based searching method that further enhances the search speed without noticeable loss of image quality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.10 no.6
• /
• pp.308-316
• /
• 1985

A new implementation of Block Adaptive filter in frequency domain is presented in this paper. Block digital filtering involves the calculation of a block or finite set of filter out put from a block of input values. A fast convergence algorithm of block adaptive filter is developed using Gordar theory and compared with the performance results of Satio algorithm and BLMS algorithm. Form the result we can be shown that the convergence state of given algorithm is not only faster than BLMS algorithm but also the resulting convergence error is less than the convergence error of Satio algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6A
• /
• pp.584-591
• /
• 2002

In this paper, we proposed a b1ocking artifact reduction algorithm using similarity and linear combination between blocks. In the proposed method, all of the blocks are classified into low frequency block and high frequency block according to the their DCT coefficients. And we defined range block which shows blocking artifacts, as block centered to block boundary and defied domain block as similar block with range block within search range. In the search procedure, we used sub-block's property of range block and similarity for more accurate searching. Finally blocking artifact reduction algorithm is performed using linear combination between searched domain block and blocky range block. The performance of the proposed method is investigated by computer simulation in comparison with the traditional methods. In the experimental results, Ire confirmed the better performance in the subjective by 0.04∼0.4 dB and objective image quality.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.10 no.2
• /
• pp.80-85
• /
• 2011

In this paper, I propose flexible base point used for a BTC(Block Truncation Coding). Halftoning images are used for printer by reducing the number of pixel depth. During over 20 years, many researches have been studied to apply this techniques to image compression. BTC algorithms are the compression methods using digital halftoning technique about images. In the BTC algorithm, an image block is divided into higher and lower domain compared with the mean of block. then the MAX and MIN representative values are evaluated by calculating the mean of higher and lower domain respectively. At a result, an image block(for example 88 size) is compressed into 64bits pixel representation and 16 bits of the MAX and MIN. And they also have been tried to sustain the image quality high after compression. In this paper, I found that there is some marginal possibility to enhance the image quality by adjusting the base point(generally mean of block) of existing algorithms.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.11
• /
• pp.62-71
• /
• 1996

In this paper we propose a method that improves PSNR at low bit rate and reduces computational complexity in fractal image coding based on discrete wavelet transform. The proposed method, which uses significant coefficient tree, improves PSNR of the reconstructed image and reduces computational comlexity of mapping domain block onto range block by matching only the significant coefficients of range block to coefficients of domain block. Also, the proposed method reduces error propagation form lower resolution subbands to higher resolution subbands by correcting error of lower resolution subbands. Some experimental results confirm that the proposed method reduces encoding and decoding time significantly and has fine reconstructed images having no blocking effect and clear edges at low bit rate.

• Journal of Korea Multimedia Society
• /
• v.7 no.12
• /
• pp.1665-1670
• /
• 2004

The general fractal image compression provides a high compression rate, but it requires a large encoding time. In order to overcome this disadvantage, many researchers have introduced various methods that reduce the total number of domain blocks considering their block similarities or control the number of searching domain block depending on its distribution. In this paper, we propose a method that can reduce the number of searching domain blocks employing the variance coherence of intensity values and also the number of range blocks requiring the domain block search through the classification of range blocks. This proposed method effectively reduces the encoding time and also a negligible drop of the quality as compared with the previous methods requiring the search of all range blocks.

• Journal of computational fluids engineering
• /
• v.21 no.1
• /
• pp.36-42
• /
• 2016

One of the obstacles on the grid generation for complex geometries with multi-block structured grids is the domain decomposition. In this paper, the domain decomposition for two-dimensional flow is studied using the flow characteristics. The potential flow equation with the source distribution on the panel surface is solved to extract the information of the flow. The current approach is applied to a two-dimensional cylinder and Bi-NACA0012 problems. The generated grids are applied to generic flow solvers and reasonable results are obtained. It can be concluded that the current methods is useful in the domain decomposition for the multi-block structured grid.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.466-472
• /
• 2007

Single carrier block transmission with frequency domain equalization(SC-FDE) has been shown to be a promising candidate in ultra-wideband(UWB) communications. In this paper, we analyze the performance of SC-FDE over UWB communications with channel estimation error. The probability density functions of the frequency domain minimum mean-squared error(MMSE) equalizer taps are derived in closed form. The error probabilities of single carrier block transmission with frequency domain MMSE equalization under imperfect channel estimation are presented and evaluated numerically. Compared with the simulation results, our semi-analytical analysis yields fairly accurate bit error rate performance, thus validating the use of the Gaussian approximation method in the performance analysis of the SC-FDE system with channel estimation error.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.61 no.4
• /
• pp.234-238
• /
• 2012

This paper proposes a multiplexed space-frequency block coding (SFBC) technique for single-carrier modulation with frequency domain equalization. Multiplexed space-frequency block coding technique for single-carrier modulation uses multiple groups of two transmitters and suppresses the interference signals of other SFBC groups at the receiver. In this paper, we reconfigure transmit signals to adapt them for multiplexed SFBC for single-carrier modulation with frequency domain equalization and receiver structures and propose a structure for transmitter and receiver, show its performance is better than the traditional algorithm by simulations.