An arbitrary order time-stepping algorithm for tracking particles in inhomogeneous magnetic fields.
Krasymyr TretiakDaniel RuprechtPublished in: CoRR (2018)
Keyphrases
- detection algorithm
- preprocessing
- learning algorithm
- real time
- np hard
- computational cost
- magnetic field
- improved algorithm
- computationally efficient
- particle swarm
- target tracking
- cost function
- evolutionary algorithm
- search space
- similarity measure
- kalman filter
- k means
- optimization algorithm
- segmentation algorithm
- image segmentation
- particle swarm optimization algorithm
- matching algorithm
- cellular automata
- optimal solution
- computational complexity
- expectation maximization
- particle swarm optimization
- worst case
- mobile robot
- special case
- significant improvement