• Title/Summary/Keyword: Orthogonalization

Search Result 63, Processing Time 0.022 seconds

A Study on LIFS Image Coding via Gram-Schmidt Orthogonalization - Fast Coding Algorithm - (Gram-Schmidt 직교화를 이용한 LIFS 영상 부호화법에 관한 연구 -부호화 고속 알고리즘-)

  • 유현배
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.4 no.2
    • /
    • pp.96-101
    • /
    • 2003
  • Recently, Fractal Image Coding has been studied as a way of efficient data compressing scheme. In the beginning, Fractal Image Coding has been studied for the data compressing in black & white images and linear images. A. E. Jacquin suggested LIFS which expends to Fractal Image Coding for a gray scale image. Currently, YTKT's LIFS scheme which is using Gram-Schmidt is so efficient that enough to compete with the JPEG which is the national standards. This paper investigates the way of greatly reduced calculation for the orthogonalization algorithm.

  • PDF

A FAST KACZMARZ-KOVARIK ALGORITHM FOR CONSISTENT LEAST-SQUARES PROBLEMS

  • Popa, Constantin
    • Journal of applied mathematics & informatics
    • /
    • v.8 no.1
    • /
    • pp.9-26
    • /
    • 2001
  • In some previous papers the author extended two algorithms proposed by Z. Kovarik for approximate orthogonalization of a finite set of linearly independent vectors from a Hibert space, to the case when the vectors are rows (not necessary linearly independent) of an arbitrary rectangular matrix. In this paper we describe combinations between these two methods and the classical Kaczmarz’s iteration. We prove that, in the case of a consistent least-squares problem, the new algorithms so obtained converge ti any of its solutions (depending on the initial approximation). The numerical experiments described in the last section of the paper on a problem obtained after the discretization of a first kind integral equation ilustrate the fast convergence of the new algorithms. AMS Mathematics Subject Classification : 65F10, 65F20.

Convergence Acceleration of the LMS Algorithm Using Successive Data Orthogonalization (입력 신호의 연속적인 직교화를 통한 LMS 알고리즘의 수렴 속도 향상)

  • Shin, Hyun-Chool
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.2
    • /
    • pp.90-94
    • /
    • 2008
  • It is well-blown that the convergence rate gets worse when an input signal to an adaptive filter is correlated. In this paper we propose a new adaptive filtering algorithm that makes the convergence rate much improved even for highly correlated input signals. By introducing an orthogonal constraint between successive input signal vectors we overcome the slow convergence problem of the LMS algorithm with the correlated input signal. Simulation results show that the proposed algerian yields fast convergence speed and excellent tracking capability under both time-invariant and time-varying environments, while keeping both computation and implementation simple.

A Complex Escalator Equalizer for Quadrature Modulation Systems (직교변조 시스템을 위한 복소 에스컬레이터 Equalizer)

  • 김남용
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.7
    • /
    • pp.47-53
    • /
    • 2004
  • In this paper we introduce a complex escalator (ESC) structure-Equalizer and investigate its performance in complex channels in QPSK undulation systems. The proposed complex equalizer has the complete orthogonalization property and is independent of eigenvalue spread ratio (ESR) of channel. The proposed complex ESC equalizer shows as 7 times faster convergence speed as that of the conventional complex TDL equalizer algorithms in a complex channel model for QPSK systems.

Mode-by-mode evaluation of structural systems using a bandpass-HHT filtering approach

  • Lin, Jeng-Wen
    • Structural Engineering and Mechanics
    • /
    • v.36 no.6
    • /
    • pp.697-714
    • /
    • 2010
  • This paper presents an improved version of the Hilbert-Huang transform (HHT) for the modal evaluation of structural systems or signals. In this improved HHT, a well-designed bandpass filter is used as preprocessing to separate and determine each mode of the signal for solving the inherent modemixing problem in HHT (i.e., empirical mode decomposition, EMD, associated with the Hilbert transform). A screening process is then applied to remove undesired intrinsic mode functions (IMFs) derived from the EMD of the signal's mode. A "best" IMF is selected in each screening process that utilizes the orthogonalization coefficient between the signal's mode and its IMFs. Through mode-by-mode signal filtering, parameters such as the modal frequency can be evaluated accurately when compared to the theoretical value. Time history of the identified modal frequency is available. Numerical results prove the efficiency of the proposed approach, showing relative errors 1.40%, 2.06%, and 1.46%, respectively, for the test cases of a benchmark structure in the lab, a simulated time-varying structural system, and of a linear superimposed cosine waves.

