• Title/Summary/Keyword: Block Error

Search Result 980, Processing Time 0.025 seconds

Correction Method for Measurement Failure Pixels in Depth Picture using Surface Modeling (표면 모델링을 통한 깊이 영상 내 측정 실패 화소 보정 방법)

  • Lee, DongSeok;Kwon, SoonKak
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.24 no.5
    • /
    • pp.1-8
    • /
    • 2019
  • In this paper, we propose a correcting method of depth pixels which are failed to measure since temporary camera error. A block is modeled to plane and sphere surfaces through measured depth pixels in the block. Depth values in the block are estimated through each modeled surface and a error for the modeled surface is calculated by comparing the original and estimated pixels, then the surface which has the least error is selected. The pixels which are failed to measure are corrected by estimating depth values through selected surface. Simulation results show that the proposed method increases the correction accuracy by an average of 20% compared with the correction method of $5{\times}5$ median method.

On the block error rate performance of cooperative non-orthogonal multiple access short-packet communications with full-duplex relay and partial relay selection

  • Ha Duy Hung;Hoang Van Toan;Tran Trung Duy;Le The Dung;Quang Sy Vu
    • ETRI Journal
    • /
    • v.46 no.3
    • /
    • pp.446-460
    • /
    • 2024
  • In this paper, we mathematically investigate a downlink non-orthogonal multiple access (NOMA) system for short-packet communications (SPC) in which the near users are used as full-duplex (FD) relays to forward intended signals from the source to a far user. In addition, partial relay selection is employed to enhance the performance of the FD relays under the impact of imperfect interference cancellation. At the far user, selection combining (SC) or maximal ratio combining (MRC) is employed to combine the signals received from the source and the selected FD relay. The analytical expressions for the average block error rate (BLER) of two users over flat Rayleigh fading channels are derived. Furthermore, closed-form asymptotic expressions of the average BLERs at the near and far users in high signal-to-noise ratio (SNR) regimes are obtained. The numerical results show that the analytical BLERs of the near user and far user closely match the simulation results.

A Study on the Fast Block Matching Algorithm (고속 Block Matching 알고리즘에 관한 연구)

  • 이인홍;박래홍
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.24 no.4
    • /
    • pp.667-674
    • /
    • 1987
  • In this paper an effective block matching algorithm is proposed to find the motion vector. There are two approaches to the estimation of the motion vector in MCC (motion compensated coding), i.e., pel(pixel element) recursive algorithm and block matching algorithm. The search algorithm in this paper is based on the block matching method. The advantage of a proposed algorithm using integral projections is the reduction of the computation time. While the conventional block matching methods have to be computed in 2-dimensional arrays, the proposed algorithm using integral projections can be computed in 1-dimensional arrays. In comparison with conventional block matching methods, a computer simulation shows that though the prediction error increases 0.23 db, it is not detectable for human eyes and the average reduction ratio of computation time obtained from the proposed algorithm is about 3-4.

  • PDF

A Blocking Artifacts Reduction Algorithm for Block-Transform coding Image

  • Han, Byung-Hyeok;Kim, Jean-Youn;Lee, Chi-Woo;Jin, Hyun-Joon;Park, Nho-Kyung
    • Proceedings of the IEEK Conference
    • /
    • 2000.07a
    • /
    • pp.437-440
    • /
    • 2000
  • This paper proposes a method to improve video quality on images that have blocking artifacts at block boundary. Block image transform coding suffers from blocking artifact that is a main cause of degrading video quality because of the quantization error of transform coefficients in quantization process. filtering and DPCM for DC components have been widely used to reduce blocking artifact. Recently, lots of works focus on the technique that minimizes block effects using discontinuity of block boundaries. In this paper, image blurring in decoding stage is improved by adding compensation factor to each transformed blocks so that discontinuity of block boundaries can be decreased. The compensation factor is applied on each block without much loss of edge components.

  • PDF

An Efficient Error Concealment Algorithm using Adaptive Selection of Adjacent Motion Vectors (주변 움직임 벡터의 적응적 선택을 이용한 효율적인 에러은닉 알고리즘)

  • Lee Hyun-Woo;Seong Dong-Su
    • The KIPS Transactions:PartB
    • /
    • v.11B no.6
    • /
    • pp.661-666
    • /
    • 2004
  • In the wireless communication systems, transmission errors degrade the reconstructed image quality severely. Error concealment in video communication is becoming increasingly important because transmission errors can cause single or multiple loss of macroblocks in video delivery over unreliable channels such as wireless networks and internet. Among various techniques which can reduce the degradation of video quality, the error concealment techniques yield good performance without overheads and the modification of the encoder. In this paper, lost image blocks can be concealed with the OBMC(Overlapped Block Motion Compensation) after new motion vectors of the lost image blocks are allocated by median values using the adaptive selection with motion vectors of adjacent blocks. We know our algorithm is more effective in case of continuous GOB loss. The results show a significant improvement over the zero motion error concealment and other temporal concealment methods such as Motion Vector Rational Interpolation or Median+OBMC by 3dB gain in PSNR.

