We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
In this letter, we present a novel descriptor based on Urquhart tessellations derived from the position of trees in a forest. We propose a framework that uses these descriptors to detect previously seen observations and landmark correspondences, even with partial overlap and noise. We run loop closure detection experiments in simulation and real-world data map-merging from different flights of an Unmanned Aerial Vehicle (UAV) in a pine tree forest and show that our method outperforms state-of-the-art approaches in accuracy and robustness.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2010.03026")
get_code_for_paper("2010.03026")
have("2010.03026")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2010.03026.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2010.03026)
Connect an agent — have() is free.