• Journal of the Korean Data and Information Science Society
• /
• v.16 no.2
• /
• pp.173-183
• /
• 2005

This paper studies quick detection of variance change point for iid data. For development of sensitive and adaptive variance change point detector, moving variance ratio is employed as a variance ratio estimator. It is shown that selection of tuning parameters of detector, (i.e., information and lag tuning parameters) is critical for detector to achieve desirable sensitivity and adaptiveness. Interestingly our simulation result reveals limitations of the commonly used change ratio against the previous day. Our results will provide useful insight when the detector is applied to time series data.

• Korean Journal of Remote Sensing
• /
• v.29 no.4
• /
• pp.351-360
• /
• 2013

Harmonic analysis enables to characterize patterns of variation in MODIS NDVI time series data and track changes in ground vegetation cover. In harmonic analysis, a periodic phenomenon of time series data is decomposed into the sum of a series of sinusoidal waves and an additive term. Each wave is defined by an amplitude and a phase angle and accounts for the portion of variance of complex curve. In this study, harmonic analysis was explored to tract ground vegetation variation through time for land-cover vegetation change detection. The process also enables to reconstruct observed time series data including various noise components. Harmonic model was tested with simulation data to validate its performance. Then, the suggested change detection method was applied to MODIS NDVI time series data over the study period (2006-2012) for a selected test area located in the northern plateau of Korean peninsula. The results show that the proposed approach is potentially an effective way to understand the pattern of NDVI variation and detect the change for long-term monitoring of land cover.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.2
• /
• pp.90-95
• /
• 2012

Remotely sensed data provide valuable information on land monitoring due to multi-temporal observation over large areas. Especially, high resolution imagery with 0.6~1.0 m spatial resolutions contain a wealth of information and therefore are very useful for thematic mapping and monitoring change in urban areas. Recently, remote sensing technology has been successfully utilized for natural disaster monitoring such as forest fire, earthquake, and floods. In this paper, an efficient change detection method based on texture differences observed from high resolution multi-temporal data sets is proposed for mapping disaster damage and extracting damage information. It is composed of two parts: feature extraction and detection process. Timely and accurate information on disaster damage can provide an effective decision making and response related to damage.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2000.11a
• /
• pp.427-436
• /
• 2000

The prediction of stock price index is a very difficult problem because of the complexity of the stock market data it data. It has been studied by a number of researchers since they strong1y affect other economic and financial parameters. The movement of stock price index has a series of change points due to the strategies of institutional investors. This study presents a two-stage forecasting model of stock price index using change-point detection and artificial neural networks. The basic concept of this proposed model is to obtain Intervals divided by change points, to identify them as change-point groups, and to use them in stock price index forecasting. First, the proposed model tries to detect successive change points in stock price index. Then, the model forecasts the change-point group with the backpropagation neural network (BPN). Fina1ly, the model forecasts the output with BPN. This study then examines the predictability of the integrated neural network model for stock price index forecasting using change-point detection.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2022.11a
• /
• pp.88-90
• /
• 2022

Semi Supervised Learning 은 일부의 data 에는 labeling 을 하고 나머지 data 에는 labeling 을 안한채로 학습을 진행하는 방법이다. Object Detection 은 이미지에서 여러개의 객체들의 대한 위치를 여러개의 바운딩 박스로 지정해서 찾는 Computer Vision task 이다. 당연하게도, model training 단계에서 사용되는 data set 의 크기가 크고 객체가 많을 수록 일반적으로 model 의 성능이 좋아 질 것이다. 하지만 실험 환경에 따라 data set 을 잘 확보하지 못하던가, 실험 장치가 데이터 셋을 감당하지 못하는 등의 문제가 발생 할 수 있다. 그렇기에 본 논문에서는 semi supervised learning based object detection model 을 알아보고 data set 의 크기를 조절해가며 modle 을 training 시킨 뒤 data set 의 크기에 따라 성능이 어떻게 변화하는 지를 알아 볼 것이다.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2004.04a
• /
• pp.221-226
• /
• 2004

For comparing more than two images, the precise geometric corrections should be preceded because it necessary to eliminate systematic errors due to basic sensor information difference and non-systematic errors due to topographical undulations. In this study, we did sensor modeling using satellite sensor information to make a basic map of change detection for artificial topography. We eliminated the systematic errors which can be occurred in photographing conditions using GCP and DEM data. The Kompsat EOC images relief could be reduced by precise rectification method. Classifying images which was used for change detections by city and forest zone, the accuracy of the matching results are increased by 10% and the positioning accuracies also increased.

• 한국공간정보시스템학회:학술대회논문집
• /
• 2007.06a
• /
• pp.139-144
• /
• 2007

Recording data in hundreds of narrow contiguous spectral intervals, hyperspectral images have provided the opportunity to detect small differences in material composition. But a limitation of a hyperspectral image is the signal to noise ratio (SNR) lower than that of a multispectral image. This paper presents the efficiency of Spectral Similarity Scale (SSS) in change detection of hyperspectral image and the experiment was performed with Hyperion data. SSS is an algorithm that objectively quantifies differences between reflectance spectra in both magnitude and direction dimensions. The thresholds for detecting the change area were determined through Expectation-Maximization (EM) algorithm. The experimental result shows that the SSS algorithm and EM algorithm are efficient enough to be applied to the unsupervised change detection of hyperspectral images.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.8
• /
• pp.293-298
• /
• 2014

Detecting and understanding the changes between RDF data is crucial in the evolutionary process, synchronization system, and versioning system on the web of data. However, current researches on detecting changes still remain unsatisfactory in that they did neither consider the large scale of RDF data nor accurately produce the RDF deltas. In this paper, we propose a scalable and effective change detection using a MapReduce framework which has been used in many fields to process and analyze large volumes of data. In particular, we focus on the structure-based change detection that adopts a strategy for the comparison of blank nodes in RDF data. To achieve this, we employ a method which is composed of two MapReduce jobs. First job partitions the triples with blank nodes by grouping each triple with the same blank node ID and then computes the incoming path to the blank node. Second job partitions the triples with the same path and matchs blank nodes with the Hungarian method. In experiments, we show that our approach is more accurate and effective than the previous approach.

• Communications for Statistical Applications and Methods
• /
• v.29 no.1
• /
• pp.127-150
• /
• 2022

We discuss multiple change-point estimation as edge detection in piecewise smooth functions with finitely many jump discontinuities. In this paper we propose change-point estimators using concentration kernels with Fourier coefficients. The change-points can be located via the signal based on Fourier transformation system. This method yields location and amplitude of the change-points with refinement via concentration kernels. We prove that, in an appropriate asymptotic framework, this method provides consistent estimators of change-points with an almost optimal rate. In a simulation study the proposed change-point estimators are compared and discussed. Applications of the proposed methods are provided with Nile flow data and daily won-dollar exchange rate data.

• The Journal of Information Systems
• /
• v.15 no.4
• /
• pp.211-224
• /
• 2006

This study investigates the application of data mining techniques such as artificial neural networks, rough sets, and induction teaming to the intrusion detection systems. To maximize the effectiveness of data mining for intrusion detection systems, we introduced the asymmetric costs with false positive errors and false negative errors. And we present a method for intrusion detection systems to utilize the asymmetric costs of errors in data mining. The results of our empirical experiment show our intrusion detection model provides high accuracy in intrusion detection. In addition the approach using the asymmetric costs of errors in rough sets and neural networks is effective according to the change of threshold value. We found the threshold has most important role of intrusion detection model for decreasing the costs, which result from false negative errors.