IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i15p2606-d872081.html
   My bibliography  Save this article

Multi-Object Tracking Algorithm of Fusing Trajectory Compensation

Author

Listed:
  • Jianhai Jin

    (China Ship Scientific Research Center, No. 265 Shanshui East Road, Wuxi 214082, China
    Taihu Laboratory of Deepsea Technology Science, Shanshui East Road, Wuxi 214082, China)

  • Liming Wang

    (School of Artificial Intelligence and Computer Science, Jiangnan University, Lihu Avenue, Wuxi 214122, China)

  • Qi You

    (School of Artificial Intelligence and Computer Science, Jiangnan University, Lihu Avenue, Wuxi 214122, China)

  • Jun Sun

    (School of Artificial Intelligence and Computer Science, Jiangnan University, Lihu Avenue, Wuxi 214122, China)

Abstract

Multi-object tracking (MOT) is an important research topic in the field of computer vision, including object detection and data association. However, problems such as missed detection and trajectory mismatch often lead to missing target information, thus resulting in missed target tracking and trajectory fragmentation. Uniform tracking confidence is also not conducive to the full utilization of detection results. Considering these problems, we first propose a threshold separation strategy, which sets different tracking thresholds for similarity matching and intersection over union (IoU) matching during association to make the distribution of detection information more reasonable. Then, the missing trajectories are screened and compensated with the predicted trajectories to improve the long-term tracking ability of the algorithm. When applied to different association algorithms or tracking algorithms, a better improvement effect can be obtained. It can achieve high tracking speed while achieving high tracking accuracy on the MOT Challenge dataset.

Suggested Citation

  • Jianhai Jin & Liming Wang & Qi You & Jun Sun, 2022. "Multi-Object Tracking Algorithm of Fusing Trajectory Compensation," Mathematics, MDPI, vol. 10(15), pages 1-17, July.
  • Handle: RePEc:gam:jmathe:v:10:y:2022:i:15:p:2606-:d:872081
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/15/2606/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/10/15/2606/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:10:y:2022:i:15:p:2606-:d:872081. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.