Tracking Moving Objects by a Mobile Camera

A system for video tracking of a moving object by the robot-held camera is presented, and efficient tracking methods are proposed. We describe our initial implementation of a system which is capable of tracking a single moving object against highly textured background. A pyramid-based image processor, PVM-1 is employed to support some fast algorithms in locating the moving object from the difference image. Object tracking is accomplished in the static look-and-move mode by the translational motion of a CCD camera mounted on the robot arm. Discussion is given on the implementation of tracking filters and on the effective utilization of multi-resolution processing for the object searching. Finally a method for dynamic look-and-move tracking is proposed for the future improvement of tracking performance

Real-time visual tracking using image processing and filtering methods

The main goal of this thesis is to develop real-time computer vision algorithms in order to detect and to track targets in uncertain complex environments purely based on a visual sensor. Two major subjects addressed by this work are: 1. The development of fast and robust image segmentation algorithms that are able to search and automatically detect targets in a given image. 2. The development of sound filtering algorithms to reduce the effects of noise in signals from the image processing. The main constraint of this research is that the algorithms should work in real-time with limited computing power on an onboard computer in an aircraft. In particular, we focus on contour tracking which tracks the outline of the target represented by contours in the image plane. This thesis is concerned with three specific categories, namely image segmentation, shape modeling, and signal filtering. We have designed image segmentation algorithms based on geometric active contours implemented via level set methods. Geometric active contours are deformable contours that automatically track the outlines of objects in images. In this approach, the contour in the image plane is represented as the zero-level set of a higher dimensional function. (One example of the higher dimensional function is a three-dimensional surface for a two-dimensional contour.) This approach handles the topological changes (e.g., merging, splitting) of the contour naturally. Although geometric active contours prevail in many fields of computer vision, they suffer from the high computational costs associated with level set methods. Therefore, simplified versions of level set methods such as fast marching methods are often used in problems of real-time visual tracking. This thesis presents the development of a fast and robust segmentation algorithm based on up-to-date extensions of level set methods and geometric active contours, namely a fast implementation of Chan-Vese's (active contour) model (FICVM). The shape prior is a useful cue in the recognition of the true target. For the contour tracker, the outline of the target can be easily disrupted by noise. In geometric active contours, to cope with deviations from the true outline of the target, a higher dimensional function is constructed based on the shape prior, and the contour tracks the outline of an object by considering the difference between the higher dimensional functions obtained from the shape prior and from a measurement in a given image. The higher dimensional function is often a distance map which requires high computational costs for construction. This thesis focuses on the extraction of shape information from only the zero-level set of the higher dimensional function. This strategy compensates for inaccuracies in the calculation of the shape difference that occur when a simplified higher dimensional function is used. This is named as contour-based shape modeling. Filtering is an essential element in tracking problems because of the presence of noise in system models and measurements. The well-known Kalman filter provides an exact solution only for problems which have linear models and Gaussian distributions (linear/Gaussian problems). For nonlinear/non-Gaussian problems, particle filters have received much attention in recent years. Particle filtering is useful in the approximation of complicated posterior probability distribution functions. However, the computational burden of particle filtering prevents it from performing at full capacity in real-time applications. This thesis concentrates on improving the processing time of particle filtering for real-time applications. In principle, we follow the particle filter in the geometric active contour framework. This thesis proposes an advanced blob tracking scheme in which a blob contains shape prior information of the target. This scheme simplifies the sampling process and quickly suggests the samples which have a high probability of being the target. Only for these samples is the contour tracking algorithm applied to obtain a more detailed state estimate. Curve evolution in the contour tracking is realized by the FICVM. The dissimilarity measure is calculated by the contour based shape modeling method and the shape prior is updated when it satisfies certain conditions. The new particle filter is applied to the problems of low contrast and severe daylight conditions, to cluttered environments, and to the appearing/disappearing target tracking. We have also demonstrated the utility of the filtering algorithm for multiple target tracking in the presence of occlusions. This thesis presents several test results from simulations and flight tests. In these tests, the proposed algorithms demonstrated promising results in varied situations of tracking.Ph.D.Committee Chair: Eric N. Johnson; Committee Co-Chair: Allen R. Tannenbaum; Committee Member: Anthony J. Calise; Committee Member: Eric Feron; Committee Member: Patricio A. Vel

A Weak Target Detection Algorithm IAR-STFT Based on Correlated K-distribution Sea Clutter Model

The detection performance of weak target on sea is affected by the special effects of sea clutter amplitude. Aiming at the time and space correlated of sea clutter, the correlated K-distribution sea clutter model is established by the sphere invariant random process algorithm. To solve the problems of range migration (RM) and Doppler frequency migration (DFM) of moving target in the case of long-time coherent accumulation, a novel integration detection algorithm, improved axis rotation short-time Fourier transform (IAR-STFT) is proposed in this paper, which is based on a generalization of traditional Fourier transform (FT) algorithm and combined with improved axis rotation. IAR-STFT not only can eliminate the RM effect by searching for the target motion parameters, but also can divide the non-stationary echo signal without range migration into several blocks. Each block of signal can be regarded as a stationary signal without DFM and FFT is performed on each signal separately. The signals of each block are accumulated to detect the target in the background of the above sea clutter. Finally, the effectiveness of the algorithm is verified by simulation. The results show that the detection ability of this algorithm is better than that of Radon-fractional Fourier transform, generalized Radon Fourier transform and Radon-Lv's distribution in low SNR environment, e.g., when the SNR is -45dB, the detection ability of this algorithm is about 55%, which is higher than that of Radon-fractional Fourier transform, generalized Radon Fourier transform and Radon-Lv's distribution

Orbit Estimation of Non-Cooperative Maneuvering Spacecraft

Due to the ever increasing congestion of the space environment, there is an increased demand for real-time situation awareness of all objects in space. An unknown spacecraft maneuver changes the predicted orbit, complicates tracking, and degrades estimate accuracies. Traditional orbit estimation routines are implemented, tested, and compared to a multiple model format that adaptively handles unknown maneuvers. Multiple Model Adaptive Estimation is implemented in an original way to track a non-cooperative satellite by covariance inflation and filtering-through a maneuver. Parameters for successful instantaneous maneuver reconstruction are analyzed. Variable State Dimension estimation of a continuously maneuvering spacecraft is investigated. A requirements based analysis is performed on short arc orbital solutions. Large covariance propagation of potential maneuvers is explored. Using ground-based radars, several thousand simulations are run to develop new techniques to estimate orbits during and after both instantaneous and continuous maneuvers. The new methods discovered are more accurate by a factor of 700 after only a single pass when compared to non-adaptive methods. The algorithms, tactics, and analysis complement on-going efforts to improve Space Situational Awareness and dynamic modeling