calculation of optimal parameters calculation of optimal
play

Calculation of Optimal Parameters Calculation of Optimal Parameters - PowerPoint PPT Presentation

CodLix LLC (Saint Petersburg, Russia) Southwest State University (Kursk, Russia) Calculation of Optimal Parameters Calculation of Optimal Parameters for Aircraft Recognition on Remote Sensing Imagery for Aircraft Recognition on Remote Sensing


  1. CodLix LLC (Saint Petersburg, Russia) Southwest State University (Kursk, Russia) Calculation of Optimal Parameters Calculation of Optimal Parameters for Aircraft Recognition on Remote Sensing Imagery for Aircraft Recognition on Remote Sensing Imagery by Contour Analysis by Contour Analysis Authors: Miroshnichenko Sergei, Dremov Evgenii 2019

  2. The Problem is to create a method for the aircraft recognition (not detection) on aerial and space imagery with the following features: 1. Use the object shape to recognize the object. 2. Be invariant to scaling and rotating of the recognized object towards the reference instances. 3. Be capable to train on compact and nonuniform datasets. 4. Minimize the number of type I and II errors. 2

  3. Related Work To reach affine transformation invariance a combination of few features and methods is used: • Zernike moments and wavelet coefficients Hsieh J W, Chen J M, Chuang C H and Fan K C 2005 Aircraft type recognition in satellite images Vision, Image and Signal Processing 152 307–315 • Radon transform, PCA and kNN classification Liu G, Sun X, Fu K and Wang H 2013 Aircraft recognition in high-resolution satellite images using coarse-to-fine shape prior IEEE Geoscience and Remote Sensing Letters 10 573–577 • HOG, graph theory and an object reconstruction Wu Q, Sun H, Sun X, Zhang D, Fu K and Wang H 2015 Aircraft recognition in high-resolution optical satellite remote sensing images IEEE Geoscience and Remote Sensing Letters 12 112–116 3

  4. Normalized Dot Product (NDP) The NDP is: The classification rule is: l          ( ( ), n ( )) n C : i arg max( ( , f Γ ) T ) ,    i j i i i    i C ( )      i ( , , ) l n 1 . i j    | ( ) | | l ( ) | l      : i max f ( , Γ ) T .  i j i i i The positive NDP features: 1. NDP module is a similarity measure of two contours within the range [0..1] . 2. Invariance to scaling. 3. Invariance to the rotation (only complex-valued). The negative NDP features: 1. Not invariant to the change of the initial point. 2. Contours have to be equal in length. 3. Require to tune classification thresholds T i . 4

  5. Training Dataset B-52 C-5 C-37 B-1 C-130 C-135 S-3 P-3 5

  6. Training Dataset Details Characteristics of contours in the training dataset Aircraft class B-1 B-52 C-5 C-37 C-130 C-135 P-3 S-3 Instances 17 10 20 11 135 81 92 64 count Mean items’ 1132 1945 2404 1227 1570 1420 1458 1132 quantity Items’ quantity histogram 6

  7. Training Classes Examples B-1 B-52 7

  8. Test Dataset B-52 C-5 C-37 B-1 C-130 C-135 S-3 P-3 8

  9. Test Dataset Details Characteristics of contours in the test dataset Aircraft class B-1 B-52 C-5 C-37 C-130 C-135 P-3 S-3 Instances count 7 6 48 11 57 102 142 49 Mean items’ 1263 1884 2441 1177 1483 1315 1345 1084 quantity Items’ quantity histogram 9

  10. Initial Point Invariance The cross-correlation function (CCF) based on NDP is introduced to add invariance to the initial point’s shift:            s ( , , ) l max , , l , i j i j    s 0.. l   ( ) s is a contour obtained from by the cycle shift of its starting point to s elements. j j 1 0,8 0,6 0,4 0,2 0 104 156 208 260 312 364 416 468 520 572 624 676 728 780 832 884 936 988 1040 1092 1144 1196 1248 1300 1352 52 0 10

  11. Instances Distance Measurement Between-class distances Within-class distances 11

  12. Classification Thresholds Graphs Total relative measurement error dependence from the classification threshold for classes B-1 and B-52. Total relative measurement error dependence from the classification threshold for classes C-130 and P-3. 12

  13. Items Quantity Effect (C-135/B-52) More type II errors More type I errors 13

  14. Items Quantity Graphs (B-1,B-52) Total relative measurement error dependence from the B-1 vector-contour's items quantity. Total relative measurement error dependence from the B-52 vector-contour's items quantity. 14

  15. Items Quantity Graphs (C-130,P-3) Total relative measurement error dependence from the C- 130 vector-contour's items quantity. Total relative measurement error dependence from the P-3 vector-contour's items quantity. 15

  16. Optimal Classification Threshold and Items ’ Quantity Values per Class 16

  17. Optimal Items ’ Quantity Value vs Heuristics The proposed optimal items’ quantity calculation method was experimentally compared to the heuristic methods including the use of: (a) the minimal items’ quantity of the certain class’s instances to minimize the type II error; (b) the maximal items’ quantity of the certain class’s instances to minimize the type I error; (c) the recognized object’s items quantity to retain its actual level of details. Table 5. Optimal values of the vector-contour’s items quantity. Row name Total relative error, % Class index 1 2 3 4 5 6 7 8 Mean error through all Class name B-1 B-52 C-5 C-37 C-130 C-135 P-3 S-3 classes Heuristic (a) 12,18 20,00 38,66 0,09 13,68 7,59 11,97 8,38 14,07 Heuristic (b) 12,18 13,33 26,29 0,09 21,23 3,70 10,00 3,97 11,35 Heuristic (c) 11,49 8,89 19,29 0,15 11,42 2,53 7,32 2,58 7,96 Proposed 9,42 0,00 2,13 0,00 6,51 0,23 4,18 0,76 2,90 method 17

  18. Similarity Functions 1. Maximum CCF for a vector-contour 2. The mean CCF value for the whole class and one of the reference instances N 1     i            f ( , Γ ) , , l . f 1 ( , Γ ) max , , l . 2 i ik i i ik i N k  k 1 i 18

  19. Modified Similarity Function To reduce of errors number we modified the classification rule to combine the functions, integrate their merits and mutually compensate shortcomings. The modified classification rule then becomes the following:       C : i arg max( f ( , Γ ) T ) ,    i 2 i i i i             C ( ) C : i arg max( f ( , Γ ) T ) , i max f ( , Γ ) T    i 1 i i 2 i i i i  i      : i max f ( , Γ ) T . 1 i i   i 19

  20. Future Work 1. Develop a CNN-based segmentation method to detect aircraft edges invariantly to: • camouflage • poor contrast with the underlying surface • illuminated and shaded areas • close-lying airfield equipment. 2. Get higher edges precision enough to recognize fighter class aircraft. 20

  21. Thank You for Attention! 21

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend