• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.417-420
• /
• 1998

A heuristic sweeping algorithm for an autonomous smearing robot which executes the area filling task is proposed. This algorithm searches tracking points with the obstacle andenvironment wall while the robot tracking whole workspace, and finds sequential tracking line by sequentally connecting the tracking points in such a way that (1) the line should be never crossed, (2) the total tracking points should be is linked as short as possible, and (3) the tracking link should be cross over the obstacle in the work-space. If the line pass through the obstacle, hierarchical collision free algorithm proposed is implied. The proposed algorithm consists of (1) collision detection procedure, (2) obstacle map making procedures, (3) tracking points generation procedures for subgosls, (4) tracking points scanning procedures, and (5) obstacle avoidance procedure.

• Journal of Advanced Marine Engineering and Technology
• /
• v.38 no.10
• /
• pp.1303-1309
• /
• 2014

In this paper, we present an iterative learning control (ILC) framework for tracking problems with predefined data points that are desired points at certain time instants. To design ILC systems for such problems, a new ILC scheme is proposed to produce output curves that pass close to the desired points. Unlike traditional ILC approaches, an algorithm will be developed in which the control signals are generated by solving an optimal ILC problem with respect to the desired sampling points. In another word, it is a direct approach for the multiple points tracking ILC control problem where we do not need to divide the tracking problem into two steps separately as trajectory planning and ILC controller.The strength of the proposed formulation is the methodology to obtain a control signal through learning law only considering the given data points and dynamic system, instead of following the direction of tracking a prior identified trajectory. The key advantage of the proposed approach is to significantly reduce the computational cost. Finally, simulation results will be introduced to confirm the effectiveness of proposed scheme.

• International Journal of Control, Automation, and Systems
• /
• v.5 no.2
• /
• pp.200-207
• /
• 2007

The passive direction finding cross localization method is widely adopted in passive tracking, therefore there will exist masses of false intersection points. Eliminating these false intersection points correctly and quickly is a key technique in passive localization. A new method is proposed for passive locating and tracking multi-jammer target in this paper. It not only solves the difficulty of determining the number of targets when masses of false intersection points existing, but also solves the initialization problem of elastic network. Thus this method solves the problem of multi-jammer target correlation and the elimination of static false intersection points. The method which dynamically establishes multiple hypothesis trajectory trees solves the problem of eliminating the remaining false intersection points. Simulation results show that computational burden of the method is lower, the elastic network can more quickly find all or most of the targets and have a more probability of locking the real targets. This method can eliminate more false intersection points.

• Journal of Advanced Marine Engineering and Technology
• /
• v.38 no.10
• /
• pp.1281-1286
• /
• 2014

This paper presents an iterative learning control (ILC) approach for tracking problems with specified data points that are desired points at certain time instants. To design ILC systems for such problems, unlike traditional ILC approaches, an algorithm which updates not only the control signal but also the reference trajectory at each trial will be developed. The relationship between the reference trajectory and ILC control in tracking problems where there are specified data points through which the system should pass is investigated as the rate of convergence. In traditional ILC, the desired data is stored in a tracking profile file. Due to the huge size of the data file containing the target points, it is important to reduce the computational cost. Finally, simulation results of the presented technique are mentioned and compared to other related works to confirm the effectiveness of proposed scheme.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.800-804
• /
• 1999

An intelligent path planning algorithm for an autonomous cleaning robot is presented. This algorithm recognizes obstacle on the architectural CAD draft and generates subgoals as tracking points which executes the area filling task based on heuristic approach. A sweeping path is planned by sequentially connecting the tracking points in such a way that (1) the connected line segments should be crossed, (2) the total tracking points should be as short as possible, (3) the tracking line should not pass through the obstacle. Feasibility of the developed techniques has been demonstrated on real architectural CAD draft.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5624-5638
• /
• 2016

