• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.1
• /
• pp.52-67
• /
• 2011

Network coding is a newly developed technology that can cause considerable improvements in network throughput. COPE is the first network coding approach for wireless mesh networks and it is based on opportunistic Wireless Network Coding (WNC). It significantly improves throughput of multi-hop wireless networks utilizing network coding and broadcast features of wireless medium. In this paper we propose a new method, called FENC, for opportunistic WNC that improves the network throughput. In addition, its complexity is lower than other opportunistic WNC approaches. FENC utilizes division and conquer method to find an optimal network coding. The numerical results show that the proposed opportunistic algorithm improves the overall throughput as well as network coding approach.

• ETRI Journal
• /
• v.30 no.3
• /
• pp.441-450
• /
• 2008

The scalable extension of H.264, known as scalable video coding (SVC) has been the main focus of the Joint Video Team's work and was finalized at the end of 2007. Synchronization between media is an important aspect in the design of a scalable video streaming system. This paper proposes an efficient media synchronization mechanism for SVC video transport over IP networks. To support synchronization between video and audio bitstreams transported over IP networks, a real-time transport protocol/RTP control protocol (RTP/RTCP) suite is usually employed. To provide an efficient mechanism for media synchronization between SVC video and audio, we suggest an efficient RTP packetization mode for inter-layer synchronization within SVC video and propose a computationally efficient RTCP packet processing method for inter-media synchronization. By adopting the computationally simple RTCP packet processing, we do not need to process every RTCP sender report packet for inter-media synchronization. We demonstrate the effectiveness of the proposed mechanism by comparing its performance with that of the conventional method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8C
• /
• pp.1055-1061
• /
• 2004

In this paper, we propose an efficient dynamic coding scheme by using multiple codewords in H.264/AVC entropy coding. The exponential Golomb (Exp-Golomb) codewords used in H.264/AVC do not reflect enough the symbol distributions of the combined syntax element in (7) due to their static probability distribution characteristics. However, the multiple codewords in this paper have different statistical characteristics. we propose a dynamic coding scheme by using selectively among multiple codewords to encode the combined syntax element according to given image sequences. Simulation results show that our proposed scheme outperforms the existing (7) method in compression efficiency without loss of quality.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.4
• /
• pp.280-283
• /
• 2009

To improve coding performance of scalable video coding which is an emerging video coding standard as an extension of H.264/AVC, SVC uses not only intra prediction and inter prediction but inter-layer prediction. This causes a problem that computational complexity is increased. In this paper, we propose an efficient intra prediction mode decision method in spatial enhancement layer to reduce the computational complexity. The proposed method selects Inra_BL mode using RD cost of Intra_BL in advance. After that, intra mode is decided by only comparing DC modes. Experimental results show that the proposed method reduces 59% of the computation complexity of intra prediction coding, while the degradation in video quality is negligible.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.9C
• /
• pp.1244-1251
• /
• 2004

In this paper, we propose an efficient dynamic coding scheme by using multiple code words in H.264/A VC entropy coding. The exponential Golomb (Exp-Golomb) code words used in H 264/A VC do not reflect enough the symbol distributions of the combined syntax element in [7] due to their static probability distribution characteristics However, the multiple codewords in this paper have different statistical characteristics. we propose a dynamic coding scheme by using selectively among multiple codewords to encode the combined syntax clement according to given image sequences. Simulation results show that our proposed scheme outperforms the existing [7] me in compression efficiency without loss of quality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3A
• /
• pp.211-220
• /
• 2002

In this paper, we propose an efficient algorithm to compress simple computer cell animation at very low bit rate. The structure of proposed algorithm consists of intra frame coding and inter frame coding. In inter frame coding, animation is encoded by color quantization using a palette, rearrangement of index, ADPCM used in JPEG-LS, mapping, classification, and entropy coding. In interframe coding, classifying the characteristics of motion, animation is encoded by block based motion replenishment. Experimental results show that the proposed methods turns out to outperform conventional methods including Flash, FLC, Motion-JPEG, MPEG-1, and MPEG-4.

• International Journal of Advanced Culture Technology
• /
• v.8 no.3
• /
• pp.186-191
• /
• 2020

Artificial Intelligence (AI) technology is used in a variety of fields because it can make inferences and plans through learning processes. In the field of coding technologies, AI has been introduced as a tool for personalized and customized education to provide new educational environments. Also, it can be used as a virtual assistant in coding operations for easier and more efficient coding. Currently, as coding education becomes mandatory around the world, students' interest in programming is heightened. The purpose of coding education is to develop the ability to solve problems and fuse different academic fields through computational thinking and creative thinking to cultivate talented persons who can adapt well to the Fourth Industrial Revolution era. However, new non-computer science major students who take software-related subjects as compulsory liberal arts subjects at university came to experience many difficulties in these subjects, which they are experiencing for the first time. AI based coding technologies can be used to solve their difficulties and to increase the learning effect of non-computer majors who come across software for the first time. Therefore, this study examines the current state of AI based coding technologies and suggests the direction of future coding education.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.1
• /
• pp.1-16
• /
• 1996

In this paper, by combining the motion compensated transform coding with the sub-band decomposition technique, we present a motion compensated sub-band coding technique(MCSBC) for image sequence coding. Several problems related to the MCSBC, such as a scheme for motion compensation in each sub-band and the efficient VWL coding of the DCT coefficients in each sub-band are discussed. For an efficient coding, the motion estimation and compensation is performed only on the LL sub-band, but the discrete cosine transform(DCT) is employed to encode all sub-bands in our approach. Then, the transform coefficients in each sub-band are scanned in a different manner depending on the energy distributions in the DCT domain, and coded by using separate 2-D Huffman code tables, which are optimized to the probability distributions in the DCT domain, and coded by using separate 2-D Huffman code tables, which are optimized to the probability distribution of each sub-band. The performance of the proposed MCSBC technique is intensively examined by computer simulations on the HDTV image sequences. The simulation results reveal that the proposed MCSBC technique outperforms other coding techniques, especially the well-known motion compensated transform coding technique by about 1.5dB, in terms of the average peak signal to noise ratio.

• 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 Broadcast Engineering
• /
• v.11 no.4 s.33
• /
• pp.386-395
• /
• 2006

Multi-view video coding technology demands the very high efficient coding technologies, because it has to encode a number of video sequences which are achieved from a number of video cameras. For this purpose, multi-view video coding introduces the inter-view prediction scheme between different views, but it shows a limitation of coding performance enhancement by adopting only new prediction method. Accordingly, we are going to achieve the more coding performance by enhancing dequantizer perfermance. Multi-view video coding is implemented basically based on H.264/AVC and uses the same quantization/de-quantization method as H.264/AVC does. The conventional quantizer and dequantizer is designed with the assumption that input residual signal follows the Laplacian PDF. However, it doesn't follow the fixed PDF type always. This mismatch between assumption and real data causes degradation of coding performance. To solve this problem, we propose the efficient de-quantization method based on quantized coefficients distribution at decoder without extra information. The extensive simulation results show that the proposed algorithm produces maximum $1.5\;dB{\sim}0.6\;dB$ at high bitrate compared with that of conventional method.