• Title/Summary/Keyword: Singular value decomposition

Search Result 371, Processing Time 0.028 seconds

Research on damage and identification of mortise-tenon joints stiffness in ancient wooden buildings based on shaking table test

  • Xue, Jianyang;Bai, Fuyu;Qi, Liangjie;Sui, Yan;Zhou, Chaofeng
    • Structural Engineering and Mechanics
    • /
    • v.65 no.5
    • /
    • pp.547-556
    • /
    • 2018
  • Based on the shaking table tests of a 1:3.52 scale one-bay and one-story ancient wooden structure, a simplified structural mechanics model was established, and the structural state equation and observation equation were deduced. Under the action of seismic waves, the damage rule of initial stiffness and yield stiffness of the joint was obtained. The force hammer percussion test and finite element calculations were carried out, and the structural response was obtained. Considering the 5% noise disturbance in the laboratory environment, the stiffness parameters of the mortise-tenon joint were identified by the partial least squares of singular value decomposition (PLS-SVD) and the Extended Kalman filter (EKF) method. The results show that dynamic and static cohesion method, PLS-SVD, and EKF method can be used to identify the damage degree of structures, and the stiffness of the mortise-tenon joints under strong earthquakes is reduced step by step. Using the proposed model, the identified error of the initial stiffness is about 0.58%-1.28%, and the error of the yield stiffness is about 0.44%-1.21%. This method has high accuracy and good applicability for identifying the initial stiffness and yield stiffness of the joints. The identification method and research results can provide a reference for monitoring and evaluating actual engineering structures.

Performance Analysis of IEEE 802.11n System adapting Frame Aggregation Methods (Frame Aggregation 기법을 적용한 IEEE 802.11n 시스템 성능 분석)

  • Lee, Yun-Ho;Kim, Joo-Seok;Kim, Kyung-Seok
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.12
    • /
    • pp.515-527
    • /
    • 2009
  • IEEE 802.11n is an ongoing next-generation WLAN(Wireless Local Area Network) standard that supports a very high-speed connection with more than 100Mb/s data throughput measured at the MAC(Medium Access Control) layer. Study trends of IEEE 802.11n show two aspects, enhanced data throughput using aggregation among packets in MAC layer, and better data rates adapting MIMO(Multiple-Input Multiple-Output) in PHY(Physical) layer. But, the former doesn't consider wireless channel and the latter doesn't consider aggregation among packets for reality. Therefore, this paper analyzes data throughput for IEEE 802.11n considering MAC and PHY connection. A-MPDU(Aggregation-MAC Protocol Data Unit) and A-MSDU(Aggregation-MAC Service Unit) is adapted considering multi-service in MAC layer, WLAN MIMO TGn channel using SVD(Singular Value Decomposition) is adapted considering MIMO and wireless channel in PHY layer. Consequently, Simulation results shows throughput between A-MPDU and A-MSDU. Also, We use Ns-2(Network simulator-2) for reality.

A study on convergence and stabilization of SVD damped least squares method in the triplet camera lens-system design (카메라 렌즈 설계에서 직교화 방법에 관한 연구)

  • Jung, Jung Bok;Lee, Won Gin;Kim, Kyung Chan
    • Journal of Korean Ophthalmic Optics Society
    • /
    • v.1 no.1
    • /
    • pp.29-39
    • /
    • 1996
  • We studied the method which would determine the appropriate additive damping factor for the damped least sequres(DLS) optimization. We calculated eigenvalues of the product of the Jacobian matrix of error function by using the singular value decomposition(SVD) method. While suitable damping factor was appiled to the additive DLS by using SVD and Gaussian elimination method, the convergence and stability of the optimization process were examined in a triplet-type camera lens-system where the condition number is well conditioned. We compared the convergence and stability of merit function when median, maximum and minimum of eigenvalues were used as a damping factor in the optimization process. When damping factor is median of eigenvalue, the convergence and stability of merit function are more excellent than in the case of two other eigenvalues. Thus, we adopt the median of eigenvalues as an appropriate damping factor. Next, by using SVD and Gaussian elimination method, we compound the convergence and stability of optimization process for triplet-type camera lens-system design. In these two method; triplet-type camera lens-system in which condition number is well conditioned, has little improvement with the combination of DLS and SVD.

  • PDF

