• Title/Summary/Keyword: Encoding Scheme

Search Result 333, Processing Time 0.026 seconds

Performance improvement for Streaming of High Capacity Panoramic Video (대용량 파노라마 비디오 스트리밍의 성능개선)

  • Kim, Young-Back;Kim, Tae-Ho;Lee, Dae-Gyu;Kim, Jae-Joon
    • Journal of Internet Computing and Services
    • /
    • v.11 no.2
    • /
    • pp.143-153
    • /
    • 2010
  • When providing high quality panoramic video across the Internet, mobile communications, and broadcasting areas, it requires a suitable video codec that satisfies both high-compression efficiency and random access functionality. The users must have high-compression efficiency in order to enable video streaming of high-volume panoramic data. Random access allows the user to move the viewpoint and direction freely. In this paper, we propose the parallel processing scheme under cell units in order to improve the performance of streaming service for large screen panoramic video in 10Mbps bandwidths based on H.264/AVC with high compression rate. This improved algorithm divides a screen composed of cells less than $256{\times}256$ in size, encodes it, and decodes it with the cells in the present view. At this point, encoding/decoding is parallel processed by the present cell units. Also, since the cells only included in the present view are packed and transmitted, the possible processing of not extricating blocks is proven by experiment.

High Compression Image Coding with BTC Parameters (BTC 파라메타를 이용한 고압축 영상부호화)

  • Shim, Young-Serk;Lee, Hark-Jun
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.2
    • /
    • pp.140-146
    • /
    • 1989
  • An efficient quantization and encoding of BTC (Block Truncation Coding) parameters {($Y_{\alpha},\;Y_{\beta}),\;P_{{\beta}/{\beta}}$} are investigated, In our algorithm 4${\times}$4 blocks are classified into flat or edge block. While edge block is represented by two approximation level $Y_{\alpha},\;Y_{\beta}$ with label plane $P_{{\beta}/{\beta}}$, flat block is represented by single approximation level Y. The approximation levels Y, $Y_{\alpha}$ and $Y_{\beta}$ are encoded by predictive quatization specially designed, and the label plane $P_{{\beta}/{\beta}}$ is tried to be encoded using stored 32 reference plantes. The performance of the proposed scheme has appeared comparable to much more complex transform coding in terms of SNR, although it requires more study on the representation of small slope in background.

  • PDF

Error Resilient Scheme in Video Data Transmission using Information Hiding (정보은닉을 이용한 동영상 데이터의 전송 오류 보정)

  • Bae, Chang-Seok;Choe, Yoon-Sik
    • The KIPS Transactions:PartB
    • /
    • v.10B no.2
    • /
    • pp.189-196
    • /
    • 2003
  • This paper describes an error resilient video data transmission method using information hiding. In order to localize transmission errors in receiver, video encoder embeds one bit for a macro block during encoding process. Embedded information is detected during decoding process in the receiver, and the transmission errors can be localized by comparing the original embedding data. The localized transmission errors can be easily corrected, thus the degradation in a reconstructed image can be alleviated. Futhermore, the embedded information can be applied to protect intellectual property rights of the video data. Experimental results for 3 QCIF sized video sequenced composed of 150 frames respectively show that, while degradation in video streams in which the information is embedded is negligible, especially in a noisy channel, the average PSNR of reconstructed images can be improved about 5 dB by using embedded information. Also, intellectual property rights information can be effectively obtained from reconstructed images.

Speech Basis Matrix Using Noise Data and NMF-Based Speech Enhancement Scheme (잡음 데이터를 활용한 음성 기저 행렬과 NMF 기반 음성 향상 기법)

  • Kwon, Kisoo;Kim, Hyung Young;Kim, Nam Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.4
    • /
    • pp.619-627
    • /
    • 2015
  • This paper presents a speech enhancement method using non-negative matrix factorization (NMF). In the training phase, each basis matrix of source signal is obtained from a proper database, and these basis matrices are utilized for the source separation. In this case, the performance of speech enhancement relies heavily on the basis matrix. The proposed method for which speech basis matrix is made a high reconstruction error for noise signal shows a better performance than the standard NMF which basis matrix is trained independently. For comparison, we propose another method, and evaluate one of previous method. In the experiment result, the performance is evaluated by perceptual evaluation speech quality and signal to distortion ratio, and the proposed method outperformed the other methods.

A Macroblock-Layer Rate Control with Adaptive Quantization Parameter Decision and Header Bits Length Estimation (적응적 양자화 파라미터 결정과 헤더 비트량 예측을 통한 매크로블록 단위 비트율 제어)

  • Kim, Se-Ho;Suh, Jae-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.2C
    • /
    • pp.200-208
    • /
    • 2009
  • A macroblock layer rate control for H.264/AVC has the problem that allocated target bits for current frame occasionally are exhausted too fast due to inadequate quantization parameter assignment. In this case, the maximum permissible quantization parameter is used to encode for remaining macroblocks and it leads to degradation of the visual quality. In addition, the header bits length estimation algorithm used for quantization parameter assignment takes the average header bits length for the encoded macroblocks of the previous frame and the current frame. Therefore, it generates a big mismatch between the actually generated header bits length and the estimated header bits length. In this paper, we propose adaptive quantization parameter decision method to prevent early exhausting target bits during encoding the current frame by considering the number of macroblocks that have negative targets bits in previous frame and the improved header bits length estimation scheme for accurate quantization parameter decision.

