• Title/Summary/Keyword: N-transform

Search Result 714, Processing Time 0.022 seconds

Image Coding by Region Classification and Wavelet Transform (영역분류와 웨이브렛 변환에 의한 영상 부호화)

  • 윤국진;박정호;최재호;곽훈성
    • Proceedings of the IEEK Conference
    • /
    • 2000.06c
    • /
    • pp.113-116
    • /
    • 2000
  • In this paper, we present new scheme for image coding which efficiently use the relationship between the properties of spatial image and its wavelet transform. Firstly an original image is decomposed into several layers by the wavelet transform, and simultaneously decomposed into 2$\^$n/ ${\times}$ 2$\^$n/ blocks. Each block is classified into 3 regions according to their property, i.e., low activity region(LAR), midrange activity region(MAR), high activity region(HAR). Secondly we are applied texture modeling technique to LAR, MAR and HAR are encoded by Stack-Run coding technique. Finally our scheme Is superior to the Zerotree method in both reconstructed image Quality and transmitted bit rates.

  • PDF

Feature Extraction of Fault Current using Fourier Transform on the Multi-Shot Reclosing (푸리에 변환을 이용한 다중 재폐로방식에서의 사고전류 특징 추출)

  • Oh, J.H.;Yun, S.Y.;Lee, N.S.;Kim, J.C.;Bae, J.C.;Kim, N.K.
    • Proceedings of the KIEE Conference
    • /
    • 1999.07c
    • /
    • pp.1130-1132
    • /
    • 1999
  • This paper presents the feature extraction of fault current related to the multi-shot reclosing scheme in the power distribution system. Fourier transform is used to extract the feature of the fault current waveform in the case of the temporary fault and the permanent fault. After the waveform is analyzed using Fourier transform, the magnitude spectrum and the relative variation of THD are calculated. These results are that the relative variation of THD is great in the temporary fault and is little in the permanent fault.

  • PDF

TROTTER-KATO TYPE CONVERGENCE FOR SEMIGROUPS

  • LEE YOUNG S.
    • Journal of applied mathematics & informatics
    • /
    • v.17 no.1_2_3
    • /
    • pp.559-565
    • /
    • 2005
  • In this paper, we establish the convergence of semigroups that are strongly continuous on (0, $\infty$). By using Laplace transform theory, we show some properties of semigroups and the convergence result.

SOME BILINEAR ESTIMATES

  • Chen, Jiecheng;Fan, Dashan
    • Journal of the Korean Mathematical Society
    • /
    • v.46 no.3
    • /
    • pp.609-620
    • /
    • 2009
  • We establish some estimates on the hyper bilinear Hilbert transform on both Euclidean space and torus. We also use a transference method to obtain a Kenig-Stein's estimate on bilinear fractional integrals on the n-torus.

Blind Signal Separation Method using Hough Transform (Hough 변환을 이용한 암묵신호분리방법)

  • Lee, Haeng Woo
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.10 no.3
    • /
    • pp.143-149
    • /
    • 2014
  • This paper is on the blind signal separation(BSS) method by the geometric method. To separate the signal sources, we use Hough transform and BSS. Hough transform is a geometric method which let us know the local informations of the signal. We find the orientations of signals by Hough transform and know the number of signal sources. When the number of sensors is more than the number of sources. the BSS algorithm can separate the mixtures well in the time domain. This algorithm has a good performance in converging fast. We had checked up the quality of the algorithm after separating the mixed signals. The results of simulations show that this BSS method has the abnormal waveforms due to unconverging coefficients in the beginning, and stably has the separated waveforms which almost equal to the sources in the most period.

COHEN-MACAULAY MODULES OVER NOETHERIAN LOCAL RINGS

  • Bahmanpour, Kamal
    • Bulletin of the Korean Mathematical Society
    • /
    • v.51 no.2
    • /
    • pp.373-386
    • /
    • 2014
  • Let (R,m) be a commutative Noetherian local ring. In this paper we show that a finitely generated R-module M of dimension d is Cohen-Macaulay if and only if there exists a proper ideal I of R such that depth($M/I^nM$) = d for $n{\gg}0$. Also we show that, if dim(R) = d and $I_1{\subset}\;{\cdots}\;{\subset}I_n$ is a chain of ideals of R such that $R/I_k$ is maximal Cohen-Macaulay for all k, then $n{\leq}{\ell}_R(R/(a_1,{\ldots},a_d)R)$ for every system of parameters $a1,{\ldots},a_d$ of R. Also, in the case where dim(R) = 2, we prove that the ideal transform $D_m(R/p)$ is minimax balanced big Cohen-Macaulay, for every $p{\in}Assh_R$(R), and we give some equivalent conditions for this ideal transform being maximal Cohen-Macaulay.

