• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.686-688
• /
• 2010

The supply of context information is increasing with the propagation of ubiquitous computing environment. Recently, as context information is being collected through electronic tags and sensors attached to the environment, we need methods to efficiently store and search large volumes of data. This paper describes the application of the RLE (Run Length Encoding) compression method for sensors that continuously collect data in USN/RFID terminals.Time information is marked on the data and one data block is generated and saved. This paper proposes a storage method that allows us to quickly search data of the desired time and place by recording time information in continuous data.

• 전자공학회논문지 IE
• /
• v.45 no.3
• /
• pp.5-12
• /
• 2008

We propose efficient scan testing method capable of reducing the test data and power dissipation for digital logic circuits. The proposed testing method is based on a hybrid run-length encoding which reduces test data storage on the tester. We also introduce modified Bus-invert coding method and scan cell design in scan cell reordering, thus providing increased power saving in scan in operation. Experimental results for ISCAS'89 benchmark circuits show that average power of 96.7% and peak power of 84% are reduced on the average without fault coverage degrading. We have obtained a high reduction of 78.2% on the test data compared the existing compression methods.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2008.10a
• /
• pp.722-725
• /
• 2008

In this paper, we propose a new approach for fast generation of CGHs of a 3-D object by using the run-length encoding and N-LUT methods. In this approach, object points to be involved in calculation of the CGH pattern can be dramatically reduced and as a result a significant increase of computational speed can be obtained.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.7
• /
• pp.23-33
• /
• 1996

This paper deals with the design of a recursively-indexed binary code for facsimile soruces and its performance. Sources used here are run-lengths of white pixels form higher-resolution facsimile. The modified huffman code used for G.3 facsimile is chosen for the performance comparison. Experiments confirm the fact that recursive indexing preserves the entropy of a memoryless geometric source: the entropy of recursively-indexed physical surce iwth roughly geometric distributin remains within 2% of the empirical source entropy. The designed recursively-indexed binary codes consist of a code applied to text-type documents and to graphics - type documents is compared iwth that of the modified huffman code. Numerical resutls show that the modified huffman code performs well for text-type documents and not equally well for graphics-tyep documents. On the other hand, recursively-indexed binary codes have shown a better performance for graphics-type documents whose distribution are similar to a geometric distribution. Specifically, the code rates of recursively-indexed binary codes with 60 codewords are from 8% to 20% of the empirical source entropy smaller than that of th emodified huffman code with 91 codewords.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.1 no.3
• /
• pp.97-103
• /
• 2008

In this paper, $256{\times}256$ input image is classified into a validity block and an edge block of $8{\times}8$ block for image compression. DCT(Discrete Cosine Transform) is executed only for the DC coefficient that is validity coefficients for a validity block. Predict the position where a quantization coefficient becomes 0 for an edge block, I propose new algorithm to execute DCT in the reduced region. Not only this algorithm that I proposed reduces computational complexity of FDCT(Forward DCT) and IDCT(Inverse DCT) and decreases encoding time and decoding time. I let compressibility increase by accomplishing other stability verticality zigzag scan by the block size that was classified for each block at the time of huffman encoding each. In addition, the algorithm that I suggested reduces Run-Length by accomplishing the level verticality zigzag scan that is good for a classified block characteristic and, I offer the compressibility that improved thereby.

• The Journal of the Korea Contents Association
• /
• v.5 no.4
• /
• pp.188-196
• /
• 2005

This paper presents a new test data compression and low power scan test method that can reduce test time and power consumption. A proposed method can reduce the scan-in power and test data volume using a modified scan cell reordering algorithm and hybrid adaptive encoding method. Hybrid test data compression method uses adaptively the Golomb codes and run-length codes according to length of runs in test data, which can reduce efficiently the test data volume compare to previous method. We apply a scan cell reordering technique to minimize the column hamming distance in scan vectors, which can reduce the scan-in power consumption and test data. Experimental results for ISCAS 89 benchmark circuits show that reduced test data and low power scan testing can be achieved in all cases. The proposed method showed an about a 17%-26% better compression ratio, 8%-22% better average power consumption and 13%-60% better peak power consumption than that of previous method.

• Journal of Internet Computing and Services
• /
• v.16 no.1
• /
• pp.29-37
• /
• 2015

In this paper, we propose a robust pre-processing module for camera-based Optical Music Score Recognition (OMR) on mobile device. The captured images likely suffer for recognition from many distortions such as illumination, blur, low resolution, etc. Especially, the complex background music sheets recognition are difficult. Through any symbol recognition system, the staff line height and staff line space are used many times and have a big impact on recognition module. A robust and accurate staff line height and staff line space are essential. Some staff line height and staff line space are proposed for binary image. But in case of complex background music sheet image, the binarization results from common binarization algorithm are not satisfactory. It can cause incorrect staff line height and staff line space estimation. We propose a robust staff line height and staff line space estimation by using run-length encoding technique on edge image. Proposed method is composed of two steps, first step, we conducted the staff line height and staff line space estimation based on edge image using by Sobel operator on image blocks. Each column of edge image is encoded by run-length encoding algorithm Second step, we detect the staff line using by Stable Path algorithm and removal the staff line using by adaptive Line Track Height algorithm which is to track the staff lines positions. The result has shown that robust and accurate estimation is possible even in complex background cases.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.11 no.3
• /
• pp.115-122
• /
• 2008

Wu and Tsai's pixel-value differencing method and Chang and Tseng's side-match method are based on the theory that the number of bits which can be embedded is determined by the degree of the pixel's smoothness, or its proximity to the edge of the image. If pixels are located in the edge area, they may tolerate larger changes than those in smooth areas. However, both methods are subject to the fall off the boundary problem(FOBP). This study proposes a new scheme that can solve the FOBP. The experimental results demonstrate that the proposed method resolves the problem, and achieves a higher image quality index value than other methods.

• Journal of Broadcast Engineering
• /
• v.15 no.5
• /
• pp.642-652
• /
• 2010

Recently, DVC (Distributed Video Coding) techniques are drawing a lot of interests as one of the future research works to achieve low complexity encoding in various applications. But, due to the limited computational complexity, the performances of DVC algorithms are inferior to those of conventional international standard video coders, which use zig-zag scan, run length code, entropy code and skipped macroblock. In this paper, in order to overcome the performance limit of the DVC system, the distortion for every block is estimated when side information is found at the decoder and then we propose a new selective block encoding scheme which provides the encoder side with the motion information for the highly distorted blocks and then allows the sender to encode the motion compensated frame difference signal. Through computer simulations, it is shown that the coding efficiency of the proposed scheme reaches almost that of the conventional inter-frame coding scheme.

• Journal of Information Display
• /
• v.10 no.1
• /
• pp.6-15
• /
• 2009

In this paper, a new approach is proposed for the efficient generation of computer-generated holograms (CGHs) using the spatially redundant data on a 3D object and the novel look-up table (N-LUT) method. First, the pre-calculated N-point principle fringe patterns (PFPs) were calculated using the 1-point PFP of the N-LUT. Second, spatially redundant data on a 3D object were extracted and re-grouped into the N-point redundancy map using the run-length encoding (RLE) method. Then CGH patterns were generated using the spatial redundancy map and the N-LUT method. Finally, the generated hologram patterns were reconstructed. In this approach, the object points that were involved in the calculation of the CGH patterns were dramatically reduced, due to which the computational speed was increased. Some experiments with a test 3D object were carried out and the results were compared with those of conventional methods.