Exploiting Patterns for Handling Incomplete Coevolving EEG Time Series

  • Thi, Ngoc Anh Nguyen;Yang, Hyung-Jeong;Kim, Sun-Hee
    • International Journal of Contents
    • /
    • v.9 no.4
    • /
    • pp.1-10
    • /
    • 2013
  • The electroencephalogram (EEG) time series is a measure of electrical activity received from multiple electrodes placed on the scalp of a human brain. It provides a direct measurement for characterizing the dynamic aspects of brain activities. These EEG signals are formed from a series of spatial and temporal data with multiple dimensions. Missing data could occur due to fault electrodes. These missing data can cause distortion, repudiation, and further, reduce the effectiveness of analyzing algorithms. Current methodologies for EEG analysis require a complete set of EEG data matrix as input. Therefore, an accurate and reliable imputation approach for missing values is necessary to avoid incomplete data sets for analyses and further improve the usage of performance techniques. This research proposes a new method to automatically recover random consecutive missing data from real world EEG data based on Linear Dynamical System. The proposed method aims to capture the optimal patterns based on two main characteristics in the coevolving EEG time series: namely, (i) dynamics via discovering temporal evolving behaviors, and (ii) correlations by identifying the relationships between multiple brain signals. From these exploits, the proposed method successfully identifies a few hidden variables and discovers their dynamics to impute missing values. The proposed method offers a robust and scalable approach with linear computation time over the size of sequences. A comparative study has been performed to assess the effectiveness of the proposed method against interpolation and missing values via Singular Value Decomposition (MSVD). The experimental simulations demonstrate that the proposed method provides better reconstruction performance up to 49% and 67% improvements over MSVD and interpolation approaches, respectively.

Adaptive Group Loading and Weighted Loading for MIMO OFDM Systems

  • Shrestha, Robin;Kim, Jae-Moung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.11
    • /
    • pp.1959-1975
    • /
    • 2011
  • Adaptive Bit Loading (ABL) in Multiple-Input Multiple-Output Orthogonal Frequency-Division Multiplexing (MIMO-OFDM) is often used to achieve the desired Bit Error Rate (BER) performance in wireless systems. In this paper, we discuss some of the bit loading algorithms, compare them in terms of the BER performance, and present an effective and concise Adaptive Grouped Loading (AGL) algorithm. Furthermore, we propose a "weight factor" for loading algorithm to converge rapidly to the final solution for various data rate with variable Signal to Noise Ratio (SNR) gaps. In particular, we consider the bit loading in near optimal Singular Value Decomposition (SVD) based MIMO-OFDM system. While using SVD based system, the system requires perfect Channel State Information (CSI) of channel transfer function at the transmitter. This scenario of SVD based system is taken as an ideal case for the comparison of loading algorithms and to show the actual enhancement achievable by our AGL algorithm. Irrespective of the CSI requirement imposed by the mode of the system itself, ABL demands high level of feedback. Grouped Loading (GL) would reduce the feedback requirement depending upon the group size. However, this also leads to considerable degradation in BER performance. In our AGL algorithm, groups are formed with a number of consecutive sub-channels belonging to the same transmit antenna, with individual gains satisfying predefined criteria. Simulation results show that the proposed "weight factor" leads a loading algorithm to rapid convergence for various data rates with variable SNR gap values and AGL requires much lesser CSI compared to GL for the same BER performance.

Damage detection in truss structures using a flexibility based approach with noise influence consideration

  • Miguel, Leandro Fleck Fadel;Miguel, Leticia Fleck Fadel;Riera, Jorge Daniel;Menezes, Ruy Carlos Ramos De
    • Structural Engineering and Mechanics
    • /
    • v.27 no.5
    • /
    • pp.625-638
    • /
    • 2007
  • The damage detection process may appear difficult to be implemented for truss structures because not all degrees of freedom in the numerical model can be experimentally measured. In this context, the damage locating vector (DLV) method, introduced by Bernal (2002), is a useful approach because it is effective when operating with an arbitrary number of sensors, a truncated modal basis and multiple damage scenarios, while keeping the calculation in a low level. In addition, the present paper also evaluates the noise influence on the accuracy of the DLV method. In order to verify the DLV behavior under different damages intensities and, mainly, in presence of measurement noise, a parametric study had been carried out. Different excitations as well as damage scenarios are numerically tested in a continuous Warren truss structure subjected to five noise levels with a set of limited measurement sensors. Besides this, it is proposed another way to determine the damage locating vectors in the DLV procedure. The idea is to contribute with an alternative option to solve the problem with a more widespread algebraic method. The original formulation via singular value decomposition (SVD) is replaced by a common solution of an eigenvector-eigenvalue problem. The final results show that the DLV method, enhanced with the alternative solution proposed in this paper, was able to correctly locate the damaged bars, using an output-only system identification procedure, even considering small intensities of damage and moderate noise levels.