A Study on the Distributed Transcoding System using Secret Sharing Techniques (비밀분산기법을 이용한 분산 트랜스코딩 시스템 연구)

  • Song, You-Jin;Gu, Seokmo;Kim, Yei-Chang
    • Journal of Digital Convergence
    • /
    • v.12 no.11
    • /
    • pp.233-239
    • /
    • 2014
  • Ultra high-resolution content, the file size is very large, therefore existing encoding techniques, it is not possible to transmit via the network. Efficient use of the network encoder HEVC corporation can be transferred. Compression requires a lot of time because it requires a distributed transcoding system. Distributed transcoding system is a distributed data store, and then encoded using a large number of nodes. The disadvantage of distributed transcoding system for distributed information is exposed or vulnerable to attack by internal managers. In this paper, when the super high definition content transcoding, distributed transcoding system does not guarantee the confidentiality of the problem to solve. We are using SNA, HEVC encoded content data encrypted using the secret distributing scheme was. Consequently, secure shared transcoding is possible, the internal administrator could prevent the attack.

Study on Performance of Double Binary Turbo Code for Power Line Communication Systems Base on OFDM (OFDM 기반의 전력선 통신 시스템에서 이중 이진 터보 부호 성능 연구)

  • Kim, Jin-Young;Cha, Jae-Sang;Kim, Seong-Kweon;Lee, Jong-Joo;Kim, Jae-Hyun;Lee, Chong-Hoon;Kim, Eun-Cheol
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.3
    • /
    • pp.193-199
    • /
    • 2009
  • Powerline communications (PLC) technology has been discussed and analyzed as a highly potential candidate of wireline access network solutions. In this paper, performance of double binary turbo coded orthogonal frequency division multiplexing (OFDM) system is analyzed and simulated in power line communications channel. In order to make power line channel environments, Bernoulli-Gaussian noise is considered. The performance is evaluated in terms of bit error probability. From the simulation results, it is demonstrated that the double binary turbo coding scheme offers considerable coding gain with reasonable encoding complexity. It is also shown that the system performance can be substantially improved by increasing the number of iterations.

  • PDF

Model-based Macroblock Layer Rate Control for Low Bit Rate Video Coding (저전송률 비디오 압축을 위한 모델 기반 매크로블록 레이어 비트율 제어)

  • Park, Sang-Hyun
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.4
    • /
    • pp.50-57
    • /
    • 2009
  • This paper presents a new model-based macroblock layer rate control algorithm for low bit rate video coding which generates output bits corresponding to a target bit budget. The H.264 standard uses various coding modes and optimization methods to improve the compression performance, which makes it difficult to control the generated traffic accurately in low bit rate environments. In the proposed scheme, we first estimate MAD values of macroblocks in a frame and define a target remaining bits using the estimated MAD values before encoding each macroblock. If a difference between the target value and the actual value is greater than a threshold value, the quantization parameter is adjusted to decrease the difference. It is shown by experimental results that the new algorithm can obtain more than 66% decrease of the difference between the target bits and the resulting bits for a frame with the PSNR performance better than that of the existing rate control algorithm.

Digital Video Watermarking Using Block Reordering Algorithm Based on DCT (DCT 기반의 블록 재정렬 알고리즘을 이용한 디지털 비디오 워터마킹)

  • Kim Kyoung-Sik;Park Kyung-Jun;Ko Hyung Hwa
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.7C
    • /
    • pp.696-705
    • /
    • 2005
  • The rapid progress of the software has enabled individuals to copy and remake digital contents, which was only done by professionals. However, this rapid growth of software has brought many other defects. As a solution to the problems, contents producer needs to have certification and inspection of its contents text and hold the proprietary rights. In this paper, the new video watermarking scheme is proposed which is appropriate for the requirements mentioned for digital video contents and it is applied to MPEG-2 video encoder and decoder. In order to insert watermark sequence for digital video data, watermarking used blocks reordering algorithm and SCL(secret code list). It is satisfied two properties of cryptography that confidentiality and integrity. We test the proposed algorithm to see its performance in terms of watermark capacity, compression robustness and visual quality impact. According to the experiment of proposed watermarking algorithm, we obtained satisfactory results that watermark can still be extracted after MPEG-2 re-encoding at lower bit rates. It is important property for data hiding and user authentication in video data.

Texture Image Database Retrieval Using JPEG-2000 Partial Entropy Decoding (JPEG-2000 부분 엔트로피 복호화에 의향 질감 영상 데이터베이스 검색)

  • Park, Ha-Joong;Jung, Ho-Youl
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.5C
    • /
    • pp.496-512
    • /
    • 2007
  • In this paper, we propose a novel JPEG-2000 compressed image retrieval system using feature vector extracted through partial entropy decoding. Main idea of the proposed method is to utilize the context information that is generated during entropy encoding/decoding. In the framework of JPEG-2000, the context of a current coefficient is determined depending on the pattern of the significance and/or the sign of its neighbors in three bit-plane coding passes and four coding modes. The contexts provide a model for estimating the probability of each symbol to be coded. And they can efficiently describe texture images which have different pattern because they represent the local property of images. In addition, our system can directly search the images in the JPEG-2000 compressed domain without full decompression. Therefore, our proposed scheme can accelerate the work of retrieving images. We create various distortion and similarity image databases using MIT VisTex texture images for simulation. we evaluate the proposed algorithm comparing with the previous ones. Through simulations, we demonstrate that our method achieves good performance in terms of the retrieval accuracy as well as the computational complexity.