https://github.com/255doesnotexist/vips_co_visible_object_matching
An unofficial implementation for the graph matching part of the paper "VIPS: real-time perception fusion for infrastructure-assisted autonomous driving"
https://github.com/255doesnotexist/vips_co_visible_object_matching
Last synced: 5 months ago
JSON representation
An unofficial implementation for the graph matching part of the paper "VIPS: real-time perception fusion for infrastructure-assisted autonomous driving"
- Host: GitHub
- URL: https://github.com/255doesnotexist/vips_co_visible_object_matching
- Owner: 255doesnotexist
- License: mit
- Created: 2023-07-26T11:45:45.000Z (almost 2 years ago)
- Default Branch: main
- Last Pushed: 2023-12-08T05:15:10.000Z (over 1 year ago)
- Last Synced: 2024-11-12T18:42:12.563Z (7 months ago)
- Language: Python
- Homepage:
- Size: 13.4 MB
- Stars: 6
- Watchers: 1
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Introduction
This repository contains the unofficial code implements for the graph matching part of the paper "VIPS: real-time perception fusion for infrastructure-assisted autonomous driving" (https://dl.acm.org/doi/abs/10.1145/3495243.3560539).
## Usage
The code provides a Python script called main.py that can be used to test the graph matching algorithm on a given set of graphs.
## Related Works
This code was used in the paper "GraphPS: Graph Pair Sequences-based Noisy-Robust Multi-Hop Collaborative Perception" (https://ieeexplore.ieee.org/document/10334055) to evaluate the performance of VIPS and GraphPS on various datasets, including V2X and V2V scenarios, and demonstrated the robustness of GraphPS under different levels of position and heading errors, surpassing the existing baselines.