• IEMEK Journal of Embedded Systems and Applications
• /
• v.12 no.3
• /
• pp.121-130
• /
• 2017

NAND flash memory has advantages of non-volatility, little power consumption and fast access time. However, it suffers from inability that does not provide to update-in-place and the erase cycle is limited. Moreover, the unit of read/write operation is a page and the unit of erase operation is a block. Therefore, erase operation is slower than other operations. The AGC, the proposed garbage collection policy focuses on not only garbage collection time reduction for real-time guarantee but also wear-leveling for a flash memory lifetime. In order to achieve above goals, we define three garbage collection operating modes: Fast Mode, Smart Mode, and Wear-leveling Mode. The proposed policy decides the garbage collection mode depending on system CPU usage rate. Fast Mode selects the dirtiest block as victim block to minimize the erase operation time. However, Smart Mode selects the victim block by reflecting the invalid page number and block erase count to minimizing the erase operation time and deviation of block erase count. Wear-leveling Mode operates similar to Smart Mode and it makes groups and relocates the pages which has the similar update time. We implemented the proposed policy and measured the performance compare with the existing policies. Simulation results show that the proposed policy performs better than Cost-benefit policy with the 55% reduction in the operation time. Also, it performs better than Greedy policy with the 87% reduction in the deviation of erase count. Most of all, the proposed policy works adaptively according to the CPU usage rate, and guarantees the real-time performance of the system.

• Journal of Broadcast Engineering
• /
• v.4 no.2
• /
• pp.127-133
• /
• 1999

The conventional fractal image compression based on discrete wavelet transform uses the fixed block size in fractal coding and reduces PSNR at low bit rate. This paper proposes a fractal image coding based on discrete wavelet transform which improves PSNR by using variable block size in fractal coding. In the proposed method. the absolute values of discrete wavelet transform coefficients are computed. and the discrete wavelet transform coefficients of different highpass subbands corresponding to the same spatial block are assembled. and the fractal code for the range block of each range block level is assigned. and then a decision tree C. the set of choices among fractal coding. "0" encoding. and scalar quantization is generated and a set of scalar quantizers q is chosen. And then the wavelet coefficients. fractal codes. and the choice items in the decision tree are entropy coded by using an adaptive arithmetic coder. This proposed method improved PSNR at low bit rate and could achieve a blockless reconstructed image. As the results of experiment. the proposed method obtained better PSNR and higher compression ratio than the conventional fractal coding method and wavelet transform coding.rm coding.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.5 s.305
• /
• pp.95-102
• /
• 2005

When images compressed with block-based compression techniques are transmitted over a noisy channel, unexpected block losses occur. In this paper, we present a post-processing-based block recovery scheme using Haar wavelet features. No consideration of the edge-direction, when recover the lost blocks, can cause block-blurring effects. The proposed directional recovery method in this paper is effective for the strong edge because exploit the varying neighboring blocks adaptively according to the edges and the directional information in the image. First, the adaptive selection of neighbor blocks is performed based on the energy of wavelet subbands (EWS) and difference of DC values (DDC). The lost blocks are recovered by the linear interpolation in the spatial domain using selected blocks. The method using only EWS performs well for horizontal and vertical edges, but not as well for diagonal edges. Conversely, only using DDC performs well diagonal edges with the exception of line- or roof-type edge profiles. Therefore, we combined EWS and DDC for better results. The proposed methods out performed the previous methods using fixed blocks.

• The KIPS Transactions:PartB
• /
• v.14B no.5
• /
• pp.321-328
• /
• 2007

In this paper, we propose a fast and dynamic Region-of-Interest coding method using the adaptive code-block discrimination algorithm in JPEG2000 images which complements the implicit ROI coding method and the modified implicit ROI coding method. For reducing the time of discriminating the code block, the proposed method estimates the characteristics of the shape of ROI and makes the shape of boundaries, and classifies the patterns of each code block. The method improves the preferred processing and loss of wavelet coefficients of background within the ROI code blocks by adaptively classifying the code blocks with the percentage of content of the wavelet coefficients using the thresholds of ROI and background. Also, the priority control of wavelet coefficients of background within ROI code block supports the rapid ROI coding by processing in batch based on patterns unlike the existing methods that process with unit of wavelet coefficients. To show the usefulness of this method, we compared this to the existing methods. There is no difference in performance, but we confirmed very speedy in processing time.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.57-60
• /
• 2000

