• Title/Summary/Keyword: Encoding Scheme

Search Result 333, Processing Time 0.029 seconds

Distributed Video Coding Based on Selective Block Encoding Using Feedback of Motion Information (움직임 정보의 피드백을 갖는 선택적 블록 부호화에 기초한 분산 비디오 부호화 기법)

  • Kim, Jin-Soo;Kim, Jae-Gon;Seo, Kwang-Deok;Lee, Myeong-Jin
    • Journal of Broadcast Engineering
    • /
    • v.15 no.5
    • /
    • pp.642-652
    • /
    • 2010
  • Recently, DVC (Distributed Video Coding) techniques are drawing a lot of interests as one of the future research works to achieve low complexity encoding in various applications. But, due to the limited computational complexity, the performances of DVC algorithms are inferior to those of conventional international standard video coders, which use zig-zag scan, run length code, entropy code and skipped macroblock. In this paper, in order to overcome the performance limit of the DVC system, the distortion for every block is estimated when side information is found at the decoder and then we propose a new selective block encoding scheme which provides the encoder side with the motion information for the highly distorted blocks and then allows the sender to encode the motion compensated frame difference signal. Through computer simulations, it is shown that the coding efficiency of the proposed scheme reaches almost that of the conventional inter-frame coding scheme.

Lossless VQ Indices Compression Based on the High Correlation of Adjacent Image Blocks

  • Wang, Zhi-Hui;Yang, Hai-Rui;Chang, Chin-Chen;Horng, Gwoboa;Huang, Ying-Hsuan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.8
    • /
    • pp.2913-2929
    • /
    • 2014
  • Traditional vector quantization (VQ) schemes encode image blocks as VQ indices, in which there is significant similarity between the image block and the codeword of the VQ index. Thus, the method can compress an image and maintain good image quality. This paper proposes a novel lossless VQ indices compression algorithm to further compress the VQ index table. Our scheme exploits the high correlation of adjacent image blocks to search for the same VQ index with the current encoding index from the neighboring indices. To increase compression efficiency, codewords in the codebook are sorted according to the degree of similarity of adjacent VQ indices to generate a state codebook to find the same index with the current encoding index. Note that the repetition indices both on the search path and in the state codebooks are excluded to increase the possibility for matching the current encoding index. Experimental results illustrated the superiority of our scheme over other compression schemes in the index domain.

A Fast Intra Skip Detection Algorithm for H.264/AVC Video Encoding

  • Kim, Byung-Gyu;Kim, Jong-Ho;Cho, Chang-Sik
    • ETRI Journal
    • /
    • v.28 no.6
    • /
    • pp.721-731
    • /
    • 2006
  • A fast intra skip detection algorithm based on the ratedistortion (RD) cost for an inter frame (P-slices) is proposed for H.264/AVC video encoding. In the H.264/AVC coding standard, a robust rate-distortion optimization technique is used to select the best coding mode and reference frame for each macroblock (MB). There are three types of intra predictions according to profiles. These are $16{\times}16$ and $4{\times}4$ intra predictions for luminance and an $8{\times}8$ intra prediction for chroma. For the high profile, an $8{\times}8$ intra prediction has been added for luminance. The $4{\times}4$ prediction mode has 9 prediction directions with 4 directions for $16{\times}16$ and $8{\times}8$ luma, and $8{\times}8$ chrominance. In addition to the inter mode search procedure, an intra mode search causes a significant increase in the complexity and computational load for an inter frame. To reduce the computational load of the intra mode search at the inter frame, the RD costs of the neighborhood MBs for the current MB are used and we propose an adaptive thresholding scheme for the intra skip extraction. We verified the performance of the proposed scheme through comparative analysis of experimental results using joint model reference software. The overall encoding time was reduced up to 32% for the IPPP sequence type and 35% for the IBBPBBP sequence type.

  • PDF

Avalanche and Bit Independence Properties of Photon-counting Double Random Phase Encoding in Gyrator Domain

  • Lee, Jieun;Sultana, Nishat;Yi, Faliu;Moon, Inkyu
    • Current Optics and Photonics
    • /
    • v.2 no.4
    • /
    • pp.368-377
    • /
    • 2018
  • In this paper, we evaluate cryptographic properties of a double random phase encoding (DRPE) scheme in the discrete Gyrator domain with avalanche and bit independence criterions. DRPE in the discrete Gyrator domain is reported to have higher security than traditional DRPE in the Fourier domain because the rotation angle involved in the Gyrator transform is viewed as additional secret keys. However, our numerical experimental results demonstrate that the DRPE in the discrete Gyrator domain has an excellent bit independence feature but does not possess a good avalanche effect property and hence needs to be improved to satisfy with acceptable avalanche effect that would be robust against statistical-based cryptanalysis. We compare our results with the avalanche and bit independence criterion (BIC) performances of the conventional DRPE scheme, and improve the avalanche effect of DRPE in the discrete Gyrator domain by integrating a photon counting imaging technique. Although the Gyrator transform-based image cryptosystem has been studied, to the best of our knowledge, this is the first report on a cryptographic evaluation of discrete Gyrator transform with avalanche and bit independence criterions.

