• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.9
• /
• pp.746-752
• /
• 2012

SVC layered video is consists of a Base Layer (BL) and Enhancement Layer (EL). Without the base layer decoding, the higher EL layer can not be decoded. Therefore, successful transfer of the BL is important factor for improving the SVC video data. In this paper, we propose a network coding of layered video to improve success decoding probability with the importance order of the video data over a multi-relay system. We shows that formula analysis and experimental results of the proposed network coding scheme. In addition, we shows performance of video quality according to the number of relays.

• Journal of Broadcast Engineering
• /
• v.9 no.4 s.25
• /
• pp.391-401
• /
• 2004

In this paper, we introduce a novel coding method to efficiently enable spatial random access for high resolution video. In terms of resolution and display size, standard display devices (such as cathode-ray tubes. monitors. PDAs, and LCDs) do not sufficiently support high resolution video such as digital cinema and panoramic video. Currently, users have no choice but to view video at lower resolution as a result of down-sampling, or only a partial region of the video due to display size limitations. Our proposed method. which we call the B-map, represents the set of starting locations of the coded segments in a picture frame. This information, or B-map, is first sent to the decoder prior to the coded data stream of the frame and is then used for fast local decoding. To test our method, we compare our B-map with JPEG tiling and the JPEG Resynchronization marker. Experimental results show that the proposed coding method requires less overhead than existing methods during the same decoding time. The results show promise for future panoramic or digital cinema applications.

• Journal of Multimedia Information System
• /
• v.5 no.3
• /
• pp.201-208
• /
• 2018

High Efficiency Video Coding range extensions (HEVC RExt) is a kind of extension model of HEVC. HEVC RExt was specially designed for dealing the high quality images. HEVC RExt is very essential for studio editing which handle the very high quality and various type of images. There are some problems to dealing these massive data in studio editing. One of the most important procedure is re-encoding and decoding procedure during the editing. Various codecs are widely used for studio data editing. But most of the codecs have common problems to dealing the massive data in studio editing. First, the re-encoding and decoding processes are frequently occurred during the studio data editing and it brings enormous time-consuming and video quality loss. This paper, we suggest new video coding structure for the efficient studio video editing. The coding structure which is called "ultra-low delay (ULD)". It has the very simple and low-delayed referencing structure. To simplify the referencing structure, we can minimize the number of the frames which need decoding and re-encoding process. It also prevents the quality degradation caused by the frequent re-encoding. Various fast coding algorithms are also proposed for efficient editing such as tool-level optimization, multi-serve based distributed coding and SIMD (Single instruction, multiple data) based parallel processing. It can reduce the enormous computational complexity during the editing procedure. The proposed method shows 9500 times faster coding speed with negligible loss of quality. The proposed method also shows better coding gain compare to "intra only" structure. We can confirm that the proposed method can solve the existing problems of the studio video editing efficiently.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.4
• /
• pp.160-172
• /
• 2014

Although Wyner-Ziv (WZ) video coding proves useful for applications employing encoders having restricted computing resources, the WZ decoder has a problem of excessive decoding complexity. It is mainly due to its iterative LDPC channel decoding process which repeatedly requests incremental parity data after iterative channel decoding of parity data received at each request. In order to solve the complexity problem, we divide bit planes into two groups and estimate the minimum required number of parity requests separately for the two groups of bit planes using bit plane correlation. The WZ decoder executes the iterative decoding process only after receiving parity data corresponding to the estimated minimum number of parity requests. The proposed method saves about 71% of the computing time in the LDPC decoding process.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.9
• /
• pp.2351-2369
• /
• 2012

This paper describes interpolation method of motion field in the Wyner-Ziv video coding (WZVC) based on Expectation-Maximization (EM) algorithm. In the EM algorithm, the estimated motion field distribution is calculated on a block-by-block basis. Each pixel in the block shares similar probability distribution, producing an undesired blocking artefact on the pixel-based motion field. The proposed interpolation techniques are Bicubic and Lanczos which successively use 16 and 32 neighborhood probability distributions of block-based motion field for one pixel in k-by-k block on pixel-based motion field. EM-based WZVC codec updates the estimated probability distribution on block-based motion field, and interpolates it to pixel resolution. This is required to generate higher-quality soft side information (SI) such that the decoding algorithm is able to make syndrome estimation more quickly. Our experiments showed that the proposed interpolation methods have the capability to reduce EM-based WZVC decoding complexity with small increment of bit rate.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.161-162
• /
• 2011

