Intelligent Transportation System (ITS) plays an essential role in smart cities. Through ITS, local authorities could handle enormous traffic flows with minimal effort and solve traffic-related problems such as traffic congestion or traffic regulation violating behaviours. In this work, we designed a system that has the ability to count vehicles moving in specific directions on the road. Such automated systems also have to deal with the diverse weather and instabilities in captured media, making current tracking algorithms become prone to errors. This problem is even more challenging in Vietnam and other developing countries, where traffic on the road is much more complex with the presence of small vehicles such as bicycles and motorbikes, thus tracking algorithms would be more likely to fail. Our proposed method for Track Joining was built on top of deepSORT, incorporating Taylor Expansion and Unweighted Bipartite Maximum Matching to predict missing movements or identify duplicated vehicle tracks, then attempt to merge them. In HCMC AI City Challenge 20201, our whole system outperforms other approaches by achieving the lowest overall RMSE score: an average of 1.39 fails per video segment on a benchmark dataset.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Unweighted Bipartite Matching For Robust Vehicle Counting


    Contributors:
    Ho, Khanh (author) / Le, Huy Bao (author) / Van Nguyen, Khoa (author) / Nguyen, Thua (author) / Do, Tien (author) / Ngo, Thanh Duc (author) / Nguyen, Thanh-Son (author)


    Publication date :

    2021-10-01


    Size :

    10614632 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Robust Movement-Specific Vehicle Counting at Crowded Intersections

    Liu, Zhongji / Zhang, Wei / Gao, Xu et al. | IEEE | 2020


    VEHICLE COUNTING DEVICE, VEHICLE COUNTING METHOD, AND VEHICLE COUNTING PROGRAM

    WATANABE MAKOTO / HAGIWARA YOSHIYUKI / OKAMOTO YAMATO et al. | European Patent Office | 2019

    Free access

    Approximate graph edit distance computation by means of bipartite graph matching

    Riesen, K. / Bunke, H. | British Library Online Contents | 2009