This paper presents a new adaptive fast motion estimation algorithm along with its architecture. The conventional algorithm such as full - search algorithm, three step algorithm have some disadvantages which are related to the amount of computation, the quality of image and the implementation of hardware, the proposed algorithm uses spatial correlation and a slope of motion vector in order to reduce the amount of computation and preserve good image quality, The proposed algorithm is better than the conventional Block Matching Algorithm(BMA) with regard to the amount of computation and image quality. Also, we propose an efficient at chitecture to implement the proposed algorithm. It is suitable for real time processing application.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.231-234
• /
• 2001

In this paper, we present a robust watermarking technique based on a DCT-domain watermarking approach and an order statistic(OS) filter. The proposed technique inserts one watermark into each of four coefficients within a 2 ${\times}$ 2 block which is scanned on DCT coefficients in the zig-zag ordering from the medium frequency range. The detection algorithm uses an adaptive trimmed mean operator as a local estimator of the embedded watermark to obtain the desired robustness in the presence of additive Gaussian noise and JPEG compression attacks. The performance is analyzed through statistical analysis and numerical experiments. It is shown that the robustness properties against additive noise and JPEG compression attacks are more enhanced than the previous techniques.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.3
• /
• pp.1-8
• /
• 1996

This paper proposes a novel transversal filter and an optimal LMS algorithm, and show how these can be realized as an adaptive equalizer. The transversal filter consists of a walsh and block pulse functions. in the LMS algorithm with equalizers, the convergence factor is an improtant design parameter because it governs stability and convergence speed. The conventional adaptation techniques use a fixed time constant convergence factor by the trial and error method. In this paper, an optimal method in the choice of the convergence factor is proposed. The proposed algorithm is obtrained that is tailored for each filter tap and is updated at each iteration. The performance of the proposed algorithm is compared iwth those of the conventional TDL and DFT equalizers by computer simulations.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2014.06a
• /
• pp.26-27
• /
• 2014

This paper presents an adaptive interpolation filtering scheme for the High Efficiency Video Coding (HEVC) standard. In regards to interpolation for motion estimation and compensation, the conventional HEVC employs 8-tap and 4-tap filters for luma and chroma samples, respectively. Coefficients in such filters are determined by discrete cosine transform (DCT). In the proposed scheme, boundary strength values are stored after the execution of the deblocking filter. For each block, the sum of boundary strength values is calculated to indicate whether its region is complex or simple. Consequently, based on the region classification, 12-tap and 8-tap interpolation filters are used for complex and simple regions, respectively. This process is applied to luma sample interpolation only. Simulation results show 1.8% average BD-rate reduction compared to the conventional method.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2015.07a
• /
• pp.211-214
• /
• 2015

본 논문은 적응적 휘도 성분 부호화(Adaptive Luminance Coding)알고리듬을 이용한 블록의 움직임을 고려한 장면전환 감지 성능을 개선시키는 알고리듬을 제안하고자 한다. 기존의 장면전환 기법에서는 단순 물체의 움직임도 장면전환으로 인식하는 문제가 발생하는 점을 착안하여 본 논문에서는 적응적 휘도 성분 부호화와 블록 매칭 오류를 활용하여 보다 정확한 장면전환 기법을 제안하고자 한다. 실험결과를 통해 제안하는 방법이 기존 방법보다 높은 Precision과 Recall을 보이는 것을 확인할 수 있다.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.921-922
• /
• 2008

In this paper, we propose a lossless compression algorithm using adaptive DPCM(Differential Pulse Coded Modulation) for enhancing the compression ratio. To improve the compression efficiency, various DPCM modification algorithms have been proposed. Proposed algorithm presents 16 DPCM methods and adaptively selects the DPCM method for each block. The experimental results show that proposed DPCM algorithm has better performance on compression ratio than JPEG standard.