• Journal of the Korea Institute of Military Science and Technology
• /
• v.23 no.3
• /
• pp.204-212
• /
• 2020

For general target tracking works by receiving a set of measurements from sensor. However, if the SNR(Signal to Noise Ratio) is low due to small RCS(Radar Cross Section), caused by remote small targets, the target's information can be lost during signal processing. TBD(Track Before Detect) is an algorithm that performs target tracking without threshold for detection. That is, all sensor data is sent to the tracking system, which prevents the loss of the target's information by thresholding the signal intensity. On the other hand, using all sensor data inevitably leads to computational problems that can severely limit the application. In this paper, we propose an iterative Joint Integrated Probabilistic Data Association as a practical target tracking technique suitable for a low SNR multi-target environment with real time operation capability, and verify its performance through simulation studies.

• Journal of Ecology and Environment
• /
• v.41 no.5
• /
• pp.142-144
• /
• 2017

In recent decades, as it becomes increasingly important to monitor and research long-term ecological changes, worldwide attempts are being conducted to integrate and manage ecological data in a unified framework. Especially domestic ecological data in South Korea should be first standardized based on predefined common protocols for data integration, since they are often scattered over many different systems in various forms. Additionally, foreign ecological data should be converted into a proper unified format to be used along with domestic data for association studies. In this study, our interest is to integrate ECN data with Korean domestic ecological data under our unified framework. For this purpose, we employed our semi-automatic data conversion tool to standardize foreign data and utilized ground beetle (Carabidae) datasets collected from 12 different observatory sites of ECN. We believe that our attempt to convert domestic and foreign ecological data into a standardized format in a systematic way will be quite useful for data integration and association analysis in many ecological and environmental studies.

• Journal of the Korean Data and Information Science Society
• /
• v.22 no.3
• /
• pp.495-503
• /
• 2011

The most widely used data mining technique is to find association rules. Association rule mining is the method to quantify the relationship between each set of items in very huge database based on the association thresholds. There are some basic association thresholds to explore meaningful association rules ; support, confidence, lift, etc. Among them, confidence is the most frequently used, but it has the drawback that it can not determine the direction of the association. The net confidence and the attributably pure confidence were developed to compensate for this drawback, but they have other drawbacks.In this paper we consider some predictive similarity measures for binary data in cluster analysis and multi-dimensional analysis as association threshold to compensate for these drawbacks. The comparative studies with net confidence, attributably pure confidence, and some predictive similarity measures are shown by numerical example.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.6
• /
• pp.1061-1069
• /
• 2010

In data mining, association rule is a popular and well researched method for discovering interesting relations between variables. There are three measures for association rule, support, confidence and lift. But there are some problem in them. They don't consider the frequency of variable in case. So, we need the new association rule which consider the frequency.In this paper, we proposed the new association rule. We compared the proposed association rule with the original association rule from example data. As a result, we knew our function was better than the original function in terms of sensitivity.

• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.10
• /
• pp.747-754
• /
• 2003

An enhancement of the probabilistic data association filter is presented for tracking a single maneuvering target in clutter environment. The use of the variable dimensional structure leads the probabilistic data association filter to adjust to real motion of a target. The detection of the maneuver for the model switching is performed by the acceleration estimates taken from a bias estimator of the two stage Kalman filter. The proposed algorithm needs low computational power since it is implemented with a single filtering procedure. A simple Monte Carlo simulation was performed to compare the performance of the proposed algorithm and the IMMPDA filter.

• IE interfaces
• /
• v.15 no.4
• /
• pp.426-431
• /
• 2002

In many cases, the result of a road traffic accident can be described with more than one response variables. Nonetheless, most of the existing road accident data analysis deal with only one response variable and try to explain why it occurs. In this paper, we train association rules for a set of more than two response variables conditional on personal, environmental and vehicular/behavioral aspects of accident. Association rules are derived at 8% support and 70% confidence from the 1996 data of three police stations in Korea. We expect that these rules can contribute to effective safety practice in Korea.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.15 no.3
• /
• pp.334-342
• /
• 2012

Data association is important technology which designate final destination in the target tracking. The joint probabilistic data association(JPDA) algorithm provides excellent ability to maintain track on multiple targets. Currently, it is not easily implemented in real time because of track coalescence & switch. The aim of this paper is to develop probabilistic filters that increase JPDA's sensitivity and decrease track coalescence & switch in a cluttered environments.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.10
• /
• pp.1826-1835
• /
• 2007

In this paper, we present a new approach for automatic detection and tracking for multiple targets. We combine a highest probability data association(HPDA) algorithm for target detection with a particle filter for multiple target tracking. The proposed approach evaluates the probabilities of one-to-one assignments of measurement-to-track and the measurement with the highest probability is selected to be target- originated, and the measurement is used for probabilistic weight update of particle filtering. The performance of the proposed algorithm for target tracking in clutter is compared with the existing clustering algorithm and the sequential monte carlo method for probability hypothesis density(SMC PHD) algorithm for multi-target detection and tracking. Computer simulation studies demonstrate that the HPDA algorithm is robust in performing automatic detection and tracking for multiple targets even though the environment is hostile in terms of high clutter density and low target detection probability.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.10
• /
• pp.982-990
• /
• 2010

In a target tracking system using image information from a CCD (Charged Couple Device) or an IIR (Imaging Infra-red) sensor, occluded targets can result in track losses. If the target is occlued by background objects such as buildings or trees, probability of track existence will be reduced sharply and track will be terminated due to track maintenance algorithms. This paper proposes data association algorithm based on target existence for the robust tracking performance. we suggest the HPDA (Highest Probability Data Association) algorithm based on target existence and the tracking performance is compared with the established method based on target perceivability. Image tracking simulation that utilizes virtual 3D images and real IR images is employed to evaluate the robustness of the proposed tracking algorithm.

• The Journal of Information Systems
• /
• v.14 no.3
• /
• pp.53-58
• /
• 2005

In this study, we will employ a multi-agent for the search and extraction of data in a distributed environment. We will use an Integrator Agent in the proposed model on the Hierarchical Clustering and Association Rule Discovery(HCARD). The HCARD will address the inadequacy of other data mining tools in processing performance and efficiency when use for knowledge discovery. The Integrator Agent was developed based on CORBA architecture for search and extraction of data from heterogeneous servers in the distributed environment. Our experiment shows that the HCARD generated essential association rules which can be practically explained for decision making purposes. Shorter processing time had been noted in computing for clusters using the HCARD and implying ideal processing period than computing the rules without HCARD.