scholarly journals Efficient Reject Options for Particle Filter Object Tracking in Medical Applications

Sensors ◽  
2021 ◽  
Vol 21 (6) ◽  
pp. 2114
Author(s):  
Johannes Kummert ◽  
Alexander Schulz ◽  
Tim Redick ◽  
Nassim Ayoub ◽  
Ali Modabber ◽  
...  

Reliable object tracking that is based on video data constitutes an important challenge in diverse areas, including, among others, assisted surgery. Particle filtering offers a state-of-the-art technology for this challenge. Becaise a particle filter is based on a probabilistic model, it provides explicit likelihood values; in theory, the question of whether an object is reliably tracked can be addressed based on these values, provided that the estimates are correct. In this contribution, we investigate the question of whether these likelihood values are suitable for deciding whether the tracked object has been lost. An immediate strategy uses a simple threshold value to reject settings with a likelihood that is too small. We show in an application from the medical domain—object tracking in assisted surgery in the domain of Robotic Osteotomies—that this simple threshold strategy does not provide a reliable reject option for object tracking, in particular if different settings are considered. However, it is possible to develop reliable and flexible machine learning models that predict a reject based on diverse quantities that are computed by the particle filter. Modeling the task in the form of a regression enables a flexible handling of different demands on the tracking accuracy; modeling the challenge as an ensemble of classification tasks yet surpasses the results, while offering the same flexibility.

Author(s):  
Indah Agustien Siradjuddin ◽  
◽  
Muhammad Rahmat Widyanto ◽  

To track vehicle motion in data video, particle filter with Gaussian weighting is proposed. This method consists of four main stages. First, particles are generated to predict target’s location. Second, certain particles are searched and these particles are used to build Gaussian distribution. Third, weight of all particles is calculated based on Gaussian distribution. Fourth, particles are updated based on each weight. The proposed method could reduce computational time of tracking compared to that of conventional method of particle filter, since the proposed method does not have to calculate all particles weight using likelihood function. This method has been tested on video data with car as a target object. In average, this proposed method of particle filter is 60.61% times faster than particle filter method meanwhile the accuracy of tracking with this newmethod is comparable with particle filter method, which reach up to 86.87%. Hence this method is promising for real time object tracking application.


Sensors ◽  
2020 ◽  
Vol 20 (13) ◽  
pp. 3669 ◽  
Author(s):  
Lei Zhong ◽  
Yong Li ◽  
Wei Cheng ◽  
Yi Zheng

A novel robust particle filtering algorithm is proposed for updating both the waveform and noise parameter for tracking accuracy simultaneously and adaptively. The approach is a significant step for cognitive radar towards more robust tracking in random dynamic systems with unknown statistics. Meanwhile, as an intelligent sensor, it would be most desirable for cognitive radar to develop the application of a traditional filter to be adaptive and to expand the adaptation to a wider scope. In this paper, after analysis of the Bayesian bounds and the corresponding cost function design, we propose the cognitive radar tracking method based on a particle filter by completely reconstructing the propagation and the update process with a cognitive structure. Moreover, we develop the cost-reference particle filter based on optimizing the cost function design according to the complicated system or environment with unknown statistics. With this method, the update of the estimation cost and variance arrives at the approximate optimization, and the estimation error can be more adjacent to corresponding low bounds. Simulations about the tracking implementation in unknown noise are utilized to demonstrate the superiority of the proposed algorithm to the existing methods in traditional radar.


2021 ◽  
Vol 2113 (1) ◽  
pp. 012017
Author(s):  
Wanjin Xu ◽  
Jiying Li ◽  
Junjie Bai ◽  
Yingying Zhang

Abstract Aiming at the problem of low filtering accuracy and even divergence caused by model mismatch when using extended Kalman filter in ship GPS navigation and positioning state estimation, a positioning ship state estimation algorithm based on the fusion of improved unscented Kalman filter and particle filter is proposed. Compared with the traditional particle filtering algorithm, the algorithm has two improvements: first, the algorithm uses untraced Kalman as the main framework, and uses the optimal estimation of particle updating state by particle algorithm; Secondly, in the resampling process, a resampling algorithm based on weight optimization is proposed to increase the diversity of particles. The simulation results show that not only the particle degradation degree of the particle filter is reduced, but also the particle tracking accuracy is improved.


2014 ◽  
Vol 2014 ◽  
pp. 1-6
Author(s):  
Liang Yuan ◽  
Junda Zhu

