• Journal of Information Science Theory and Practice
• /
• v.4 no.4
• /
• pp.64-74
• /
• 2016

In this paper we define a two parametric new generalized useful average code-word length $L_{\alpha}^{\beta}$(P;U) and its relationship with two parametric new generalized useful information measure $H_{\alpha}^{\beta}$(P;U) has been discussed. The lower and upper bound of $L_{\alpha}^{\beta}$(P;U), in terms of $H_{\alpha}^{\beta}$(P;U) are derived for a discrete noiseless channel. The measures defined in this communication are not only new but some well known measures are the particular cases of our proposed measures that already exist in the literature of useful information theory. The noiseless coding theorems for discrete channel proved in this paper are verified by considering Huffman and Shannon-Fano coding schemes on taking empirical data. Also we study the monotonic behavior of $H_{\alpha}^{\beta}$(P;U) with respect to parameters ${\alpha}$ and ${\beta}$. The important properties of $H_{{\alpha}}^{{\beta}}$(P;U) have also been studied.

• Journal of the Korean Institute of Navigation
• /
• v.19 no.3
• /
• pp.21-28
• /
• 1995

Mathematical morphology skeleton image processing makes many partial skeleton image planes from an original binary image. And the original binary image can be reconstructed without any distortion by summing the first partial skeleton image plane and each dilated partial skeleton image planes using the same structuring element. Especially compression effects of Elias coding to the morphological globally minimal skeleton(GMS) image, is better than that of PCX and Huffman coding. And then this paper proposes mathematical morphological GMS image processing which can be applied to a binary image transmitting for facimile and big size(bigger than $64{\times}64$ size) bitmap fonts storing in a memory.

• ETRI Journal
• /
• v.9 no.3
• /
• pp.13-21
• /
• 1987

정보를 나타내는 기호(symbol)들의 발생 빈도수(occurrence frequency)는 일반적으로 일정하지 않다. 빈번히 발생되는 기호일수록 짧은 길이로, 드물게 발생되는 기호는 길게 부호화 함으로써 우리는 데이터량을 많이 감축할 수 있다. 우리는 이러한 가변장 부호 기법(variable length coding)인 Huffman과 Shannon-Fano 부호 기법을 영상정보에 적용하여 약 77%의 데이터량을 감축할 수 있음을 보여준다.

• Journal of the Korean Society of Radiology
• /
• v.5 no.6
• /
• pp.329-334
• /
• 2011

This paper presents improvement of compression rate for SPIHT algorithm based on wavelet compression through redundancy bit removing. Proposed SPIHT algorithm uses a method to select of optimized threshold from feature of wavelet transform coefficients and removes sign bit only if coefficient is LL area. Finally Proposed SPIHT algorithm applies to Huffman coding. Experimental results show that the proposed algorithm achieves more improvement bit rate and more fast progressive transmission with low bit rate.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.3
• /
• pp.453-458
• /
• 2006

This paper proposed the method for restorable lossy mage compression using wavelet transformation. In order to increase compression efficiency, this algorithm subbands with the wavelet transformation filter after processing the pre-quantizer on the original images. Then, it quantizes its wavelet coefficients by using the Huffman Coding. Comparing to the JPEG or non pre-quantized images, the reconstructed images by the proposed algorithm showed higher PSNR. By applying pre-quantizing process, it will be possible to control the peak errors and it is also expected to be useful at mass image compressions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.11
• /
• pp.4443-4462
• /
• 2020

This paper proposes a new framework of reversible data hiding scheme for absolute moment truncation coding (AMBTC) compressed images. AMBTC-based RDH can be applied to optical remote sensing (ORS) image transmission, which achieves target region preservation and image compression simultaneously. Existing methods can be concluded as two types. In type I schemes, stego codes mimic the original AMBTC format where no file bloat occurs, yet the carried secret data is limited. Type II schemes utilize predication errors to recode quantity levels of AMBTC codes which achieves significant increase in embedding capacity. However, such recoding causes bloat inside stego format, which is not appropriate in mentioned ORS transmission. The proposed method is a novel type I RDH method which prevents bloat inside AMBTC stego codes with significant improvement in embedding capacity. The AMBTC compressed trios are grouped into two categories according to a given threshold. In smooth trio, the modified low quantity level is constructed by concatenating Huffman codes and secret bits. The reversible contrast mapping (RCM) is performed to complex trios for data embedment. Experiments show that the proposed scheme provides highest payload compared with existing type I methods. Meanwhile, no expansion inside stego codes is caused.

• Journal of Broadcast Engineering
• /
• v.10 no.3
• /
• pp.328-338
• /
• 2005

Technology for compressing low-bitrate multichannel audio coding is being standardized owing to the increasing need of consumer for multichannel audio contents. In this paper we propose the sound source location cue coding (SSLCC) for extremely compressing multichannel audio to be suitable at the narrow bandwidth transmission environment. To improve the compression capability of the conventional binaural cue coding(BCC), the SSLCC adopts the virtual source location information (VSLI) as a spatial cue parameter, a symmetric uniform quantizer, and Huffman coder. The objective and subjective assessment results show that the SSLCC provides lower bitrate and better audio quality than conventional BCC method.

• International Journal of Computer Science & Network Security
• /
• v.22 no.4
• /
• pp.73-82
• /
• 2022

This paper shows the hiding process of unlimited secret text size in an image using three methods: the first method is the traditional method in steganography that based on the concealing the binary value of the text using the least significant bits method, the second method is a new method to hide the data in an image based on Exclusive OR process and the third one is a new method for hiding the binary data of the text into an image (that may be grayscale or RGB images) using Exclusive and Huffman Coding. The new methods shows the hiding process of unlimited text size (data) in an image. Peak Signal to Noise Ratio (PSNR) is applied in the research to simulate the results.

• IEIE Transactions on Smart Processing and Computing
• /
• v.3 no.1
• /
• pp.10-18
• /
• 2014

From the perspective of reducing the sampling cost of color images at high resolution, block-based compressive sensing (CS) has attracted considerable attention as a promising alternative to conventional Nyquist/Shannon sampling. On the other hand, for storing/transmitting applications, CS requires a very efficient way of representing the measurement data in terms of data volume. This paper addresses this problem by developing a measurement-coding method with the proposed customized Huffman coding. In addition, by noting the difference in visual importance between the luma and chroma channels, this paper proposes measurement coding in YCbCr space rather than in conventional RGB color space for better rate allocation. Furthermore, as the proper use of the image property in pursuing smoothness improves the CS recovery, this paper proposes the integration of a low pass filter to the CS recovery of color images, which is the block-based ${\ell}_{20}$-norm minimization. The proposed coding scheme shows considerable gain compared to conventional measurement coding.

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