• Title/Summary/Keyword: 필터 블록

Search Result 429, Processing Time 0.029 seconds

Fast Motion Estimation Algorithm using Filters of Multiple Thresholds (다중 문턱치 필터를 이용한 고속 움직임 예측 알고리즘)

  • Kim, Jong-Nam
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.19 no.4
    • /
    • pp.199-205
    • /
    • 2018
  • So many fast motion estimation algorithms for prediction quality and computational reduction have been published due to tremendous computations of full search algorithm. In the paper, we suggest an algorithm that reduces computation effectively, while keeping prediction quality as almost same as that of the full search. The proposed algorithm based on multiple threshold filter calculates the sum of partial block matching error for each candidate, selects the candidates for the next step, compares the stability of optimal candidates with minimum error, removes impossible candidates, and calculates optimal motion vectors by determining the progress of the next step. By doing that, we can find the minimum error point as soon as possible and obtain the better performance of calculation speed by reducing unnecessary computations. The proposed algorithm can be combined with conventional fast motion estimation algorithms as well as by itself, further reduce computation while keeping the prediction quality as almost same as the algorithms, and prove it in the experimental results.

Subband Acoustic Echo Canceller with Double-Talk Detector using Weighted Over1ap-add method (가중 Overlap-Add 기법을 적용한 서브밴드 반향 제거기와 새로운 동시 통화 검출기)

  • 고충기;이원철
    • Proceedings of the IEEK Conference
    • /
    • 2000.09a
    • /
    • pp.541-544
    • /
    • 2000
  • 본 논문은 부밴드별 반향제거 필터 뱅크를 구현하기 위한 가중 Overlap-add 적응필터를 이용한 단일 채널 음향 반향 제거기를 제안한다. 기준 입력 신호의 고유치 분포율에 의존하여 수렴 특성이 결정되는 NLSM알고리즘을 사용하여 전대역 처리 과정에서 발생하는 수렴성능의 저하를 방지하고, 효율적인 블록별 병렬 처리가 가능한 부밴드 처리기법인 가중 Overlap-add 방식을 적용한 적응 반향제거기의 성능을 고찰한다 또한 본 논문에서는 동시 통화 검출을 위한 전용 필터와 에너지 비교 방법을 동시에 사용하는 새로운 형태의 동시통화 검출 기법을 제안한다.

  • PDF

A Spatially Adaptive Post-processing Filter to Remove Blocking Artifacts of H.264 Video Coding Standard (H.264 동영상 표준 부호화 방식의 블록화 현상 제거를 위한 적응적 후처리 기법)

  • Choi, Kwon-Yul;Hong, Min-Cheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.8C
    • /
    • pp.583-590
    • /
    • 2008
  • In this paper, we present a spatially adaptive post-processing algorithm for H.264 video coding standard to remove blocking artifacts. The loop filter of H.264 increases computational complexity of the encoder. Furthermore it doesn't clearly remove the blocking artifacts, resulting in over-blurring. For overcoming them, we combine the projection method with the Constraint Least Squares(CLS) method to restore the high quality image. To reflect the Human Visual System, we adopt the weight norm CLS method. Particularly pixel location-based local variance and laplacian operator are newly defined for the CLS method. In addition, the fact that correlation among adjoining pixels is high is utilized to constrain the solution space when the projection method is applied. Quantization Index(QP) of H.264 is also used to control the degree of smoothness. The simulation results show that the proposed post-processing filter works better than the loop filter of H.264 and converges more quickly than the CLS method.

