• Journal of KIISE:Databases
• /
• v.33 no.5
• /
• pp.463-475
• /
• 2006

In applications such as a traffic management system, analysis using a spatial hierarchy of a spatial data warehouse and a simple aggregation is required. Over the past few years, several studies have been made on solution using a spatial index. Many studies have focused on using extended R-tree. But, because it just provides either the current aggregation or the total aggregation, decision support of traffic policy required historical analysis can not be provided. This paper proposes hybrid index based on extended aR-tree for the spatio-temporal aggregation. The proposed method supports a spatial hierarchy and the current aggregation by the R-tree. The sorted hash table using the time structure of the extended aR-tree provides a temporal hierarchy and a historical aggregation. Therefore, the proposed method supports an efficient decision support with spatio-temporal analysis and is Possible currently traffic analysis and determination of a traffic policy with historical analysis.

• ETRI Journal
• /
• v.29 no.4
• /
• pp.527-529
• /
• 2007

In this paper, a decision-tree-based Markov model for phrase break prediction is proposed. The model takes advantage of the non-homogeneous-features-based classification ability of decision tree and temporal break sequence modeling based on the Markov process. For this experiment, a text corpus tagged with parts-of-speech and three break strength levels is prepared and evaluated. The complex feature set, textual conditions, and prior knowledge are utilized; and chunking rules are applied to the search results. The proposed model shows an error reduction rate of about 11.6% compared to the conventional classification model.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.2
• /
• pp.961-968
• /
• 2018

Recently, researches on automatic recognition of human activities have been actively carried out with the emergence of various intelligent systems. Since a large amount of visual data can be secured through Closed Circuit Television, it is required to recognize human behavior in a dynamic situation rather than a static situation. In this paper, we propose new intelligent human activity recognition model using the trajectory information extracted from the video sequence. The proposed model consists of three steps: segmentation and partitioning of trajectory step, feature extraction step, and behavioral learning step. First, the entire trajectory is fuzzy partitioned according to the motion characteristics, and then temporal features and spatial features are extracted. Using the extracted features, four pedestrian behaviors were modeled by decision tree learning algorithm and performance evaluation was performed. The experiments in this paper were conducted using Caviar data sets. Experimental results show that trajectory provides good activity recognition accuracy by extracting instantaneous property and distinctive regional property.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.13 no.2
• /
• pp.1-11
• /
• 2014

In this paper, travel speed patterns were deducted based on historical DSRC travel speed data using Decision Tree technique to improve availability of the massive amount of historical data. These patterns were designed to reflect spatio-temporal vicissitudes in reality by generating pattern units classified by months, time of day, and highway sections. The study area was from Seoul TG to Ansung IC sections on Gyung-bu highway where high peak time of day frequently occurs in South Korea. Decision Tree technique was applied to categorize travel speed according to day of week. As a result, five different pattern groups were generated: (Mon)(Tue Wed Thu)(Fri)(Sat)(Sun). Statistical verification was conducted to prove the validity of patterns on nine different highway sections, and the accuracy of fitting was found to be 93%. To reduce travel pattern errors against individual travel speed data, inclusion of four additional variables were also tested. Among those variables, 'traffic condition on previous month' variable improved the pattern grouping accuracy by reducing 50% of speed variance in the decision tree model developed.

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.4
• /
• pp.30-39
• /
• 2003

In this paper, we carried out the performance evaluation of HM-Net(Hidden Markov Network) speech recognition system for Korean speech databases. We adopted to construct acoustic models using the HM-Nets modified by HMMs(Hidden Markov Models), which are widely used as the statistical modeling methods. HM-Nets are carried out the state splitting for contextual and temporal domain by PDT-SSS(Phonetic Decision Tree-based Successive State Splitting) algorithm, which is modified the original SSS algorithm. Especially it adopted the phonetic decision tree to effectively express the context information not appear in training speech data on contextual domain state splitting. In case of temporal domain state splitting, to effectively represent information of each phoneme maintenance in the state splitting is carried out, and then the optimal model network of triphone types are constructed by in the parameter. Speech recognition was performed using the one-pass Viterbi beam search algorithm with phone-pair/word-pair grammar for phoneme/word recognition, respectively and using the multi-pass search algorithm with n-gram language models for sentence recognition. The tree-structured lexicon was used in order to decrease the number of nodes by sharing the same prefixes among words. In this paper, the performance evaluation of HM-Net speech recognition system is carried out for various recognition conditions. Through the experiments, we verified that it has very superior recognition performance compared with the previous introduced recognition system.

