• Title/Summary/Keyword: Block-based Coding

Search Result 474, Processing Time 0.021 seconds

Edge-Based Fast Intra Mode Decision in HEVC

  • Na, Sangkwon;Lee, Wonjae;Lee, Kyohyuk;Yoo, Kiwon
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2013.06a
    • /
    • pp.180-181
    • /
    • 2013
  • High efficiency video coding (HEVC) appears due to the demand on high compression video coding beyond H.264/AVC in ultra-high definition (UHD) videos. As for intra prediction, HEVC has 35 prediction modes while H.264/AVC has 9 intra modes. To exploit the spatial correlation, we adopt an edge detection method, establish the edge map, and adaptively select the candidate modes using the acquired edge information in a block. The number of the candidate modes is determined through trade-off between computational complexity and coding efficiency. Besides, the range of coding unit sizes is determined using the uniqueness of the edge directions for the given image block. As a result, we reduced the encoding time by 56.8% at the cost of 2.5% BD-BR increase on average compared to Full modes at the HEVC reference software (HM 6.0 [1]).

  • PDF

Secondary Residual Transform for Lossless Intra Coding in HEVC (제 2차 잔차 변환을 이용한 HEVC 무손실 인트라 코딩)

  • Kwak, Jae-Hee;Lee, Yung-Lyul
    • Journal of Broadcast Engineering
    • /
    • v.17 no.5
    • /
    • pp.734-741
    • /
    • 2012
  • A new lossless intra coding method based on residual transform is applied to the next generation video coding standard HEVC (High Efficiency Video Coding). HEVC includes a multi-directional spatial prediction method to reduce spatial redundancy by using neighboring samples as a prediction for the samples in a block of data to be encoded. In the new lossless intra coding method, the spatial prediction is performed as samplewise DPCM (Difference Pulse Code Modulation) but is implemented as block-based manner by using residual transform and secondary residual transform on the HEVC standard. Experimental results show that the new lossless intra coding method reduces the bit rate by approximately 6.45% in comparison with the lossless intra coding method previously included in the HEVC standard.

Video coding using multi-resolution image (다중해상도 영상을 이용한 동영상 압축)

  • 배성호;박길흠
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.2
    • /
    • pp.33-42
    • /
    • 1997
  • In this paper, a video coding method in wavelet transformed multi-resolution image using variable block sized motion estimation and multi-codebook is proposed. In the propoed method, the accuracy of motion estimation is increased by using variable block matching algorithm based on edge type of blocks which estimation is increased by using variable block matching algoritm based on edge type of blocks which is classified accoridng to the magnitude of wavelet coefficients in vertical subband and horizontal subband of the highest layer. Also, we increased the flexibility of bit allocation and decreased vector quantization error for motion compensated error transmission by using importance of each subband. Some experimental results confirm that he proposed mothod has fine reconstructed images without blocking effect at low bit rate, and especially reconstructs edges well to which human eyes are sensitive.

  • PDF

A Common Bitmap Block Truncation Coding for Color Images Based on Binary Ant Colony Optimization

  • Li, Zhihong;Jin, Qiang;Chang, Chin-Chen;Liu, Li;Wang, Anhong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.5
    • /
    • pp.2326-2345
    • /
    • 2016
  • For the compression of color images, a common bitmap usually is generated to replace the three individual bitmaps that originate from block truncation coding (BTC) of the R, G and B channels. However, common bitmaps generated by some traditional schemes are not the best possible because they do not consider the minimized distortion of the entire color image. In this paper, we propose a near-optimized common bitmap scheme for BTC using Binary Ant Colony Optimization (BACO), producing a BACO-BTC scheme. First, the color image is compressed by the BTC algorithm to get three individual bitmaps, and three pairs of quantization values for the R, G, and B channels. Second, a near-optimized common bitmap is generated with minimized distortion of the entire color image based on the idea of BACO. Finally, the color image is reconstructed easily by the corresponding quantization values according to the common bitmap. The experimental results confirmed that reconstructed image of the proposed scheme has better visual quality and less computational complexity than the referenced schemes.

Largest Coding Unit Level Rate Control Algorithm for Hierarchical Video Coding in HEVC

  • Yoon, Yeo-Jin;Kim, Hoon;Baek, Seung-Jin;Ko, Sung-Jea
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.1 no.3
    • /
    • pp.171-181
    • /
    • 2012
  • In the new video coding standard, called high efficiency video coding (HEVC), the coding unit (CU) is adopted as a basic unit of a coded block structure. Therefore, the rate control (RC) methods of H.264/AVC, whose basic unit is a macroblock, cannot be applied directly to HEVC. This paper proposes the largest CU (LCU) level RC method for hierarchical video coding in a HEVC. In the proposed method, the effective bit allocation is performed first based on the hierarchical structure, and the quantization parameters (QP) are then determined using the Cauchy density based rate-quantization (RQ) model. A novel method based on the linear rate model is introduced to estimate the parameters of the Cauchy density based RQ model precisely. The experimental results show that the proposed RC method not only controls the bitrate accurately, but also generates a constant number of bits per second with less degradation of the decoded picture quality than with the fixed QP coding and latest RC method for HEVC.

  • PDF