Performance improvement of active noise control using orthogonalization property of Walsh transform (월쉬 변환의 직교화 특성을 이용한 능동 소음제어의 성능 향상)

  • Ahn, Doo-Soo;Kim, Jong-Boo;Choi, Seung-Uk;Yim, Kook-Hyun
    • Proceedings of the KIEE Conference
    • /
    • 1996.07b
    • /
    • pp.1327-1329
    • /
    • 1996
  • This paper presents an active noise control (ANC) algorithm using orthogonalization property of Walsh transform. Conventional ANC algorithm known as filtered-x LMS(FXL) algorithm has a problem of decreasing convergence speed in FIR adaptive filters operating in colored noise environments. Walsh transform decompose an input signal into a set of N uncorrelated components and reduce eigenvalue spread of autocorrelation matrix of input sequences. Computer simulations show that proposed (FXW) algorithm is superier to FXL in convergence speed.

  • PDF

REGION-ORIENTED TRANSFORM CODING OF STILL IMAGES USING VORONOI DIAGRAMS AND SCHMIDT'S ORTHOGONALIZATION

  • Ichiro-Matsuda;Susumu-Itoh
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 1999.06a
    • /
    • pp.69-76
    • /
    • 1999
  • This paper proposes a new region-oriented coding scheme of still images. The scheme first segments an image into homogeneous regions by making use of Voronoi diagrams. Then luminance components in each Voronoi region are encoded using a transform coding technique which employs the Schmidt's orthogonalization method to produce orthonormal basis-functions for arbitrarily shaped regions. In this technique, coding efficiency depends on the properties of initial vectors to be orthogonalized. Therefore we adaptively select a set of initial vectors as well as the order in which these vectors are orthogonalized. Simulation results indicate that the proposed coding scheme achieves higher coding performance with much less computation than the KLT-based scheme which we reported formerly.

A Jarque-Bera type test for multivariate normality based on second-power skewness and kurtosis

  • Kim, Namhyun
    • Communications for Statistical Applications and Methods
    • /
    • v.28 no.5
    • /
    • pp.463-475
    • /
    • 2021
  • Desgagné and de Micheaux (2018) proposed an alternative univariate normality test to the Jarque-Bera test. The proposed statistic is based on the sample second power skewness and kurtosis while the Jarque-Bera statistic uses sample Pearson's skewness and kurtosis that are the third and fourth standardized sample moments, respectively. In this paper, we generalize their statistic to a multivariate version based on orthogonalization or an empirical standardization of data. The proposed multivariate statistic follows chi-squared distribution approximately. A simulation study shows that the proposed statistic has good control of type I error even for a very small sample size when critical values from the approximate distribution are used. It has comparable power to the multivariate version of the Jarque-Bera test with exactly the same idea of the orthogonalization. It also shows much better power for some mixed normal alternatives.

A Novel Equivalent Wiener-Hopf Equation with TDL coefficient in Lattice Structure

  • Cho, Ju-Phil;Ahn, Bong-Man;Hwang, Jee-Won
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.5
    • /
    • pp.500-504
    • /
    • 2011
  • In this paper, we propose an equivalent Wiener-Hopf equation. The proposed algorithm can obtain the weight vector of a TDL(tapped-delay-line) filter and the error simultaneously if the inputs are orthogonal to each other. The equivalent Wiener-Hopf equation was analyzed theoretically based on the MMSE(minimum mean square error) method. The results present that the proposed algorithm is equivalent to original Wiener-Hopf equation. The new algorithm was applied into the identification of an unknown system for evaluating the performance of the proposed method. We compared the Wiener-Hopf solution with the equivalent Wiener-Hopf solution. The simulation results were similar to those obtained in the theoretical analysis. In conclusion, our method can find the coefficient of the TDL (tapped-delay-line) filter where a lattice filter is used, and also when the process of Gram-Schmidt orthogonalization is used. Furthermore, a new cost function is suggested which may facilitate research in the adaptive signal processing area.

Wiener-Hopf Equation with Robustness to Application System (응용시스템에 강건한 Wiener-Hopf 방정식)

  • Cho, Ju-Phil;Lee, Il-Kyu;Cha, Jae-Sang
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.4
    • /
    • pp.245-249
    • /
    • 2011
  • In this paper, we propose an equivalent Wiener-Hopf equation. The proposed algorithm can obtain the weight vector of a TDL(tapped-delay-line) filter and the error simultaneously if the inputs are orthogonal to each other. The equivalent Wiener-Hopf equation was analyzed theoretically based on the MMSE(minimum mean square error) method. The results present that the proposed algorithm is equivalent to original Wiener-Hopf equation. In conclusion, our method can find the coefficient of the TDL (tapped-delay-line) filter where a lattice filter is used, and also when the process of Gram-Schmidt orthogonalization is used. Furthermore, a new cost function is suggested which may facilitate research in the adaptive signal processing area.