Recently, many research works are focusing on DVC (Distributed Video Coding) system for low complexity encoder. However the feedback channel-based parity bit control is a major cause of the high decoding time latency. Spatial and temporal correlation is high in video and, therefore, the statistical property can be applied for the parity bit request of LDPCA frame. By introducing frame adaptive parity bit request estimation method, this paper proposes a new method for reducing the decoding time latency. Through computer simulations, it is shown that the proposed method achieves about 80% of complexity reduction, compared to the conventional no-estimation method.

• Journal of Broadcast Engineering
• /
• v.16 no.4
• /
• pp.635-646
• /
• 2011

In distributed video coding, low complexity encoder can be realized by shifting encoder-side complex processes to decoder-side. However, not only motion estimation/compensation processes but also complex LDPC decoding process are imposed to the Wyner-Ziv decoder, therefore decoder-side complexity has been one important issue to improve. LDPC decoding process consists of numerous iterative decoding processes, therefore complexity increases as the number of iteration increases. This iterative LDPC decoding process accounts for more than 60% of whole WZ decoding complexity, therefore it can be said to be a main target for complexity reduction. Previously, HDA (Hard Decision Aided) method is introduced for fast LDPC decoding process. For currently received parity bits, HDA method certainly reduces the complexity of decoding process, however, LDPC decoding process is still performed even with insufficient amount of parity request which cannot lead to successful LDPC decoding. Therefore, we can further reduce complexity by avoiding the decoding process for insufficient parity bits. In this paper, therefore, a parity request estimation method is proposed using bit plane-wise correlation and temporal correlation. Joint usage of HDA method and the proposed method achieves about 72% of complexity reduction in LDPC decoding process, while rate distortion performance is degraded only by -0.0275 dB in BDPSNR.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.4
• /
• pp.187-194
• /
• 2011

In this paper, JPEG(Joint Photographic Experts Group) image data video decoding technique is presented, it is Huffman decoding method and fractal image method which is very complexive algorithm and the time required much it to implement this method and the first image is decoded to video frame image. This have defect of overlap decoding and transport work because of impossible to represent objective value of resemblance. The proposed method was calculated the mathematical absolute image resemblance and simplify the moving picture process to reducing the step of moving picture codefying. The results show that smoothed moving picture compared recent methods.

• Proceedings of the IEEK Conference
• /
• 2001.06d
• /
• pp.41-44
• /
• 2001

Variable length coding (VLC) has been used in many well known standard video coding algorithms such as MPEG and H.26x. However, VLC can not be processed parallelly because of its sequentiality. This sequentiality is a big barrier for implementing a real-time software video codec since parallel schemes can not be applied. In this paper, we propose a new fast VLD (Variable Length Decoding) method based on the probabilistic distribution of symbols in VLC tables used in MPEG as well as H.263 standard codecs. Even though MPEG suggests the table partitioning method, they do not show theoretically why the number of partitioned tables is two or three. We suggest the method for deciding the number of partitioned tables. Applying our scheme to several well-known MPEG-2 test sequences, we can reduce the computational time up to about 10% without any sacrificing video quality

• IEIE Transactions on Smart Processing and Computing
• /
• v.6 no.2
• /
• pp.93-101
• /
• 2017

This paper proposes an algorithm for adaptive loop filter (ALF) complexity reduction in the decoding process. In the original ALF algorithm, filtering for I frames is performed in the frame unit, and thus, all of the pixels in a frame are filtered if the current frame is an I frame. The proposed algorithm is designed on top of the local gradient calculation. On both the encoder side and the decoder side, homogeneous areas are checked and skipped in the filtering process, and the filter coefficient calculation is only performed in the inhomogeneous areas. The proposed algorithm is implemented in Joint Exploration Model (JEM) version 3.0 future video coding reference software. The proposed algorithm is applied for frame-level filtering and intra configuration. Compared with the JEM 3.0 anchor, the proposed algorithm has 0.31%, 0.76% and 0.73% bit rate loss for luma (Y) and chroma (U and V), respectively, with about an 8% decrease in decoding time.