A Study on Pre-service Teachers' Development of Digital-based Teaching and Learning Materials of Pi (예비교사의 디지털 기반 원주율 교수학습자료 개발 사례 연구)

  • Kang, Hyangim;Choi, Eunah
    • Education of Primary School Mathematics
    • /
    • v.26 no.1
    • /
    • pp.65-82
    • /
    • 2023
  • The purpose of this study is to examine how pre-service teachers' digital capabilities and content knowledge for teaching pi appear and are strengthened in the process of developing digital-based teaching and learning materials of pi, and to derive implications for pre-service teacher education. To this end, the researchers analyzed the process of two pre-service teachers developing exploratory activity materials for teaching pi using block coding of AlgeoMath program. Through the analysis results, it was confirmed that AlgeoMath' block coding activities provided an experience of expressing and expanding the digital capabilities of pre-service teachers, an opportunity to deepen the content knowledge of pi, and to recognize the problems and limitations of the digital learning environment. It was also suggested that the development of digital materials using block coding needs to be used to strengthen digital capabilities of pre-service teachers, and that the curriculum knowledge needs to be emphasized as knowledge necessary for the development of digital teaching and learning materials in pre-service teacher education.

A New Approximate DCT Computation Based on Subband Decomposition and Its Application (서브밴드 분리에 근거한 새로운 근사 DCT 계산과 응용)

  • Jeong, Seong-Hwan
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.5
    • /
    • pp.1329-1336
    • /
    • 1996
  • In many image compression applications, the discrete cosine transform (DCY) is well known for is highly efficient coding performance. However, it produces undesirable block artifacts in low-bit rate coding. In addition, in many practical applications, faster computation and easier VLST implementation of DCT coefficients are also important issues. The removal of the block artifacts and faster DCT computation are therefor of practical interest. In this paper, a modified DCTcomputation scheme was investigated, which provides a simple efficient solution to the reduction of the block artifacts while achieving faster computation. We have applied the new ap-proach to the low-bit rate coding and decoding of images. Simulation results on real images have verified the improved performance of the proposed method over the standar d method.

  • PDF

Performance of Tactics Mobile Communication System Based on UWB with Double Binary Turbo Code in Multi-User Interference Environments (다중 사용자 간섭이 존재하는 환경에서 이중이진 터보부호를 이용한 UWB 기반의 전술이동통신시스템 성능)

  • Kim, Eun-Cheol;Seo, Sung-Il;Kim, Jin-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.1
    • /
    • pp.39-50
    • /
    • 2010
  • In this paper, we analyze and simulate the performance of a tactics mobile communication system based on ultra wide band (UWB) in multi-user interference (MUI) environments. This system adopts a double binary turbo code for forward error correction (FEC). Wireless channel is modeled a modified Saleh and Valenzuela (SV) model. We employ a space time block coding (STBC) scheme for enhancing system performance. System performance is evaluated in terms of bit error probability. From the simulation results, it is confirmed that the tactics mobile communication system based on UWB, which is encoded with the double binary turbo code, can achieve a remarkable coding gain with reasonable encoding and decoding complexity in multi-user interference environments. It is also known that the bit error probability performance of the tactics mobile communication system based on UWB can be substantially improved by increasing the number of iterations in the decoding process for a fixed cod rate. Besides, we can demonstrate that the double binary turbo coding scheme is very effective for increasing the number of simultaneous users for a given bit error probability requirement.

Gradual Block-based Efficient Lossy Location Coding for Image Retrieval (영상 검색을 위한 점진적 블록 크기 기반의 효율적인 손실 좌표 압축 기술)

  • Choi, Gyeongmin;Jung, Hyunil;Kim, Haekwang
    • Journal of Broadcast Engineering
    • /
    • v.18 no.2
    • /
    • pp.319-322
    • /
    • 2013
  • Image retrieval research activity has moved its focus from global descriptors to local descriptors of feature point such as SIFT. MPEG is Currently working on standardization of effective coding of location and local descriptors of feature point in the context mobile based image search driven application in the name of MPEG-7 CDVS (Compact Descriptor for Visual Search). The extracted feature points consist of two parts, location information and Descriptor. For efficient image retrieval, we proposed a novel method that is gradual block-based efficient lossy location coding to compress location information according to distribution in images. From experimental result, the number of average bits per feature point reduce 5~6% and the accuracy rate keep compared to state of the art TM 3.0.

A Study on the Variance Based Self-similar Block Search for Fractal Image Compression (프랙탈 이미지 압축을 위한 분산 기반 유사 블록 탐색 연구)

  • Ham, Do-Yong;Kim, Jong-Gu;Kim, Ha-Jin;Wi, Yeong-Cheol
    • Journal of the Korea Computer Graphics Society
    • /
    • v.7 no.1
    • /
    • pp.11-17
    • /
    • 2001
  • Fractal image coding provides many promising qualities including the high compression ratio. The coding process however suffers from the long search time of domain block pool because the size of the domain block pool is often very large. In this paper, we introduce a hybrid domain block pool search method that combines the block classification and the variance based searching. This hybrid method makes use of the fact that the variance of a block is independent of the block classification. Thus, this hybrid method enhances the search speed by up to an O(number of classes) factor over the purely variance based searching method. An experimental result shows that our method enhances the search speed by up to 17 times over the purely variance based searching method. We also propose an adjustable variance based searching method that further enhances the search speed without noticeable loss of image quality.

  • PDF