In-Loop Selective Decontouring Algorithm in Video Coding (비디오 부호화 루프 내에서 의사 윤곽 오차의 선택적 제거 알고리즘)

  • Yoo, Ki-Won;Sohn, Kwang-Hoon
    • Journal of Broadcast Engineering
    • /
    • v.15 no.5
    • /
    • pp.697-702
    • /
    • 2010
  • Contour artifact is known as the unintentional result of quantizing a flat area that has smooth gradients. In this letter, a decontouring algorithm is proposed to efficiently remove false contours that occur in typical block-based video coding applications. First, the algorithm goes through a refinement stage to determine candidate blocks probably having noticeable false contours with different kinds of features in a block. Then, pseudo-random noise masking is applied to those blocks to mitigate the contour artifacts. This block-based selective decontouring can efficiently remove the unnecessary processing of those blocks that have no false contour, which incidentally ensures a minor penalty in visual quality and computational complexity. The proposed algorithm was demonstrated, integrated into H.264/AVC, that visual quality can be significantly enhanced with an ignorable rate-distortion (RD) loss and an minor increase in computational complexity.

CNN-based In-loop Filtering Using Block Information (블록정보를 이용한 CNN기반 인 루프 필터)

  • Kim, Yangwoo;Lee, Yung-lyul
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2019.11a
    • /
    • pp.27-29
    • /
    • 2019
  • VVC(Versatile Video Coding)는 입력 YUV영상을 CTU(Coding Tree Unit)으로 분할하고, 다시 이를 QTBTTT(Quad Tree, Binary Tree, Ternery Tree)로 최적의 블록으로 분할하고 각각의 블록을 공간적, 시간적 정보를 이용하여 예측하고 예측블록과 원본블록의 차분신호를 변환, 양자화를 통해 전송한다. 이를 위해 여러가지 인코딩정보가 디코더에 전송되며 이를 이용하여 디코더는 인코더와 똑같은 순서로 영상을 복원 할 수 있다. 본 논문에서는 이러한 VVC 인코더에서 반드시 전송하는 정보를 추가적으로 이용하여 딥러닝 기반의 Convolutional Neural Netwrok로 영상의 압축률 및 화질개선 하는 방법을 제안한다.

  • PDF

Design of Morphological Filter for Image Processing (영상처리용 Morphological Filter의 하드웨어 설계)

  • 문성용;김종교
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.10
    • /
    • pp.1109-1116
    • /
    • 1992
  • Mathematical morphology, theoretical foundation for morphological filter, is very efficient for the analysis of the geometrical characteristics of signals and systems and is used as a predominant tool for smoothing the data with noise. In this study, H/W design of morphological filter is implemented to process the gray scale dilation and the erosion in the same circuit and to choose the maximum and minimum value by a selector, resulting in their education of the complexity of the circuit and an architecture for parallel processing. The structure of morphological filter consists of the structuring-element block, the image data block, the control block, the ADD block, the MIN/MAX block, etc, and is designed on an one-chip for real time operation.

  • PDF

An Implementation of Evolvable Adaptive Image Preprocessing Filter (진화적응성을 갖는 영상 전처리 필터 구현)

  • Lee, Seung-Young;Jun, In-Ja;Rhee, Phill-Kyu
    • Proceedings of the KIEE Conference
    • /
    • 2002.07d
    • /
    • pp.2783-2787
    • /
    • 2002
  • 최근 멀티미디어 및 통신의 발달로 인하여 영상 정보를 이용한 응용시스템이 많이 연구되고있다. 중간 전달 매체를 이용한 응용시스템으로의 영상 정보를 전달과정에서 잡영(noise) 이 포함되어 시스템의 성능을 저하시키게 된다. 또한 잡영은 임의의 형태이기 때문에 상황에 따라 적합한 필터를 선택하기는 쉽지 않다. 본 논문에서는 유전자 알고리즘 프로세서를 이용하여 필터들의 구성 및 파라미터를 조절하여 임의의 잡영에 진화적응적인 능력을 가지는 영상 전처리 필터를 구현하였다. 주파수 영역의 잡영에 대해서는 하드웨어에 적합하고 구현이 용이한 멀티밴드필터(Multi-Band filter)를 설계하여 사용하였다. 시스템은 유전자알고리즘과 필터블록에 대해서는 하드웨어(FPCA)로 구현하였고 적합도 평가는 PC 기반으로 수행하였다. 실험결과 순수 PC기반의 시뮬레이션에 비해 속도향상 및 성능면에서도 만족할 만한 결과를 얻었다.

  • PDF

