• Title/Summary/Keyword: distributed coding

Search Result 230, Processing Time 0.027 seconds

Distributed Video Coding for Illumination Compensation of Multi-view Video

  • Park, Sean-Ae;Sim, Dong-Gyu;Jeon, Byeung-Woo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.6
    • /
    • pp.1222-1236
    • /
    • 2010
  • In this paper, we propose an improved distributed multi-view video coding method that is robust to illumination changes among different views. The use of view dependency is not effective for multi-view video because each view has different intrinsic and extrinsic camera parameters. In this paper, a modified distributed multi-view coding method is presented that applies illumination compensation when generating side information. The proposed encoder codes DC values of discrete cosine transform (DCT) coefficients separately by entropy coding. The proposed decoder can generate more accurate side information by using the transmitted DC coefficients to compensate for illumination changes. Furthermore, AC coefficients are coded with conventional entropy or channel coders depending on the frequency band. We found that the proposed algorithm is about 0.1~0.5 dB better than conventional algorithms.

Depth Map Based Distributed Multi-view Video Coding Scheme through an Efficient Side Information Generation (효율적인 보조 정보 생성을 통한 깊이지도 기반의 분산 다시점 비디오 코딩 기법)

  • Yoo, Ji-Hwan;Lee, Dong-Seok;Kim, Tae-June;Yoo, Ji-Sang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.10B
    • /
    • pp.1093-1103
    • /
    • 2009
  • In this paper, we propose a new depth map based distributed multi-view video coding algorithm through an efficient side information generation. A distributed video coding scheme corrects errors between an original image and side information generated at a decoder by using channel coding techniques. Therefore, the more accurate side information is generated, the better performance of distributed video coding scheme is achieved. In the proposed algorithm, a distributed video coding scheme is applied to multi-view video coding based on depth map. Side information is also generated from images of adjacent views through 3D warping by using a depth map and is also combined with MCTI(motion compensated temporal interpolation) which uses images on a temporal axis, and 3D warping. Experimental results show that side information generated by using the proposed algorithm has 0.97dB better average PSNR compared with using MCTI and 3D warping separated. In addition, 8.01% of average bit-rate has been decreased while the same PSNR in R-D curves is kept.

Distributed Coding Scheme for Multi-view Video through Efficient Side Information Generation

  • Yoo, Jihwan;Ko, Min Soo;Kwon, Soon Chul;Seo, Young-Ho;Kim, Dong-Wook;Yoo, Jisang
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.5
    • /
    • pp.1762-1773
    • /
    • 2014
  • In this paper, a distributed image coding scheme for multi-view video through an efficient generation of side information is proposed. A distributed video coding technique corrects the errors in the side information, which is generated with the original image, by using the channel coding technique at the decoder. Therefore, the more correct the generated side information is, the better the performance of distributed video coding. The proposed technique is to apply the distributed video coding schemes to the image coding for multi-view video. It generates side information by selectively and efficiently using both 3-dimensional warping based on the depth map with spatially adjacent frames and motion-compensated temporal interpolation with temporally adjacent frames. In this scheme the difference between the adjacent frames, the sizes of the motion vectors for the adjacent blocks, and the edge information are used as the selection criteria. From the experiments, it was observed that the quality of the side information generated by the proposed technique was improved by the average peak signal-to-noise ratio of 0.97dB than the one by motion-compensated temporal interpolation or 3-dimensional warping. The result from analyzing the rate-distortion curves revealed that the proposed scheme could reduce the bit-rate by 8.01% on average at the same peak signal-to-noise ratio value, compared to previous work.

Adaptive Motion Vector Smoothing for Improving Side Information in Distributed Video Coding

  • Guo, Jun;Kim, Joo-Hee
    • Journal of Information Processing Systems
    • /
    • v.7 no.1
    • /
    • pp.103-110
    • /
    • 2011
  • In this paper, an adaptive motion vector smoothing scheme based on weighted vector median filtering is proposed in order to eliminate the motion outliers more effectively for improving the quality of side information in frame-based distributed video coding. We use a simple motion vector outlier reliability measure for each block in a motion compensated interpolated frame and apply weighted vector median filtering only to the blocks with unreliable motion vectors. Simulation results show that the proposed adaptive motion vector smoothing algorithm improves the quality of the side information significantly while maintaining low complexity at the encoder in frame-based distributed video coding.

Network Coding for Energy-Efficient Distributed Storage System in Wireless Sensor Networks

  • Wang, Lei;Yang, Yuwang;Zhao, Wei;Lu, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.9
    • /
    • pp.2134-2153
    • /
    • 2013
  • A network-coding-based scheme is proposed to improve the energy efficiency of distributed storage systems in WSNs (Wireless Sensor Networks). We mainly focus on two problems: firstly, consideration is given to effective distributed storage technology; secondly, we address how to effectively repair the data in failed storage nodes. For the first problem, we propose a method to obtain a sparse generator matrix to construct network codes, and this sparse generator matrix is proven to be the sparsest. Benefiting from this matrix, the energy consumption required to implement distributed storage is reduced. For the second problem, we designed a network-coding-based iterative repair method, which adequately utilizes the idea of re-encoding at intermediate nodes from network coding theory. Benefiting from the re-encoding, the energy consumption required by data repair is significantly reduced. Moreover, we provide an explicit lower bound of field size required by this scheme, which implies that it can work over a small field and the required computation overhead is very low. The simulation result verifies that the proposed scheme not only reduces the total energy consumption required to implement distributed storage system in WSNs, but also balances energy consumption of the networks.

