• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권4호
• /
• pp.1066-1079
• /
• 2023

Multi-target tracking based on the detector is a very hot and important research topic in target tracking. It mainly includes two closely related processes, namely target detection and target tracking. Where target detection is responsible for detecting the exact position of the target, while target tracking monitors the temporal and spatial changes of the target. With the improvement of the detector, the tracking performance has reached a new level. The problem that always exists in the research of target tracking is the problem that occurs again after the target is occluded during tracking. Based on this question, this paper proposes a DeepSORT model based on SIFT features to improve ship tracking. Unlike previous feature extraction networks, SIFT algorithm does not require the characteristics of pre-training learning objectives and can be used in ship tracking quickly. At the same time, we improve and test the matching method of our model to find a balance between tracking accuracy and tracking speed. Experiments show that the model can get more ideal results.

• 한국수학교육학회지시리즈E:수학교육논문집
• /
• 제25권1호
• /
• pp.21-45
• /
• 2011

본 연구는 4명의 중학교 3학년 학생들이 주어진 표적 문제를 해결하는 과정을 분석하여 학생들이 보이는 다양한 활동 요소 중 구조적 유사성의 인식, 분석적 활동 그리고 비교 활동에 주목하여 이들 활동이 표적 문제의 해결에서 어떤 역할을 하는지 살펴보았다. 4명의 학생들의 문제 해결 과정을 개별적으로 관찰하고 면담한 후, 이 과정에서 학생들이 보인 반응을 분석하여 다음과 같은 결과를 얻었다. 표적 문제의 해결에 근원 문제의 해법을 적용할 수 있는 토대를 마련하는데 도움을 주는 활동 중의 하나로 구조적 유사성의 인식이 그 역할을 수행할 수 있음을, 또 문제 해결을 위해 추측한 사실에 대한 진위 여부의 판단 근거로 분석적 활동을 활용함을 확인하였다. 그리고 표적 문제의 문제점을 인식하게 하여 표적 문제의 해결 방향을 설정하는데 도움을 제공하는 것으로 비교 활동을 활용함을 확인하였다. 따라서 현장에서 수학을 가르치는 교사는 표적 문제의 해결을 위해 유사 문제와의 구조적 유사성, 분석적 활동 그리고 비교 활동에 초점을 맞추어 문제의 해결을 지도하는 노력이 요구된다. 뿐 만 아나라 본 연구에서 언급한 세 가지 요소 이외에 더 많은 요소가 있을 수 있으며 그 요소들의 역할을 탐구하는 후속연구도 필요하다.

• Journal of Electrical Engineering and Technology
• /
• 제8권6호
• /
• pp.1520-1529
• /
• 2013

In this paper, we propose and assess the performance of "H infinity filter ($H_{\infty}$, HIF)" and "cost reference particle filter (CRPF)" in the problem of tracking a target based on the measurements of the range and the bearing of the target. HIF and CRPF have the common advantageous feature that we do not need to know the noise statistics of the problem in their applications. The performance of the extended Kalman filter (EKF) is also compared with that of the proposed filters, but the noise information is perfectly known for the applications of the EKF. Simulation results show that CRPF outperforms HIF, and is more robust because the tracking of HIF diverges sometimes, particularly when the target track is highly nonlinear. Interestingly, when the tracking of HIF diverges, the tracking of the EKF also tends to deviate significantly from the true track for the same target track. Therefore, CRPF is very effective and appropriate approach to the problems of highly nonlinear model, especially when the noise statistics are unknown. Nonetheless, HIF also can be applied to the problem of timevarying state estimation as the EKF, particularly for the case when the noise statistcs are unknown. This paper provides a good example of how to apply CRPF and HIF to the estimation of dynamically varying and nonlinearly modeled states with unknown noise statistics.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• pp.120-124
• /
• 1991

In this paper, we consider the maneuvering detection and target tracking problem in uncertain linear discrete-time systems. The maneuvering detection is based on X$^{2}$ test[2,71, where Kalman filters have been utilized so far. The target tracking is performed by the maneuvering input compensation based on a maximum likelihood estimator. KF has been known to diverge when some modelling errors exist and fail to detect the maneuvering and to track the target in uncertain systems. Thus this paper adopt the FIR filter[l], which is known to be robust to modelling errors, for maneuvering detection and target tracking problem. Various computer simulations show the superior performance of the FIR filter in this problem.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1999년도 제14차 학술회의논문집
• /
• pp.206-209
• /
• 1999

Conventional target tracking techniques are primarily based on Kalman filtering or probabilistic data association(PDA). But it is difficult to perform well under a high cluttered tracking environment because of the difficulty of measurement, the problem of mathematical simplification and the difficulty of combined target detection for tracking association problem. This paper deals with an analysis of target tracking problem using fuzzy-logic theory, and determines fuzzy rules used by a fuzzy tracker, and designs the fuzzy tracker by using fuzzy rules and Kalman filtering.

• 한국군사과학기술학회지
• /
• 제20권3호
• /
• pp.441-453
• /
• 2017

In this paper, a new type of weapon-target assignment(WTA) problem has been suggested that reflects realistic constraints for sharing target with other weapons and shooting double rapid fire. To utilize in rapidly changing actual battle field, the computation time is of great importance. Several metaheuristic methods such as Simulated Annealing, Tabu Search, Genetic Algorithm, Ant Colony Optimization, and Particle Swarm Optimization have been applied to the real-time WTA in order to find a near optimal solution. A case study with a large number of targets in consideration of the practical cases has been analyzed by the objective value of each algorithm.

• 제어로봇시스템학회논문지
• /
• 제6권2호
• /
• pp.173-180
• /
• 2000

During the last decade many researches have been working on multiple target tracking problem in the area of radar application, Various approaches have been proposed to solve the tracking problem and the concept of sensor fusion was established as an effort. In this paper utilization of geographic information for ground target tracking is investigated and performance comparison with the results of applying sensor fusion is described. Geographic information is used in three aspects: association masking target measurement and re-striction of removing true target. Simulation results indicate that using two sensors shows better performance with respect to tracking but a single with geographic information is a winner in reducing the number of false tracks.

• 한국국방경영분석학회지
• /
• 제22권2호
• /
• pp.200-214
• /
• 1996

In this paper, the problem of determining the probability of kill(or survival) of a vulnerable target by one or more missiles is considered. The general formulas are obtained for the kill or survival probability the target is killed or survival. Several well-known concepts such as those of vulnerability, lethality, multi-component target, and a general combinatorial theorem of probability are introduced and used. For the convenience in this paper, the word missile is used in a very general sense and the target is generally taken to be a point target. And, this paper, is concentrated primarily with the probabilistic aspects of the problem, also a general numerical procedures are also described. Two examples are shown to illustrate the use of some of the formulas in this study, but also illustrate a few points which may not have been sufficiently emphasized. The extension study to complete a software package will be followed.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2004년도 추계학술대회 및 정기총회
• /
• pp.13-16
• /
• 2004

This paper deals with a one-searcher multi-target search problem where targets with different detection priorities move in Markov processes in each discrete time over a given space search area, and the total number of search time intervals is fixed. A limited search resource is available in each search time interval and an exponential detection function is assumed. The searcher can obtain a target detection award, if detected, which represents the detection priority of target and is non-increasing with time. The objective is to establish the optimal search plan which allocates the search resource effort over the search areas in each time interval in order to maximize the total detection award. In the analysis, the given problem is decomposed into intervalwise individual search problems each being treated as a single stationary target problem for each time interval. An associated iterative procedure is derived to solve a sequence of stationary target problems. The computational results show that the proposed algorithm guarantees optimality.

• ETRI Journal
• /
• 제33권6호
• /
• pp.857-863
• /
• 2011

Due to uncertainties in target motion and randomness of deployed sensor nodes, the problem of imbalance of energy consumption arises from sensor scheduling. This paper presents an energy-efficient adaptive sensor scheduling for a target monitoring algorithm in a local monitoring region of wireless sensor networks. Owing to excessive scheduling of an individual node, one node with a high value generated by a decision function is preferentially selected as a tasking node to balance the local energy consumption of a dynamic clustering, and the node with the highest value is chosen as the cluster head. Others with lower ones are in reserve. In addition, an optimization problem is derived to satisfy the problem of sensor scheduling subject to the joint detection probability for tasking sensors. Particles of the target in particle filter algorithm are resampled for a higher tracking accuracy. Simulation results show this algorithm can improve the required tracking accuracy, and nodes are efficiently scheduled. Hence, there is a 41.67% savings in energy consumption.