Matching with Cascade Hashing
Nobody has claimed this yet.
- Dominant language
- Python
- Stars
- 3.8k
- Forks
- 899
- PR merge metrics
- No merged PRs in 30d
Description
OpenSfM should be able to match using cascade hashing which 10x faster than flann.
TheiaSfM has a good implementation (https://github.com/sweeneychris/TheiaSfM/blob/master/src/theia/matching/cascade_hasher.h) that could be used by importing it into the third party modules.
OpenMVG has a modified version here https://github.com/openMVG/openMVG/blob/master/src/openMVG/matching/cascade_hasher.hpp
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reviewing the issue description and the referenced TheiaSfM cascade_hasher.h and OpenMVG cascade_hasher.hpp implementations. Determine how a cascade-hashing matcher would fit into OpenSfM's matching pipeline and third-party modules. Done means OpenSfM can perform matching with cascade hashing and the integration is validated against the existing matcher behavior.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- cpp, python
- Domain
- computer-vision
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 25/100