• 방송공학회논문지
• /
• 제4권2호
• /
• pp.127-133
• /
• 1999

기존의 이산 웨이브렛 변환 기반 플랙탈 영상 압축은 프랙탈 부호화시 고정된 블럭 크기를 사용하므로 낮은 비트율에서 PSNR을 감소시킨다. 본 논문에서는 플랙탈 부호화시 가변 블록 크기를 사용하여 PSNR을 개선하는 이산 웨이브렛 기반 프랙탈 영상 부호화를 제안한다. 제안된 방법에서는 먼저 이산 웨이브렛 변환 계수들의 절대값을 최하고, 같은 공간 영역에 해당하는 다른 고주파 부대역의 이산 웨이브렛 변환 계수들을 묶어서 레인지 블록과 도메인 블록을 만든다. 그리고 각각의 레인지 블록 레벨의 레인지 블록에 대한 프랙탈 코드를 지정하고, 프랙탈 부호화,\ulcorner0\ulcorner부호화와 스칼라 양자화중 하나를 선택하여 만든 집합인 결정 트리 C를 만들고 스칼라 양자화기의 집합 q를 선택한다. 웨이브렛 계수, 프랙탈 코드와 결정 트리를 적응적 산술 부호화기를 사용하여 엔트로피 nq호화 한다. 제안된 방법은 낮은 비트율에서 PSNR을 개선하고 복원 영상의 블록킹 현상을 제거한다. 실험 결과를 통해서 제안한 방법은 기존의 프랙탈 부호화 방법과 웨이브렛 변환 부호화 방법에 비해 더 좋은 PSNR과 더 높은 압축율을 얻었다.

• 방송공학회논문지
• /
• 제20권1호
• /
• pp.57-67
• /
• 2015

본 논문에서는 HEVC (high efficiency video coding) SCC (screen content coding)의 화면 내 블록 카피 (IBC: intra block copy) 기술의 소개와 분석을 통해 성능향상 방법에 대해 알아본다. 분석을 위해 HEVC SCC 참조 소프트웨어인 SCM 2를 사용하며, HEVC SCC에 새롭게 채택된 예측 모드인 IBC의 선택 비율과 IBC의 블록 벡터 예측 방법 및 블록 벡터 부호화 방법에 대한 분석결과를 제시한다. 실험결과를 통해 IBC의 선택 비율은 I-Slice와 B-Slice에서 각각 평균 31.08%와 0.33%를 보이고 있으며, 이를 통해 IBC를 선택적으로 수행한다면 부호화 성능을 높일 수 있을 것으로 기대된다. 또한, 블록 벡터 예측 방법과 블록 벡터 부호화 방법에 대한 분석 실험을 통해 기존의 방법이 스크린 콘텐츠 특성이 강항 영상에 대해 효율적이지 못한 것을 확인하였으며 이를 개선하기 위한 방안을 제시한다.

• 한국통신학회논문지
• /
• 제29권6A호
• /
• pp.640-650
• /
• 2004

본 논문에서는 Multiple Put-Multiple output Orthogonal Frequency Division Multiplexing(MIMO-OFDM) 시스템을 위한 채널 추정 기법으로 space-time block c첨ing(STBC) 기법과 space-frequency block coding(SFBC) 기법을 제안한다. 제안된 방식은 각 송신 안테나에서 서로 직교성을 갖는 훈련 심볼을 전송함으로써 수신 안테나에서는 각 송수신 안테나 사인의 채널 계수를 추정한다. 제안된 알고리즘은 IEEE 802.11a 시스템 기반의 MIMO-OFDM 시스템에 적용해 성능 개선 효과를 확인해 보았다. 그 결과 제안된 방법이 기존의 방법보다 더 정확한 채별 계수 추정이 가능함을 확인할 수 있었다. 모의실험은 기존의 추정기법과 제안된 추정 기법이 적용된 시스템을 50ns 와 150ns 의 RMS 지연 확산을 갖는 다중 경로 페이딩 환경에서 수행되었으며 각 변복조 방식에 따른 비트 오류 성능 개선 정도를 확인해 보았다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권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.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제52권7호
• /
• pp.434-441
• /
• 2003

