• Title/Summary/Keyword: Decomposition Techniques

Search Result 335, Processing Time 0.025 seconds

The Comparison of Singular Value Decomposition and Spectral Decomposition

  • Shin, Yang-Gyu
    • Journal of the Korean Data and Information Science Society
    • /
    • v.18 no.4
    • /
    • pp.1135-1143
    • /
    • 2007
  • The singular value decomposition and the spectral decomposition are the useful methods in the area of matrix computation for multivariate techniques such as principal component analysis and multidimensional scaling. These techniques aim to find a simpler geometric structure for the data points. The singular value decomposition and the spectral decomposition are the methods being used in these techniques for this purpose. In this paper, the singular value decomposition and the spectral decomposition are compared.

  • PDF

THE RELIABLE MODIFIED OF ADOMIAN DECOMPOSITION METHOD FOR SOLVING INTEGRO-DIFFERENTIAL EQUATIONS

  • Hamoud, Ahmed A.;Ghadle, Kirtiwant P.
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.32 no.4
    • /
    • pp.409-420
    • /
    • 2019
  • In this article, we discussed semi-analytical approximated methods for solving mixed Volterra-Fredholm integro-differential equations, namely: Adomian decomposition method and modified Adomian decomposition method. Moreover, we prove the uniqueness results and convergence of the techniques. Finally, an example is included to demonstrate the validity and applicability of the proposed techniques.

A Study of Singular Value Decomposition in Data Reduction techniques

  • Shin, Yang-Kyu
    • Journal of the Korean Data and Information Science Society
    • /
    • v.9 no.1
    • /
    • pp.63-70
    • /
    • 1998
  • The singular value decomposition is a tool which is used to find a linear structure of reduced dimension and to give interpretation of the lower dimensional structure about multivariate data. In this paper the singular value decomposition is reviewed from both algebraic and geometric point of view and, is illustrated the way which the tool is used in the multivariate techniques finding a simpler geometric structure for the data.

  • PDF

Comparison of wavelet-based decomposition and empirical mode decomposition of electrohysterogram signals for preterm birth classification

  • Janjarasjitt, Suparerk
    • ETRI Journal
    • /
    • v.44 no.5
    • /
    • pp.826-836
    • /
    • 2022
  • Signal decomposition is a computational technique that dissects a signal into its constituent components, providing supplementary information. In this study, the capability of two common signal decomposition techniques, including wavelet-based and empirical mode decomposition, on preterm birth classification was investigated. Ten time-domain features were extracted from the constituent components of electrohysterogram (EHG) signals, including EHG subbands and EHG intrinsic mode functions, and employed for preterm birth classification. Preterm birth classification and anticipation are crucial tasks that can help reduce preterm birth complications. The computational results show that the preterm birth classification obtained using wavelet-based decomposition is superior. This, therefore, implies that EHG subbands decomposed through wavelet-based decomposition provide more applicable information for preterm birth classification. Furthermore, an accuracy of 0.9776 and a specificity of 0.9978, the best performance on preterm birth classification among state-of-the-art signal processing techniques, were obtained using the time-domain features of EHG subbands.

Forecasting Baltic Dry Index by Implementing Time-Series Decomposition and Data Augmentation Techniques (시계열 분해 및 데이터 증강 기법 활용 건화물운임지수 예측)

  • Han, Min Soo;Yu, Song Jin
    • Journal of Korean Society for Quality Management
    • /
    • v.50 no.4
    • /
    • pp.701-716
    • /
    • 2022
  • Purpose: This study aims to predict the dry cargo transportation market economy. The subject of this study is the BDI (Baltic Dry Index) time-series, an index representing the dry cargo transport market. Methods: In order to increase the accuracy of the BDI time-series, we have pre-processed the original time-series via time-series decomposition and data augmentation techniques and have used them for ANN learning. The ANN algorithms used are Multi-Layer Perceptron (MLP), Recurrent Neural Network (RNN), and Long Short-Term Memory (LSTM) to compare and analyze the case of learning and predicting by applying time-series decomposition and data augmentation techniques. The forecast period aims to make short-term predictions at the time of t+1. The period to be studied is from '22. 01. 07 to '22. 08. 26. Results: Only for the case of the MAPE (Mean Absolute Percentage Error) indicator, all ANN models used in the research has resulted in higher accuracy (1.422% on average) in multivariate prediction. Although it is not a remarkable improvement in prediction accuracy compared to uni-variate prediction results, it can be said that the improvement in ANN prediction performance has been achieved by utilizing time-series decomposition and data augmentation techniques that were significant and targeted throughout this study. Conclusion: Nevertheless, due to the nature of ANN, additional performance improvements can be expected according to the adjustment of the hyper-parameter. Therefore, it is necessary to try various applications of multiple learning algorithms and ANN optimization techniques. Such an approach would help solve problems with a small number of available data, such as the rapidly changing business environment or the current shipping market.

