• The Journal of the Korea Contents Association
• /
• v.12 no.12
• /
• pp.544-554
• /
• 2012

Screen content refers to images or videos generated by various electronic devices such as computers or mobile phones, whereas natural content refers to images captured by cameras. Screen contents show different statistical characteristics from natural images, so the conventional video codecs which were developed mainly for the coding of natural videos cannot guarantee good coding performances for screen contents. Recently, researches on efficient SCC(Screen Content Coding) are being actively studied, and especially at ongoing JCT-VC(Joint Collaborative Team on Video Coding) meeting for HEVC(High Efficiency Video Coding) standard, SCC issues are being discussed steadily. In this paper, we analyze the performances of high efficient coding tools in HM(HEVC Test Model) on SCC, and present an optimized SCC model based on the analysis results. We also present the characteristics of screen contents and the future research issues as well.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.2
• /
• pp.193-201
• /
• 2008

Using Network Coding in P2P systems yields great benefits, e.g., reduced download delay. The core notion of Network Coding is to allow encoding and decoding at intermediate nodes, which are prohibited in the traditional networking. However, improper implementation of Network Coding may reduce the overall performance of P2P systems. Network Coding cannot work with general arithmetic operations, since its arithmetic is over a Finite Field and the use of an efficient Finite Field arithmetic algorithm is the key to the performance of Network Coding. Also there are other important performance parameters in Network Coding such as Field size. In this paper we study how those factors influence the performance of Network Coding based systems. A set of experiments shows that overall performance of Network Coding can vary 2-5 times by those factors and we argue that when developing a network system using Network Coding those performance parameters must be carefully chosen.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.4
• /
• pp.295-302
• /
• 2013

In the network coding, throughput can be increased by allowing the transformation of the received data at the intermediate nodes. However, the adversary can obtain more information at the intermediate nodes and make troubles for decoding of transmitted data at the sink nodes by modifying transmitted data at the compromised nodes. In order to resist the adversary activities, various information theoretic or cryptographic secure network coding schemes are proposed. Recently, a secure network coding based on the cryptographic hash function can be used at the random network coding. However, because of the computational resource requirement for cryptographic hash functions, networks with limited computational resources such as sensor nodes have difficulties to use the cryptographic solution. In this paper, we propose a new secure network coding scheme which uses linear transformations and table lookup and safely transmits n-1 packets at the random network coding under the assumption that the adversary can eavesdrop at most n-1 nodes. It is shown that the proposed scheme is an all-or-nothing transform (AONT) and weakly secure network coding in the information theory.

• Journal of Communications and Networks
• /
• v.10 no.4
• /
• pp.371-383
• /
• 2008

Application of network coding in wireless two-way relay channels (TWRC) has received much attention recently because its ability to improve throughput significantly. In traditional designs, network coding operates at upper layers above (including) the link layer and it requires the input packets to be correctly decoded. However, this requirement may limit the performance and application of network coding due to the unavoidable fading and noise in wireless networks. In this paper, we propose a new wireless network coding scheme for TWRC, which is referred to as soft network coding (SoftNC), where the relay nodes applies symbol-by-symbol soft decisions on the received signals from the two end nodes to come up with the network coded information to be forwarded. We do not assume further channel coding on top of SoftNC at the relay node (channel coding is assumed at the end nodes). According to measures of the soft information adopted, two kinds of SoftNC are proposed: amplify-and-forward SoftNC (AF-SoftNC) and soft-bit-forward SoftNC (SBF-SoftNC). We analyze the both the ergodic capacity and the outage capacity of the two SoftNC schemes. Specifically, analytical form approximations of the ergodic capacity and the outage capacity of the two schemes are given and validated. Numerical simulation shows that our SoftNC schemes can outperform the traditional network coding based two-way relay protocol, where channel decoding and re-encoding are used at the relay node. Notable is the fact that performance improvement is achieved using only simple symbol-level operations at the relay node.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.3
• /
• pp.57-70
• /
• 2008

