• Journal of the Korean Institute of Telematics and Electronics
• /
• v.17 no.2
• /
• pp.15-22
• /
• 1980

For efficient coding of graphic image data, the statistical characteristics for both Korean lettered images and English lettered images are measurpd and co mpared. Also, the measured run length distribution is compared with the run length distribution hased on Markov model. It is shown that the measured white run length distribution is more Bike a negative - power distribution than an exponential distribution . This fact is stronger in the Korean lettered images than is the English lettered images, The performances of four typical run length codes are compared for the same set of graphic data files,, and it is shown that the codes perform better in the Korean ]entered images :hart In Eng]isle lettered images.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.21 no.6
• /
• pp.115-117
• /
• 1984

A method of calculating the maximum entropy per run in binary run-length coding is given when run-length is limited to a maximum of M. And Huang's bounds can be obtained from the present result as M tends to infinity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.1
• /
• pp.111-119
• /
• 1994

In this paper we propose a reversible image coding methods with progressive build-up function by bit-plane of multi-lavel image. Firstly, the differencial conversion is applied to reduce the entropy of source images. Then the bit-plane sequences of converted images are coded by means of the newly designed VFRL(Variable to Fixed Run-Llength) code and the RDHC(Run-length Dynamic Huffman Coding). We aim to the simple construction to reduce the complexity. The computer simulated results show that the proposed methods are very effective to the multi-level digital images. For "GIRL" and "COUPLE" of 1EEE monochromatic standard images, the compressibility are superior to the results obtained by the well-known universal codes.own universal codes.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.8 no.2
• /
• pp.78-83
• /
• 2009

In this paper, a novel method for data hiding into binary images is proposed. Binary image has two tones: black and white. For this reason, it is not easy to hide messages into binary images. PWLC (pair-wise logical computation) is a new method to hide message into binary images. However, it yields images of unacceptable quality and its decoding process is unclear. Therefore, in order to solve this problem, we adopt the run-length method to achieve advanced reversible data hiding. That is, we find a proper region to hide messages to reduce visual degradation. In this paper, we introduce an improved procedure to hide messages into binary images.

• Proceedings of the Korea Multimedia Society Conference
• /
• 1998.04a
• /
• pp.138-142
• /
• 1998

자동차 번호판 인식시스템은 영상획득, 번호판 추출, 전처리(이치화), 문자영역분할, 문자인식 등의 5가지 핵심부분으로 구성되어 있다. 따라서 자동차 번호판 인식시스템의 최종 인식률은 각 단계의 성능에 따라 직접적인 영향을 받는다. 본 논문은 컴퓨터 비젼의 한 분야인 영상처리 기법을 이용한 이치화된 자동차 번호판의 문자영역 추출에 관한 연구로서 문자 인식단계에서 높은 인식률을 확보하기 위해서 가장 중요한 입력 데이터의 상태를 보다 깨끗하게 정확하게 분리하는데 변형된 Run Length Coding 기법을 이용하여 효과적이고 빠른 문자 영역 분리 방법을 제안함으로서 처리속도의 향상은 물론 잡영에도 강한 문자 영역 분리 시스템을 구현하였다.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.1
• /
• pp.1-6
• /
• 1999

In this paper We propose the new lossless compression method which use Huffman Coding using the preprocessing to compress the still image. The proposed methode divide into two parts according to activity of the image. If activities are high, the original Huffman Coding method was used directly. IF activities are low, the nibble run-length coding and the bit dividing method was used. The experimental results show that compression rate of the proposed method was better than the general Huffman Coding method.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.16 no.1
• /
• pp.44-57
• /
• 2016

Rectification is used as a preprocessing to reduce the computation complexity of disparity estimation. However, rectification also requires a complex computation. To minimize the computing complexity, rectification using a lookup-table (R-LUT) has been introduced. However, since, the R-LUT consumes large amount of memory, rectification with compressed LUT (R-CLUT) has been introduced. However, the more we reduce the memory consumption, the more we need decoding overhead. Therefore, we need to attain an acceptable trade-off between the size of LUT and decoding overhead. In this paper, we present such a trade-off by adaptively combining simple coding methods, such as differential coding, modified run-length coding (MRLE), and Huffman coding. Differential coding is applied to transform coordinate data into a differential form in order to further improve the coding efficiency along with Huffman coding for better stability and MRLE for better performance. Our experimental results verified that our coding scheme yields high performance with maintaining robustness. Our method showed about ranging from 1 % to 16 % lower average inverse of compression ratio than the existing methods. Moreover, we maintained low latency with tolerable hardware overhead for real-time implementation.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.38 no.6
• /
• pp.93-105
• /
• 2001

In the lossless step of Lattice Vector Quantization(LVQ), the lattice codewords produced at quantization step are enumerated into radius sequence and index sequence. The radius sequence is run-length coded and then entropy coded, and the index sequence is represented by fixed length binary bits. As bit rate increases, the index bit linearly increases and deteriorates the coding performances. To reduce the index bits across the wide range of bit rates, we developed a novel lattice enumeration algorithm adopting the set partitioning method. The proposed enumeration method shifts down large index values to smaller ones and so reduces the index bits. When the proposed lossless coding scheme is applied to a wavelet based image coding, the proposed scheme achieves more than 10% at bit rates higher than 0.3 bits/pixel over the conventional lossless coding method, and yields more improvement as bit rate becomes higher.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.49 no.1
• /
• pp.8-11
• /
• 2012

Automated Vision Inspection (AVI) systems automatically detect any defect feature in a surface image. The performance of the system can be measured under a special circumstances such as ultimate defect detection. In this situation, the defect signal level is similar to noise level and it becomes hard to make a solid decision with AVI systems. In this paper, we propose an effective preprocessing technique to enhance SNR (Signal to Noise Ratio). The method is motivated by some principles of HVS (Human Visual System) and RLC (Run Length Coding) techniques is used for this purpose. The proposed preprocessing technique enhances SNR under ultimate defect conditions and improves overall performance of AVI system.

• 전자공학회논문지 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.