Distributed video coding complexity balancing method by phase motion estimation algorithm (단계적 움직임 예측을 이용한 분산비디오코딩(DVC)의 복잡도 분배 방법)

  • Kim, Chul-Keun;Kim, Min-Geon;Suh, Doug-Young;Park, Jong-Bin;Jeon, Byeung-Woo
    • Journal of Broadcast Engineering
    • /
    • v.15 no.1
    • /
    • pp.112-121
    • /
    • 2010
  • Distributed video coding is a coding paradigm that allows complexity to be shared between encoder and decoder, in contrast with conventional video coding. We propose that complexity balancing method of encoder/decoder by phase motion estimation algorithm. The encoder performs partial motion estimation. The result of the partial motion estimation is transferred to the decoder, and the decoder performs motion estimation within the narrow range. When the encoder can afford some complexity, complexity balancing is possible. The method proposed is able to know relativity between complexity balancing and coding efficiency. The coding efficiency increase rate by the encoder complexity increases is higher than that by the decoder complexity increases. The proposed method can control the complexity and coding efficiency according to devices' resources and channel conditions.

A study on performance evaluation of DVCs with different coding method and feasibility of spatial scalable DVC (분산 동영상 코딩의 코딩 방식에 따른 성능 평가와 공간 계층화 코더로서의 가능성에 대한 연구)

  • Kim, Dae-Yeon;Park, Gwang-Hoon;Kim, Kyu-Heon;Suh, Doug-Young
    • Journal of Broadcast Engineering
    • /
    • v.12 no.6
    • /
    • pp.585-595
    • /
    • 2007
  • Distributed video coding is a new video coding paradigm based on Slepian-Wolf and Wyner-Ziv's information theory Distributed video coding whose decoder exploits side information transfers its computational burden from encoder to decoder, so that encoding with light computational power can be realized. RD performance is superior than that of standard video coding without motion compensation process but still has a gap with that of coding with motion compensation process. This parer introduces basic theory of distributed video coding and its structure and then shows RD performances of DVCs whose coding style is different from each other and of a DVC as a spatial scalable video coder.

Improvement of Feedback Delay for Practical Distributed Source Coding (실제적인 분산 비디오 부호화를 위한 분산 소스 부호화 시스템의 피드백 지연 문제 개선 방안)

  • Shin, Seung-Shik;Shin, Sang-Yun;Jang, Min;Lim, Dae-Woon;Kim, Sang-Hyo
    • Journal of Broadcast Engineering
    • /
    • v.17 no.1
    • /
    • pp.122-128
    • /
    • 2012
  • Because of the system delay caused by the number of feedback retransmission in Distributed Video Coding (DVC) scheme, it is difficult to realize practical DVC in many cases. In this paper low feedback retransmission Distributed Source Coding (DSC) scheme is proposed for practical DVC scheme based on Low-Density Parity-Check (LDPC) codes because DVC system is an specific application of DSC system. This DSC scheme is achieved by using different LDPC codes optimized in each different compression rate and using source revealing scheme. Optimized LDPC codes provide us much better decoding performance which causes the 57% reduced number of iteration. Consequently, the number of feedback retransmission is decreased by 50%.

Complexity of Distributed Source Coding using LDPCA Codes (LDPCA 부호를 이용한 실용적 분산 소스 부호화의 복호복잡도)

  • Jang, Min;Kang, Jin-Whan;Kim, Sang-Hyo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.4C
    • /
    • pp.329-336
    • /
    • 2010
  • Distributed source coding (DSC) system moves computational burden from encoder to decoder, so it takes higher decoding complexity. This paper explores the problem of reducing the decoding complexity of practical Slepian-Wolf coding using low-density parity check accumulate (LDPCA) codes. It is shown that the convergence of mean magnitude (CMM) stopping criteria for LDPC codes help reduce the 85% of decoding complexity under the 2% of compression rate loss, and marginal initial rate request reduces complexity below complexity minimum bound. Moreover, inter-rate stopping criterion, modified for rate-adaptable characteristic, is proposed for LDPCA codes, and it makes decoder perform less iterative decoding than normal stopping criterion does when channel characteristic is unknown.

A Skip-mode Coding for Distributed Compressive Video Sensing (분산 압축 비디오 센싱을 위한 스킵모드 부호화)

  • Nguyen, Quang Hong;Dinh, Khanh Quoc;Nguyen, Viet Anh;Trinh, Chien Van;Park, Younghyeon;Jeon, Byeungwoo
    • Journal of Broadcast Engineering
    • /
    • v.19 no.2
    • /
    • pp.257-267
    • /
    • 2014
  • Distributed compressive video sensing (DCVS) is a low cost sampling paradigm for video coding based on the compressive sensing and the distributed video coding. In this paper, we propose using a skip-mode coding in DCVS under the assumption that in case of high temporal correlation, temporal interpolation can guarantee sufficiently good quality of nonkey frame, therefore no need to transmit measurement data in such a nonkey frame. Furthermore, we extend it to use a hierarchical structure for better temporal interpolation. Simulation results show that the proposed skip-mode coding can save the average subrate of whole video sequence while the PSNR is reduced only slightly. In addition, by using the proposed scheme, the computational complexity is also highly decreased at decoder on average by 43.75% for video sequences that have strong temporal correlation.