• Title/Summary/Keyword: Space time series data

Search Result 231, Processing Time 0.029 seconds

ANALYSIS OF TROPOSPHERIC $NO_2$ BASED ON SATELLITE MEASUREMENTS

  • Kwon Eun-Han;Lim Hyo-Suk
    • Proceedings of the KSRS Conference
    • /
    • 2005.10a
    • /
    • pp.374-377
    • /
    • 2005
  • The distribution and changes of tropospheric nitrogen dioxide ($NO_2$) are analyzed using the satellite measurements data from GOME (Global Ozone Monitoring Experiment) and SCIMACHY (SCanning Imaging Absorption spectroMeter for Atmospheric CHartographY). We produced global maps of tropospheric $NO_2$ for 4 seasons using GOME measurements from January 1997 to June 2003. The global distribution shows high values in regions with dense population and high industrialization. Tropospheric $NO_2$ shows obvious seasonal changes depending on its emission and lifetime. Based on the good agreement between two instruments in the time period of overlapping measurements (January 2003-June2003), we linked SClAMACHY data to the GOME time series. The combined time series over the past decade indicate that $NO_2$ 1evels over China are rapidly increasing while those over Europe are decreasing. We also discussed potential application of spaceborne instruments in detecting and characterizing long-distance transport of $NO_2$.

  • PDF

KMTNet time-series photometry of the doubly eclipsing candidate stars in the LMC

  • Hong, Kyeongsoo;Lee, Jae Woo;Koo, Jae-Rim;Kim, Seung-Lee;Lee, Chung-Uk;Kim, Dong-Jin
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.42 no.1
    • /
    • pp.44.2-44.2
    • /
    • 2017
  • Multiple stellar systems composed of triple, double+double or double+triple, etc. are very rare and interesting objects for understanding the star formation and dynamical evolution. However, only six systems have been found to be a doubly eclipsing quadruple, which consists of two eclipsing binaries, and four systems to be a triply eclipsing hierarchical triple. Recently, the 15 doubly eclipsing multiple candidates located in the Large Magellanic Cloud (LMC) have been reported by the OGLE project. In order to examine whether these candidates are real multiple systems with eclipsing features, we performed a high-cadence time-series photometry for the LMC using the KMTNet (Korea Microlensing Telescope Network) 1.6 m telescopes in three site (CTIO, SAAO, and SSO) during 2016-2017. The KMTNet data will help reveal the photometric properties of the multiple-star candidates. In this paper, we present the VI light curves and their preliminarily analyses for 12 of the 15 eclipsing systems in the LMC, based on our KMTNet observations and the OGLE-III survey data from 2001-2009.

  • PDF

Construction of Theme Melody Index by Transforming Melody to Time-series Data for Content-based Music Information Retrieval (내용기반 음악정보 검색을 위한 선율의 시계열 데이터 변환을 이용한 주제선율색인 구성)

  • Ha, Jin-Seok;Ku, Kyong-I;Park, Jae-Hyun;Kim, Yoo-Sung
    • The KIPS Transactions:PartD
    • /
    • v.10D no.3
    • /
    • pp.547-558
    • /
    • 2003
  • From the viewpoint of that music melody has the similar features to time-series data, music melody is transformed to a time-series data with normalization and corrections and the similarity between melodies is defined as the Euclidean distance between the transformed time-series data. Then, based the similarity between melodies of a music object, melodies are clustered and the representative of each cluster is extracted as one of theme melodies for the music. To construct the theme melody index, a theme melody is represented as a point of the multidimensional metric space of M-tree. For retrieval of user's query melody, the query melody is also transformed into a time-series data by the same way of indexing phase. To retrieve the similar melodies to the query melody given by user from the theme melody index the range query search algorithm is used. By the implementation of the prototype system using the proposed theme melody index we show the effectiveness of the proposed methods.

