• Title/Summary/Keyword: Transform

Search Result 10,392, Processing Time 0.032 seconds

CONDITIONAL FOURIER-FEYNMAN TRANSFORMS AND CONDITIONAL CONVOLUTION PRODUCTS

  • Park, Chull;David Skoug
    • Journal of the Korean Mathematical Society
    • /
    • v.38 no.1
    • /
    • pp.61-76
    • /
    • 2001
  • In this paper we define the concept of a conditional Fourier-Feynman transform and a conditional convolution product and obtain several interesting relationships between them. In particular we show that the conditional transform of the conditional convolution product is the product of conditional transforms, and that the conditional convolution product of conditional transforms is the conditional transform of the product of the functionals.

  • PDF

N-Point Fast Fourier Transform Using 4$\times$4 Fast Reverse Jacket Transform (4-점 리버스 자켓 변환를 이용한 N-점 고속 푸리에 변환)

  • 이승래;성굉모
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.4B
    • /
    • pp.418-422
    • /
    • 2001
  • 4-점 리버스 자켓 변환 (4-Point Reverse Jacket transform)의 장점 중의 하나는 4-점 fast Fourier transform(FFT)시 야기되는 실수 또는 복소수 곱셈을 행렬분해(matrix decomposition)를 이용, 곱셈인자를 모두 대각행렬에만 집중시킨, 매우 간결하고 효율적인 알고리즘이라는 점이다. 본 논문에서는 이를 N 점 FFT에 적용하는 알고리즘을 제안한다. 이 방법은 기존의 다른 변환형태보다 확장하거나 구조를 파악하기에 매우 용이하다.

  • PDF

A Study on the Probabilistic Generation Simulation by FHT (Fast hartley Transform을 이용한 확률론적 발전시뮬레이션에 관한 연구)

  • Song, Kil-Yeoung;Kim, Yong-Ha;Choi, Jae-Seok
    • Proceedings of the KIEE Conference
    • /
    • 1988.11a
    • /
    • pp.131-134
    • /
    • 1988
  • This Paper describes a algorithm for evaluating the loss of load probability of a generating system using Fast Hartley Transform. The Fast Hartley Transform(FHT) Is as fast as or faster than the Fast Fourier Transform(FHT) and serves for all the uses such as spectral, digital processing and convolution to which the FFT is at present applied. The method has been tested by applying to IEEE reliability test system and the effectiveness is demonstrated.

  • PDF

AN APPLICATION OF p-ADIC ANALYSIS TO WINDOWED FOURIER TRANSFORM

  • Park, Sook Young;Chung, Phil Ung
    • Korean Journal of Mathematics
    • /
    • v.12 no.2
    • /
    • pp.193-200
    • /
    • 2004
  • We shall introduce the notion of the windowed Fourier transform in $\mathbb{Q}_p$ and show that, for any given function $g{\in}L^2(\mathbb{Q}_p)$ of norm, the windowed Fourier transform of $f$ with respect to $g$ be a function of norms, and moreover be expressible to a summation form. The results obtained in this paper will be usable to the field of research in data compression for signal processing according to the following scheme.

  • PDF

FOURIER-YEH-FEYNMAN TRANSFORM AND CONVOLUTION ON YEH-WIENER SPACE

  • Kim, Byoung Soo;Yang, Young Kyun
    • Korean Journal of Mathematics
    • /
    • v.16 no.3
    • /
    • pp.335-348
    • /
    • 2008
  • We define Fourier-Yeh-Feynman transform and convolution product on the Yeh-Wiener space, and establish the existence of Fourier-Yeh-Feynman transform and convolution product for functionals in a Banach algebra $\mathcal{S}(Q)$. Also we obtain Parseval's relation for those functionals.

  • PDF

A new object recognition algorithm using generalized incremental circle transform

  • Han, Dong-Il;You, Bum-Jae;Zeungnam Bien
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1990.10b
    • /
    • pp.933-938
    • /
    • 1990
  • A method of recognizing 2-dimensional polygonal object is proposed by using a concept of generalized incremental circle transform. The generalized incremental circle transform, which maps boundaries of an object into a circular disc, represents efficiently the shape of the boundaries that are obtained from digirized binary images of the objects. It is proved that the generalized incremental circle transform of an object is invariant to object translation, rotation, and size, and can be used as feature information for recognizing two dimensional polygonal object efficiently.

  • PDF

Performance Comparison of Wavelet Transform Based Watermarking and DCT Transform Based Watermarking (Wavelet 변환과 DCT 변환을 이용한 워터마킹에 관한 연구)

  • 장용원;한승수;김인택
    • Proceedings of the IEEK Conference
    • /
    • 2000.11c
    • /
    • pp.85-88
    • /
    • 2000
  • With the rapid growth of network distributions of digitized media(audio, image, and video), there is an urgent need for copyright protection. For now watermarking is a well-known technique for copyright protection of digital data. To embed a digital watermark to the image, discrete cosine transform(DCT) and wavelet transform are commonly used. In this paper, the performance of the DCT based watermarking technique and wavelet based watermarking technique were compared and the influences of the parameter a that decides the strength of the watermarking data were considered.

  • PDF

Knowledge-Based Lane Detection using Rough Transform (Hough Transform을 이용한 지식 기반 차선 검출)

  • 이상영;박래홍
    • Proceedings of the IEEK Conference
    • /
    • 2003.07e
    • /
    • pp.1988-1991
    • /
    • 2003
  • 본 논문에서는 도로 주변의 나무와 건물, 그리고 옆 차선의 차량 등에 의한 그림자의 영향을 최소화하며 차선을 검출할 수 있는 방법을 제안하였다 우선 Hough transform을 수행하는 데 있어서 계산 시간을 줄이기 위하여 에지 영상에서 수평 투영을 통하여 vanishing line을 검출하였으며, vanishing line 아래 부분에서만 Hough transform을 수행하였다. 그리고 차선 검출을 위하여 Hough 평면에서 θ을 16등분하여 rough한 차선을 검출하였으며, 도로 형태에 대한 사전 지식을 이용하여 차선 검출을 시도하였다. 도로 주변상황이 다른 두 종류의 연속 영상들에 의한 실험 결과, 도로형태에 대하여 가정한 사전 지식과 유사한 영상들에 대하여 차선을 정확하게 검출하였다.

  • PDF

QUALITATIVE UNCERTAINTY PRINCIPLES FOR THE INVERSE OF THE HYPERGEOMETRIC FOURIER TRANSFORM

  • Mejjaoli, Hatem
    • Korean Journal of Mathematics
    • /
    • v.23 no.1
    • /
    • pp.129-151
    • /
    • 2015
  • In this paper, we prove an $L^p$ version of Donoho-Stark's uncertainty principle for the inverse of the hypergeometric Fourier transform on $\mathbb{R}^d$. Next, using the ultracontractive properties of the semigroups generated by the Heckman-Opdam Laplacian operator, we obtain an $L^p$ Heisenberg-Pauli-Weyl uncertainty principle for the inverse of the hypergeometric Fourier transform on $\mathbb{R}^d$.