• 제목/요약/키워드: M-transform

검색결과 956건 처리시간 0.034초

Properties of Two-dimensional M-transform with Applications to Image Processing

  • Kashiwagi, Hiroshi;Harada, Hiroshi;Yamaguchi, Teruo;Andoh, Toshiyuki
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2002년도 ICCAS
    • /
    • pp.86.4-86
    • /
    • 2002
  • 1. Review of one dimensional M-transform 2. Definition of two dimensional(2D)M-transform 3. Properties of 2D M-transform 4. Mean, Autocorrelation 5. Crosscorrelation of input and output of a system 6. Application to fault detection of mechanical shape

  • PDF

Measurement of Frequency Response of Giant Magnetostrictive Material by Use of M-transform

  • Harada, Hiroshi;Kashiwagi, Hiroshi;Kndo, Koshi;Yamaguchi, Teruo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2003년도 ICCAS
    • /
    • pp.497-501
    • /
    • 2003
  • In this paper, impulse response of giant magnetostrictive material (GMM) is identified by using M-transform. First, the displacement of GMM was measured by using the dual frequency laser interferometer. The noise included in the measured signal was removed by using M-transform. The impulse response of the GMM was identified from the input current of the driving coil and the displacement.

  • PDF

Identification of 2D Impulse Response by use of M-array with Application to 2D M-transform

  • Liu, Min;Kashiwagi, Hiroshi;Kobatake, Hidefumi
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1999년도 제14차 학술회의논문집
    • /
    • pp.234-237
    • /
    • 1999
  • In this paper, a new method for identification of two-dimensional(2D) impulse response is presented. As is well known, identification of 2D impulse response is an important and necessary theme for image processing or signal processing. Here, the authors extend M-transform which has been proposed by some of the authors to 2D case where an image is used instead of signal, and M-array is used instead of M-sequence. Firstly, we show that 2D impulse response can be obtained by use of M-array. Next 2D M-transform is defined where any 2D image can be considered to be the output of 2D filter whose input is 2D M-array. Simulation results show the effectiveness of identification of 2D impulse response by either using M-array or by 2D M-transform.

  • PDF

M-band 웨이블릿 변환을 이용한 볼테라 적응 등화기 (An Adaptive Volterra Series-based Nonlinear Equalizer Using M-band Wavelet Transform)

  • 김영근;강동준;남상원
    • 제어로봇시스템학회논문지
    • /
    • 제7권5호
    • /
    • pp.415-419
    • /
    • 2001
  • This paper proposes and adaptive nonlinear equalizer based on Volterra Series along with M-band wavelet transform(M-DWT). The proposed wavelet transform-domain approach leads to diagonalization of the input vector auto-correlation matrix, which yields clustering its eigenvalue spread around one, and improving the convergence rate of the corresponding transform-domain LMS algorithm. In particular, the proposed adaptive Volterra equalizer is employed to compensate for the output distortion produced by a weakly nonlinear system. Finally, some simulation results obtained by using a TWT amplifier model are provide to demonstrated the converging performance of the proposed approach.

  • PDF

THE INVERSION FORMULA OF THE STIELTJES TRANSFORM OF SPECTRAL DISTRIBUTION

  • Choi, Sang-Il
    • 충청수학회지
    • /
    • 제22권3호
    • /
    • pp.519-524
    • /
    • 2009
  • In multivariate analysis, the inversion formula of the Stieltjes transform is used to find the density of a spectral distribution of random matrices of sample covariance type. Let $B_{n}\;=\;\frac{1}{n}Y_{m}^{T}T_{m}Y_{m}$ where $Ym\;=\;[Y_{ij}]_{m{\times}n}$ is with independent, identically distributed entries and $T_m$ is an $m{\times}m$ symmetric nonnegative definite random matrix independent of the $Y_{ij}{^{\prime}}s$. In the present paper, using the inversion formula of the Stieltjes transform, we will find the density function of the limiting distribution of $B_n$ away from zero.

  • PDF