Chaotic Evaluation of Slag Inclusion Welding Defect Time Series Signals Considering the Hyperspace (초공간을 고려한 슬래그 혼입 용접 결함 시계열 신호의 카오스성 평가)

  • Yi, Won;Yun, In-Sik
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.15 no.12
    • /
    • pp.226-235
    • /
    • 1998
  • This study proposes the analysis and evaluation of method of time series of ultrasonic signal using the chaotic feature extraction for ultrasonic pattern recognition. The features are extracted from time series data for analysis of weld defects quantitatively. For this purpose, analysis objectives in this study are fractal dimension, Lyapunov exponent, and strange attractor on hyperspace. The Lyapunov exponent is a measure of rate in which phase space diverges nearby trajectories. Chaotic trajectories have at least one positive Lyapunov exponent, and the fractal dimension appears as a metric space such as the phase space trajectory of a dynamical system. In experiment, fractal(correlation) dimensions and Lyapunov exponents show the mean value of 4.663, and 0.093 relatively in case of learning, while the mean value of 4.926, and 0.090 in case of testing in slag inclusion(weld defects) are shown. Therefore, the proposed chaotic feature extraction can be enhancement of precision rate for ultrasonic pattern recognition in defecting signals of weld zone, such as slag inclusion.

  • PDF

Time Series Representation Combining PIPs Detection and Persist Discretization Techniques for Time Series Classification (시계열 분류를 위한 PIPs 탐지와 Persist 이산화 기법들을 결합한 시계열 표현)

  • Park, Sang-Ho;Lee, Ju-Hong
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.9
    • /
    • pp.97-106
    • /
    • 2010
  • Various time series representation methods have been suggested in order to process time series data efficiently and effectively. SAX is the representative time series representation method combining segmentation and discretization techniques, which has been successfully applied to the time series classification task. But SAX requires a large number of segments in order to represent the meaningful dynamic patterns of time series accurately, since it loss the dynamic property of time series in the course of smoothing the movement of time series. Therefore, this paper suggests a new time series representation method that combines PIPs detection and Persist discretization techniques. The suggested method represents the dynamic movement of high-diemensional time series in a lower dimensional space by detecting PIPs indicating the important inflection points of time series. And it determines the optimal discretizaton ranges by applying self-transition and marginal probabilities distributions to KL divergence measure. It minimizes the information loss in process of the dimensionality reduction. The suggested method enhances the performance of time series classification task by minimizing the information loss in the course of dimensionality reduction.

Chaotic Time Series Prediction using Parallel-Structure Fuzzy Systems (병렬구조 퍼지스스템을 이용한 카오스 시계열 데이터 예측)

  • 공성곤
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.10 no.2
    • /
    • pp.113-121
    • /
    • 2000
  • This paper presents a parallel-structure fuzzy system(PSFS) for prediction of time series data. The PSFS consists of a multiple number of fuzzy systems connected in parallel. Each component fuzzy system in the PSFS predicts the same future data independently based on its past time series data with different embedding dimension and time delay. The component fuzzy systems are characterized by multiple-input singleoutput( MIS0) Sugeno-type fuzzy rules modeled by clustering input-output product space data. The optimal embedding dimension for each component fuzzy system is chosen to have superior prediction performance for a given value of time delay. The PSFS determines the final prediction result by averaging the outputs of all the component fuzzy systems excluding the predicted data with the minimum and the maximum values in order to reduce error accumulation effect.

  • PDF

Compression Methods for Time Series Data using Discrete Cosine Transform with Varying Sample Size (가변 샘플 크기의 이산 코사인 변환을 활용한 시계열 데이터 압축 기법)

  • Moon, Byeongsun;Choi, Myungwhan
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.5
    • /
    • pp.201-208
    • /
    • 2016
  • Collection and storing of multiple time series data in real time requires large memory space. To solve this problem, the usage of varying sample size is proposed in the compression scheme using discrete cosine transform technique. Time series data set has characteristics such that a higher compression ratio can be achieved with smaller amount of value changes and lower frequency of the value changes. The coefficient of variation and the variability of the differences between adjacent data elements (VDAD) are presumed to be very good measures to represent the characteristics of the time series data and used as key parameters to determine the varying sample size. Test results showed that both VDAD-based and the coefficient of variation-based scheme generate excellent compression ratios. However, the former scheme uses much simpler sample size decision mechanism and results in better compression performance than the latter scheme.

