• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.4
• /
• pp.63-67
• /
• 2004

The conventional typical techniques as fast codebook generation methods are PDS, FNNS, and FC. In this paper, we propose FCNNPDS integrated the conventional methods to generate a codebook. The results of simulations show that the computational magnitude of FCNNPDS is reduced to 40-95% lower than conventional techniques. But comparison computation has no relation with k dimension of vectors, that is, because the computational magnitude of comparison is smaller than others, therefore FCNNPDS may be the best method than the conventional methods.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.10
• /
• pp.118-125
• /
• 1998

We introduce an adaptive finite state vector quantization using a new side match distortion function. The conventional side match distortion function can make the gray level transition between the block bounddaries as smooth as possible and proper state codebooks in the flat areas where the spatial correlations are high. But it can't make proper codebooks in the edge areas where the spatial correlations are not high. The proposed distortion function adds the variances which represent the image characteristics to the conventional side match distortion function as weighted values. Then it can select better state codebooks than the conventional side match distortion function. Also if it predicts a wrong state, the proposed quantizer can correct the state. As a result, we can obtain the satisfiable image quality.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.1
• /
• pp.19-30
• /
• 2012

For digital data compression, the quantization is the main part of the lossy source coding. In order to improve the performance of quantization, the vector quantizer(VQ) can be employed. The encoding complexity, however, exponentially increases as the vector dimension or bit rate gets large. Much research has been conducted to alleviate such problems of VQ. Especially for high bit rates, a constrained VQ, which is called the sample-adaptive product quantizer(SAPQ), has been proposed for reducing the hugh encoding complexity of regular VQs. SAPQ has very similar structure as to the product VQ(PQ). However, the quantizer performance can be better than the PQ case. Further, the encoding complexity and the memory requirement for the codebooks are lower than the regular full-search VQ case. Among SAPQs, 1-SAPQ has a simple quantizer structure, where each product codebook is symmetric with respect to the diagonal line in the underlying vector space. It is known that 1-SAPQ shows a good performance for i.i.d. sources. In this paper, a study on designing 1-SAPQ for the first-order Markov process. For an efficient design of 1-SAPQ, an algorithm for the initial codebook is proposed, and through the numerical analysis it is shown that 1-SAPQ shows better quantizer distortion than the VQ case, of which encoding complexity is similar to that of 1-SAPQ, and shows distortions, which are close to that of the DPCM(differential pulse coded modulation) scheme with the Lloyd-Max quantizer.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.7
• /
• pp.1817-1823
• /
• 1998

V.42bis, a type of LZW(Lempel-Ziv-Welch) code, is well-known as theinter national standard is asynchronous data compression. In this paper, we analyze several undesirable phenomena arising from the application of v.42bis to high speed data transmission, and we propose a modified technique to overcome them. the proposed technique determines the proper size of the dictionary, one of important factors affecting the compression ratio, and improves the method of dictionary generation for a higher compression ratio. Furthermore, we analyze the problem of excessive mode changes and solve it to a certain degree by adjusting the threshold for mode change. By doing this, we can achieve smiller variation of the compression ratio in time. This improvement chtributes to easier and better design and control of the buffer in high speed data transmission.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.1
• /
• pp.81-91
• /
• 1994

A DCT map and new cldebook design algorithm based on a two-dimension discrete cosine transform (2D-DCT) is presented for coder of image vector quantizer. We divide the image into smaller subblocks, then, using 2D DCT, separate it into blocks which are hard to code but it bears most of the visual information and easy to code but little visual information, and DCT map is made. According to this map, the significant features of training image are extracted by using the 2D DCT. A codebook is generated by partitioning the training set into a binary tree based on tree-structure. Each training vector at a nonterminal node of the binary tree is directed to one of the two descendants by comparing a single feature associated with that node to a threshold. Compared with the pairwise neighbor (PPN) and classified VQ(CVQ) algorithm, about 'Lenna' and 'Boat' image, the new algorithm results in a reduction in computation time and shows better picture quality with 0.45 dB and 0.33dB differences as to PNN, 0.05dB and 0.1dB differences as to CVQ respectively.

