• Proceedings of the IEEK Conference
• /
• 2000.11c
• /
• pp.73-76
• /
• 2000

본 논문은 표준완성형코드를 표준으로 허프만 부호를 생성하기 위해 부호화 효율이 가장 높은 곳에서 예외 부호화를 통해 최적의 허프만 부호를 얻는다. 현재 우리나라의 DTV는 한글문자를 압축하지 않고 전송하는 형태이며, 본격적인 데이터 방송이 시작되면 한글 데이터가 차지하는 전송량으로 인한 심각한 문제가 야기된다. 본 논문에서는 데이터 방송에서 문제가 되는 전송량을 줄이기 위해 한글 전용 최적의 허프만 부호를 생성하여 일련의 해결책을 찾고자 하며 영문 위주인 데이터 압축기술을 한글에 맞게 적용하여 DTV 방송용 한글 전용 압축부호를 만드는데 있다.

• 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.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2016.11a
• /
• pp.69-71
• /
• 2016

본 논문에서는 JPEG, MPEG 등 표준압축 기술에 사용되고 있는 무손실 압축 기법 중 Huffman coding 을 통해 영문 텍스트를 압축하고 압축률을 구해보았다. 각 글자를 Huffman coding 의 원리에 기초하여 빈도수에 따라 코드를 결정한다. 결정된 코드에 따라 영문 텍스트를 변환하여 압축을 진행한다. 본 연구에서는 MATLAB을 이용하여 영문 텍스트의 각 글자 빈도수를 구하였고 Huffman coding 과정을 수행하였다. 또한 영문 텍스트를 코드로 변환과정을 수행하여 아스키코드와 압축률을 비교하였다. Huffman coding 은 아스키코드만으로 이용하는 것보다 1.89:1 의 압축률을 나타내었다.

• Proceedings of the KAIS Fall Conference
• /
• 2009.12a
• /
• pp.626-629
• /
• 2009

본 논문에서는 MPEG2(Moving Picture Expert Group 2)비디오 디코더에서 영상데이타를 디코딩하는 기술에 관한 것으로, 종래의 동여상 처리기에서는 허프만 코드화 처리를 하여 정지영상을 부호화한 후 분할기반 부호화 방식의 동영상 처리기법을 사용하였으나 1프레임의 코드화시에도 많은 계산 알고리즘이 필요하고 이미지의 닮음정도를 객관적수치로 표현할 수 없으므로 비슷한 이미지를 중복 코드화 작업 및 전송 작업을 하는 결함이 있었다. 본 눈문에서는 이를 해결하기 위하여 이미지의 닮음정도를 수치화하고 기준값 이하의 영상은 코드화 작업을 하지않고 계산된 영상 변화값에 의해 구현된 영상으로 대체하여 저장 및 전송하도록 하여 시각적으로 전혀 거부감이 없는 동영상을 구현하였다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.4
• /
• pp.187-194
• /
• 2011

In this paper, JPEG(Joint Photographic Experts Group) image data video decoding technique is presented, it is Huffman decoding method and fractal image method which is very complexive algorithm and the time required much it to implement this method and the first image is decoded to video frame image. This have defect of overlap decoding and transport work because of impossible to represent objective value of resemblance. The proposed method was calculated the mathematical absolute image resemblance and simplify the moving picture process to reducing the step of moving picture codefying. The results show that smoothed moving picture compared recent methods.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.3
• /
• pp.873-879
• /
• 2010

In this paper, MPEG2(Moving Picture Expert Group 2) image data video decoding technique is presented, it is Huffman decoding method and fractal image method which is very complexive algorithm and have too much times to implement this method. This have defect of overlap decoding and transport work because of impossible to represent objective value of resemblance. The proposed method was calculated the mathematical absolute image resemblance and simplify the moving picture process to reducing the step of moving picture codefying. The results show that smoothed moving picture compared recent methods.

• Convergence Security Journal
• /
• v.7 no.2
• /
• pp.129-134
• /
• 2007

This paper proposes multiple burst error detection and correction scheme for transmission of Huffman coded string. We use bidirectionally decodable codes and introduce insertion of forbidden symbol to find errors. Additional bits are added to original bit streams to correct errors. The total file size id increased but it can detect errors and recover errors real time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5C
• /
• pp.382-390
• /
• 2005

Huffman codes are widely used for image and video data transmission. As the increase of real-time data, a lot of studies on effective decoding algorithms and architectures have been done. In this paper, we proposed a balanced binary search tree for Huffman decoding and compared the performance of the proposed architecture with that of previous works. Based on definitions of the comparison of codewords with different lengths, the proposed architecture constructs a balanced binary tree which does not include empty internal nodes, and hence it is very efficient in the memory requirement. Performance evaluation results using actual image data show that the proposed architecture requires small number of table entries, and the decoding time is 1, 5, and 2.41 memory accesses in minimum, maximum, and average, respectively.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2615-2628
• /
• 1997

In this paper, a new codebook design algorithm is proposed. It uses a DCT map based on two-dimensional discrete cosine of transform (2D DCT) and finite state vector quantizer (FSVQ) when the vector quantizer is designed for image transmission. We make the map by dividing input image according to edge quantity, then by the map, the significant features of training image are extracted by using the 2D DCT. A master codebook of FSVQ is generated by partitioning the training set using binary tree based on tree-structure. The state codebook is constructed from the master codebook, and then the index of input image is searched at not master codebook but state codebook. And, because the coding of index is important part for high speed digital transmission, it converts fixed length codes to variable length codes in terms of entropy coding rule. The huffman coding assigns transmission codes to codes of codebook. This paper proposes single-side growing huffman tree to speed up huffman code generation process of huffman tree. Compared with the pairwise nearest neighbor (PNN) and classified VQ (CVQ) algorithm, about Einstein and Bridge image, the new algorithm shows better picture quality with 2.04 dB and 2.48 dB differences as to PNN, 1.75 dB and 0.99 dB differences as to CVQ respectively.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.97-100
• /
• 2008

정보화 사회가 진행되어감에 따라 카메라 센서, 디지털 카메라, 휴대폰, 영상 관련디지털 기기들이 증가하고 이로 인하여 영상정보 서비스 기술의 중요성이 크게 부각되었다. 특히 멀티미디어 응용서비스 기술에서는 영상 정보가 필수적인데, 그 영상 정보의 양이 너무 방대하여 압축 부호화를 하여 사용되고 있다. 본 논문에서는 정지영상압축 방법 중 JPEG표준에서 제시한 4가지 동작 모드 중 베이스라인을 기반으로 하는 JPEG압축 알고리즘을 연구하여 CMOS 이미지 센서에서 영상을 전송받으면 8*8 블록 단위로 변환 후 DCT 및 양자화 과정을 거쳐 지그재그 스캔을 한 후 허프만 코드를 사용하여 압축 부호화 시키는 JPEG 베이스라인 인코더를 VHDL언어로 설계하였다.