• Title/Summary/Keyword: 블록 적응

Search Result 506, Processing Time 0.023 seconds

Receivers for Spatially Multiplexed Space-Time Block Coded Systems : Reduced Complexity (시공간블록부호화를 적용한 공간다중화 시스템 수신기 : 복잡도 감소 방안)

  • Hwang Hyeon Chyeol;Shin Seung Hoon;Lee Cheol Jin;Kwak Kyung Sup
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.11A
    • /
    • pp.1244-1252
    • /
    • 2004
  • In this paper, we derive some properties of linear detectors (zero forcing or minimum mean square error) at spatial multiplexing systems with alamouti's space-time block code. Based on the derived properies, this paper proposes low-complexity receivers. Implementing MMSE detector adaptively, the number of weight vectors to be calculated and updated is greatly reduced with the derived properties compared to the conventional methods. In the case of recursive least square algorithm, with the proposed approach computational complexity is reduced to less than the half. We also identify that sorted QR decomposition detector, which reduces the complexity of V-Blast detector, has the same properties for unitary matrix Q and upper triangular matrix R. A complexity reduction of about 50%, for sorted QR decomposition detector, can be achieved by using those properties without the loss of performance.

Multi-carriers PAPR Reduction Method using Adaptive Sub-optimal PTS with Threshold (다중반송파 PAPR 감소를 위한 임계치 적용 적응 부최적 PTS 기법 연구)

  • 권오주;하영호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.12A
    • /
    • pp.2012-2018
    • /
    • 2001
  • This paper proposes the adaptive suboptimal iterative algorithm using threshold to reduce system complexity in the PTS\`s. Performance of the proposed adaptive suboptimal iteration algorithm is represented in terms of iteration number and CDF. In the case of the number of sub-block is 4, the 10-3 PAPR of the proposed method and P S improved this by 0.4dB compared to Cimini\`s. And the complexity of the proposed method was reduced to nearly 22% for the PTS\`s and 44% for the Cimini\`s for 8dB threshold. For the 8 sub-blocks, the 10$\^$-3/ PAPR of the proposed method reduced by 0.7dB compared to PTS\`s, but improved by 0.4dB compared to Cimini\`s. And the complexity of the proposed method was reduced to nearly 2.4% for the PTS\`s and 39% for the Cimini\`s.

  • PDF

Quantization Noise Reduction in MPEG Postprocessing System Using the Variable Filter Adaptive to Edge Signal (에지 신호에 적응적인 가변 필터를 이용한 MPEG 후처리 시스템에서의 양자화 잡음 제거)

  • Lee Suk-Hwan;Huh So-Jung;Lee Eung-Joo;Kwon Ki-Ryong
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.3
    • /
    • pp.296-306
    • /
    • 2006
  • We proposed the algorithm for the quantization noise reduction based on variable filter adaptive to edge signal in MPEG postprocessing system. In our algorithm, edge map and local modulus maxima in the decoded images are obtained by using 2D Mallat wavelet tilter. And then, blocking artifacts in inter-block are reduced by Gaussian LPF that is variable to filtering region according to edge map. Ringing artifacts in intra-block are reduced by 2D SAF according to local modulus maxima. Experimental results show that the proposed algorithm was superior to the conventional algorithms as regards PSNR, which was improved by 0.04-0.20 dB, and the subjective image quality.

  • PDF

An Adaptive Block Matching Algorithm Based on Temporal Correlations (시간적 상관성을 이용한 적응적 블록 정합 알고리즘)

  • Yoon, Hyo-Sun;Lee, Guee-Sang
    • The KIPS Transactions:PartB
    • /
    • v.9B no.2
    • /
    • pp.199-204
    • /
    • 2002
  • Since motion estimation and motion compensation methods remove the redundant data to employ the temporal redundancy in images, it plays an important role in digital video compression. Because of its high computational complexity, however, it is difficult to apply to high-resolution applications in real time environments. If we have information about the motion of an image block before the motion estimation, the location of a better starting point for the search of an exact motion vector can be determined to expedite the searching process. In this paper, we present an adaptive motion estimation approach bated on temporal correlations of consecutive image frames that defines the search pattern and determines the location of the initial search point adaptively. Through experiments, compared with DS(Diamond Search) algorithm, the proposed algorithm is about 0.1∼0.5(dB) better than DS in terms of PSNR(Peak Signal to Noise Ratio) and improves as high as 50% compared with DS in terms of average number of search point per motion vector estimation.

Adaptive Intra Fast Algorithm of H.264 for Video Surveillance (보안 영상 시스템에 적합한 H.264의 적응적 인트라 고속 알고리즘)

  • Jang, Ki-Young;Kim, Eung-Tae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.12C
    • /
    • pp.1055-1061
    • /
    • 2008
  • H.264 is the prominent video coding standard in various applications such as real-time streaming and digital multimedia broadcasting, since it provides enhanced compression performance, error resilience tools, and network adaptation. Compression efficiency of H.264 has been improved, however, it requires more computing and memory access than traditional methods. In this paper we proposed adaptive intra fast algorithm for real-time video surveillance system reducing the encoding complexity of H264/A VC. For this aim, temporal interrelationship between macroblock in the previous and the current frame is used to decide the encoding mode of macroblock fast. As a result, though video quality was deteriorated a little, less than 0.04dB, and bit rate was somewhat increased in suggested method, however, proposed method improved encoding time significantly and, in particular, encoding time of an image with little changes of neighboring background such as surveillance video was more shortened than traditional methods.

A Novel Method of Determining Parameters for Contrast Limited Adaptive Histogram Equalization (대비제한 적응 히스토그램 평활화에서 매개변수 결정방법)

  • Min, Byong-Seok;Cho, Tae-Kyung
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.3
    • /
    • pp.1378-1387
    • /
    • 2013
  • Histogram equalization, which stretches the dynamic range of intensity, is the most common method for enhancing the contrast of image. Contrast limited adaptive histogram equalization(CLAHE), proposed by K. Zuierveld, has two key parameters: block size and clip limit. These parameters mainly control image quality, but have been heuristically determined by user. In this paper, we propose a novel method of determining two parameters of CLAHE using entropy of image. The key idea is based on the characteristics of entropy curves: clip limit vs entropy and block size vs entropy. Clip limit and block size are determined at the point with maximum curvature on entropy curve. Experimental results show that the proposed method improves images with very low contrast.

Adaptive Distance Selection Algorithm Using Constrained One-Bit Transform in Macroblock Unit (매크로블록 단위로 거리값을 선택해주는 제한된 1비트 변환 알고리듬)

  • Kim, Jaehun;Kim, Ilseung;Ng, Teck Sheng;Jeong, Jechang
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2011.11a
    • /
    • pp.225-228
    • /
    • 2011
  • 동영상을 고효율로 압축할 수 있는 중요한 기술 중의 하나가 움직임 추정 기술이다. 움직임 추정 기술에서 가장 널리 사용되는 탐색 방식과 정합오차를 판단하는 기준은 각각 전역 탐색(FS: Full Search)알고리듬과 Sum of Absolute Differences(SAD)이다. 하지만, FS와 SAD를 사용한 움직임 추정기술은 인코더 전체 계산량의 50%이상을 차지하게 된다. 무선 통신 및 인터넷 환경에서 사용되는 응용프로그램에 대해서는 많은 계산량이 실시간 전송을 어렵게 만든다. 이러한 이유로, 동영상 압축 기술에서 계산량을 줄이는 방법이 중요하게 되었다. 그 결과로, SAD대신 다른 정합 오차 기준을 사용하여 움직임 추정기술의 계산량을 줄이는 알고리듬들이 제안되었다. 본 논문에서는 계산량을 줄이면서 하드웨어 구현 시 많은 이점을 가진 1비트 변환 (One-bit Transform, 1BT)알고리듬과 1비트 변환의 성능을 향상시킨 제한된 1비트 변환(Constrained one-bit transform, C-1BT)을 소개하고 C-1BT방법에 있어서 기존 방식의 빠른 인코딩속도를 유지하면서 PSNR을 증가시키는 알고리듬을 제안한다. 제안하는 알고리듬에서는 기존 C-1BT에서 고정해서 사용한 파라미터 D값을 대신에 현재블록과 동일한 위치에 있는 참조영역의 블록과 그 주변블록의 움직임벡터 정보를 이용해서 블록의 움직임 정도를 판단하고, 블록단위로 D값을 적응적으로 결정한다. 실험결과는 제안하는 알고리듬이 기존의 알고리듬과 비교하여 평균 0.11dB PSNR 증가를 보여 준다.

  • PDF

A Postfiltering Algorithm for Enhancement in Block-based DCT Compressed Images (블록 기반 DCT 압축 영상의 화질 개선을 위한 후처리 필터링 알고리듬)

  • Kim, Yong-Hun;Jeong, Jong-Hyeog
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.24 no.1
    • /
    • pp.22-27
    • /
    • 2014
  • Blocking and ringing artifacts continue to be the most serious defects that occur in images and video streams compressed to low bit rates using block-based discrete cosine transform(DCT) compression standards. These artifacts contain the high frequency components near the block and the edge boundaries. Usually the lowpass filter can remove them. However, simple lowpass filter results into blur by removing important information such as edges at the same time. To overcome these problems, we propose a novel postfiltering algorithm that calculate the weight value based on the intensity similarity in the neighboring pixels and multiply this weight to the Gaussian lowpass filter coefficient. Experimental results show that the proposed technique provides satisfactory performance in both objective and subjective image quality.

An MPEG2-to-H.264 Transcoding Method (MPEG2에서 H.264로의 트랜스코딩 기법)

  • Kim, Dong-Hyung;Jeong, Je-Chang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.7C
    • /
    • pp.706-715
    • /
    • 2005
  • In this paper, we present a transcoding algorithm for converting an MPEG-2 video bitstream to an H.264 bitstream. The proposed transcoder consists of two parts. One is MPEG2 decoding part and the other is H.264 encoding part Because our algorithm is for transcoding in the spatial domain, MPEG2 decoding part carries out full decoding of MPEG2 bitstream. While, because macroblock type and coded block pattern in MPEG2 are significantly related to macroblock mode in H.264, macroblock mode is selected adaptively according to macroblock type and coded block pattern in H.264 decoding part. Furthermore, motion vector is also used as side-information for 16$\ctimes$16 macroblock mode. Simulation results show that the proposed transcoder yields high reduction of total transcoding time at comparable PSNR.

A Study on the Curriculum Innovation of Department of Advertising and Career Education Improvement in Blockchain based Advertising Industry (블록체인 기반, 광고산업 변화에 따른 광고홍보학과 교육과정 혁신 및 진로교육 내실화 방안 연구)

  • Han, Sangpil
    • Journal of the Korea Convergence Society
    • /
    • v.12 no.6
    • /
    • pp.113-118
    • /
    • 2021
  • The purpose of this study is to develop a program to improve the curriculum of the Department of Advertising and PR and to improve education in the 4th industrial revolution based on blockchain. This study is in charge of human resources department, planning, and production of advertising agencies with a high understanding of the direction of human resource development of advertising agencies and career education of universities. Six people were divided into two groups and an in-depth interview was conducted. It was found that the curriculum of the Department of Advertising and PR has not yet been reorganized, and the method of career education is still progressing in the traditional media era. In order to cultivate future advertising professionals, it is important that advertising education must operate courses and adopt the curriculum so that they can be trained as experts who can adapt to the revolutionary change engine of blockchain.