A novel method based on Surf points is proposed to detect and lock-track single ground target in aerial videos. Videos captured by moving cameras contain complex motions, which bring difficulty in moving object detection. Our approach contains three parts: moving target template detection, search area estimation and target tracking. Global motion estimation and compensation are first made by grids-sampling Surf points selecting and matching. And then, the single ground target is detected by joint spatial-temporal information processing. The temporal process is made by calculating difference between compensated reference and current image and the spatial process is implementing morphological operations and adaptive binarization. The second part improves KALMAN filter with surf points scale information to predict target position and search area adaptively. Lastly, the local Surf points of target template are matched in this search region to realize target tracking. The long-term tracking is updated following target scaling, occlusion and large deformation. Experimental results show that the algorithm can correctly detect small moving target in dynamic scenes with complex motions. It is robust to vehicle dithering and target scale changing, rotation, especially partial occlusion or temporal complete occlusion. Comparing with traditional algorithms, our method enables real time operation, processing $520{\times}390$ frames at around 15fps.

• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.2
• /
• pp.133-138
• /
• 2016

This paper describes the track initiation and target-tracking filter for ship tracking in a marine environment by using Light Detection And Ranging (LiDAR). LiDAR with three-dimensional scanning capability is more useful for target tracking in the short to medium range compared to RADAR. LiDAR has rotating multi-beams that return point clouds reflected from targets. Through preprocessing the cluster of the point cloud, the center point can be obtained from the cloud. Target tracking is carried out by using the center points of targets. The track of the target is initiated by investigating the normalized distance between the center points and connecting the points. The regular track obtained from the track initiation can be maintained by the target-tracking filter, which is commonly used in radar target tracking. The target-tracking filter is constructed to track a maneuvering target in a cluttered environment. The target-tracking algorithm including track initiation is experimentally evaluated in a sea-trial test with several boats.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.4 s.316
• /
• pp.86-92
• /
• 2007

A discrete dynamic model for tracking feature points in 2D images is developed. Conventional snake approaches deform a contour to lock onto features of interest within an image by finding a minimum of its energy functional, composed of internal and external forces. The neighborhood around center snaxel is a space matrix, typically rectangular. The structure of the model proposed in this paper is a set of connected vertices. Energy model is designed for its local minima to comprise the set of alternative solutions available to active process. Block on tracking is one dimension, line type. Initial starting points are defined to the satisfaction of indent states, which is then automatically modified by an energy minimizing process. The track is influenced by curvature constraints, ascent/descent or upper/lower points. The advantages and effectiveness of this layer approach may also be applied to feature points tracking of digital image whose pixels have one directional properties with high autocorrelation between adjacent data lines, vertically or horizontally. The test image is the ultrasonic carotid artery image of human body, and we have verified its effect on intima/adventitia starting points tracking.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.18 no.2
• /
• pp.181-192
• /
• 2014

In this paper, we propose a robust real-time myocardial border tracking algorithm for echocardiography. Commonly, after an initial contour of LV border is traced at one or two frame from the entire cardiac cycle, LV contour tracking is performed over the remaining frames. Among a variety of tracking techniques, optical flow method is the most widely used for motion estimation of moving objects. However, when echocardiography data is heavily corrupted in some local regions, the errors bring the tracking point out of the endocardial border, resulting in distorted LV contours. This shape distortion often occurs in practice since the data acquisition is affected by ultrasound artifacts, dropout or shadowing phenomena of cardiac walls. The proposed method deals with this shape distortion problem and reflects the motion realistic LV shape by applying global deformation modeled as affine transform partitively to the contour. We partition the tracking points on the contour into a few groups and determine each affine transform governing the motion of the partitioned contour points. To compute the coefficients of each affine transform, we use the least squares method with equality constraints that are given by the relationship between the coefficients and a few contour points showing good tracking results. Many real experiments show that the proposed method supports better performance than existing methods.

• Journal of Welding and Joining
• /
• v.18 no.3
• /
• pp.60-67
• /
• 2000

In this study, we constructed a preview-sensing visual sensor system for weld seam tracking in GMA welding. The visual sensor consists of a CCD camera, a diode laser system with a cylindrical lens and a band-pass-filter to overcome the degrading of image due to spatters and/or arc light. To obtain weld joint position and edge points accurately from the captured image, we compared Hough transform method with central difference method. As a result, we present Hough transform method can more accurately extract the points and it can be applied to real time weld seam tracking. Image processing is carried out to extract straight lines that express laser stripe. After extracting the lines, weld joint position and edge points is determined by intersecting points of the lines. Although a spatter trace is in the image, it is possible to recognize the position of weld joint. Weld seam tracking was precisely implemented with adopting Hough transform method, and it is possible to track the weld seam in the case of offset angle is in the region of $\pm15^{\circ}$.