복소연산이 없는 Polynomial 변환을 이용한 2차원 고속 DCT (Two dimensional Fast DCT using Polynomial Transform without Complex Computations)

  • Park, Hwan-Serk;Kim, Won-Ha
    • 전자공학회논문지CI
    • /
    • 제40권6호
    • /
    • pp.127-140
    • /
    • 2003
  • 본 논문은 2차원 Discrete Cosine Transform (2D-DCT)의 계산을 새로운 Polynomial 변환을 통하여 1차원 DCT의 합으로 변환하여 계산하는 알고리즘을 개발한다. 기존의 2차원 계산방법인 row-column 으로는 N×M 크기의 2D-DCT에서 3/2NMlog₂(NM)-2NM+N+M의 합과 1/2NMlog₂(NM)의 곱셈이 필요한데 비하여 본 논문에서 제시한 알고리즘은 3/2NMlog₂M+NMlog₂N-M-N/2+2의 합과 1/2NMlog₂M의 곱셈 수를 필요로 한다. 또한 기존의 polynomial 변환에 의한 2D DCT는 Euler 공식을 적용하였기 때문에 복소 연산이 필요하지만 본 논문에서 제시한 polynomial 변환은 DCT의 modular 규칙을 이용하여 2D DCT를 ID DCT의 합으로 직접 변환하므로 복소 연산이 필요하지 않다.

Testing of EBELC classes of life distributions based on TTT-transform

  • Abu-Youssef, S.E.;Mohie El-Din, M.M.;Hassan, M.Kh.
    • International Journal of Reliability and Applications
    • /
    • 제13권1호
    • /
    • pp.49-56
    • /
    • 2012
  • Using total time on test transform (TTT), a new approach is taken for testing exponentiality versus the unknown age, exponential better than equilibrium life in convex ordering (EBELC). Selected critical values are tabulated for sample size n =2(2)50 and powers of the test are estimated for some commonly used distributions in reliability. Finally real example is presented to illustrate the theoretical results.

  • PDF

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

  • 임진호;정제창
    • 방송공학회논문지
    • /
    • 제16권4호
    • /
    • pp.647-656
    • /
    • 2011
  • 1비트 변환 (one-bit transform) 및 2비트 변환 (two-bit transform)을 이용하는 이진 블록 매칭 움직임 예측 (motion estimation) 방법은 전역 탐색 (full search) 움직임 예측 방법에 비해 블록 매칭 연산의 복잡도를 감소시키지만 PSNR (Peak Signal-to-Noise Ratio)성능 저하를 야기한다. 이러한 이진 블록 매칭 움직임 예측 방법의 정확도를 개선하기 위해 조건부 국부 탐색 (conditional localsearch)이 더해져 보완된 1비트 변환 (modified one-bit transform) 및 보완된 2비트 변환 (modified two-bit transform) 방법이 제안되었다. 그러나 이와 같이 추가적인 국부 탐색은 움직임이 빠른 영상에 대한 $16{\times}16$ 블록 크기의 움직임 예측에 있어서 많은 수의 추가적인 탐색을 필요로 한다. 본 논문은 기존의 조건부 국부 탐색 방법 대신 탐색 영역내의 각 후보 블록들의 (candidate blocks) NNMP(Number of Non-Matching Points)를 기반으로 한 효율적인 탐색 방법을 제안한다. NNMP 기반 탐색 방법을 통하여 작은 NNMP 값을 가지는 후보 블록들을 쉽게 탐색하여 최종 움직임 벡터(motion vector)를 효율적으로 찾을 수 있다. 실험을 통하여 제안하는 알고리듬이 기존의 방법들보다 복잡도 및 정확도 측면에서 좋은 성능을 보여주는 것을 확인하였다.

개선된 고속월쉬변환에 의한 직교필터 설계 (The orthogonal filter design using improved fast Walsh transform)

  • 정제욱;조영호;이한석;박준훈;심재선;안두수
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2000년도 하계학술대회 논문집 D
    • /
    • pp.2620-2623
    • /
    • 2000
  • The standard approach consists of using correlation of orthogonal functions in digital filtering, such as well-known FFT(Fast Fourier Transform) and FWT(Fast Walsh Transform). But it needs much calculations, multiplications and additions. The calculation amount is m $log_2m$ in the general case. Therefore, this requires high speed processors to calculate in real time, which can calculate floating point. This study developed improved fast Walsh transform based on dyadic-ordered fast Walsh transform, then regenerated signal flow graph of improved fast Walsh transform, and used it for digital filtering, and then measured fundamental frequency and harmonics for current and voltage signals of power system.

  • PDF

Multipliers in the fourier transform of distributions of rapid growth

  • Dae Hyeon Pahk;Byung Keun Sohn;Sun Woo Im
    • 대한수학회논문집
    • /
    • 제12권1호
    • /
    • pp.59-67
    • /
    • 1997
  • Let $K'_M$ be the space of distributions on $R^m$ which grow no faster than $e^{M(kx)}$ for some k > 0 and an index function M(x) and $K'_M$ be the Fourier transform of $K'_M$. We establish the characterizations of the space $O_M(K'_m;K'_M)$ of multipliers in $K'_M$.

  • PDF