• Smart Media Journal
• /
• v.13 no.2
• /
• pp.23-31
• /
• 2024

In precision cattle farm, reliably tracking the identity of each cattle is necessary. Effective tracking of cattle within farm environments presents a unique challenge, particularly with the need to minimize the occurrence of excessive tracking trajectories. To address this, we introduce a trajectory playback decision tree algorithm that reevaluates and cleans tracking results based on spatio-temporal relationships among trajectories. This approach considers trajectory as metadata, resulting in more realistic and accurate tracking outcomes. This algorithm showcases its robustness and capability through extensive comparisons with popular tracking models, consistently demonstrating the promotion of performance across various evaluation metrics that is HOTA, AssA, and IDF1 achieve 68.81%, 79.31%, and 84.81%.

• Korean Journal of Remote Sensing
• /
• v.36 no.5_1
• /
• pp.707-723
• /
• 2020

In this study, a decision tree type of quality control (QC) method was developed to improve the temporal-spatial representation and accuracy of the visibility data being operated by the Korea Meteorological Administration (KMA). The quality of the developed QC method was evaluated through the application to the 3 years (2016.03-2019.02) of 290 stations visibility data. For qualitative and quantitative verification of the developed QC method, visibility and naked-eye data provided by the KMA and QC method of the Norwegian Meteorological Institute (NMI) were used. Firstly, if the sum of missing and abnormal data exceeds 10% of the total data, the corresponding point was removed. In the 2nd step, a temporal continuity test was performed under the assumption that the visibility changes continuously in time. In this process, the threshold was dynamically set considering the different temporal variability depending on the visibility. In the 3rd step, the spatial continuity test was performed under the assumption of spatial continuity for visibility. Finally, the 10-minute visibility data was calculated using weighted average method, considering that the accuracy of the visibility meter was inversely proportional to the visibility. As results, about 10% of the data were removed in the first step due to the large temporal-spatial variability of visibility. In addition, because the spatial variability was significant, especially around the fog area, the 3rd step was not applied. Through the quantitative verification results, it suggested that the QC method developed in this study can be used as a QC tool for visibility data.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.2
• /
• pp.87-92
• /
• 2014

In this paper, we present a two-phase activity recognition system using smartphone's accelerometers. To consider the unique temporal pattern of accelerometer data for each activity, our system executes the decision-tree(DT) learning in the first phase, and then, in the second phase, executes the hidden Markov model(HMM) learning based on the sequences of classification results of the first phase classifier. Moreover, to build a robust recognizer for each activity, we trained our system using a large amount of data collected from different users, different positions and orientations of smartphone. Through experiments using 6720 examples collected for 6 different indoor activities, our system showed high performance based on its novel design.

• Journal of the Korean earth science society
• /
• v.22 no.2
• /
• pp.138-146
• /
• 2001

The land cover over Korean peninsula was classified using a multi-temporal NOAA/AVHRR (Advanced Very High Resolution Radiometer) data. Four types of phenological data derived from the 10-day composited NDVI (Normalized Differences Vegetation Index), maximum and annual mean land surface temperature, and topographical data were used not only reducing the data volume but also increasing the accuracy of classification. Self organizing feature map (SOFM), a kind of neural network technique, was used for the clustering of satellite data. We used a decision tree for the classification of the clusters. When we compared the classification results with the time series of NDVI and some other available ground truth data, the urban, agricultural area, deciduous tree and evergreen tree were clearly classified.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2310-2325
• /
• 2016

In this paper, we provide a trajectory-generation algorithm that can identify pedestrians in real time. Typically, the contours for the extraction of pedestrians from the foreground of images are not clear due to factors including brightness and shade; furthermore, pedestrians move in different directions and interact with each other. These issues mean that the identification of pedestrians and the generation of trajectories are somewhat difficult. We propose a new method for trajectory generation regarding multiple pedestrians. The first stage of the method distinguishes between those pedestrian-blob situations that need to be merged and those that require splitting, followed by the use of trained decision trees to separate the pedestrians. The second stage generates the trajectories of each pedestrian by using the point-correspondence method; however, we introduce a new point-correspondence algorithm for which the A* search method has been modified. By using fuzzy membership functions, a heuristic evaluation of the correspondence between the blobs was also conducted. The proposed method was implemented and tested with the PETS 2009 dataset to show an effective multiple-pedestrian-tracking capability in a pedestrian-interaction environment.