Giovanni Barbarani, Francesco Vaccarino, Gabriele Trivigno, Marco Guerra, Gabriele Berton, Carlo Masone
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 computer vision, keypoint detection is a fundamental task, with applications spanning from robotics to image retrieval; however, existing learning-based methods suffer from scale dependency, and lack flexibility. This paper introduces a novel approach that leverages Morse theory and persistent homology, powerful tools rooted in algebraic topology. We propose a novel loss function based on the recent introduction of a notion of subgradient in persistent homology, paving the way toward topological learning. Our detector, MorseDet, is the first topology-based learning model for feature detection, which achieves competitive performance in keypoint repeatability and introduces a principled and theoretically robust approach to the problem.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2406.01315")
get_code_for_paper("2406.01315")
have("2406.01315")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2406.01315.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2406.01315)
Connect an agent — have() is free.