• Journal of Broadcast Engineering
• /
• v.13 no.3
• /
• pp.289-298
• /
• 2008

We propose an SNR-scalable coding algorithm for three-dimensional mesh sequences based on singular value decomposition (SVD). SVD achieves a coding gain by representing a mesh sequence with a small number of basis vectors and singular values. First, we introduce a bit plane coding scheme and derive a quantitative relationship between each bit plane and the reconstructed image quality. Using the relationship, we develop a rate-distortion (RD) optimized coding algorithm. Moreover, we propose prediction techniques to exploit the spatio-temporal correlations in real mesh sequences. Simulation results demonstrate that the proposed algorithm provides significantly better RD performance than conventional SVD coders.

• ETRI Journal
• /
• v.32 no.4
• /
• pp.577-587
• /
• 2010

The layered coding structure of scalable video coding (SVC) with adaptive inter-layer prediction causes noticeable computational complexity increments when compared to existing video coding standards. To lighten the computational complexity of SVC, we present a fast algorithm to speed up the inter-mode decision process. The proposed algorithm terminates inter-mode decision early in the enhancement layers by estimating the rate-distortion (RD) cost from the macroblocks of the base layer and the enhancement layer in temporal, spatial, and inter-layer directions. Moreover, a search range decision algorithm is also proposed in this paper to further increase the motion estimation speed by using the motion vector information from temporal, spatial, or inter-layer domains. Simulation results show that the proposed algorithm can determine the best mode and provide more efficient total coding time saving with very slight RD performance degradation for spatial and quality scalabilities.

• Journal of information and communication convergence engineering
• /
• v.8 no.1
• /
• pp.71-76
• /
• 2010

Scalable video coding (SVC) has been standardized as an extension of the H.264/AVC standard. SVC allows straightforward adaptation of video streams by providing layered bit streams. In this paper, we propose a SVC video-based multicasting system preserving scalable security which is able to provide a SVC video service while maintaining information security. In order to maintain information security between a server and a client during all transmission time, the proposed system immediately performs a packet filtering process without decoding with respect to encrypted data received in a routing device, thereby reducing an amount of calculations and latency.

• Journal of Digital Contents Society
• /
• v.18 no.1
• /
• pp.141-147
• /
• 2017

Scalable extension of High Efficiency Video Coding (SHVC) standard uses the up-sampled residual data from the base layer to make a residual data in the enhancement layer. This paper describes an efficient algorithm for improving coding gain by using the filtered residual signal of base layer in the Scalable extension of High Efficiency Video Coding (SHVC). The proposed adaptive filter selection mechanism uses the smoothing and sharpening filters to enhance the quality of inter-layer prediction. Based on two filters and the existing up-sampling filter, a rate-distortion (RD)-cost fuction-based competitive scheme is proposed to get better quality of video. Experimental results showed that average BD-rate gains of 1.5%, 2.1%, and 1.7% for Y, U and V components, respectively, were achieved, compared with SHVC reference software 5.0, which is based on HEVC reference model (HM) 13.

• Journal of Broadcast Engineering
• /
• v.21 no.2
• /
• pp.237-251
• /
• 2016

The conventional 3D-HEVC uses the depth data of the other view instead of that of the current view because the texture data has to be encoded before the corresponding depth data of the current view has been encoded, where the depth data of the other view is used as the predicted depth for the current view. Whereas the conventional 3D-HEVC has no other candidate for the predicted depth information except for that of the other view, the scalable 3D-HEVC utilizes the depth data of the lower spatial layer whose view ID is equal to that of the current picture. The depth data of the lower spatial layer is up-scaled to the resolution of the current picture, and then the enlarged depth data is used as the predicted depth information. Because the quality of the enlarged depth is much higher than that of the depth of the other view, the proposed scheme increases the coding efficiency of the scalable 3D-HEVC codec. Computer simulation results show that the scalable 3D-HEVC is useful and the proposed scheme to use the enlarged depth data for the current picture provides the significant coding gain.

• Journal of Broadcast Engineering
• /
• v.12 no.2
• /
• pp.102-111
• /
• 2007

Currently, the efficient adaptive video streaming services and coding techniques are required to ensure quality of service (QoS) in diverse multimedia environments. To maintain optimal video quality in these environments, it is required to support scalable video coding (SVC) technique and proper QoS metric methods. In this paper, we propose a new quality metric that takes in to the temporal, the SNR, the spatial scalability on SVC. Experimental results shows that proposed method has a higher correlation with the subjective quality. We expect that the proposed metric plays an important role in deciding the coding parameter to optimize the quality of the SVC based video.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.123-126
• /
• 2007

This paper presents the SVC (Scalable Video Coding) scheme which enables the AT-DMB (Advanced Terrestrial - DMB) video service in enhancement layer, while keeping the current T-DMB video service in base layer. But, it is very complicate to implement the SVC encoder and so it is necessary to analyze the complexity and performance for SVC encoder's structures and coding parameters. In this paper, through computer simulations, SVC coding parameters are tested and then, based on these results, three types of SVC encoder models are compared from the viewpoint of the complexity and performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.11
• /
• pp.2015-2020
• /
• 2007

This paper presents the SVC(Scalable Video Coding) scheme which enables the AT-DMB(Advanced Terrestrial-DMB) video service in enhancement layer, while keeping the current T-DMB video service in base layer. But, it is very complicate to implement the SVC encoder and so it is necessary to analyze the complexity and performance for SVC encoder#s structures and coding parameters. In this paper, through computer simulations, SVC coding parameters are tested and then, based on these results, three types of SVC encoder models are compared from the viewpoint of the complexity and performance.

• Journal of Broadcast Engineering
• /
• v.6 no.3
• /
• pp.225-233
• /
• 2001

Real-time video communication applications over Internet should be able to support such functionality as scalability because of the unpredictable and varying channel bandwidth between server and client. To accommodatethe wide variety of channel bitrates, a new scalable coding tool, namely the Fine Granular Scalability (FGS) coding tool has been reduce the adopted In the MPEG-4 video standard. This paper presentsa new FGS algorithm with matching Pursuit that can reduce the computational complexity of ordinal matching pursuit-based algorithm. The Proposed coding algorithm can make trade-off between Picture Quality and computationalcomplexity. Our simulation result shows that the proposed algorithm can reduce the computational cumplexity up to 1/5 compared to the conventional FGS method while retaining a similar picture quality.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.13 no.5
• /
• pp.415-422
• /
• 2013

In this paper, we present Self-Checking look-up-table (LUT) based on Scalable Error Detection Coding (SEDC) scheme for use in fault-tolerant reconfigurable architectures. SEDC scheme has shorter latency than any other existing coding schemes for all unidirectional error detection and the LUT execution time remains unaffected with self-checking capabilities. SEDC scheme partitions the contents of LUT into combinations of 1-, 2-, 3- and 4-bit segments and generates corresponding check codes in parallel. We show that the proposed LUT with SEDC performs better than LUT with traditional Berger as well as Partitioned Berger Coding schemes. For 32-bit data, LUT with SEDC takes 39% less area and 6.6 times faster for self-checking than LUT with traditional Berger Coding scheme.