Frequency Domain Encoding Matrices for Computationally Efficient STBC/SFBC OFDM Transmitters (복잡도 감소를 위한 MIMO-STBC/SFBC OFDM 방식의 주파수 도메인 부호화 행렬)

  • Cho, Se-Young;Shang, Pingping;Kim, Soo-Young;Lim, Kwang-Jae
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.12
    • /
    • pp.8-16
    • /
    • 2010
  • In this paper, we present a structure of computationally efficient MIMO-OFDM transmitters, using STBC. Straightforward implementation of these systems requires separate WFT processing blocks for each of the transmit antennas. In our proposed scheme, we use symmetry properties of Fourier transform, and thus use a frequency domain encoding strategy. This greatly reduces the computational burden. The proposed scheme uses just a single IFFT block at each OFDM symbol period, and thus resulting in the same complexity as a single antenna OFDM system. As specific examples of the proposed schemes, we present frequency domain encoding matrices for QO-STBC-OFDM and QO-SFBC-OFDM transmitters.

Clipping Prevention Scheme for MPEG Surround

  • Pang, Hee-Suk
    • ETRI Journal
    • /
    • v.30 no.4
    • /
    • pp.606-608
    • /
    • 2008
  • MPEG Surround has a potential clipping problem since its encoding is based on downmixing a multichannel signal. We propose a clipping prevention scheme for MPEG Surround, which is composed of modification and recovery processes of a downmix signal with recovery information conveyed in arbitrary downmix gains of an MPEG Surround bitstream. Experiments show that the proposed scheme effectively prevents sound quality degradation caused by clipping problems with negligible additional bit rates.

  • PDF

Design and Performance of Space-Time Trellis Codes for Rapid Rayleigh Fading Channels

  • Zummo, Salam A.;Al-Semari, Saud A.
    • Journal of Communications and Networks
    • /
    • v.5 no.2
    • /
    • pp.174-183
    • /
    • 2003
  • Space-Time (ST) codes are known to provide high transmission rates, diversity and coding gains. In this paper, a tight upper bound on the error probability of ST codes over rapid fading channels is presented. Moreover, ST codes suitable for rapid fading channels are presented. These codes are designed using the QPSK and 16-QAM signal constellations. The proposed codes are based on two different encoding schemes. The first scheme uses a single trellis encoder, whereas the second scheme uses the I-Q encoding technique. Code design is achieved via partitioning the signal space such that the design criteria are maximized. As a solution for the decoding problem of I-Q ST codes, the paper introduces a low-complexity decoding algorithm. Results show that the I-Q ST codes using the proposed decoding algorithm outperform singleencoder ST codes with equal complexity. The proposed codes are tested over fading channels with different interleaving conditions, where it is shown that the new codes are robust under such imperfect interleaving conditions.

Mitigation Techniques of Channel Collisions in the TTFR-Based Asynchronous Spectral Phase-Encoded Optical CDMA System

  • Miyazawa, Takaya;Sasase, Iwao
    • Journal of Communications and Networks
    • /
    • v.11 no.1
    • /
    • pp.1-10
    • /
    • 2009
  • In this paper, we propose a chip-level detection and a spectral-slice scheme for the tunable-transmitter/fixed-receiver (TTFR)-based asynchronous spectral phase-encoded optical codedivision multiple-access (CDMA) system combined with timeencoding. The chip-level detection can enhance the tolerance of multiple access interference (MAI) because the channel collision does not occur as long as there is at least one weighted position without MAI. Moreover, the spectral-slice scheme can reduce the interference probability because the MAI with the different frequency has no adverse effects on the channel collision rate. As a result, these techniques mitigate channel collisions. We analyze the channel collision rate theoretically, and show that the proposed system can achieve a lower channel collision rate in comparison to both conventional systems with and without the time-encoding method.

Algorithm of XML and SOAP Messages Canonicalization (XML 및 SOAP 메시지 정규화 알고리즘)

  • Jeong, Hoe-Gyeong
    • The Journal of Engineering Research
    • /
    • v.6 no.1
    • /
    • pp.125-137
    • /
    • 2004
  • This paper implemented system that run Canonical XML and SOAP messages algorithm. So, can change to more elaborate regular document. Thus, interoperable with other application that takes W3C recommendation. Also, use in several system that physical identify is required when it exchange XML and SOAP messages for web service interoperability. Moreover, Adding the transformation ability between universal encoding scheme and EUC-KR that is internal encoding scheme should be Canonical XML and SOAP messages algorithm that is suited to internal circumstances, and this should be a foundation technique of international interoperability confirmedness.

  • PDF

Next Generation PET for Human Brain Study

  • Murayama, Hideo
    • Proceedings of the Korean Society of Medical Physics Conference
    • /
    • 2002.09a
    • /
    • pp.35-37
    • /
    • 2002
  • Conceptual design of the next generation PET with both high sensitivity and high spatial resolution has been performed. A detector unit using a depth encoding scheme was designed and constructed for trial. The unit consists of four Gd$_2$SiO$\sub$5/:Ce crystal blocks in a 2x2x4 array coupled to a position-sensitive photomultiplier tube having metal channel dynodes and 4x4 multi-anodes. Our proposed detector is a very reliable and simple solution suitable for volume PET devices since the proposed depth encoding scheme does not need additional photo-detectors.

  • PDF