Object detection based on multiple trick feature pyramid networks and dynamic balanced L1 loss
by Yiming Yin; Guangjian Zhang
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 22, No. 1, 2022

Abstract: Although the performance of the object detection has been significantly optimised in recent years, there is still a lot of room for designing multi-scale feature fusion methods and designing loss functions. Specifically, we propose Multiple Trick Feature Pyramid Networks (MT-FPN), by using various techniques such as feedback information, global module, attention mechanism, and fusion of refined information, to solve the problem of insufficient multi-scale feature fusion. We also propose Dynamic Balanced L1 Loss (DBLL), by utilising dynamic strategies and solving the derivative discontinuity problem, in order to help relieve the inconsistent problem between the dynamic training process and the fixed parameters. Moreover, by replacing FPN with MT-FPN, our Average Precision (AP) on Microsoft Common Objects in Context (MSCOCO) is 5.1 points and 3.8 points higher than FPN Faster R-CNN and Libra R-CNN, respectively. Without any bells and whistles, our experiments also show that the combined application of MT-FPN and DBLL achieves competitive performance compared with most advanced detectors on MS COCO benchmark.

Online publication date: Wed, 27-Apr-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com