• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.578-581
• /
• 2007

For tracing tag locations, a trajectories should be modeled and indexed in radio frequency identification (RFID) systems. The trajectory of a tag can be represented as a line that connects two spatiotemporal locations captured when the tag enters and leaves the vicinity of a reader. If a tag enters but does not leave a reader, its trajectory is represented only as a point captured at entry. Because the information that the tag stays in the reader is missing from the trajectory represented only as a point, we should extend the region of a query to find the tag that remains in a reader. In this paper, we propose an interval data model of tag's trajectory in order to solve the problem. Trajectories of tags are represented as two kinds of intervals; dynamic intervals which are time-dependent lines and static intervals which are fixed lines. We also show that the interval data model has better performance than others with a cost model

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.3
• /
• pp.145-153
• /
• 2009

Trajectory data are ubiquitous in the real world. Recent progress on satellite, sensor, RFID, video, and wireless technologies has made it possible to systematically track object movements and collect huge amounts of trajectory data. Accordingly, there is an ever-increasing interest in performing data analysis over trajectory data. In this paper, we develop a data mining tool for massive trajectory data. This mining tool supports three operations, clustering, classification, and outlier detection, which are the most widely used ones. Trajectory clustering discovers common movement patterns, trajectory classification predicts the class labels of moving objects based on their trajectories, and trajectory outlier detection finds trajectories that are grossly different from or inconsistent with the remaining set of trajectories. The primary advantage of the mining tool is to take advantage of the information of partial trajectories in the process of data mining. The effectiveness of the mining tool is shown using various real trajectory data sets. We believe that we have provided practical software for trajectory data mining which can be used in many real applications.

• Journal of Korea Spatial Information System Society
• /
• v.7 no.2 s.14
• /
• pp.67-79
• /
• 2005

For tracing tag locations, the trajectories should be modeled and indexed in a radio frequency identification (RFID) system. The trajectory of a tag is represented as a line that connects two spatiotemporal locations captured when the tag enters and leaves the vicinity of a reader. If a tag enters but does not leave a reader, its trajectory is represented only as a point captured at entry. Because the information that a tag stays in a reader is missing from the trajectory represented only as a point, it is impossible to find the tag that remains in a reader. To solve this problem we propose the data model in which trajectories are defined as intervals and new index scheme called the Interval R-tree. We also propose new insert and split algorithms to enable efficient query processing. We evaluate the performance of the proposed index scheme and compare it with the R-tree and the R*-tree. Our experiments show that the new index scheme outperforms the other two in processing queries of tags on various datasets.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.56-68
• /
• 2006

For tracing tag locations, the trajectories should be modeled and indexed in radio frequency identification (RFID) systems. The trajectory of a tag can be represented as a line that connects two spatiotemporal locations captured when the tag enters and leaves the vicinity of a reader. If a tag enters but does not leave a reader, its trajectory is represented only as a point captured at entry. Because the information that a tag stays in a reader is missing from the trajectory represented only as a point, it is impossible to find the tag that remains in a reader. To solve this problem we propose the data model in which trajectories are defined as time-parameterized intervals and new index scheme called the Time Parameterized Interval R-tree. We also propose new insert and split algorithms that reduce the area of nodes to enable efficient query processing. We evaluate the performance of the proposed index scheme and compare it with previous indexes on various datasets.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.14 no.6
• /
• pp.15-29
• /
• 2018

This paper proposes an enhanced object tracking algorithm to compensate the lack of temporal information in existing particle swarm optimization based object trackers using the trajectory of the target object. The proposed scheme also enables the tracking and documentation of the location of an online updated set of distractions. Based on the trajectories information and the distraction set, a rule based approach with adaptive parameters is utilized for occlusion detection and determination of the target position. Compare to existing algorithms, the proposed approach provides more comprehensive use of available information and does not require manual adjustment of threshold values. Moreover, an effective weight adjustment function is proposed to alleviate the diversity loss and pre-mature convergence problem in particle swarm optimization. The proposed weight function ensures particles to search thoroughly in the frame before convergence to an optimum solution. In the existence of multiple objects with similar feature composition, this algorithm is tested to significantly reduce convergence to nearby distractions compared to the other existing swarm intelligence based object trackers.

