cs 4803 7643 deep learning
play

CS 4803 / 7643: Deep Learning Topics: Structured representations - PowerPoint PPT Presentation

CS 4803 / 7643: Deep Learning Topics: Structured representations with graph networks Zsolt Kira Georgia Tech Deep Learning (C) Dhruv Batra & Zsolt Kira 2 Slide Credit: Thomas Kipf (C) Dhruv Batra & Zsolt Kira 3 Slide Credit:


  1. CS 4803 / 7643: Deep Learning Topics: – Structured representations with graph networks Zsolt Kira Georgia Tech

  2. Deep Learning (C) Dhruv Batra & Zsolt Kira 2 Slide Credit: Thomas Kipf

  3. (C) Dhruv Batra & Zsolt Kira 3 Slide Credit: Thomas Kipf

  4. (C) Dhruv Batra & Zsolt Kira 4 Slide Credit: Thomas Kipf

  5. (C) Dhruv Batra & Zsolt Kira 5 Slide Credit: Thomas Kipf

  6. (C) Dhruv Batra & Zsolt Kira 6 Slide Credit: Thomas Kipf

  7. (C) Dhruv Batra & Zsolt Kira 7 Slide Credit: Thomas Kipf

  8. (C) Dhruv Batra & Zsolt Kira 8 Slide Credit: Thomas Kipf

  9. (C) Dhruv Batra & Zsolt Kira 9 Slide Credit: Thomas Kipf

  10. (C) Dhruv Batra & Zsolt Kira 10 Slide Credit: Thomas Kipf

  11. (C) Dhruv Batra & Zsolt Kira 11 Slide Credit: Thomas Kipf

  12. (C) Dhruv Batra & Zsolt Kira 12 Slide Credit: Thomas Kipf

  13. (C) Dhruv Batra & Zsolt Kira 13 Slide Credit: Thomas Kipf

  14. (C) Dhruv Batra & Zsolt Kira 14 Slide Credit: Thomas Kipf

  15. (C) Dhruv Batra & Zsolt Kira 15 Slide Credit: Thomas Kipf

  16. (C) Dhruv Batra & Zsolt Kira 16 Slide Credit: Thomas Kipf

  17. (C) Dhruv Batra & Zsolt Kira 17 Slide Credit: Thomas Kipf

  18. (C) Dhruv Batra & Zsolt Kira 18 Slide Credit: Thomas Kipf

  19. (C) Dhruv Batra & Zsolt Kira 19 Slide Credit: Thomas Kipf

  20. (C) Dhruv Batra & Zsolt Kira 20 Slide Credit: Thomas Kipf

  21. (C) Dhruv Batra & Zsolt Kira 21 Slide Credit: Thomas Kipf

  22. (C) Dhruv Batra & Zsolt Kira 22 Slide Credit: Thomas Kipf

  23. (C) Dhruv Batra & Zsolt Kira 23 Slide Credit: Thomas Kipf

  24. (C) Dhruv Batra & Zsolt Kira 24 Slide Credit: Thomas Kipf

  25. (C) Dhruv Batra & Zsolt Kira 25 Slide Credit: Thomas Kipf

  26. (C) Dhruv Batra & Zsolt Kira 26 Slide Credit: Thomas Kipf

  27. (C) Dhruv Batra & Zsolt Kira 27 Slide Credit: Thomas Kipf

  28. (C) Dhruv Batra & Zsolt Kira 28 Slide Credit: Thomas Kipf

  29. (C) Dhruv Batra & Zsolt Kira 29 Slide Credit: Thomas Kipf

  30. (C) Dhruv Batra & Zsolt Kira 30 Slide Credit: Thomas Kipf

  31. (C) Dhruv Batra & Zsolt Kira 31 Slide Credit: Thomas Kipf

  32. (C) Dhruv Batra & Zsolt Kira 32 Slide Credit: Thomas Kipf

  33. (C) Dhruv Batra & Zsolt Kira 33 Slide Credit: Thomas Kipf

  34. (C) Dhruv Batra & Zsolt Kira 34 Slide Credit: Thomas Kipf

  35. (C) Dhruv Batra & Zsolt Kira 35 Slide Credit: Thomas Kipf

  36. (C) Dhruv Batra & Zsolt Kira 36 Slide Credit: Thomas Kipf

  37. (C) Dhruv Batra & Zsolt Kira 37 Slide Credit: Thomas Kipf

  38. (C) Dhruv Batra & Zsolt Kira 38 Slide Credit: Thomas Kipf

  39. (C) Dhruv Batra & Zsolt Kira 39 Slide Credit: Thomas Kipf

  40. Problem Description • Application: Component detection on PCBs. • Input: high resolution (eg. 6000 x 4000) PCB images. • Output: component types (eg. resistor, capacitor, IC, etc) and bounding boxes. • Challenge 1: expensive to build a large- scale dataset for training • ~500 components per PCB. • Require professional labeler. • Very few high-quality datasets available on the Internet. Data-Efficient Graph Embedding Learning for PCB Component Detection Chia-Wen Kuo, Jacob Ashmore, David Huggins, Zsolt Kira (C) Dhruv Batra & Zsolt Kira 40

  41. Problem Description • Challenge 2: data distribution • Unbalanced data distribution: 100+ resistors and capacitors, 10+ ICs, and only a few switches. • High intra-class variance (eg. connector). • Low inter-class variance (eg. resistor, led, capacitor). (C) Dhruv Batra & Zsolt Kira 41

  42. Graph Network (GN) • Capture the spatial feature of component layout. • Capture the structure of feature manifold. • Capture the global statistics of the whole board. • => Refine the feature of object proposals based on these additional sources of information. • => Everything is learned and jointly optimized including graph edges and node features. (C) Dhruv Batra & Zsolt Kira 42

  43. Similarity Prediction Network (C) Dhruv Batra & Zsolt Kira 43

  44. Pipeline (C) Dhruv Batra & Zsolt Kira 44

  45. Results • Significant improvement in mAP with graph network (GN) within a board – Triplet loss used to train similarity prediction. – Propagation of label features in few labeled examples further improves results. (C) Dhruv Batra & Zsolt Kira 45

  46. Results Blue : correct type and precise bounding box location. Cyan : imprecise bounding box location. Magenta : miss-detected component. Yellow : precise bounding box location but wrong type. • Leveraging the local, spatial, and global structure of PCB boards results in significant improvements over standard detection pipelines. • Connectivity can be initialized via learned similarity and jointly optimized to learn the structure to maximize accuracy. (C) Dhruv Batra & Zsolt Kira 46

  47. (C) Dhruv Batra & Zsolt Kira 47 Slide Credit: Thomas Kipf

  48. (C) Dhruv Batra & Zsolt Kira 48 Slide Credit: Thomas Kipf

  49. (C) Dhruv Batra & Zsolt Kira 49 Slide Credit: Thomas Kipf

  50. (C) Dhruv Batra & Zsolt Kira 50 Slide Credit: Thomas Kipf

  51. (C) Dhruv Batra & Zsolt Kira 51 Slide Credit: Thomas Kipf

  52. (C) Dhruv Batra & Zsolt Kira 52 Slide Credit: Thomas Kipf

Recommend


More recommend