• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.11a
• /
• pp.467-470
• /
• 2000

Vector quantization (VQ) is widely used in many high-quality and high-rate data compression applications such as speech coding, audio coding, image coding and video coding. When the size of a VQ codebook is large, the computational complexity for the full codeword search method is a significant problem for many applications. A number of complexity reduction algorithms have been proposed and investigated using such properties of the codebook as the triangle inequality. This paper proposes a new structured VQ search algorithm that is based on a multi-stage structure for searching for the best codeword. Even using only two stages, a significant complexity reduction can be obtained without any loss of quality.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.8
• /
• pp.1444-1456
• /
• 2011

This paper presents a low-complexity algorithm for an H.264/AVC encoder. The proposed motion estimation scheme determines the best coding mode for a given macroblock (MB) by finding motion-blurred MBs; identifying, before motion estimation, an early selection of MBs; and hence saving processing time for these MBs. It has been observed that human vision is more sensitive to the movement of well-structured objects than to the movement of randomly structured objects. This study analyzed permissible perceptual distortions and assigned a larger inter-mode value to the regions that are perceptually less sensitive to human vision. Simulation results illustrate that the algorithm can reduce the computational complexity of motion estimation by up to 47.16% while maintaining high compression efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.2
• /
• pp.344-352
• /
• 1997

This paper proposes an efficient lossless coding scheme for tree structured vector quantization (TSVQ) system which efficiently exploits inter-block correlation. The TSVQ index of the current block is adaptively arithmeticencoded depending on the indices of the previous blocks. This paper also presents a reductio method, which effectively resolve the memory problem which usually arises in many conditional entropy coding schemes. Simulation results show that the proposed scheme provides remarkable bitrate reduction by effectively exploiting not only linear but also non-linear inter-block correlation.

• Journal of Korea Multimedia Society
• /
• v.15 no.11
• /
• pp.1349-1357
• /
• 2012

In recent years, security accidents which are becoming the socially hot issue not only cause financial damages but also raise outflow of private information. Most of the accidents have been immediately caused by the software weakness. Moreover, it is difficult for software today to assure reliability because they exchange data across the internet. In order to solve the software weakness, developing the secure software is the most effective way than to strengthen the security system for external environments. Therefore, suggests that the coding guide has emerged as a major security issue to eliminate vulnerabilities in the coding stage for the prevention of security accidents. Developers or administrators effectively in order to use secure coding coding secure full set of security weaknesses organized structurally and must be managed. And the constant need to update new information, but the existing Secure Coding and Security weakness is organized structurally do not. In this paper, we will define and introduce the structured weakness for mobile applications by the surveys of existing secure coding and coding rules for code analysis tools in Java.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.6
• /
• pp.895-906
• /
• 1993

In this paper, MTSVQ(Multirate Tree-Structured Vector Quantization) is introduced for subband image coding. Original images are decomposed into a number of subband components, and multiresolution codebook is designed by MTSVQ algorithm. Optimal bit allocation among the subband components becomes the problem selecting the particular pruned subtree of MTSVQ which has the desired rate and distortion.

• Journal of Digital Convergence
• /
• v.13 no.6
• /
• pp.165-175
• /
• 2015

Methods to design programs which implement IT systems have been developed in various forms from flowchart to activity diagram of UML. However, program design tools and methods developed so far have not been efficient comparing to program coding tools and methods. In addition, Program design methods and tools developed until now have been difficult to support the bidirectional conversion between program design and coding, and the improvement of development productivity and maintainability. Therefore, in this study, we propose Convergence Development Method to enable working with wide bandwidth through fusing the program design and coding phase by using SOC and supporting tool named SETL which automatizes the convergence of design and coding. Thus, by using SETL, it is expected that the efficiency gap between the program design and coding phase is reduced, and development productivity and maintainability is increased. key words.

• Broadcasting and Media Magazine
• /
• v.4 no.1
• /
• pp.62-79
• /
• 1999

In this survey paper the emerging MPEG-4 audio technology is discribed In the previous MPEG-1 and the MPEG-4 audio words, only the natural audio and the speech coding techniques were the standadization objects But in the MPEG-4 audio standadization, not only the natural audio and the speech coding, but also the structured audio and the synthetic speech techniques are inclued, The purpose of this expansion can be summarized as the preparation for the versatile high-quality multimedia services supposed emerge in the 21st century.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.101-109
• /
• 2004

In this paper, we propose an efficient algerian for wavelet-based sti image coding method that utilizes the rate-distortion (R-D) theory. Since conventional tree-structured image coding schemes do not consider the rate-distortion theory properly, they show reduced coding performance. In this paper, we apply an rate-distortion optimized embedding (RDE) operation into the set partitioning in hierarchical trees (SPIHT) algorithm. In this algorithm, we use the rate-distortion slope as a criterion for the coding order of wavelet coefficients in SPIHT lists. We also describe modified set partitioning and rate-distortion optimized list scan methods. Experimental results demonstrate that the proposed method outperforms the SPIHT algorithm and the rate-distortion optimized embedding algerian with respect to the PSNR (peak signal-to-noise ratio) performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.6
• /
• pp.2271-2288
• /
• 2015

The emerging high efficiency video coding (HEVC) standard adopts the quadtree-structured transform unit (TU) in the residual quadtree (RQT) coding. Each TU allows to be split into four equal sub-TUs recursively. The RQT coding is performed for all the possible transform depth levels to achieve the highest coding efficiency, but it requires a very high computational complexity for HEVC encoders. In order to reduce the computational complexity requested by the RQT coding, in this paper, we propose a fast TU size decision method incorporating an adaptive maximum transform depth determination (AMTD) algorithm and a full check skipping - early termination (FCS-ET) algorithm. Because the optimal transform depth level is highly content-dependent, it is not necessary to perform the RQT coding at all transform depth levels. By the AMTD algorithm, the maximum transform depth level is determined for current treeblock to skip those transform depth levels rarely used by its spatially adjacent treeblocks. Additionally, the FCS-ET algorithm is introduced to exploit the correlations of transform depth level between four sub-CUs generated by one coding unit (CU) quadtree partitioning. Experimental results demonstrate that the proposed overall algorithm significantly reduces on average 21% computational complexity while maintaining almost the same rate distortion (RD) performance as the HEVC test model reference software, HM 13.0.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.2
• /
• pp.385-390
• /
• 2013

This paper proposes an efficient hardware architecture of CABAC for HEVC decoder. The proposed method is structured to handle two bins in one cycle, while preserving data dependencies of the CABAC. In addition, the processing time of the proposed architecture is reduced because the operation using Offset and Range is processed while the architecture reads rLPS from rLPSROM. As a result of analyzing operating frequency of the proposed CABAC architecture, the proposed architecture has improved by 40% than the previous one.