This paper proposes a new quantitative and objective image quality metric which is essential to verify the performance of block-based DCT image coding. The proposed metric considers not only global distortion of coded image such as spatial frequency sensitivity and channel masking using HVS based multi-channel model, but also structural distortions caused block-based coding. The experimental results show a strong correlation between proposed metric and subjective metric.

• 대한전기학회논문지:전기물성ㆍ응용부문C
• /
• 제52권7호
• /
• pp.434-434
• /
• 2003

This paper proposes a new quantitative and objective image quality metric which is essential to verify the performance of block-based DCT image coding The proposed metric considers not only global distortion of coded image such as spatial frequency sensitivity and channel masking using HVS based multi-channel model, but also structural distortions caused block-based coding. The experimental results show a strong correlation between propose(B metric and subjective metric.

• 전자공학회논문지B
• /
• 제31B권2호
• /
• pp.45-55
• /
• 1994

In this paper, a block based image approximation technique using the Self Affine System(SAS) from the fractal theory is suggested. Each block of an image is divided into 4 tiles and 4 affine mapping coefficients are found for each tile. To find the affine mapping cefficients that minimize the error between the affine transformed image block and the reconstructed image block, the matrix euation is solved by setting each partial differential coefficients to aero. And to ensure the convergence of coding block. 4 uniformly partitioned affine transformation is applied. Variable block size technique is employed in order to applynatural image reconstruction property of fractal image coding. Large blocks are used for encoding smooth backgrounds to yield high compression efficiency and texture and edge blocks are divided into smaller blocks to preserve the block detail. Affine mapping coefficinets are found for each block having 16$\times$16, 8$\times$8 or 4$\times$4 size. Each block is classified as shade, texture or edge. Average gray level is transmitted for shade bolcks, and coefficients are found for texture and edge blocks. Coefficients are quantized and only 16 bytes per block are transmitted. Using the proposed algorithm, the computational load increases linearly in proportion to image size. PSNR of 31.58dB is obtained as the result using 512$\times$512, 8 bits per pixel Lena image.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 1997년도 Proceedings International Workshop on New Video Media Technology
• /
• pp.25-29
• /
• 1997

The present block-based DCT encoder transforms images regardless of layers and then simply partitions the transformed data into a few layers, for example low and high frequency bands in JPEG. Yet, it fails to utilize the similarity of coefficients in each band. Therefore, we combine the subband coder and the block-based DCt coder in this paper. The new coding scheme enables the data to automatically be classified into several layers and increases the efficiency of transform. Various possible coding structures are investigated and the simulation results are also provided.

• 반도체디스플레이기술학회지
• /
• 제8권3호
• /
• pp.45-50
• /
• 2009

Recently, block-based transforms, like discrete cosine transform (DCT), have been widely used in image and video coding standards, but block-based transforms have a weak point with blocking effect. However, the integer lapped orthogonal transform (ILOT) is a tool for block-based coding with bases functions that overlap near blocks, so it has a strong point against blocking effect. Although it has slightly higher arithmetic complexity than the DCT, the coding gain is significantly higher with much less blocking artifacts. This paper introduces the integer lapped orthogonal transforms and discrete cosine transform. And we compare the performance of DCT with ILOT which is proposed a new efficient method for image coding applications.

• IEIE Transactions on Smart Processing and Computing
• /
• 제3권6호
• /
• pp.388-392
• /
• 2014

This paper proposes an early termination method of a block vector search for fast encoding of high efficiency video coding (HEVC) screen content coding (SCC). In the proposed algorithm, two blocks indicated by two block vector predictors (BVPs) were first employed as an intra block copy (IBC) search. If the sum of absolute difference (SAD) value of the block is less than a threshold defined empirically, an IBC BV search is terminated early. The initial threshold for early termination is derived by statistical analysis and it can be modified adaptively based on a quantization parameter (QP). The proposed algorithm is evaluated on SCM-2.0 under all intra (AI) coding configurations. Experimental results show that the proposed algorithm reduces IBC BV search time by 29.23% on average while the average BD-rate loss is 0.41% under the HEVC SCC common test conditions (CTC).