• The Journal of the Acoustical Society of Korea
• /
• v.17 no.4
• /
• pp.72-75
• /
• 1998

본 논문에서는 기존에 제시된 수정된 K-평균 방법을 이용한 VQ 학습 알고리즘을 분석하고, 보다 개선된 성능을 보이는 학습 알고리즘을 제안한다. 수정된 K-평균 학습 알고 리즘은 자기 집단에 속하는 데이터의 중심을 데이터의 중심을 새로운 코드워드로 삼는 것이 아니라 현재 코드워드와 새로 구한 집단의 중심을 연결한 선상에서 새로 구한 중심 너머의 일정한 점을 새로운 코드워드로 선택하는 방식이다. 본 논문에서는 이렇게 구한 새로운 코 드워드가 어떠한 조건을 만족할 때 알고리즘이 반복적 감소의 성질을 가지는지 살펴보고, 그 조건을 만족시키는 영역 중 기존의 방식보다 더 좋은 성능을 보이는 코드워드 선택법을 제시함으로써 개선된 학습 알고리즘을 제안한다.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.6
• /
• pp.72-80
• /
• 1998

A method is proposed for directional vector quantization using the wavelet packets. After partitioning the wavelet packet coefficients into 9 edges according to the corresponding directions, it encodes and transmits locally dominant edges. The directions of the edges are encoded with a variable length coding and conditional switching of codebooks, while the contents of them with the vector quantization followed by the variable length index coding. The proposed algorithm is superior to various conventional image coding algorithms in the sense of PSNR, which is relatively more significant at very low bit rate such as 0.1~0.3 bpp. As the proposed algorithm preserves the edges which is the most important for the human visual system, it also provides the reconstructed images of good subjective quality even at very low bit rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.11
• /
• pp.1311-1319
• /
• 1992

In the partial-band interference and Rayleigh fading environments, the bit error probability equation of FH/MFSK signal has been derived and the error rate has been evaluated. And the results are shown in graphs and discussed. Here, to improve the error rate performance the repeated diversity and the error-correction coding techniques are adopted. The degree of improvement of error rate performance has been found out in diversity and coding techniques respectively. In diversity case, repetition number is taken as a parameter and in coding case, as the error-correction codes Hamming code, BCH code, and convolutional code are introduced. From the obtained results, we have known that the increase of the number of repetition in diversity technique has been brought a little improvement of performance but the coding technique considerable improvement and in particular, convolutional code is very effective. Therefore, coding technique is considered to be better than repeated diversity to cope with Rayleigh fading and partial-band interference.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.1
• /
• pp.32-39
• /
• 2002

Vector quantization for image compression needs expensive encoding time to find the closest codeword to the input vector. This paper proposes a search algorithm for fast vector quantization encoding. Firstly, we derive a robust condition based on the efficient topological structure of the codebook to dramatically eliminate unnecessary matching operations from the search procedure. Then, we Propose a fast search algorithm using the elimination condition. Simulation results show that with little preprocessing and memory cost, the encoding time of the proposed algorithm is reduced significantly while the encoding quality remains the same with respect to the full search algorithm. It is also found that the Proposed algorithm outperforms the existing search algorithms.

• Journal of Internet Computing and Services
• /
• v.6 no.2
• /
• pp.59-68
• /
• 2005

In this paper, for compression and transmission of 3D image, we propose an algorithm which executes 3D discrete cosine transform(DCT) for 3D images, hierarchically segments 3D blocks of an image in comparison with the original image and executes finite-state vector quantization(FSVQ) for each 3D block. Using 3D DCT coefficient feature, a 3D image is segmented hierarchically into large smooth blocks and small edge blocks, then the block hierarchy informations are transmitted. The codebooks are constructed for each hierarchical blocks respectively, the encoder transmits codeword index using FSVQ for reducing encoded bit with hierarchical segmentation information. The new algorithm suggested in this paper shows that the quality of Small Lobster and Head image increased by 1,91 dB and 1.47 dB respectively compared with those of HFSVQ.