Compuationally Efficient Propagator Method for DoA with Coprime Array (서로소 배열에서 프로퍼게이터 방법 기반의 효율적인 도래각 추정 기법)

  • Byun, Bu-Guen;Yoo, Do-Sik
    • Journal of Advanced Navigation Technology
    • /
    • v.20 no.3
    • /
    • pp.258-264
    • /
    • 2016
  • In this paper, we propose a computationally efficient direction of arrival (DoA) estimation algorithm based on propagator method with non-uniform array. While the co-prime array techniques can improve the resolution of DoA, they generally lead to high computational complexity as the length of the coarray aperture. To reduce the complexity we use the propagator method that does not require singular value decomposition (SVD). Through simulations, we compare MUSIC with uniform lineary array, propagator method with uniform linear array, MUSIC with co-prime array, and the proposed scheme and observe that the performance of the proposed scheme is significantly better than MUSIC or propagator method with uniform linear array while it is slightly worse than computationally much more expensive co-prime array MUSIC scheme.

A Defocus Technique based Depth from Lens Translation using Sequential SVD Factorization

  • Kim, Jong-Il;Ahn, Hyun-Sik;Jeong, Gu-Min;Kim, Do-Hyun
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.383-388
    • /
    • 2005
  • Depth recovery in robot vision is an essential problem to infer the three dimensional geometry of scenes from a sequence of the two dimensional images. In the past, many studies have been proposed for the depth estimation such as stereopsis, motion parallax and blurring phenomena. Among cues for depth estimation, depth from lens translation is based on shape from motion by using feature points. This approach is derived from the correspondence of feature points detected in images and performs the depth estimation that uses information on the motion of feature points. The approaches using motion vectors suffer from the occlusion or missing part problem, and the image blur is ignored in the feature point detection. This paper presents a novel approach to the defocus technique based depth from lens translation using sequential SVD factorization. Solving such the problems requires modeling of mutual relationship between the light and optics until reaching the image plane. For this mutuality, we first discuss the optical properties of a camera system, because the image blur varies according to camera parameter settings. The camera system accounts for the camera model integrating a thin lens based camera model to explain the light and optical properties and a perspective projection camera model to explain the depth from lens translation. Then, depth from lens translation is proposed to use the feature points detected in edges of the image blur. The feature points contain the depth information derived from an amount of blur of width. The shape and motion can be estimated from the motion of feature points. This method uses the sequential SVD factorization to represent the orthogonal matrices that are singular value decomposition. Some experiments have been performed with a sequence of real and synthetic images comparing the presented method with the depth from lens translation. Experimental results have demonstrated the validity and shown the applicability of the proposed method to the depth estimation.

  • PDF

Multiple Targets Detection by using CLEAN Algorithm in Matched Field Processing (정합장처리에서 CLEAN알고리즘을 이용한 다중 표적 탐지)

  • Lim Tae-Gyun;Lee Sang-Hak;Cha Young-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.9
    • /
    • pp.1545-1550
    • /
    • 2006
  • In this paper, we propose a method for applying the CLEAN algorithm to an minimum variance distortionless response(MVDR) to estimate the location of multiple targets distributed in the ocean. The CLEAN algorithm is easy to implement in a linear processor, yet not in a nonlinear processor. In the proposed method, the CSDM of a Dirty map is separated into the CSDM of a Clean beam and the CSDM of the Residual, then an individual ambiguity surface(AMS) is generated. As such, the CLEAN algorithm can be applied to an MVDR, a nonlinear processor. To solve the ill-conditioned problem related to the matrix inversiion by an MVDR when using the CLEAN algorithm, Singular value decomposition(SVD) is carried out, then the reciprocal of small eigenvalues is replaced with zero. Experimental results show that the proposed method improves the performance of an MVDR.

Robust $H_\infty$ Output Feedback Control of Descriptor Systems with Parameter Uncertainty and Time dDelay (파라미터 불확실성과 시간지연을 가지는 특이시스템의 견실 $H_\infty$ 출력궤환 제어)

  • 김종해
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.41 no.3
    • /
    • pp.9-16
    • /
    • 2004
  • This paper provides an observer-based Η$\infty$ output feedback controller design method for descriptor systems with time-varying delay by just one LMI(linear matrix inequality) condition. The sufficient condition for the existence of controller and the controller design method are presented by perfect LMI approach which can be solved efficiently by convex optimization. The design procedure involves solving an LMI. Since the obtained condition can be expressed as an LMI form all variables including feedback gain and observer gain can be calculated simultaneously by Schur complement changes of variables, and singular value decomposition. Moreover, The proposed controller design algorithm can be extended to the observer-based robust Η$\infty$ output feedback controller design method for descriptor systems with parameter uncertainty and time delay. An example is given to illustrate the results.