• Title/Summary/Keyword: spectral representation method

Search Result 53, Processing Time 0.029 seconds

Simulation of wind process by spectral representation method and application to cooling tower shell

  • Choi, Chang-Koon;Noh, Hyuk-Chun
    • Wind and Structures
    • /
    • v.2 no.2
    • /
    • pp.105-117
    • /
    • 1999
  • The various spectral density functions of wind are applied in the wind process simulation by the spectral representation method. In view of the spectral density functions, the characteristics of the simulated processes are compared. The ensemble spectral density functions constructed from the simulated sample processes are revealed to have the similarity not only in global shape but also in the maximum values with the target spectral density functions with a high accuracy. For the correlation structure to be satisfied in the circumferential direction on the cooling tower shell, a new formula is suggested based on the mathematical expression representing the circumferential distribution of the wind pressure on the cooling tower shell. The simulated wind processes are applied in the dynamic analysis of cooling tower shell in the time domain and the fluctuating stochastic behavior of the cooling tower shell is investigated.

Multi-view Clustering by Spectral Structure Fusion and Novel Low-rank Approximation

  • Long, Yin;Liu, Xiaobo;Murphy, Simon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.3
    • /
    • pp.813-829
    • /
    • 2022
  • In multi-view subspace clustering, how to integrate the complementary information between perspectives to construct a unified representation is a critical problem. In the existing works, the unified representation is usually constructed in the original data space. However, when the data representation in each view is very diverse, the unified representation derived directly in the original data domain may lead to a huge information loss. To address this issue, different to the existing works, inspired by the latest revelation that the data across all perspectives have a very similar or close spectral block structure, we try to construct the unified representation in the spectral embedding domain. In this way, the complementary information across all perspectives can be fused into a unified representation with little information loss, since the spectral block structure from all views shares high consistency. In addition, to capture the global structure of data on each view with high accuracy and robustness both, we propose a novel low-rank approximation via the tight lower bound on the rank function. Finally, experimental results prove that, the proposed method has the effectiveness and robustness at the same time, compared with the state-of-art approaches.

Destripe Hyperspectral Images with Spectral-spatial Adaptive Unidirectional Variation and Sparse Representation

  • Zhou, Dabiao;Wang, Dejiang;Huo, Lijun;Jia, Ping
    • Journal of the Optical Society of Korea
    • /
    • v.20 no.6
    • /
    • pp.752-761
    • /
    • 2016
  • Hyperspectral images are often contaminated with stripe noise, which severely degrades the imaging quality and the precision of the subsequent processing. In this paper, a variational model is proposed by employing spectral-spatial adaptive unidirectional variation and a sparse representation. Unlike traditional methods, we exploit the spectral correction and remove stripes in different bands and different regions adaptively, instead of selecting parameters band by band. The regularization strength adapts to the spectrally varying stripe intensities and the spatially varying texture information. Spectral correlation is exploited via dictionary learning in the sparse representation framework to prevent spectral distortion. Moreover, the minimization problem, which contains two unsmooth and inseparable $l_1$-norm terms, is optimized by the split Bregman approach. Experimental results, on datasets from several imaging systems, demonstrate that the proposed method can remove stripe noise effectively and adaptively, as well as preserve original detail information.

Simulation of stationary Gaussian stochastic wind velocity field

  • Ding, Quanshun;Zhu, Ledong;Xiang, Haifan
    • Wind and Structures
    • /
    • v.9 no.3
    • /
    • pp.231-243
    • /
    • 2006
  • An improvement to the spectral representation algorithm for the simulation of wind velocity fields on large scale structures is proposed in this paper. The method proposed by Deodatis (1996) serves as the basis of the improved algorithm. Firstly, an interpolation approximation is introduced to simplify the computation of the lower triangular matrix with the Cholesky decomposition of the cross-spectral density (CSD) matrix, since each element of the triangular matrix varies continuously with the wind spectra frequency. Fast Fourier Transform (FFT) technique is used to further enhance the efficiency of computation. Secondly, as an alternative spectral representation, the vectors of the triangular matrix in the Deodatis formula are replaced using an appropriate number of eigenvectors with the spectral decomposition of the CSD matrix. Lastly, a turbulent wind velocity field through a vertical plane on a long-span bridge (span-wise) is simulated to illustrate the proposed schemes. It is noted that the proposed schemes require less computer memory and are more efficiently simulated than that obtained using the existing traditional method. Furthermore, the reliability of the interpolation approximation in the simulation of wind velocity field is confirmed.