Deblocking Filtering in TMIV for Atlases in Basic and Additional Views (TMIV 소프트웨어에서의 기본 시점과 추가 시점에 대한 디블로킹 필터의 성능 비교)

  • Yeo, Eun;Kang, Jewon
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2020.11a
    • /
    • pp.46-48
    • /
    • 2020
  • HEVC (High Efficiency Video Coding)의 In-Loop 필터 중 하나인 디블로킹 필터는 예측과 변환 블록 주변의 균일하지 않은 잡음을 제거하기 위해 사용된다. 영상을 복원할 때 텍스쳐 정보의 경우, 디블로킹 필터로 눈에 보이는 잡음을 제거하는 데 유리하지만 깊이 정보는 깊이를 예측하여 합성하는 데 사용되므로 디블로킹 필터를 적용하면 합성에 방해가 될 수 있다. 이에 본 논문은 TMIV (Test Model 6 for MPEG Immersive Video) 인코더를 거쳐 나온 기본 시점과 추가 시점의 텍스쳐와 깊이 영상에 디블로킹 필터를 적용하여 BD-Rate의 향상 정도와 인지 화질적 관점에서의 화질 개선 여부를 실험을 통해 검증한다.

  • PDF

An Efficient Loop Filter to Improve Visual Quality of H.26L Video Coder (H.26L 동영상 부호화 방식의 화질 개선을 위한 루프 필터)

  • 홍민철
    • Journal of Broadcast Engineering
    • /
    • v.7 no.4
    • /
    • pp.327-334
    • /
    • 2002
  • This paper addresses an efficient loop filter algorithm to improve visual quality by simultaneously reducing blocking and ringing artifacts in H.26L video coder. H.26L video coding standard using the different coding mechanism to existing video coding standards has different distribution of blocking and ringing artifacts that is dependent on coding type, quantization step size, and motion vector. Therefore, the information is used to define the filter type and the filter coefficients. and a projection operator is defined to avoid the over-smoothness. In addition, in order to avoid over-smoothing coming from filtering processing, a constraint projection operator is defined. Since the above information is available both in encoder and in the decoder, a loop filter is used, and the algorithm is simplified to reduce the computational cost. Experimental results show the capability of the proposed algorithm.

Dynamic Prefetch Filtering Schemes to enhance Utilization of Data Cache (데이타 캐시의 활용도를 높이는 동적 선인출 필터링 기법)

  • Chon, Young-Suk;Kim, Suk-Il;Jeon, Joong-Nam
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.35 no.1
    • /
    • pp.30-43
    • /
    • 2008
  • Memory reference instructions such as loads or stores are critical factors that limit the processing power of processor. The prefetching technique is an effective way to reduce the latency caused from memory access. However, excessively aggressive prefetch leads to cache pollution so as to cancel out the advantage of prefetch. In this study, four filtering schemes have been compared and evaluated which dynamically decide whether to begin prefetch after referring a filtering table to decrease cache pollution. First, A bi-states scheme has been shown to analyze the lock problem of the conventional scheme, this scheme such as conventional scheme used to be N:1 mapping, but it has the two state to 1bit value of each entries. A complete state scheme has been introduced to be used as a reference for the comparative study. A block address lookup scheme has been proposed as the main idea of this paper which exhibits the most exact filtering performance. This scheme has a length of the table the same as the bi-states scheme, the contents of each entry have the fields the same as the complete state scheme recently, never referenced data block address has been 1:1 mapping a entry of the filter table. Experimental results from commonly used general benchmarks and multimedia programs show that average cache miss ratio have been decreased by 10.5% for the block address lookup scheme(BAL) compare to conventional dynamic filter scheme(2-bitSC).