Semi-Supervised Recursive Learning of Discriminative Mixture Models for Time-Series Classification

  • Kim, Minyoung
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.13 no.3
    • /
    • pp.186-199
    • /
    • 2013
  • We pose pattern classification as a density estimation problem where we consider mixtures of generative models under partially labeled data setups. Unlike traditional approaches that estimate density everywhere in data space, we focus on the density along the decision boundary that can yield more discriminative models with superior classification performance. We extend our earlier work on the recursive estimation method for discriminative mixture models to semi-supervised learning setups where some of the data points lack class labels. Our model exploits the mixture structure in the functional gradient framework: it searches for the base mixture component model in a greedy fashion, maximizing the conditional class likelihoods for the labeled data and at the same time minimizing the uncertainty of class label prediction for unlabeled data points. The objective can be effectively imposed as individual mixture component learning on weighted data, hence our mixture learning typically becomes highly efficient for popular base generative models like Gaussians or hidden Markov models. Moreover, apart from the expectation-maximization algorithm, the proposed recursive estimation has several advantages including the lack of need for a pre-determined mixture order and robustness to the choice of initial parameters. We demonstrate the benefits of the proposed approach on a comprehensive set of evaluations consisting of diverse time-series classification problems in semi-supervised scenarios.

Forecasting with a combined model of ETS and ARIMA

  • Jiu Oh;Byeongchan Seong
    • Communications for Statistical Applications and Methods
    • /
    • v.31 no.1
    • /
    • pp.143-154
    • /
    • 2024
  • This paper considers a combined model of exponential smoothing (ETS) and autoregressive integrated moving average (ARIMA) models that are commonly used to forecast time series data. The combined model is constructed through an innovational state space model based on the level variable instead of the differenced variable, and the identifiability of the model is investigated. We consider the maximum likelihood estimation for the model parameters and suggest the model selection steps. The forecasting performance of the model is evaluated by two real time series data. We consider the three competing models; ETS, ARIMA and the trigonometric Box-Cox autoregressive and moving average trend seasonal (TBATS) models, and compare and evaluate their root mean squared errors and mean absolute percentage errors for accuracy. The results show that the combined model outperforms the competing models.

Data anomaly detection for structural health monitoring of bridges using shapelet transform

  • Arul, Monica;Kareem, Ahsan
    • Smart Structures and Systems
    • /
    • v.29 no.1
    • /
    • pp.93-103
    • /
    • 2022
  • With the wider availability of sensor technology through easily affordable sensor devices, several Structural Health Monitoring (SHM) systems are deployed to monitor vital civil infrastructure. The continuous monitoring provides valuable information about the health of the structure that can help provide a decision support system for retrofits and other structural modifications. However, when the sensors are exposed to harsh environmental conditions, the data measured by the SHM systems tend to be affected by multiple anomalies caused by faulty or broken sensors. Given a deluge of high-dimensional data collected continuously over time, research into using machine learning methods to detect anomalies are a topic of great interest to the SHM community. This paper contributes to this effort by proposing a relatively new time series representation named "Shapelet Transform" in combination with a Random Forest classifier to autonomously identify anomalies in SHM data. The shapelet transform is a unique time series representation based solely on the shape of the time series data. Considering the individual characteristics unique to every anomaly, the application of this transform yields a new shape-based feature representation that can be combined with any standard machine learning algorithm to detect anomalous data with no manual intervention. For the present study, the anomaly detection framework consists of three steps: identifying unique shapes from anomalous data, using these shapes to transform the SHM data into a local-shape space and training machine learning algorithms on this transformed data to identify anomalies. The efficacy of this method is demonstrated by the identification of anomalies in acceleration data from an SHM system installed on a long-span bridge in China. The results show that multiple data anomalies in SHM data can be automatically detected with high accuracy using the proposed method.