Aiming at the application of passive trackinn based on sensor array, a new passive trackinn usinn sensor array based on particle filter was proposed. Firstly, the“fake points" could be almost entirely and exactly deleted with the aids of the sensor array at the expense of an additional sensor. Secondly, considered the fact that the measurements notten from each array were independent in passive trackinn system, a novel sequential particle filter usinn sensor array with improved distribution was proposed. At last, in a simulation study we compared this approach a壇orithm with traditional trackinn methods. The simulation re-sups show that the proposed method can nreatly improve the state estimation precision of sensor array passive trackinn system.
標簽： trackinn passive application Aiming
上傳時間： 2015-12-31
上傳用戶：trepb001
In this article, we present an overview of methods for sequential simulation from posterior distributions. These methods are of particular interest in Bayesian filtering for discrete time dynamic models that are typically nonlinear and non-Gaussian. A general importance sampling framework is developed that unifies many of the methods which have been proposed over the last few decades in several different scientific disciplines. Novel extensions to the existing methods are also proposed.We showin particular how to incorporate local linearisation methods similar to those which have previously been employed in the deterministic filtering literature these lead to very effective importance distributions. Furthermore we describe a method which uses Rao-Blackwellisation in order to take advantage of the analytic structure present in some important classes of state-space models. In a final section we develop algorithms for prediction, smoothing and evaluation of the likelihood in dynamic models.
標簽： sequential simulation posterior overview
上傳時間： 2015-12-31
上傳用戶：225588
An unsatisfactory property of particle filters is that they may become inefficient when the observation noise is low. In this paper we consider a simple-to-implement particle filter, called ‘LIS-based particle filter’, whose aim is to overcome the above mentioned weakness. LIS-based particle filters sample the particles in a two-stage process that uses information of the most recent observation, too. Experiments with the standard bearings-only tracking problem indicate that the proposed new particle filter method is indeed a viable alternative to other methods.
標簽： unsatisfactory inefficient property particle
上傳時間： 2014-01-11
上傳用戶：大三三
2D Collsion Detection in Real-time Demonstration This is the sample application that accompanies Game Developer magazine. It is meant as a demonstration of a method for 2D collision detection.
標簽： Demonstration application accompanies Detection
上傳時間： 2016-01-17
上傳用戶：sardinescn
bpmpd是用fortran77語言編寫的一個state-of-the-art求解大規模線性規劃程序，使用不可行原-對偶內點法（infeasible primal-dual interior point method）求解
標簽： state-of-the-art fortran bpmpd 77
上傳時間： 2013-12-09
上傳用戶：xiaohuanhuan
這是一個模擬第3類模式地震波的matlab腳本。 This a collection of Matlab scripts that solve the antiplane (mode III) earthquake dynamic problem with slip-weakening friction, on a 1D fault embedded in a 2D homogeneous elastic unbounded medium. The problem is formulated as a boundary integral equation and the elastodynamic kernels are analytically derived in the spectral domain (spatial wavenumber). The method is explained e.g. by Morrysey and Geubelle (1997), and has been improved and extensively used by Nadia Lapusta, Alain Cochard, etc.
標簽： collection antiplane scripts matlab
上傳時間： 2013-12-26
上傳用戶：遠遠ssad
線上求解法求解色譜模型，method of lines sloving chromatographic model
上傳時間： 2014-01-11
上傳用戶：liansi
the free lattice Boltzmann code anb ，一段lattice Boltzmann method程序源碼
標簽： Boltzmann lattice free code
上傳時間： 2014-12-20
上傳用戶：康郎
This code implements the shortest path algorithm via the simple scheme and fibonacci heap data structure. It has 3 kinds of testing data input method : random input by computer, reading from the file, reading from the key board.
標簽： implements algorithm fibonacci the
上傳時間： 2013-12-23
上傳用戶：ynzfm
We can see that using Gauss-Seidel iterative methods need only 13 timed to make But using Jacobi method after 25 times the is bigger than that using Gauss-Seidel iterative methods
標簽： Gauss-Seidel iterative methods 61541
上傳時間： 2016-02-06
上傳用戶：sjyy1001
