• Title/Summary/Keyword: transform coefficients

Search Result 763, Processing Time 0.026 seconds

Transform Coding of Arbitrarily-Shaped Image Segments Using Recovery of Truncated Coefficients (삭제된 변환계수의 복원을 이용한 임의형태 영상영역 변환부호화)

  • 김희정;김지홍
    • Proceedings of the IEEK Conference
    • /
    • 2003.07e
    • /
    • pp.2351-2354
    • /
    • 2003
  • A new transform coder for arbitrarily shaped image segments is proposed. In the encoder, a block-based DCT is applied to the resulting image block after shifting pixels within the image segment to block border and padding the mean value of the pixels to empty region. For reducing the transmission bit rate, the transform coefficients located in padded region are truncated and only the remaining transform coefficients are transmitted to the decoder. In the decoder, the transform coefficients truncated in the encoder are recovered using received transform coefficients and a block-based inverse DCT is performed.

  • PDF

Efficient Conversion of DCT Coefficients to H.264 Transform Coefficients Using Lapped Transforms

  • Lee, Chang-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.7C
    • /
    • pp.601-607
    • /
    • 2007
  • In order to convert MPEG-2 into H.264 format in ubiquitous communication environments, the efficient conversion of the discrete cosine transform (DCT) coefficients to H.264 transform coefficients is essential. In this paper, two efficient conversion systems are proposed. The proposed systems are composed of two parts. In the first part, the DCT coefficients are denoised using the lapped transform (LT) to reduce the quantization noises and blocking effects. In the second part, the denoised DCT coefficients are converted into the integer transform (IT) coefficients of H.264. Simulation results show that the proposed methods provide visually fine images. Moreover, the computational complexity of the proposed method is reduced compared with the conventional method, since the number of the DCT coefficients, which should be converted, is reduced in the first part.

A Boundary Integral Equation Formulation for an Unsteady Anisotropic-Diffusion Convection Equation of Exponentially Variable Coefficients and Compressible Flow

  • Azis, Mohammad Ivan
    • Kyungpook Mathematical Journal
    • /
    • v.62 no.3
    • /
    • pp.557-581
    • /
    • 2022
  • The anisotropic-diffusion convection equation with exponentially variable coefficients is discussed in this paper. Numerical solutions are found using a combined Laplace transform and boundary element method. The variable coefficients equation is usually used to model problems of functionally graded media. First the variable coefficients equation is transformed to a constant coefficients equation. The constant coefficients equation is then Laplace-transformed so that the time variable vanishes. The Laplace-transformed equation is consequently written as a boundary integral equation which involves a time-free fundamental solution. The boundary integral equation is therefore employed to find numerical solutions using a standard boundary element method. Finally the results obtained are inversely transformed numerically using the Stehfest formula to get solutions in the time variable. The combined Laplace transform and boundary element method are easy to implement and accurate for solving unsteady problems of anisotropic exponentially graded media governed by the diffusion convection equation.

Image Analysis using Transform domain-based Human Visual Parameter (변환영역 기반의 시각특성 파라미터를 이용한 영상 분석)

  • Kim, Yoon-Ho
    • Journal of Advanced Navigation Technology
    • /
    • v.12 no.4
    • /
    • pp.378-383
    • /
    • 2008
  • This paper presents a method of image analysis based on discrete cosine transform (DCT) and fuzzy inference(Fl). It concentrated not only on the design of fuzzy inference algorithm but also on incorporating human visual parameter(HVP) into transform coefficients. In the first, HVP such as entropy, texture degree are calculated from the coefficients matrix of DCT. Secondly, using these parameters, fuzzy input variables are generated. Mamdani's operator as well as ${\alpha}$-cut function are involved to simulate the proposed approach, and consequently, experimental results are presented to testify the performance and applicability of the proposed scheme.

  • PDF

Wavelet-Based Fuzzy System Modeling Using VEGA (VEGA를 이용한 웨이브릿 기반 퍼지 시스템 모델링)

  • 이승준;주영훈;박진배
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2000.11a
    • /
    • pp.149-152
    • /
    • 2000
  • This paper addresses the wavelet fuzzy modeling using Virus-Evolutionary Genetic Algorithm (VEGA). We build a fuzzy system model which is equivalent to the wavelet transform after identifying the coefficients of wavelet transform. We can obtain an accurate system model with a small number of coefficients due to the energy compaction property of the wavelet transform. It thus means that we can construct a fuzzy system model with a small number of rules. In order to identify the wide-ranged coefficients of the wavelet transform, VEGA is adopted, which has prominent ability to avoid premature local convergence that is suitable to complex optimization problems. We demonstrate the superiority of our proposed fuzzy system modeling method over the previous results by modeling nonlinear function.

  • PDF

Derivation of ternary RM coefficients using single transform matrix (단일변수 변환 행렬을 이용한 3치 RM 상수 생성)

  • 이철우;최재석;신부식;심재환;김홍수
    • Proceedings of the IEEK Conference
    • /
    • 1999.06a
    • /
    • pp.745-748
    • /
    • 1999
  • This paper propose the method to derive RM(Reed-Muller) expansion coefficients for Multiple-Valued function. The general method to obtain RM expansion coefficient for p valued n variable is derivation of single variable transform matrix and expand it n times using Kronecker product. The transform matrix used is p$^{n}$ $\times$ p$^{n}$ matrix. In this case the size of matrix increases depending on the augmentation of variables and the operation is complicated. Thus, to solving the problem, we propose derivation of RM expansion coefficients using p$\times$p transform matrix and Karnaugh-map.

  • PDF

Secret Data Communication Method using Quantization of Wavelet Coefficients during Speech Communication (음성통신 중 웨이브렛 계수 양자화를 이용한 비밀정보 통신 방법)

  • Lee, Jong-Kwan
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.10d
    • /
    • pp.302-305
    • /
    • 2006
  • In this paper, we have proposed a novel method using quantization of wavelet coefficients for secret data communication. First, speech signal is partitioned into small time frames and the frames are transformed into frequency domain using a WT(Wavelet Transform). We quantize the wavelet coefficients and embedded secret data into the quantized wavelet coefficients. The destination regard quantization errors of received speech as seceret dat. As most speech watermark techniques have a trade off between noise robustness and speech quality, our method also have. However we solve the problem with a partial quantization and a noise level dependent threshold. In additional, we improve the speech quality with de-noising method using wavelet transform. Since the signal is processed in the wavelet domain, we can easily adapt the de-noising method based on wavelet transform. Simulation results in the various noisy environments show that the proposed method is reliable for secret communication.

  • PDF

An Efficient Algorithm for the Conversion of DCT Coefficients to H.264 Transform Coefficients in MPEG-2 to H.264 Transcoding (MPEG-2에서 H.264로의 Transcoding 과정에서 DCT 계수를 H.264 변환 계수로 변환하는 효율적인 알고리듬)

  • Kim, Yong-Jae;Lee, Chang-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.8C
    • /
    • pp.729-737
    • /
    • 2007
  • The H.264/AVC video coding standard provides higher coding efficiency compared to the conventional MPEG-2 standard. Since a lot of videos have been encoded using MPEG-2, the format conversion from MPEG-2 to H.264 is essential. In this paper, we propose an efficient method for the conversion of DCT coefficients to H.264/AVC transform coefficients. This conversion is essential, since $8{\times}8$ DCT and $4{\times}4$ integer transform are used in MPEG-2 and H.264/AVC, respectively. The mathematical analysis and computer simulation show that the computational complexity of the proposed algorithm is reduced compared to the conventional algorithm, while the loss caused by the conversion is negligible.

On the Performances of Block Adaptive Filters Using Fermat Number Transform

  • Min, Byeong-Gi
    • ETRI Journal
    • /
    • v.4 no.3
    • /
    • pp.18-29
    • /
    • 1982
  • In a block adaptive filtering procedure, the filter coefficients are adjusted once per each output block while maintaining performance comparable to that of widely used LMS adaptive filtering in which the filter coefficients are adjusted once per each output data sample. An efficient implementation of block adaptive filter is possible by means of discrete transform technique which has cyclic convolution property and fast algorithms. In this paper, the block adaptive filtering using Fermat Number Transform (FNT) is investigated to exploit the computational efficiency and less quantization effect on the performance compared with finite precision FFT realization. And this has been verified by computer simulation for several applications including adaptive channel equalizer and system identification.

  • PDF

A New Production mettled of GRM coefficients using k-map (K-map상의 셀을 이용한 새로운 GRM 상수 생성 기법)

  • Lee Chol-U;Che Wenzhe;Kim Heung-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.9C
    • /
    • pp.860-870
    • /
    • 2005
  • In this paper we propose a new method to derive GRM(Generalized Reed-Muller) coefacients for each $2^{n}$ polarities using cell of karnaugh map(k-map). Generally, there are the serial and parallel method to derive GRM coefficients. As a serial method, Green method generates GRM coefncients using transform matrix. And as a parallel method, Besslich algorithm produces GRM coefficients of each polarity using the generated anteriorly. Green's method generates GRM coefficients for n-variable by calculating transform matrix for one-variable and n-times kronecker product this matrix. And Besslich's method generates GRM coefficients of each polarity in order of Grey-code. But those methods have disadvantages that the number of variable exceeding four makes transform matrix large and there are so many operation steps. In this paper, GRM coefficients is generated by producing cell [$f_{i}$] minimizing variable on k-map and operating this cell [$f_{i}$] and transform matrix for one-variable. So, we can generate GRM coefficients of all polarities easily by using the proposed method.