Search icon CANCEL
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Advanced Deep Learning with TensorFlow 2 and Keras

You're reading from   Advanced Deep Learning with TensorFlow 2 and Keras Apply DL, GANs, VAEs, deep RL, unsupervised learning, object detection and segmentation, and more

Arrow left icon
Product type Paperback
Published in Feb 2020
Publisher Packt
ISBN-13 9781838821654
Length 512 pages
Edition 2nd Edition
Languages
Tools
Arrow right icon
Author (1):
Arrow left icon
Rowel Atienza Rowel Atienza
Author Profile Icon Rowel Atienza
Rowel Atienza
Arrow right icon
View More author details
Toc

Table of Contents (16) Chapters Close

Preface 1. Introducing Advanced Deep Learning with Keras 2. Deep Neural Networks FREE CHAPTER 3. Autoencoders 4. Generative Adversarial Networks (GANs) 5. Improved GANs 6. Disentangled Representation GANs 7. Cross-Domain GANs 8. Variational Autoencoders (VAEs) 9. Deep Reinforcement Learning 10. Policy Gradient Methods 11. Object Detection 12. Semantic Segmentation 13. Unsupervised Learning Using Mutual Information 14. Other Books You May Enjoy
15. Index

12. Non-Maximum Suppression (NMS) algorithm

After the model training is completed, the network predicts bounding box offsets and corresponding categories. In some cases, two or more bounding boxes refer to the same object creating redundant predictions. The situation is shown in the case of a Soda can in Figure 11.12.1. To remove redundant predictions, a NMS algorithm is called. In this book, both classic NMS and soft NMS [6] are covered as shown in Algorithm 11.12.1. Both algorithms assume that bounding boxes and the corresponding confidence scores or probabilities are known.

Figure 11.12.1 The network predicted two overlapping bounding boxes for the Soda can object. Only one valid bounding box is chosen and that is the one with the higher score of 0.99.

In classic NMS, the final bounding boxes are selected based on probabilities and stored in list and with corresponding scores . All bounding boxes and corresponding probabilities are stored in initial lists and . In...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime