Using Dynamic Graph Matching and Gravity Models for Early Detection of Bioterrorist Attacks

Author(s):  
Jomon Aliyas Paul ◽  
Kedar Sambhoos ◽  
Govind Hariharan
2018 ◽  
Vol 17 ◽  
pp. 02004
Author(s):  
Junchang Zhang ◽  
Chenyang Xia ◽  
Leili Hu ◽  
Yanling Zhou

Focusing on the problems of target deformation, occlusion, background interference and rotation, a robust video tracking method is proposed in this paper, which is based on the superpixels and dynamic graph matching. Firstly, to make the superpixels edge fit better and structure tighter, the local gradient feature is fused into the simple linear iterative clustering (SLIC) method. Secondly, the candidate target superpixels set is generated by Graph Cuts and to obtain more accurate foreground superpixels set, the LASVM classification results are fused into the Graph Cuts energy function. Thirdly, in order to make the proposed tracker more robust, the color local entropy is fused into the diagonal elements of the affinity matrix. Experiment results show that the proposed algorithm has strong robustness and better tracking accuracy.


2020 ◽  
Vol 34 (07) ◽  
pp. 11940-11947
Author(s):  
Min Ren ◽  
Yunlong Wang ◽  
Zhenan Sun ◽  
Tieniu Tan

The generalization ability of Convolutional neural networks (CNNs) for biometrics drops greatly due to the adverse effects of various occlusions. To this end, we propose a novel unified framework integrated the merits of both CNNs and graphical models to learn dynamic graph representations for occlusion problems in biometrics, called Dynamic Graph Representation (DGR). Convolutional features onto certain regions are re-crafted by a graph generator to establish the connections among the spatial parts of biometrics and build Feature Graphs based on these node representations. Each node of Feature Graphs corresponds to a specific part of the input image and the edges express the spatial relationships between parts. By analyzing the similarities between the nodes, the framework is able to adaptively remove the nodes representing the occluded parts. During dynamic graph matching, we propose a novel strategy to measure the distances of both nodes and adjacent matrixes. In this way, the proposed method is more convincing than CNNs-based methods because the dynamic graph method implies a more illustrative and reasonable inference of the biometrics decision. Experiments conducted on iris and face demonstrate the superiority of the proposed framework, which boosts the accuracy of occluded biometrics recognition by a large margin comparing with baseline methods.


2001 ◽  
Vol 120 (5) ◽  
pp. A606-A606
Author(s):  
Y MORII ◽  
T YOSHIDA ◽  
T MATSUMATA ◽  
T ARITA ◽  
K SHIMODA ◽  
...  

2004 ◽  
Vol 171 (4S) ◽  
pp. 481-481
Author(s):  
Ravery V. Vincent ◽  
Chautard D. Denis ◽  
Arnauld A. Villers ◽  
Laurent Boccon Gibbod

2003 ◽  
Vol 2 (1) ◽  
pp. 136
Author(s):  
C MEUNE ◽  
C GIRAUDEAU ◽  
H BECANE ◽  
O PASCAL ◽  
P LAFORET ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document