• The Transactions of the Korea Information Processing Society
• /
• v.4 no.6
• /
• pp.1495-1507
• /
• 1997

Among a number of approaches to text compression, adaptive dictionary schemes based on a sliding window have been very frequently used due to their high performance. The LZ77 algorithm is the most efficient algorithm which implements such adaptive schemes for the practical use of text compression. This paperpresents a VLSI architecture designed for processing the LZ77 algorithm in parallel. Compared with the other VLSI architectures developed so far, the proposed architecture provides the more viable solution to high performance with regard to its throughput, efficient implementation of the VLSI systolic arrays, and hardware scalability. Indeed, without being affected by the size of the sliding window, our system has the complexity of O(N) for both the compression and decompression and also requires small wafer area, where N is the size of the input text.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.6
• /
• pp.83-88
• /
• 2005

In this paper, detection based - adaptive windowed nonlinear filters(DB-AWNF) are proposed for removing one-side impulse noise in infrared image. They are composed of impulse detector and window-size-variable median filters. Impulse detector checks whether current pixel is impulse or not using range function and nonlinear location estimator. If impulse is detected, current pixel is filtered according to four kinds of local masks by use of median filter. If not. current pixel is delivered to output like identity filter. In qualitative view, the proposed could have removed heavy corrupted noise up to $20\%$ and reserved the details of image. In quantitative view, PSNR was measured. The proposed could have 13 - 31[dB] more improved performance than those of median($3{\times}3$) filter and 18 - 25[dB] more improved performance than those of median($5{\times}5$) filter.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.08a
• /
• pp.73-76
• /
• 2008

We present a area-based method for stereo matching using varying weights. A central problem in a area-based stereo matching is different result from selecting a window size. Most of the previous window-based methods iteratively update windows. However, the iterative methods very sensitive the initial disparity estimation and are computationally expensive. To resolve this problem, we proposed a new function to assign weights to pixels using features. To begin with, we extract features in a given stereo images based on edge. We adjust the weights of the pixels in a given window based on correlation of the stereo images. Then, we match pixels in a given window between the reference and target images of a stereo pair. The proposed method is compared to existing matching strategies using both synthetic and real images. The experimental results show the improved accuracy of the proposed method.

• Journal of Broadcast Engineering
• /
• v.16 no.6
• /
• pp.902-915
• /
• 2011

Recently in the area-based stereo matching field, Adaptive Support-Weight (ASW) method that weights matching cost adaptively according to the luminance intensity and the geometric difference shows promising matching performance. However, ASW requires more computational cost than other matching algorithms do and its real-time implementation becomes impractical. By applying Integral Histogram technique after approximating to the Bilateral filter equation, the computational time of ASW can be restricted in constant time regardless of the support window size. However, Integral Histogram technique causes loss of the matching accuracy during approximation process of the original ASW equation. In this paper, we propose a novel algorithm that maintains the ASW algorithm's matching accuracy while reducing the computational costs. In the proposed algorithm, we propose Sub-Block method that groups the pixels within the support area. We also propose the method adjusting the disparity search range depending on edge information. The proposed technique reduces the calculation time efficiently while improving the matching accuracy.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.10
• /
• pp.2371-2377
• /
• 2010

As the substantial increment in program complexity and appearance of mega program, the programs need to be divided to small tasks with multiple partitions and performed with a priority based scheduling. And also, a program development has to be progressed according to diversify of development environment. For instance, there are some restrictions upon O/S environment such as embedded O/S or windows. Therefore, the adaptive scheduling technique which performs multiple task partitioning process, regardless environment or O/S, is suggested. In this study, In this study, the adaptive scheduling technique algorithm and its applied examples are described.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.2
• /
• pp.183-190
• /
• 2013

In this paper, we propose a spatially adaptive noise detection and removal algorithm for a single degraded image. Under the assumption that an observed image is Gaussian-distributed, the noise information is estimated by local statistics of degraded image, and the degree of the additive noise is detected by the local statistics of the estimated noise. In addition, we describe a noise removal method taking a modified Gaussian filter which is adaptively determined by filter parameters and window size. The experimental results demonstrate the capability of the proposed algorithm.

• Journal of Korea Society of Industrial Information Systems
• /
• v.20 no.2
• /
• pp.45-56
• /
• 2015

In this paper we propose a very rapid moving object tracking method for an object-based auto focus on a smart phone camera. By considering the limit of non-learning approach on low-performance platforms, we use a sliding-window detection technique based on histogram features. By adapting the integral histogram, we solve the problem of the time-consuming histogram computation on each sub-window. For more speed up, we propose a local candidate search, and an adaptive scaling template method. In addition, we propose to apply a stabilization term in the matching function for a stable detection location. In experiments on our dataset, we demonstrated that we achieved a very rapid tracking performance demonstrating over 100 frames per second on a PC environment.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.9 no.6
• /
• pp.768-775
• /
• 1998

The equalizer is the central part of the receiver and its performance significantly affects the overall performance of the system in the mobile communication. A proposed equalizer is composed of the channel estimator, MLSE based on the Viterbi algorithm and GMSK decoder. The approximation of GMSK with QPSK has great impact on the equalizer design, because it allows us to use the existing simple and efficient algorithms for designing optimal QPSK equalizer. In order to estimate efficiently channel, we use a sliding window algorithm based on energy calculation and cross-correlator. And also a tuning scheme is presented in order to improve the equalizer performance. Simulation results indicate that a proposed equalizer meets the GSM standards easily in terms of performance.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.10
• /
• pp.556-568
• /
• 2003

This paper presents and analyzes the performance of a weighted-window based cache replacement policy for the efficient media caching in streaming media cache servers. The proposed policy makes, for each cached object, use of the reference count, reference time, amount of media delivered to clients and, in particular, the periodic patterns of user requests. Also, by giving weights to the recently referenced media contents, the replacement policy adequately and swiftly reflects the ever-changing characteristics of users preferences. The simulation studies show that the performance of the proposed policy has improved over the conventional policies such as LRU, LFU and SEG - in terms of hit ratio, byte hit ratio, delayed start and cache input.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.3
• /
• pp.47-54
• /
• 2016

In this paper, we propose a new opportunistic routing scheme based on timed bargaining game. The proposed algorithm effectively formulates the opportunistic routing mechanism as an repeated bargaining model using timed learning method. Additionally, we formulate a new contention window adjusting scheme for reduce collision rate. Simulation results indicate that the proposed scheme has excellent performance than other existing schemes under widely diverse VANET environments.