• Title/Summary/Keyword: one-bit transform

Search Result 64, Processing Time 0.029 seconds

An Efficient Search Method for Binary-based Block Motion Estimation (이진 블록 매칭 움직임 예측을 위한 효율적인 탐색 알고리듬)

  • Lim, Jin-Ho;Jeong, Je-Chang
    • Journal of Broadcast Engineering
    • /
    • v.16 no.4
    • /
    • pp.647-656
    • /
    • 2011
  • Motion estimation using one-bit transform and two-bit transform reduces the complexity for computation of matching error; however, the peak signal-to-noise ratio (PSNR) is degraded. Modified 1BT (M1BT) and modified 2BT (M2BT) have been proposed to compensate degraded PSNR by adding conditional local search. However, these algorithms require many additional search points in fast moving sequences with a block size of $16{\times}16$. This paper provides more efficient search method by preparing candidate blocks using the number of non-matching points (NNMP) than the conditional local search. With this NNMP-based search, we can easily obtain candidate blocks with small NNMP and efficiently search final motion vector. Experimental results show that the proposed algorithm not only reduces computational complexity, but also improves PSNR on average compared with conventional search algorithm used in M1BT, M2BT and AM2BT.

Weighted Constrained One-Bit Transform Method for Low-Complexity Block Motion Estimation

  • Choi, Youngkyoung;Kim, Hyungwook;Lim, Sojeong;Yu, Sungwook
    • ETRI Journal
    • /
    • v.34 no.5
    • /
    • pp.795-798
    • /
    • 2012
  • This letter proposes a new low-complexity motion estimation method. The proposed method classifies various nonmatching pixel pairs into several categories and assigns an appropriate weight for each category in the matching stage. As a result, it can significantly improve performance compared to that of the conventional methods by adding only one 1-bit addition and two Boolean operations per pixel.

The Most and Least Greedy Algorithms for Integer Bit Allocation (정수 비트 할당을 위한 최대 탐욕 및 최소 탐욕 알고리즘에 관한 연구)

  • Lim, Jong-Tae;Yoo, Do-Sik
    • Journal of Advanced Navigation Technology
    • /
    • v.11 no.4
    • /
    • pp.388-393
    • /
    • 2007
  • In designing transform coders bit allocation is one of the important issues. In this paper we propose two optimal algorithms for integer bit allocation in transform coding. Based on high-resolution formulas for bit allocation, the most and least greedy algorithms are developed to optimally adjust non-integer bit rates of coefficient quantizers to integer values. In particular, a duality property is observed between the two greedy algorithms.

  • PDF

Enhanced Binary Block Matching Method for Constrained One-bit Transform based Motion Estimation (개선된 이진 블록 매칭 방법을 사용한 제한된 1비트 변환 알고리듬 기반 움직임 추정)

  • Kim, Hyungdo;Jeong, Jechang
    • Journal of Broadcast Engineering
    • /
    • v.20 no.2
    • /
    • pp.257-264
    • /
    • 2015
  • In this paper, Enhanced binary block matching method for Constrained one-bit transform (C1BT) based motion estimation is proposed. Binary motion estimation exploits the Number of non-matched points (NNMP) as a block matching criterion instead of the Sum of Absolute Differences (SAD) for low complex motion estimation. The motion estimation using SAD could use the smaller block for more accurate motion estimation. In this paper the enhanced binary block matching method using smaller motion estimation block for C1BT is proposed to the more accurate binary matching. Experimental results shows that the proposed algorithm has better Peak Signal to Noise Ration (PSNR) results compared with conventional binary transform algorithms.

Constrained One-Bit Transform based Motion Estimation using Extension of Matching Error Criterion (정합 오차 기준을 확장한 제한된 1비트 변환 알고리즘 기반의 움직임 예측)

  • Lee, Sanggu;Jeong, Jechang
    • Journal of Broadcast Engineering
    • /
    • v.18 no.5
    • /
    • pp.730-737
    • /
    • 2013
  • In this paper, Constrained One-Bit Transform (C1BT) based motion estimation using extension of matching error criterion is proposed. C1BT based motion estimation algorithm exploiting Number of Non-Matching Points (NNMP) instead of Sum of Absolute Differences (SAD) that used in the Full Search Algorithm (FSA) facilitates hardware implementation and significantly reduces computational complexity. However, the accuracy of motion estimation is decreased. To improve inaccurate motion estimation, this algorithm based motion estimation extending matching error criterion of C1BT is proposed in this paper. Experimental results show that proposed algorithm has better performance compared with the conventional algorithm in terms of Peak-Signal-to-Noise-Ratio (PSNR).

Damage Diagnosis of Drill Bit while Drilling using Wavelet Transform Analysis (웨이블릿 변환 분석을 이용한 천공 중 드릴 비트의 손상 진단)

  • Jang, Hyongdoo
    • Explosives and Blasting
    • /
    • v.38 no.1
    • /
    • pp.14-22
    • /
    • 2020
  • Bit damage is one of the primary causes of decreasing drilling efficacy. Nevertheless the management of bit ware and failure are often left for field engineers' experience. Thus it is imperative to establish a proper system to predict and manage the bit damage during the rock drilling process. In this study, the drilling sound signal has been recorded and analyzed using wavelet transform analysis to identify the exact moment of bit failure. Through the analysis wavelet time-frequency spectrums have been constructed and an abnormal point has been identified with 0.9 of wavelet transform value at the 652.8s on a frequency band around 500Hz. Furthermore it is also observed that the penetration rate of the damaged bit has been decreased to 23mm/s which is 9mm/sec lower than the average of undamaged bit. The study verifies that wavelet transform analysis can be used to build a system to diagnose the bit damage while drilling.