New Simple Decomposition Technique for Polarimetric SAR Images (완전편파 SAR영상의 새로운 영상 분해 기법)

  • Lee, Kyung-Yup;Oh, Yi-Sok
    • Korean Journal of Remote Sensing
    • /
    • v.26 no.1
    • /
    • pp.1-7
    • /
    • 2010
  • This paper proposes a new decomposition technique for polarimetric synthetic aperture radar (SAR) images. This new decomposition technique is based on the degree of polarization (DoP) and co-polarized phase-difference (CPD) of the measured polarimetric backscattering coefficients. This decomposition technique is compared with the existing three- and four-component decomposition techniques with the ALOS PALSAR full polarimetric L-band data acquired in 2009. It is shown that the new decomposition technique is better or comparable to the existing techniques for the study areas such as sea, bare soil, forest, and urban area.

A High-Dimensional Index Structure Based on Singular Value Decomposition (Singular Value Decomposition 기반 고차원 인덱스 구조)

  • Kim, Sang-Wook;Aggarwal, Charu;Yu, Philip S.
    • Journal of Industrial Technology
    • /
    • v.20 no.B
    • /
    • pp.213-218
    • /
    • 2000
  • The nearest neighbor query is an important operation widely used in multimedia databases for finding the object that is most similar to a given query object. Most of techniques for processing nearest neighbor queries employ multidimensional indexes for effective indexing of objects. However, the performance of previous multidimensional indexes, which use N-dimensional rectangles or spheres for representing the capsule of the object cluster, deteriorates seriously as the number of dimensions gets higher. This paper proposes a new index structure based singular value decomposition resolving this problem and the query processing method using it. We also verify the superiority of our approach through performance evaluation by performing extensive experiments.

  • PDF

A domain decomposition method applied to queuing network problems

  • Park, Pil-Seong
    • Communications of the Korean Mathematical Society
    • /
    • v.10 no.3
    • /
    • pp.735-750
    • /
    • 1995
  • We present a domain decomposition algorithm for solving large sparse linear systems of equations arising from queuing networks. Such techniques are attractive since the problems in subdomains can be solved independently by parallel processors. Many of the methods proposed so far use some form of the preconditioned conjugate gradient method to deal with one large interface problem between subdomains. However, in this paper, we propose a "nested" domain decomposition method where the subsystems governing the interfaces are small enough so that they are easily solvable by direct methods on machines with many parallel processors. Convergence of the algorithms is also shown.lso shown.

  • PDF

On the Hybrid Prediction Pyramid Compatible Coding Technique (혼성 예측 피라미드 호환 부호화 기법)

  • 이준서;이상욱
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.1
    • /
    • pp.33-46
    • /
    • 1996
  • Inthis paper, we investigate the compatible coding technique, which receives much interest ever since the introduction of HDTV. First, attempts have been made to analyze the theoretical transform coding gains for various hierarchical decomposition techniques, namely subband, pyramid and DCT-based decomposition techniques. It is shown that the spatical domain techniques proide higher transform coding gains than the DCT-based coding technique. Secondly, we compare the performance of these spatial domain techniques, in terms of the PSNR versus various rate allocations to each layer. Based on these analyses, it is believed that the pyramid decomposition is more appropriate for the compatible coding. Also in this paper, we propose a hybrid prediction pyramid coding technique, by combining the spatio-temporal prediction in MPEG-2[3] and the adaptive MC(Motion Compensation)[1]. In the proposed coding technigue, we also employ an adaptive DCT coefficient scanning technique to exploit the direction information of the 2nd-layer signal. Through computer simulations, the proposed hybrid prediction with adaptive scanning technuque shows the PSNR improvement, by about 0.46-1.78dB at low 1st-layer rate(about 0.1bpp) over the adaptive MC[1], and by about 0.33-0.63dB at high 1st-layer rate (about 0.32-0.43bpp) over the spatio-temporal prediction[3].

  • PDF

Application to the design of reduced-order robust MPC and MIMO identification

  • Lee, Kwang-Soon;Kim, Sang-Hoon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1997.10a
    • /
    • pp.313-316
    • /
    • 1997
  • Two different issues, design of reduced-order robust model predictive control and input signal design for identification of a MIMO system, are addressed and design techniques based on singular value decomposition(SVD) of the pulse response circulant matrix(PRCM) are proposed. For this, we investigate the properties of the PRCM, which is a periodic approximation of a linear discrete-time system, and show its SVD represents the directional as well as the frequency decomposition of the system. Usefulness of the PRCM and effectiveness of the proposed design techniques are demonstrated through numerical examples.

  • PDF