Fast Motion Estimation Algorithm via Minimum Error for Each Step (단계별 최소에러를 통한 고속 움직임 예측 알고리즘)

  • Kim, Jong Nam
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.8
    • /
    • pp.1531-1536
    • /
    • 2016
  • In this paper, we propose a fast motion estimation algorithm which is important in performance of video encoding. Even though so many fast algorithms for motion estimation have been published due to its tremendous computational amount of for full search algorithm, efforts for reducing computations in motion estimation still remain. In the paper, we propose an algorithm that reduces unnecessary computations only, while keeping prediction quality the same as that of the full search. The proposed algorithm does not calculate block matching error for each candidate at once to find motion vectors but divides the calculation procedure into several steps and calculates partial sum of block errors. By doing that, we can estimate the minimum error point early and get the enhancement of calculation speed by reducing unnecessary computations. The proposed algorithm uses smaller computations than conventional fast search algorithms with the same prediction quality as full search.

A Study on Efficient UWB Positioning Error Compensation Technique (효율적인 UWB 무선 측위 오차 보상 기법에 관한 연구)

  • Park, Jae-Wook;Bae, Seung-Chun;Lee, Soon-Woo;Kang, Ji-Myung;Lee, Won-Cheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.10A
    • /
    • pp.727-735
    • /
    • 2009
  • To alleviate positioning error using wireless ultra-wideband (UWB) is primary concern, and it has been studied how to reduce the positioning error effectively. Thanks to many repeated transmissions of UWB signals, we can have a variety of selections to point out the most precise positioning result. Towards this, scanning method has been preferred to be used due to its simplicity. This exhaustive method firstly fixes the candidate position, and calculates the sum of distances from observed positions. However, it has tremendous number of computations, and the complexity is more serious if the size of two-dimensional range is the larger. To mitigate the large number of computations, this paper proposes the technique employing genetic algorithm and block windowing. To exploit its superiority, simulations will be conducted to show the reduction of complexity, and the efficiency on positioning capability.

Motion Estimation Using the Relation Between Rate and Distortion (부호화율과 일그러짐의 관계를 이용하는 움직임 추정)

  • 양경호;김태정;이충웅
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.29B no.8
    • /
    • pp.66-73
    • /
    • 1992
  • This paper proposes a new motion estimation algorithm which takes into account the rate-distortion relation in encoding motion compensated error images. The proposed algorithm is based on a new block-matching criterion which is the function of not only the mean squared block-matching error but also the code length for the entropy coded motion vector. The proposed algorithm optimizes the trade-off between the bit rate for motion compensated error images and the bit rate for the motion vectors. Simulation results show that in the motion compensated image coding the proposed motion estimator improves the overall performance by 0.5 dB when compared to the motion estimator which uses MSE only.

  • PDF

A Study On Error Localization Techniques for MPEG-4 Error Resilience (MPEG-4에서 오류 강인성을 위한 오류전파 제한방법에 대한 연구)

  • 이상조;서덕영;임영권;이명호
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 1999.11b
    • /
    • pp.243-248
    • /
    • 1999
  • MPEG-4에서 오류강인성(Error Resilience)를 위한 한 방법으로 Resynchronization Markers(RM)을 사용한다. 한 프레임이 시작될 때 StartCode를 사용하여 동기를 맞추고 몇 개의MacroBlock을 encoding한 후 일정한 비트수(Threshold 값)가 지나면 재동기 마커 표시하여 재동기를 한다. 이렇게 하므로서 한 프레임 내에서 어떤 부분에 에러가 발생하더라도 그 에러가 속해있는 비디오패킷(재동기 마커와 재동기 마커사이의 Data)만을 버리거나 RVLC(ReversibleVariable Length Codes)를 사용하여 Data를 복원할 수 있다. 그러나 만약 재동기 마커에 에러가 발생하거나 에러의 전파로 인하여 재동기 마커를 인식 못한다면 두 개 이상의 패킷이 손실되거나RVLC를 사용한 데이터 복원을 할 수 없다. 본 논문에서는 이를 막기위해 디코딩 전에 Prescan을 통해서 재동기 마커의 위치를 탐지하고 에러가 생긴 재동기 마커를 복원하는 방법을 제안하였다. 그리고 bitrate에 따른 MB(MacroBlock)의 크기와 비디오 패킷 크기(재동기 마커와 재동기 마커간의 거리)를 분석하여 재동기 마커를 찾는 루틴에 적용하였다.

  • PDF

Estimation of long memory parameter in nonparametric regression

  • Cho, Yeoyoung;Baek, Changryong
    • Communications for Statistical Applications and Methods
    • /
    • v.26 no.6
    • /
    • pp.611-622
    • /
    • 2019
  • This paper considers the estimation of the long memory parameter in nonparametric regression with strongly correlated errors. The key idea is to minimize a unified mean squared error of long memory parameter to select both kernel bandwidth and the number of frequencies used in exact local Whittle estimation. A unified mean squared error framework is more natural because it provides both goodness of fit and measure of strong dependence. The block bootstrap is applied to evaluate the mean squared error. Finite sample performance using Monte Carlo simulations shows the closest performance to the oracle. The proposed method outperforms existing methods especially when dependency and sample size increase. The proposed method is also illustreated to the volatility of exchange rate between Korean Won for US dollar.