• Title/Summary/Keyword: Direct Transform

Search Result 215, Processing Time 0.027 seconds

Fast DFT Matrices Transform Based on Generalized Prime Factor Algorithm

  • Guo, Ying;Mao, Yun;Park, Dong-Sun;Lee, Moon-Ho
    • Journal of Communications and Networks
    • /
    • v.13 no.5
    • /
    • pp.449-455
    • /
    • 2011
  • Inspired by fast Jacket transforms, we propose simple factorization and construction algorithms for the M-dimensional discrete Fourier transform (DFT) matrices underlying generalized Chinese remainder theorem (CRT) index mappings. Based on successive coprime-order DFT matrices with respect to the CRT with recursive relations, the proposed algorithms are presented with simplicity and clarity on the basis of the yielded sparse matrices. The results indicate that our algorithms compare favorably with the direct-computation approach.

Some Remarks on the s-plane to w-plane Correlations of w-transform (w-변환의 s와 w영역간의 관계에 대한 유의 성질)

  • Jin, Lihua;Kim, Young-Chol
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.61 no.1
    • /
    • pp.117-124
    • /
    • 2012
  • In this paper, we present some remarks on the correlations between s and w domains when a discrete-time transfer function is converted from z-plane by using the w-transform. With time response specifications, when a digital filter or controller is designed in z-plane, the w-transform is useful for the purpose if only the w-transformed system closely approximates to the continuous-time system. It will be shown that the approximation is accomplished only in the specific region depending on sampling time. Also, it is noted that such an approximation should be carefully dealt with for the case where a discrete-time reference transfer function is synthesized for the use of direct digital design.

Calibration transfer between miniature NIR spectrometers used in the assessment of intact peach and melon soluble solids content

  • Greensill, Colin.V.;Walsh, Kerry.B.
    • Proceedings of the Korean Society of Near Infrared Spectroscopy Conference
    • /
    • 2001.06a
    • /
    • pp.1127-1127
    • /
    • 2001
  • The transfer of predictive models using various chemometric techniques has been reported for FTNIR and scanning-grating based NIR instruments with respect relatively dry samples (<10% water). Some of the currently used transfer techniques include slope and bias correction (SBC), direct standardization (DS), piecewise direct standardization (PDS), orthogonal signal correction (OSC), finite impulse transform (FIR) and wavelet transform (WT) and application of neural networks. In a previous study (Greensill et at., 2001) on calibration transfer for wet samples (intact melons) across silicon diode array instrumentation, we reported on the performance of various techniques (SBC, DS, PDS, double window PDS (DWPDS), OSC, FIR, WT, a simple photometric response correction and wavelength interpolative method and a model updating method) in terms of RMSEP and Fearns criterion for comparison of RMSEP. In the current study, we compare these melon transfer results to a similar study employing pairs of spectrometers for non-invasive prediction of soluble solid content of peaches.

  • PDF

Camera Tracking Method based on Model with Multiple Planes (다수의 평면을 가지는 모델기반 카메라 추적방법)

  • Lee, In-Pyo;Nam, Bo-Dam;Hong, Hyun-Ki
    • Journal of Korea Game Society
    • /
    • v.11 no.4
    • /
    • pp.143-149
    • /
    • 2011
  • This paper presents a novel camera tracking method based on model with multiple planes. The proposed algorithm detects QR code that is one of the most popular types of two-dimensional barcodes. A 3D model is imported from the detected QR code for augmented reality application. Based on the geometric property of the model, the vertices are detected and tracked using optical flow. A clipping algorithm is applied to identify each plane from model surfaces. The proposed method estimates the homography from coplanar feature correspondences, which is used to obtain the initial camera motion parameters. After deriving a linear equation from many feature points on the model and their 3D information, we employ DLT(Direct Linear Transform) to compute camera information. In the final step, the error of camera poses in every frame are minimized with local Bundle Adjustment algorithm in real-time.

Digital Video Watermarking Using Frame Division And 3D Wavelet Transform (프레임 분할과 3D 웨이블릿 변환을 이용한 비디오 워터마킹)

  • Kim, Kwang-Il;Cui, Jizhe;Kim, Jong-Weon;Choi, Jong-Uk
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.18 no.3
    • /
    • pp.155-162
    • /
    • 2008
  • In this paper we proposed a video watermarking algorithm based on a three dimension discrete wavelet transform (3D DWT) and direct spread spectrum (DSS). In the proposed method, the information watermark is embedded into followed frames, after sync watermark is embedded into the first frame. Input frames are divided into sub frames which are located odd row and even row. The sub frames are arranged as 3D frames, and transformed into 3D wavelet domain. In this domain the watermark is embedded using DSS. Existing video watermarking using 3D DWT is non-blind method but, proposed algorithm uses blind method. The experimental results show that the proposed algorithm is robust against frame cropping, noise addition, compression, etc. acquiring BER of 10% or below and sustains level of 40dB or above on the average.