Neurofilament is an important type of intercellular cargos transmitted in neural axons. Given fluorescence microscopy images, existing methods extract neurofilament movement patterns by manual tracking. In this paper, we describe two automated tracking methods for analyzing neurofilament movement based on two different techniques: constrained particle filtering and tracking-by-detection. First, we introduce the constrained particle filtering approach. In this approach, the orientation and position of a particle are constrained by the axon’s shape such that fewer particles are necessary for tracking neurofilament movement than object tracking techniques based on generic particle filtering. Secondly, a tracking-by-detection approach to neurofilament tracking is presented. For this approach, the axon is decomposed into blocks, and the blocks encompassing the moving neurofilaments are detected by graph labeling using Markov random field. Finally, we compare two tracking methods by performing tracking experiments on real time-lapse image sequences of neurofilament movement, and the experimental results show that both methods demonstrate good performance in comparison with the existing approaches, and the tracking accuracy of the tracing-by-detection approach is slightly better between the two.


2018 ◽  
Vol 12 (02) ◽  
pp. 261-285 ◽  
Author(s):  
Gurinderbeer Singh ◽  
Sreeraman Rajan ◽  
Shikharesh Majumdar

A massive amount of video data is recorded daily for forensic post analysis and computer vision applications. The analyses of this data often require multiple object tracking (MOT). Advancements in image analysis algorithms and global optimization techniques have improved the accuracy of MOT, often at the cost of slow processing speed which limits its applications only to small video datasets. With the focus on speed, a fast-iterative data association technique (FIDA) for MOT that uses a tracking-by-detection paradigm and finds a locally optimal solution with a low computational overhead is introduced. The performance analyses conducted on a set of benchmark video datasets show that the proposed technique is significantly faster (50–600 times) than the existing state-of-the-art techniques that produce a comparable tracking accuracy.


Sensors ◽  
2021 ◽  
Vol 21 (6) ◽  
pp. 2236
Author(s):  
Sichun Du ◽  
Qing Deng

Unscented particle filter (UPF) struggles to completely cover the target state space when handling the maneuvering target tracing problem, and the tracking performance can be affected by the low sample diversity and algorithm redundancy. In order to solve this problem, the method of divide-and-conquer sampling is applied to the UPF tracking algorithm. By decomposing the state space, the descending dimension processing of the target maneuver is realized. When dealing with the maneuvering target, particles are sampled separately in each subspace, which directly prevents particles from degeneracy. Experiments and a comparative analysis were carried out to comprehensively analyze the performance of the divide-and-conquer sampling unscented particle filter (DCS-UPF). The simulation result demonstrates that the proposed algorithm can improve the diversity of particles and obtain higher tracking accuracy in less time than the particle swarm algorithm and intelligent adaptive filtering algorithm. This algorithm can be used in complex maneuvering conditions.


Symmetry ◽  
2021 ◽  
Vol 13 (2) ◽  
pp. 266 ◽  
Author(s):  
Yifeng Wang ◽  
Zhijiang Zhang ◽  
Ning Zhang ◽  
Dan Zeng

The one-shot multiple object tracking (MOT) framework has drawn more and more attention in the MOT research community due to its advantage in inference speed. However, the tracking accuracy of current one-shot approaches could lead to an inferior performance compared with their two-stage counterparts. The reasons are two-fold: one is that motion information is often neglected due to the single-image input. The other is that detection and re-identification (ReID) are two different tasks with different focuses. Joining detection and re-identification at the training stage could lead to a suboptimal performance. To alleviate the above limitations, we propose a one-shot network named Motion and Correlation-Multiple Object Tracking (MAC-MOT). MAC-MOT introduces a motion enhance attention module (MEA) and a dual correlation attention module (DCA). MEA performs differences on adjacent feature maps which enhances the motion-related features while suppressing irrelevant information. The DCA module focuses on decoupling the detection task and re-identification task to strike a balance and reduce the competition between these two tasks. Moreover, symmetry is a core design idea in our proposed framework which is reflected in Siamese-based deep learning backbone networks, the input of dual stream images, as well as a dual correlation attention module. Our proposed approach is evaluated on the popular multiple object tracking benchmarks MOT16 and MOT17. We demonstrate that the proposed MAC-MOT can achieve a better performance than the baseline state of the arts (SOTAs).


Sign in / Sign up

Export Citation Format

Share Document