• Journal of the Korean Society for Precision Engineering
• /
• v.9 no.1
• /
• pp.18-28
• /
• 1992

시스템의 모델링 과정에서 발생될 수 있는 불확실성(uncertainty) 혹은 미지의 가반중량을 비롯한 외란에 의해 발생되는 불확실성 등을 갖고있는 로봇의 강건 추적제어기 설계를 위해 가변구조시스템(variable structure system) 이론을 적용하였다. 시스템 방정식과 연계하여 슬라이딩 모드가 존재하기 위한 조건을 구했으며, 입력 에 대한 불확실성은 매칭조건(matching condition)을 가정하여 다루었다. 기존의 방법에 비해 제어기 설계과정이 간단 명료하며 요구되는 궤적에 대한 추적제어 효과 또한 매우 우수함을 컴퓨터 시뮬레이션을 통해 입증하였다.

• Journal of Space Technology and Applications
• /
• v.2 no.2
• /
• pp.67-80
• /
• 2022

The missile early-warning satellite systems have been developed and upgraded by some space-developed nations, under the inevitable trend that the space is more strongly considered as another battle field than before. As the key function of such a satellite-based early warning system, the prediction algorithm of the missile flight trajectory is studied in the paper. In particular, the evolution computation, receiving broad attention in the artificial intelligence area, is applied to the proposed prediction method so that the global optimum-like solution is found avoiding disadvantage of the previous non-linear optimization search tools. Moreover, using the prediction simulator of the launch vehicle flight trajectory which is newly developed in C# and Python, the paper verifies the performance and the feature of the proposed algorithm.

• Journal of IKEEE
• /
• v.26 no.2
• /
• pp.211-218
• /
• 2022

This paper presents a S-band phased array antenna system for receiving LEO satellite telemetry signals. The proposed antenna, which is performed to be beam-tiled along the elevation direction, consists of 16 sub-array assemblies, 16 active circuit modules, a perpendicular feed network and a control/power unit. In order to precisely track an LEO satellite, the developed antenna is placed with its elevation axis along the projected trajectory of the satellite on the earth. The center of antenna aperture is facing to the maximum elevation angle in the LEO trajectory. The beam-tilted angles for tracking LEO satellite are obtained by calculating accurately satellite points. Satellite tracking measurements are carried out in the range of ±30° with the respect to the maximum elevation angle. The S/N ratio of 16.5 dB and the Eb/No of 13.3 dB at the maximum elevation angle are obtained from the measurements. The measured result agrees well with the pre-analyzed system margin.

• Korean Journal of Optics and Photonics
• /
• v.20 no.3
• /
• pp.156-165
• /
• 2009

We theoretically derive the set of general paraxial zoom locus equations for all zoom lens systems with finite object distance, including the infinite object distance case, by using the Gaussian bracket method and matrix representation of paraxial ray tracing. We make the zoom locus program by means of a numerical calculation method according to these equations in Visual Basic Language. Consequently, the solutions of this method can be consistently and flexibly used in all types of zoom lens in the step of initial design about zoom loci. Finally, in order to verify the justification and usefulness of this method, we show that two examples, such as $M_{4a}$ and $M_{4h}$ types of 4 groups, and one example, $M_{5n}$ type of 5 groups, which are very complicated zoom lens systems, can be rapidly and diversely traced through various interpolations by using this program.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.42 no.2
• /
• pp.1-6
• /
• 2005

Ryu et al. proposed a multiple target DOA tracking algorithm using a linear sensor array. In Ryu's algorithm first, the signal subspace is estimated using sensor output and the angular innovations of targets are extracted from the estimated signal subspace. Next, the DOA's of targets are tracked using the angular innovations as the inputs of Kalman filters. Ryu's algorithm has good features that it has no data association problem and is efficient. However, Ryu's algorithm can't be a lied to an arbitrarily shaped array because it was proposed using linear sensor array. Actually, when the sensor array is used in the various application fields, sensors have a position error. Therefore, the sensor array can be an arbitrarily shaped array. In this paper, we propose a multiple target DOA tracking algorithm applicable to an arbitrarily shaped array, and it sustains the good features of Ryu's algorithm.