Design of a Variable Bit Rate Speech Coder Based on One-dimensional SPIHT (1차원 SPIHT를 이용한 가변 비트율 음성 부호기의 설계)

  • Na, Hoon;Jeong, Dae-Gwon
    • The Journal of the Acoustical Society of Korea
    • /
    • v.22 no.6
    • /
    • pp.443-451
    • /
    • 2003
  • Since a codebook-based CELP coder models its excitation signal according to one of several bit rates pre-assigned to codebooks and synthesizes speech signal using codebooks, it can not support encoding of speech signal at an arbitrary bit rate in one encoder. The proposed variable bit rate speech coder encodes the excitation signal based on the bit rate assigned to a present frame of speech using one-dimensional SPIHT and wavelet transform. Also it does't need to model excitation signal (or codebook) to some types as CELP coder, and can encode excitation signal at various bit rates without exact pitch information according to user requirement. As a result, since the coder doesn't have a codebook structure, it has relatively low coder complexity and provides equal or better speech quality compared to G.729 and G.723.1 coder.

Image Coding Using Bit-Planes of Wavelet Coefficients (웨이블렛 변환 계수의 비트 플레인을 이용한 영상부호화)

  • 김영로;홍원기;고성제
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.4
    • /
    • pp.714-725
    • /
    • 1997
  • This paper proposes an image compression method using the wavelet transform and bit-plane coding of wavelet coefficients. The hierarchical application of wavelet transform to an image produces one low resoluation(the subband with lowest frequency) image and several high frequency subbands. In the proposed method, the low resolution image is compressed by a lossless method at 8 bits per each coefficient. However, the high frequency subbands are decomposed into 8 bit planes. With an adptive block coding method, the decomposed bit planes are effectively compressed using localized edge information in each bit plane. In addition, the propsoed method can control bit rates by selectively eliminating lessimportant subbands of low significant bit planes. Experimental results show that the proposed scheme has better performance in the peak signal to noise ratio (PSNR) and compression rate than conventional image coding methods using the wavelet transform and vector quantization.

  • PDF

Optimized Integer Cosine Transform (최적화 정수형 여현 변환)

  • 이종하;김혜숙;송인준;곽훈성
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.9
    • /
    • pp.1207-1214
    • /
    • 1995
  • We present an optimized integer cosine transform(OICT) as an alternative approach to the conventional discrete cosine transform(DCT), and its fast computational algorithm. In the actual implementation of the OICT, we have used the techniques similar to those of the orthogonal integer transform(OIT). The normalization factors are approximated to single one while keeping the reconstruction error at the best tolerable level. By obtaining a single normalization factor, both forward and inverse transform are performed using only the integers. However, there are so many sets of integers that are selected in the above manner, the best OICT matrix obtained through value minimizing the Hibert-Schmidt norm and achieving fast computational algorithm. Using matrix decomposing, a fast algorithm for efficient computation of the order-8 OICT is developed, which is minimized to 20 integer multiplications. This enables us to implement a high performance 2-D DCT processor by replacing the floating point operations by the integer number operations. We have also run the simulation to test the performance of the order-8 OICT with the transform efficiency, maximum reducible bits, and mean square error for the Wiener filter. When the results are compared to those of the DCT and OIT, the OICT has out-performed them all. Furthermore, when the conventional DCT coefficients are reduced to 7-bit as those of the OICT, the resulting reconstructed images were critically impaired losing the orthogonal property of the original DCT. However, the 7-bit OICT maintains a zero mean square reconstruction error.

  • PDF

Constrained One-Bit Transform using Extension of Matching error criterion (정합 오차 기준을 확장한 제한된 1비트 변환 알고리즘)

  • Lee, Sang-Gu;Yun, Jang-Hyeok;Jeong, Je-Chang
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2013.06a
    • /
    • pp.267-269
    • /
    • 2013
  • 본 논문은 제한된 1비트 변환 (Constrained One-Bit Transform : C1BT) 알고리즘의 정합 오차 기준의 동적 범위를 확장하는 알고리즘을 제안하였다. C1BT는 정합 오차 기준으로 SAD (Sum of Absolute Differences)를 사용하지 않고 CNNMP (Constrained Number of Non-Matching Points)를 사용하여 하드웨어 구현을 용이하게 하고 속도를 대폭 향상시켰다. 이는 기존의 움직임 예측 방법인 전역 탐색 알고리즘 (Full Search Algorithm: FSA)과 비교하여 연산량을 크게 줄였으나 움직임 예측의 정확도를 현저히 감소시켰다. 이 점을 개선하기 위해 이 논문에서는 C1BT의 정합 오차 기준을 확장하여 움직임 예측의 정확도를 높이는 알고리즘을 제안하였다. 기존의 C1BT와 제안하는 알고리즘을 비교한 결과에서 제안하는 알고리즘이 기존의 C1BT에 비해 움직임 예측의 정확도의 기준인 PSNR 측면에서 더 우수한 성능을 보였다.

  • PDF