Fast two dimensional DCT by Polynomial Transform without complex operations (복소연산이 없는 Polynomial 변환을 이용한 고속 2 차원 DCT)

  • Park, Hwan-Serk;Kim, Won-Ha
    • Proceedings of the IEEK Conference
    • /
    • 2003.07e
    • /
    • pp.1940-1943
    • /
    • 2003
  • 본 논문은 Polynomial 변환을 이용하여 2차원 Discrete Cosine Transform (2D-DCT)의 계산을 1차원 DCT로 변환하여 계산하는 알고리즘을 개발한다. 기존의 일반적인 알고리즘인 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의 합으로 직접 변환하므로 복소 연산이 필요하지 않다. 또한 본 논문에서 제시한 알고리즘은 각 차원에서 데이터 크기가 다른 임의 크기의 2차원 데이터 변환에도 적용할 수 있다.

  • PDF

HYPERCYCLICITY OF WEIGHTED COMPOSITION OPERATORS ON THE UNIT BALL OF ℂN

  • Chen, Ren-Yu;Zhou, Ze-Hua
    • Journal of the Korean Mathematical Society
    • /
    • v.48 no.5
    • /
    • pp.969-984
    • /
    • 2011
  • This paper discusses the hypercyclicity of weighted composition operators acting on the space of holomorphic functions on the open unit ball $B_N$ of $\mathbb{C}^N$. Several analytic properties of linear fractional self-maps of $B_N$ are given. According to these properties, a few necessary conditions for a weighted composition operator to be hypercyclic in the space of holomorphic functions are proved. Besides, the hypercyclicity of adjoint of weighted composition operators are studied in this paper.

A fast IMDCT algorithm for MPEG-2 AAC decoder (MEPG-2 AAC 디코더를 위한 고속 IMDCT 알고리즘)

  • Chi, Hua-Jun;Kim, Tae-Hoon;Cho, Koon-Shik;Park, Ju-Sung
    • Proceedings of the IEEK Conference
    • /
    • 2007.07a
    • /
    • pp.261-262
    • /
    • 2007
  • This paper proposes a new IFFT(Inverse Fast Fourier Transform) algorithm, which is proper for IMDCT(Inverse Modified Discrete Cosine Transform) of MPEG-2 AAC(Advanced Audio Coding) decoder. The IFFT used in $2^N$-point IMDCT employ the bit-reverse data arrangement of inputs and N/4-IFFT to reduce the calculation cycles. We devised a new data arrangement algorithm of IFFT input and N/$4^{n+1}$-IFFT and can reduce multiplication cycles, addition cycles, and ROM size.

  • PDF

Lp FOURIER-FEYNMAN TRANSFORMS AND CONVOLUTION

  • Ahn, Jae Moon
    • Korean Journal of Mathematics
    • /
    • v.7 no.2
    • /
    • pp.183-198
    • /
    • 1999
  • Let $\mathcal{F}(B)$ be the Fresnel class on an abstract Wiener space (B, H, ${\omega}$) which consists of functionals F of the form : $$F(x)={\int}_H\;{\exp}\{i(h,x)^{\sim}\}df(h),\;x{\in}B$$ where $({\cdot}{\cdot})^{\sim}$ is a stochastic inner product between H and B, and $f$ is in $\mathcal{M}(H)$, the space of all complex-valued countably additive Borel measures on H. We introduce the concepts of an $L_p$ analytic Fourier-Feynman transform ($1{\leq}p{\leq}2$) and a convolution product on $\mathcal{F}(B)$ and verify the existence of the $L_p$ analytic Fourier-Feynman transforms for functionls in $\mathcal{F}(B)$. Moreover, we verify that the Fresnel class $\mathcal{F}(B)$ is closed under the $L_p$ analytic Fourier-Feynman transform and the convolution product, respectively. And we investigate some interesting properties for the $n$-repeated $L_p$ analytic Fourier-Feynman transform on $\mathcal{F}(B)$. Finally, we show that several results in [9] come from our results in Section 3.

  • PDF