Direct position tracking method for non-circular signals with distributed passive arrays via first-order approximation

  • Jinke Cao;Xiaofei Zhang;Honghao Hao
    • ETRI Journal
    • /
    • v.46 no.3
    • /
    • pp.421-431
    • /
    • 2024
  • In this study, a direct position tracking method for non-circular (NC) signals using distributed passive arrays is proposed. First, we calculate the initial positions of sources using a direct position determination (DPD) approach; next, we transform the tracking into a compensation problem. The offsets of the adjacent time positions are calculated using a first-order Taylor expansion. The fusion calculation of the noise subspace is performed according to the NC characteristics. Because the proposed method uses the signal information from the previous iteration, it can realize automatic data associations. Compared with traditional DPD and two-step localization methods, our novel process has lower computational complexity and provides higher accuracy. Moreover, its performance is better than that of the traditional tracking methods. Numerous simulation results support the superiority of our proposed method.

Access timing offsets-resilient SC-FDMA (접속동기 오차에 강한 SC-FDMA 기법)

  • Kim, Bong-Seok;Choi, Kwonhue
    • Journal of Satellite, Information and Communications
    • /
    • v.7 no.3
    • /
    • pp.26-29
    • /
    • 2012
  • In this paper, we propose a Single Carrier Frequency Division Multiple Access(SC-FDMA) scheme with greatly enhanced tolerance of timing offset among the users. The type of the proposed scheme is similar to code spread Multiple Carrier Direct Spread Code Division Multiple Access(MC DS CDMA). The proposed scheme performs partial Discrete Fourier Transform(DFT) in order to solve high Peak to Average Power Ratio(PAPR) of the MC DS CDMA before Inverse Fast Fourier Transform(IFFT). Exploiting the property Properly Scrambled Walsh-Hadamard(PSW) code has zero correlation despite ${\pm}1$ chip timing offset, the proposed scheme achieves Multiple Access Interference free performance with the timing offset up to ${\pm}1$ OFDM symbol duration with low PAPR. In contrast, the other existing schemes in comparison undergo severe performance degradation even with small timing offset in multipath fading channel.

Fast Motion Estimation Algorithms Through Adaptive Application of the Hadamard Transform (하다마드 변환의 적응적 적용을 이용한 고속 움직임 예측 알고리즘)

  • Lee, Hyuk;Kim, Jong-Ho;Jin, Soon-Jong;Jeong, Je-Chang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.8C
    • /
    • pp.712-719
    • /
    • 2007
  • In this paper, we propose a new, effective, fast motion estimation algorithms using $4{\times}4$ pixels Hadamard transform. The Hadamard transform has the advantage of simplicity because it uses only addition and subtraction. Motion estimation is composed of three stages. First, it should be decided whether to terminate the search early and use a previous motion vector with DC(Direct Current) coefficients. Then the adaptive matching scan order for motion estimation should be determined according to the image complexity using AC(Alternating Current) coefficients. Experimentally, we adapted this algorithms to MVFAST and PMVFAST algorithms, and the proposed algorithms turn out to be very efficient in terms of computational speed while remaining almost the same in terms of PSNR(Peak Signal-to-Noise Ratio) compared to MVFAST and PMVFAST algorithms.

UCC Contents Production System Using Direct Show (Direct Show 기반 UCC 컨텐츠 제작 시스템)

  • Kim, Kee-Baek;Choi, Jong-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.2
    • /
    • pp.127-134
    • /
    • 2008
  • Recently, it has developed that UCC (User Created Contents) is made and created by the users. The mainly issue of production of contents parts is how can make easier and paly the moving picture more useful. In this paper, for this, we implemented UCC production system using Direct Show which is included Direct X. Direct Show is a moving picture editing technique and has been supported in Microsoft with COM component. Our system has features that the various effects can be easily inserted into moving Picture by users. Moreover, our system can efficiently apply the effects at playing the moving picture differently from the frame processing method. We confirmed these merits through experiments. The proposed system can be used for commercial purposes which high efficiency is required such as advertisement movie.

  • PDF

BUSY PERIOD DISTRIBUTION OF A BATCH ARRIVAL RETRIAL QUEUE

  • Kim, Jeongsim
    • Communications of the Korean Mathematical Society
    • /
    • v.32 no.2
    • /
    • pp.425-433
    • /
    • 2017
  • This paper is concerned with the analysis of the busy period distribution in a batch arrival $M^X/G/1$ retrial queue. The expression for the Laplace-Stieltjes transform of the length of the busy period is well known, but from this expression we cannot compute the moments of the length of the busy period by direct differentiation. This paper provides a direct method of calculation for the first and second moments of the length of the busy period.