Multiple space object tracking is vital to space situational awareness. In this paper, the multiple hypothesis filter is used to track multiple space objects via a space-based optical sensor, which has many distinct a...
详细信息
ISBN:
(纸本)9781467376778
Multiple space object tracking is vital to space situational awareness. In this paper, the multiple hypothesis filter is used to track multiple space objects via a space-based optical sensor, which has many distinct advantages over ground-based sensors. Due to the limited observations obtained from the space-based sensor, the constrained admissible area is used to initialize the orbit. A semi-greedy track selection (SGTS) algorithm is used to solve the multidimensional assignment problem in the observation to track association. The Cubature Kalman filter (CKF) will be used to update the orbit for each space object. Because of the various geometric relationships between the Sun, space objects, and the Earth, many trackelets are generated by the same space object. To facilitate the space object classification, the least squares method associates tracklets to objects. A set of objects with geosynchronous equatorial orbit obtained from the space catalogue is used to test and demonstrate the effectiveness of the proposed algorithm.
Repeater jamming is a newly proposed jamming strategy much effective against linear frequency modulated (LFM) radars. In this paper, a general repeater jamming suppression algorithm is proposed based on Hilbert-Huang ...
详细信息
ISBN:
(纸本)9781509008643
Repeater jamming is a newly proposed jamming strategy much effective against linear frequency modulated (LFM) radars. In this paper, a general repeater jamming suppression algorithm is proposed based on Hilbert-Huang transform (HHT). Firstly, with the application of empirical mode decomposition (EMD), the time delay and duration of a repeater jamming can be calculated from the Hilbert-Huang spectrum. Then the repeater jamming is divided into several multi-components LFM segments and the other unknown parameters of each segment are estimated through a modified interpolation on Fourier coefficients (IFC) method. At last, the repeater jamming is suppressed by reconstruction and subtraction in a unified model. Monte-Carlo simulations demonstrate that the variances of the parameters estimation can attain the Cramér-Rao bounds (CRBs) asymptotically, and the proposed algorithm is verified having superior jamming suppression performance.
This paper proposed video stabilization techniques using undesired motion detection and alpha-trimming mean filter. The proposed method consists of detecting undesired motions step and filtering the undesired motions ...
详细信息
ISBN:
(纸本)9781509024018
This paper proposed video stabilization techniques using undesired motion detection and alpha-trimming mean filter. The proposed method consists of detecting undesired motions step and filtering the undesired motions step. The limitation on undesired motions is defined, using the local motion information. The alpha-trimming mean filter's alpha is controlled based on this limitation, so that regenerated video is controlled. The experimental results proved that the superior performance of the proposed algorithm.
This paper presents the problem of information fusion in a multi-sensor setup of asynchronous sensors with different latencies. This leads to the problem of tracks that have arbitrary arrival time at the fusion center...
详细信息
ISBN:
(纸本)9781467365970
This paper presents the problem of information fusion in a multi-sensor setup of asynchronous sensors with different latencies. This leads to the problem of tracks that have arbitrary arrival time at the fusion center. A solution for the integration of tracks that are temporally out of order is proposed. The proposed algorithm is quite suitable for the track-to-track fusion requirements. This solution avoids the complex calculation involved in negating the effect of process noise that influences the estimation accuracy in a track-to-track fusion and also the correlated process noise problem that arises during the integration of out of order track with the global track. Monte Carlo simulations are carried out with different sensor characteristics to study the performance of the algorithm. The result of the algorithm is compared with an optimal filtering benchmark.
Pairwise clustering methods are able to handle relational data, in which a set of objects is described via a matrix of pairwise (dis)similarities. Using the framework of source coding, it has been shown that pairwise ...
详细信息
ISBN:
(纸本)9781479919611
Pairwise clustering methods are able to handle relational data, in which a set of objects is described via a matrix of pairwise (dis)similarities. Using the framework of source coding, it has been shown that pairwise clustering can be considered as entropy maximization problem under the constraint of keeping the distortion at a small value. This can be optimized via deterministic annealing. For the purpose of improving this optimization procedure, we have previously suggested two incremental pairwise clustering methods. However, they either only allow an even number of clusters, or cannot be applied to large proximity matrices. In this paper, we propose an incremental pairwise clustering method that resolves these issues. We compare the computational efficiency of the proposed algorithm to the previous incremental methods using simulations. Moreover, we apply the method to identify functionally connected brain networks by clustering a high-dimensional connectivity matrix obtained from resting state functional magnetic resonance imaging data.
The minimum distance for linear codes is one of the important parameters. The shift bound is a good lower bound of the minimum distance for cyclic codes, Reed-Muller codes and geometric Goppa codes. It is necessary to...
详细信息
ISBN:
(纸本)9781467360500
The minimum distance for linear codes is one of the important parameters. The shift bound is a good lower bound of the minimum distance for cyclic codes, Reed-Muller codes and geometric Goppa codes. It is necessary to construct the maximum number of the independent set for the calculation of the shift bound. However, its computational complexity is very large, because the construction of the independent sets is not unique. The authors proposed an algorithm for calculation of the independent set and new lower bound using the discrete Fourier transform in 2010. In this paper we give simple modification and new recurrent algorithms to improve the original algorithm.
Micro-motion features are very useful for target recognition in inverse synthetic aperture radar (ISAR). In this paper, we propose an effective algorithm for micro-motion feature extraction in ISAR imaging with sparse...
详细信息
Micro-motion features are very useful for target recognition in inverse synthetic aperture radar (ISAR). In this paper, we propose an effective algorithm for micro-motion feature extraction in ISAR imaging with sparse aperture. The micro-Doppler effect induced by rotational micro-motion in ISAR with sparse aperture is analysed first, and then an improved four-parameter Hough transform and an Orthogonal matching pursuit decomposition method are proposed to extract the micro-motion parameters, such as rotation rate and radius. Simulations are given to demonstrate the effectiveness of the proposed algorithm.
This paper presents a new nonlinear filtering algorithm that is shown to outperform state-of-the-art particle filters with resampling. Starting from the Ito stochastic differential equation, the proposed algorithm har...
详细信息
ISBN:
(纸本)9781479901777
This paper presents a new nonlinear filtering algorithm that is shown to outperform state-of-the-art particle filters with resampling. Starting from the Ito stochastic differential equation, the proposed algorithm harnesses Karhunen-Loeve expansion to derive an approximate non-autonomous dynamical system, for which transfer operator based density computation can be performed in exact arithmetic. It is proved that the algorithm is asymptotically consistent in mean-square sense. Numerical results demonstrate that explicitly accounting prior dynamics entail significant performance improvement for nonlinear non-Gaussian estimation problems with infrequent measurement updates, as compared to the performance of particle filters.
The paper presents a new solution to the multivehicle coverage problem. The proposed algorithm guarantees complete coverage and provides collaborative behaviors of vehicles, despite the fact that it does not explicitl...
详细信息
ISBN:
(纸本)9781479901777
The paper presents a new solution to the multivehicle coverage problem. The proposed algorithm guarantees complete coverage and provides collaborative behaviors of vehicles, despite the fact that it does not explicitly exploit any computationally intensive optimization technique. The algorithm can deal with any mission domain, including regions with irregular shapes, multi-connected and disjoint regions. It gives reasonably good solutions even for partially connected multi-vehicle systems. The coverage problem for regions the shape of which change in time regardless the vehicle movement is also solved by the proposed algorithm.
Area Coverage is a standard problem in which Robotics techniques can be applied. An approach to solve this problem is through techniques based on Centroidal Voronoi Tesselations (CVT), considering that each robot is a...
详细信息
ISBN:
(纸本)9781467361279
Area Coverage is a standard problem in which Robotics techniques can be applied. An approach to solve this problem is through techniques based on Centroidal Voronoi Tesselations (CVT), considering that each robot is a generator used to build Voronoi polygons. In this work, a new approach named by Sample Lloyd Area Coverage System (SLACS), is proposed that does not need of the explicit building of the diagram based in the Probabilistic Lloyd method to estimate a Voronoi polygon's centroid. In addition, it is proposed a method to close Voronoi diagrams to apply in a classic Lloyd CVT procedure. Both approaches are compared in empty and roomlike environments done in simulated tests using both Player interface and Stage simulator. Results obtained show that the proposed approach is well suited to solve the area coverage problem via mobile sensor deployment and it is a simple and effective substitute to a Lloyd CVT method.
暂无评论