Sub-Nyquist Nonuniform Sampling and Perfect Reconstruction of Speech Signals (음성신호의 Sub-Nyquist 비균일 표준화 및 완전 복구에 관한 연구)

  • Lee, He-Young
    • Speech Sciences
    • /
    • v.12 no.2
    • /
    • pp.153-170
    • /
    • 2005
  • The sub-Nyquist nonuniform sampling (SNNS) and the perfect reconstruction (PR) formula are proposed for the development of a systematic method to obtain minimal representation of a speech signal. In the proposed method, the instantaneous sampling frequency (ISF) varies, depending on the least upper boundary of spectral support of a speech signal in time-frequency domain (TFD). The definition of the instantaneous bandwidth (IB), which determines the ISF and is used for generating the set of samples that represent continuous-time signals perfectly, is given. Also, the spectral characteristics of the sampled data generated by the sub-Nyquist nonuniform sampling method is analyzed. The proposed method doesn't generate the redundant samples due to the time-varying property of the instantaneous bandwidth of a speech signal.

  • PDF

A Line Spectrum Frequency Pairs Representation for Spectral Envelop Quantization

  • Park, Youngho;Lee, Won-Cheol;Bae, Myung-Jin
    • Proceedings of the IEEK Conference
    • /
    • 2000.09a
    • /
    • pp.787-790
    • /
    • 2000
  • This paper introduces a new type of representation of the LSPs as a promising alternative used for transmitting the LPC parameters. Major contribution in this paper is that the vocal track information embedded on the spectral envelope can be represented in terms of the reduced number of LSF compared tn the conventional. Hence, it provides a possibility that LPC parameters could be quantized at a reduced bit rate without causing any major spectral distortion. The simulation result illustrates the capability of the proposed LSPs representation as an efficient quantization method via a proper rejection of the redundant pairs of pole and zero along the unit circle.

  • PDF

Vector and Scalar Modes in Coherent Mode Representation of Electromagnetic Beams

  • Kim, Ki-Sik
    • Journal of the Optical Society of Korea
    • /
    • v.12 no.2
    • /
    • pp.103-106
    • /
    • 2008
  • It is shown that the two mode representations, one with vector modes and the other with scalar modes, for the cross spectral density matrices of electromagnetic beams are equivalent to each other. In particular, we suggest a method to find the vector modes from the scalar modes and formulate the cross spectral density matrix as a correlation matrix.

An Efficient Representation Method for ICLD with Robustness to Spectral Distortion

  • Beack, Seung-Kwon;Seo, Jeong-Il;Kang, Kyung-Ok;Hanh, Min-Soo
    • ETRI Journal
    • /
    • v.27 no.3
    • /
    • pp.330-333
    • /
    • 2005
  • The Inter-Channel Level Difference (ICLD) is a cue parameter to estimate spectral information in a binaural cue coding that has been recently in the spotlight as a multichannel audio signal compression technique. Even though the ICLD is an essential parameter, it is generally distorted by quantization. In this paper, a new modified ICLE representation method to minimize the quantization distortion is proposed by adopting a flexible determination of the reference channel and the unidirectional quantization. Our experimental result confirms that the proposed method improves the multichannel audio output quality even with the reduced bit-rate.

  • PDF

Dynamic Analysis of Electrical Power Transmission System under Wind Load (풍하중을 받는 송전 시스템의 동적해석)

  • Jung Hyung-Jo;Kim Young-Hoon;Park Ji-Hun;Min Kyung-Won
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2006.04a
    • /
    • pp.667-674
    • /
    • 2006
  • Dynamic analysis of the electrical transmission system including transmission towers and cables is carried out by a general purpose structural analysis computer program for examining the wind-resistance of the system The spectral representation method is introduced to generate dynamic wind loads by using the Kaimal's spectrum and the measured wind velocities from wind tunnel tests, respectively. The numerical simulation results show that the responses in the case of the measured wind velocities is slightly larger than those in the case of the code.

  • PDF

Simulation of Multi-Variate Random Processes (다변수 확률과정의 시뮬레이션)

  • ;M. Shinozuka
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1990.04a
    • /
    • pp.24-30
    • /
    • 1990
  • An improved algorithm for simulation of multi-variate random processes has been presented. It is based on the spectral representation method. The conventional methods give sample time histories which satisfy the target spectral density matrix only in the sense of ensemble average. However, the present method can generate sample functions which satisfy the target spectra in the ergodic sense. Example analysis is given for the simulation of earthquake accelerations with three components.

  • PDF