This paper introduces a new paradigm of physical layer security through channel coding for wireless networks. The well known spread spectrum based physical layer security in wireless network is applicable when code division multiple access (CDMA) is used as wireless air link interface. In our proposal, we incorporate the proposed security protocol within channel coding as channel coding is an essential part of all kind of wireless communications. Channel coding has a built-in security in the sense of encoding and decoding algorithm. Decoding of a particular codeword is possible only when the encoding procedure is exactly known. This point is the key of our proposed security protocol. The common parameter that required for both encoder and decoder is generally a generator matrix. We proposed a random selection of generators according to a security key to ensure the secrecy of the networks against unauthorized access. Therefore, the conventional channel coding technique is used as a security controller of the network along with its error correcting purpose.

• ETRI Journal
• /
• v.27 no.3
• /
• pp.326-329
• /
• 2005

The MPEG-4 multiple auxiliary component (MAC) is a good mechanism to achieve one-stream stereoscopic video coding. However, there is no syntax or semantics for the residual texture data of the disparity-compensated image in the current MAC. Therefore, we propose a novel disparity-compensated coding method using the MAC for stereoscopic video. We also define a novel MAC semantics in MPEG-4 so as to support the proposed coding algorithm. The major difference between the existing and proposed coding methods using the MAC is the addition of the residual texture coding.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.5
• /
• pp.45-51
• /
• 1997

To trnsmit moving image signals by using an object vased coding technique at the rate of 8kbps~11kbps, it is very important to minimize the bit rates used for the compression of the color information of MF-objects. This paper proposes a hybrid coding method which uses the shpae adaptive coding method and the interframe reference method selectively. Gilge's shape adaptive orthogonal coidng method is utilized for shpae adaptive coding. The interfarame reference method approximates the low-passed signals of the image by gilge's shpae adaptive orthogonalization method and then refers the approximation error signals from the high frequency signal components of th eprevious frame. The proposed method achives the bit rates reduction of 17% compared to the gilge's shape adaptive orthogonalization method and 30% rduction compared to the shape adaptive DCT in average.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.310-313
• /
• 2011

Broadcasting nature of wireless communications makes it possible to apply opportunistic network coding (OPNC) by overhearing transmitted packets from a source to sink nodes. However, it is difficult to apply network coding to the topology of multiple relay and sink nodes. We propose to use relay node selection, which finds a proper node for network coding since the OPNC alone in the topology of multiple relays and sink nodes cannot guarantee network coding gain. The proposed system is a novel combination of wireless network coding and relay selection, which is a key contribution of this paper. In this paper, with the consideration of channel state and potential network coding gain, we propose relay node selection techniques, and show performance gain over the conventional OPNC and a channel-based selection algorithm in terms of average system throughput.

• Proceedings of the KIEE Conference
• /
• 1988.11a
• /
• pp.477-480
• /
• 1988

A new image coding system called knowledge- based coding is presented which uses positively the knowledge for coding objects. The 3- dimensional model and the psychological knowledge for a person's face can be used as the knowledge for a coding system, when a person's face is coding object. A transmitter analyzes input images and a receiver synthesizes output images using them. The construction of 3-dimensional model and the introduction of the psychological knowledge to the new coding system are discussed. The basic facial expressions are synthesized from a neutral face using them. The synthesized images are very natural.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.607-610
• /
• 1998

The major objectives of speech coding include high compression ratio for transmission in the band limited channel, high synthesized speech quality in terms of the intelligibility and the naturalness and fast processing speed. In general, speech coding methods are classified into the following three categories: the wavelform coding, the source coding and the hybird coding. In this paper, we proposed a new waveform coding method using PSOLA(pitch-synchronous overlap add) technique. First, we fixed one basic waveform per pitch and measured the formant similarity between basic and neighbor waveform. Second, if the similairy satisfied threshold values, we compress the neighbor waveform per pitch and then store or transmit. When the comparession is about 45%, we obtained about 4 in MOS.